Skip to content

Author

Cong Fang

We have 18 of 73 papers

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 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
Preprint Sep 2026

Matching Higher-Order Oracle Complexity for Smooth Monotone Variational Inequalities

A matching $\Omega_p(Q^{2/(3p-1)})$ lower bound is proved for arbitrary adaptive deterministic algorithms and randomized algorithms with per-instance success probability at least $2/3$, without span or tensor-update restrictions.

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

Near-Optimal Deterministic Exact-Value Complexity for Smooth Convex Optimization

A single fixed smooth convex hard instance is constructed using a Moreau-smoothed biased max chain, an exact prefix-shielding mechanism, and batched delayed rotations to preserve consistency with the full adaptive transcript and establish the optimality of the square-root complexity branch for deterministic bounded-que...

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

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