Skip to content

Author

Qi-Hao Zhou

6 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.

Oct 2026

A Dynamic Primary/Backup Path Algorithm Based on Multi-Level Feedback Queue for Differentiated Services in LEO Satellite Networks

With the accelerated deployment of Low Earth Orbit (LEO) mega-constellations, such as Starlink and OneWeb, satellite networks are transitioning from providing best-effort connectivity to supporting stringent, mission-critical services, including autonomous driving coordination, ultra-high-definition video streami...

Hong-Yuan Zhang, Peng-Fei Zhang, Qi-Hao Zhou et al. · 0 citations
Preprint Oct 2026

Accelerating Finite-Sum Bilevel Optimization with Fully First-Order Oracles

We study nonconvex--strongly-convex bilevel optimization with finite-sum objectives and fully first-order oracles. We propose Sampled Implicit Corrections for Bilevel Optimization (SICBO), which combines a penalty approximation with variance-reduced corrections for the lower-level variables. Under componentwise lower s...

Qi-Hao Zhou, S. Niu · 0 citations
Preprint Nov 2026

Near-Optimal Complexity of Finding Approximate Local Minima of Nonconvex Finite Sums

We study the component-oracle complexity of finding approximate local minima of nonconvex finite sums under mean-squared averaged smoothness with parameter $L$ and a $\rho$-Lipschitz average Hessian. Each query returns the value, gradient, and one Hessian-vector product of a component. We show that the complexity in th...

Qi-Hao Zhou · 0 citations
#machine learning Preprint Oct 2026

Optimal Oracle Complexity for Finite-Sum Monotone Inclusions

We present an oracle-optimal method for finite-sum monotone inclusions under mean-square Lipschitz continuity. Our switching regularization method finds a point $y$ and a certificate $g\in G(y)$ with $(\mathbb{E}\|F(y)+g\|^2)^{1/2}\le\varepsilon$ using $\mathcal{O}(n+\sqrt{n}LR/\varepsilon)$ expected component evaluati...

Qi-Hao Zhou · 1 citation
#machine learning Preprint Oct 2026

Near-Optimal Complexity of Finite-Sum Nonconvex-Strongly-Concave Minimax Optimization

We characterize, up to logarithmic factors, the minimax expected query complexity of finite-sum nonconvex-strongly-concave optimization under mean-squared averaged smoothness. For randomized zero-respecting incremental first-order algorithms, the complexity is $\tilde{\Theta}(n+\min\{\sqrt{n}\,\kappa,n^{3/4}\sqrt{\kapp...

Qi-Hao Zhou · 3 citations · ⚡2

Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization

We study whether the linear condition-number dependence in the stochastic complexity of SAPD+ is necessary for nonconvex-strongly-concave minimax optimization. For jointly $L$-smooth objectives with dual strong-concavity parameter $\mu$, we prove a lower bound that matches the SAPD+ upper bound under the same Moreau-en...

Qi-Hao Zhou · 2 citations

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