3 papers
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…
cs.DS2024
Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models
Huanjian Zhou, Masashi Sugiyama
Sampling from high-dimensional probability distributions is fundamental in machine learning and statistics. As datasets grow larger, computational efficiency becomes increasingly i…
cs.DS2022
Efficient Submodular Optimization under Noise: Local Search is Robust
Lingxiao Huang, Yuyi Wang, Chunxue Yang +1
The problem of monotone submodular maximization has been studied extensively due to its wide range of applications. However, there are cases where one can only access the objective…