Multilinear extension of k-submodular functions. - Baoxiang Wang 001; Huanjian Zhou (CoRR, 2021)

Efficient Submodular Optimization under Noise: Local Search is Robust. - Lingxiao Huang; Yuyi Wang 001; Chunxue Yang; Huanjian Zhou (NeurIPS, 2022)

Adaptive complexity of log-concave sampling. - Huanjian Zhou; Baoxiang Wang 001; Masashi Sugiyama (CoRR, 2024)

Parallel simulation for sampling under isoperimetry and score-based diffusion models. - Huanjian Zhou; Masashi Sugiyama (CoRR, 2024)

The Adaptive Complexity of Finding a Stationary Point. - Huanjian Zhou; Andi Han; Akiko Takeda; Masashi Sugiyama (COLT, 2025)

The adaptive complexity of parallelized log-concave sampling. - Huanjian Zhou; Baoxiang Wang 001; Masashi Sugiyama (ICLR, 2025)

Improved Approximation Algorithms for k-Submodular Maximization via Multilinear Extension. - Huanjian Zhou; Lingxiao Huang; Baoxiang Wang 001 (ICLR, 2025)