Zixi Chen 0001

dblp:228/8814-1 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0004-0688-7025ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Optimization for machine learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
convergence analysis
0.912025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Mathematical optimization › stochastic optimization
stochastic approximation
0.912025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Mathematical optimization › stochastic optimization › stochastic approximation
two-time-scale stochastic approximation
0.912025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Machine learning › Optimization for machine learning › iterate averaging
polyak-ruppert averaging
0.312025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Machine learning › Optimization for machine learning
stochastic gradient descent
0.312025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025

Methods — techniques the papers use, named apart from their topics

lyapunov function analysis · 1.7
YearPublicationVenuePosition
2025 Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence
abstract
The nonlinear two-time-scale stochastic approximation is widely studied under conditions of bounded variances in noise. Motivated by recent advances that allow for variability linked to the current state or time, we consider state- and time-dependent noises. We show that the Lyapunov function exhibits polynomial convergence rates in both cases, with the rate of polynomial delay depending on the parameters of state- or time-dependent noises. Notably, if the state noise parameters fully approach their limiting value, the Lyapunov function achieves an exponential convergence rate. We provide two numerical examples to illustrate our theoretical findings in the context of stochastic gradient descent with Polyak-Ruppert averaging and stochastic bilevel optimization.
Zixi Chen 0001, Yumin Xu, Ruixun Zhang
AAAI1