Skip to content

3 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

Matching Complexity for Second-Order Stationary Point with Sample Reuse

We consider stochastic nonconvex optimization with sample-wise Lipschitz gradients and Hessians, and reusable opaque sample handles. Gradient and complete-Hessian evaluations are charged separately, including both endpoints of a same-sample difference. For fixed positive problem parameters and in the high-dimensional w...

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

Matching Randomized Bounds for Finite-Sum Nonconvex-Concave Optimization

The randomized component-oracle complexity of finite-sum nonconvex-concave optimization with a bounded dual domain is characterized, taking the worst case over admissible known dual domains and finite dimensions.

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

Beyond Overparameterization: Provable Learning of Input-Convex Multi-Layer Polynomial Networks with Active Queries

The theoretical understanding of multi-layer neural networks is largely confined to overparameterized settings, which obscure parameter identifiability and incur high sample complexity. Neural tangent kernel (NTK) provides a general theory for wide networks, but does not offer efficient sample-complexity guarantees. Re...

Jing-Qiao Tang, Qian Chen, Shihong Ding 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.