 A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker ConditionsAnnual Conference Computational Learning Theory (COLT), 2025 |
 Probabilistic Iterative Hard Thresholding for Sparse LearningComputational optimization and applications (COA), 2024 |
 High-dimensional Linear Bandits with KnapsacksInternational Conference on Machine Learning (ICML), 2023 |
 Interaction Hard Thresholding: Consistent Sparse Quadratic Regression in
Sub-quadratic Time and SpaceNeural Information Processing Systems (NeurIPS), 2019 |
 Stochastic Iterative Hard Thresholding for Graph-structured Sparsity
OptimizationInternational Conference on Machine Learning (ICML), 2019 |
