Huanjian Zhou

activity

20212026

k

-Submodular Maximization via Multilinear Extension

2 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing math.OCShow all

3 papers · 1 filter

math.OC2026

On the Complexity of Finding Stationary Points of p-th Order Hölder Smooth Functions in One Dimension

Huanjian Zhou, Taiji Suzuki

We study the query complexity of finding an an $ε$ -stationary points of a one-dimensional non-convex function whose $p$ -th derivative is $β_{p}$ -Hölder continuous. We deter…

math.OC2026

Finding Stationary Points under Higher-Order Smoothness: Trapping Algorithms and First-Order Lower Bounds

Huanjian Zhou, Masashi Sugiyama, Taiji Suzuki

We study the query complexity of finding approximate stationary points under higher-order smoothness using only function values or only gradients. Our results cover different dimen…

math.OC2025

The Adaptive Complexity of Finding a Stationary Point

Huanjian Zhou, Andi Han, Akiko Takeda +1

In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study th…