3 papers
cs.LG2025
Smoothed Agnostic Learning of Halfspaces over the Hypercube
Yiwen Kou, Raghu Meka
Agnostic learning of Boolean halfspaces is a fundamental problem in computational learning theory, but it is known to be computationally hard even for weak learning. Recent work [C…
cs.LG2024
Matching the Statistical Query Lower Bound for -Sparse Parity Problems with Sign Stochastic Gradient Descent
Yiwen Kou, Zixiang Chen, Quanquan Gu +1
The -sparse parity problem is a classical problem in computational complexity and algorithmic theory, serving as a key benchmark for understanding computational classes. In this…
cs.LG2024
Fast Sampling via Discrete Non-Markov Diffusion Models with Predetermined Transition Time
Zixiang Chen, Huizhuo Yuan, Yongqian Li +3
Discrete diffusion models have emerged as powerful tools for high-quality data generation. Despite their success in discrete spaces, such as text generation tasks, the acceleration…