{"total":16,"rows":[{"id":"2205.14337","title":"List-Decodable Sparse Mean Estimation","created":"2022-05-28","cited_by_count":11,"area":null},{"id":"2203.09413","title":"Stability and Risk Bounds of Iterative Hard Thresholding","created":"2022-03-17","cited_by_count":7,"area":null},{"id":"2208.05447","title":"Robust Methods for High-Dimensional Linear Learning","created":"2022-08-10","cited_by_count":5,"area":null},{"id":"2204.11640","title":"Hybrid ISTA: Unfolding ISTA With Convergence Guarantees Using Free-Form Deep Neural Networks","created":"2022-04-25","cited_by_count":4,"area":null},{"id":"2305.06199","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","created":"2023-05-10","cited_by_count":4,"area":null},{"id":"2506.02724","title":"WeightLoRA: Keep Only Necessary Adapters","created":"2025-06-03","cited_by_count":4,"area":null},{"id":"2210.05279","title":"Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity","created":"2022-10-11","cited_by_count":3,"area":null},{"id":"2306.00673","title":"Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise","created":"2023-06-01","cited_by_count":3,"area":null},{"id":"2311.01327","title":"High-dimensional Linear Bandits with Knapsacks","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2209.14536","title":"Convergence of the mini-batch SIHT algorithm","created":"2022-09-29","cited_by_count":2,"area":null},{"id":"2509.09802","title":"Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation","created":"2025-09-11","cited_by_count":2,"area":null},{"id":"2302.10755","title":"Federated Gradient Matching Pursuit","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2403.18540","title":"skscope: Fast Sparsity-Constrained Optimization in Python","created":"2024-03-27","cited_by_count":1,"area":null},{"id":"2207.02058","title":"Best Subset Selection with Efficient Primal-Dual Algorithm","created":"2022-07-05","cited_by_count":0,"area":null},{"id":"2402.02322","title":"Dynamic Incremental Optimization for Best Subset Selection","created":"2024-02-04","cited_by_count":0,"area":null},{"id":"2406.12017","title":"Sparsity-Constraint Optimization via Splicing Iteration","created":"2024-06-17","cited_by_count":0,"area":null}],"next_cursor":null}