collaborators

10 papers

math.OC2026

Gradient-Hessian Query Tradeoffs: Matching Lower Bounds in Logarithmic Dimension

Wendao Wu, Haihan Zhang, Chenheng Zhang +5

We establish matching lower bounds for the tradeoff between gradient and Hessian queries in nonconvex optimization with Lipschitz Hessian. In normalized units, the initial objectiv…

cs.LG2026

Dimension-Optimal Dynamic Regret in Exp-Concave Online Learning

Yanyi Li, Wendao Wu, Haihan Zhang +6

Tracking changing comparators is a central problem in online learning. For exp-concave losses, previous work established the dependence on the horizon and Eu…

math.OC2026

Matching Randomized First-Order Bounds for Higher-Order Smooth Nonconvex Optimization

Haihan Zhang, Wendao Wu, Fangqing Zhang +5

Does randomization improve the worst-case first-order complexity of nonconvex optimization when the objective is very smooth? We prove that, for every fixed finite integer ,…

math.OC2026

Matching Randomized Bounds for Finite-Sum Nonconvex-Concave Optimization

Wendao Wu, Haihan Zhang, Qian Chen +5

We characterize the randomized component-oracle complexity of finite-sum nonconvex-concave optimization with a bounded dual domain. For $Φ(x)=\max_{y\in Y}n^{-1}\sum_{i=1}^n f_i(x,…

math.OC2026

Matching Complexity for Second-Order Stationary Point with Sample Reuse

Qian Chen, Wendao Wu, Haihan Zhang +5

We consider stochastic nonconvex optimization with sample-wise Lipschitz gradients and Hessians, and reusable opaque sample handles. Gradient and complete-Hessian evaluations are c…

math.OC2026

Matching Full-Hessian Oracle Complexity for Nonconvex--Strongly-Concave Minimax Optimization

Fangqing Zhang, Haihan Zhang, Wendao Wu +5

We characterize the oracle complexity of finding first-order stationary points in smooth nonconvex--strongly-concave (NC--SC) minimax optimization when each query provides the full…

math.OC2026

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

Wendao Wu, Haihan Zhang, Chenheng Zhang +5

We study the sample complexity of finding a point with expected hypergradient norm at most in nonconvex--strongly-convex stochastic bilevel optimization using fresh, globally…

math.OC2026

Closing the Accuracy Gap in Stochastic First-Order Bilevel Optimization

Haihan Zhang, Wendao Wu, Chenheng Zhang +5

We characterize the optimal accuracy dependence for smooth nonconvex--strongly-convex bilevel optimization with stochastic first-order oracles. For globally unbiased fresh-gradient…

math.OC2026

Matrix-Vector Complexity of Low-Rank Approximation

Haihan Zhang, Wendao Wu, Chenheng Zhang +5

We establish matching polynomial query bounds for low-rank approximation from exact matrix--vector products. Given an unknown matrix , at each step a ra…

stat.ME2026

Feasible Fusion: Constrained Joint Estimation under Structural Non-Overlap

Yuxi Du, Zhiheng Zhang, Haoxuan Li +4

Causal inference in modern largescale systems faces growing challenges, including highdimensional covariates, multi-valued treatments, massive observational (OBS) data, and limited…