Skip to content

Author

Yan-Yi Li

13 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Closing the Accuracy Gap in Stochastic First-Order Bilevel Optimization

The optimal accuracy dependence for smooth nonconvex--strongly-convex bilevel optimization with stochastic first-order oracles is characterized and an $\Omega(\epsilon^{-6})$ lower bound matching the accuracy exponent of existing upper bounds is proved.

Hai-Han Zhang, Wen-Dao Wu, Chen-Heng Zhang et al. · 0 citations
Preprint Oct 2026

Geodesically Convex Optimization in Hyperbolic Space: Matching Lower Bounds

We establish matching lower bounds for deterministic first-order optimization of globally Lipschitz geodesically convex functions on hyperbolic space. A global minimizer lies within distance $r$ of a known point, each query returns an exact function value and a selected Riemannian subgradient, and the target objective...

Wen-Dao Wu, Hai-Han Zhang, Chen-Heng Zhang et al. · 1 citation
#machine learning Preprint Oct 2026

Dimension-Optimal Dynamic Regret in Exp-Concave Online Learning

A proper, full-information learner on compact convex subsets of $\mathbb{R}^d$ that adapts to the unknown path length and, under fixed dimension-independent diameter, gradient, and curvature parameters, guarantees full information under fixed dimension-independent diameter, gradient, and curvature parameters.

Yan-Yi Li, Wen-Dao Wu, Hai-Han Zhang et al. · 0 citations
#machine learning Preprint Oct 2026

Sample-Adaptive Zeroth-Order Post-Training

Zeroth-order (ZO) optimization offers a memory-efficient alternative to backpropagation for fine-tuning large language models. However, existing ZO methods typically sample training examples uniformly, overlooking their evolving importance and leaving avoidable estimation variance. To address this limitation, we propos...

Hai-Yuan Wan, Yan-Yi Li, Wei-Cheng Lin et al. · 0 citations
Preprint Oct 2026

The Minimax Cost of Smoothness in Fully First-Order Stochastic Bilevel Optimization

We study the sample complexity of finding a point with expected hypergradient norm at most $\epsilon>0$ in nonconvex--strongly-convex stochastic bilevel optimization using fresh, globally unbiased first-order samples with bounded variance. For lower-variable smoothness order $p\ge1$, F$^2$SA-$p$ achieves $\widetilde O(...

Wen-Dao Wu, Hai-Han Zhang, Chen-Heng Zhang et al. · 0 citations
Preprint Sep 2026

Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization

We study deterministic adaptive optimization of globally $\beta$-smooth, $\mu$-strongly convex functions using exact scalar function values. Queries and outputs lie in $B_2^d(R)$, and the minimizer lies in $B_2^d(R/2)$. Set $\kappa=\beta/\mu$, $Q=\beta R^2/\epsilon$, and $D_d=(d/\log(ed))^{1/3}$. For sufficiently large...

Wen-Dao Wu, Hai-Han Zhang, Chen-Heng Zhang et al. · 0 citations
Preprint Sep 2026

Matching Lower Bounds for Randomized First-Order Methods in Hessian-Lipschitz Nonconvex Optimization

We establish a randomized first-order lower bound for finding an $\epsilon$-stationary point, $\|\nabla f(x)\|\le \epsilon$, of a nonconvex function with initial gap at most $\Delta$, $L_1$-Lipschitz gradient, and $L_2$-Lipschitz Hessian. Each oracle call returns the exact function value and gradient. Let $Q_{\mathrm{r...

Hai-Han Zhang, Wen-Dao Wu, Chen-Heng Zhang et al. · 2 citations · ⚡1
Preprint Sep 2026

Joint Lower Bounds for Zeroth-Order Nonconvex Optimization on Euclidean Balls

We prove a joint stochastic zeroth-order lower bound for Goldstein stationarity on a Euclidean query ball, even when the ball is guaranteed to contain a stationary point. In dimension $d$, let $f=\mathbb{E}[F(\cdot;\xi)]$, assume $\mathbb{E}[\operatorname{Lip}(F(\cdot;\xi))^2]\le L_0^2$, and bound the initial objective...

Hai-Han Zhang, Wen-Dao Wu, Chen-Heng Zhang et al. · 3 citations · ⚡1
Preprint Sep 2026

Matching Upper and Lower Bounds for Higher-Order Nonconvex Finite-Sum Optimization

We establish tight randomized higher-order oracle complexity for finding first-order stationary points of nonconvex finite sums. Let $n$ be the number of components, $\Delta>0$ the initial objective-gap bound, $L_p>0$ an individual $p$-th derivative Lipschitz bound, and $\epsilon>0$ the target gradient norm. For every...

Wen-Dao Wu, Hai-Han Zhang, Chen-Heng Zhang et al. · 2 citations
Preprint Sep 2026

Sharp Fresh-Gradient Complexity of Nonconvex-Strongly-Concave Minimax Optimization

We characterize the fresh-gradient oracle complexity of smooth nonconvex-strongly-concave minimax optimization, with matching upper and lower bounds up to logarithmic factors. Let $\Phi(x)=\max_y f(x,y)$, where $f$ is jointly $L$-smooth and $\mu$-strongly concave in $y$ on unconstrained Euclidean domains, and set $\kap...

Wen-Dao Wu, Hai-Han Zhang, Chen-Heng Zhang et al. · 2 citations
Sep 2026

Matrix-Vector Complexity of Low-Rank Approximation

The proof extends adaptive Wishart deferred decisions to a rectangular factor with a $k$-dimensional nullspace while persistence of small compression eigenvalues controls growing $p$ and the spectral endpoint.

Hai-Han Zhang, Wen-Dao Wu, Chen-Heng Zhang et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.