{"total":53,"rows":[{"id":"2106.12379","title":"AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks","created":"2021-06-23","cited_by_count":59,"area":null},{"id":"2106.07197","title":"DAGs with No Curl: An Efficient DAG Structure Learning Approach","created":"2021-06-14","cited_by_count":53,"area":null},{"id":"2101.07577","title":"Learnable Embedding Sizes for Recommender Systems","created":"2021-01-19","cited_by_count":42,"area":null},{"id":"2107.11136","title":"High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data","created":"2021-07-23","cited_by_count":42,"area":null},{"id":"2102.02756","title":"On the computational and statistical complexity of over-parameterized matrix sensing","created":"2021-01-27","cited_by_count":31,"area":null},{"id":"2303.07152","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","created":"2023-03-13","cited_by_count":21,"area":null},{"id":"2306.06209","title":"Backdoor Attack with Sparse and Invisible Trigger","created":"2023-05-11","cited_by_count":20,"area":null},{"id":"2203.04002","title":"Semi-Random Sparse Recovery in Nearly-Linear Time","created":"2022-03-08","cited_by_count":18,"area":null},{"id":"2106.09207","title":"On the Power of Preconditioning in Sparse Linear Regression","created":"2021-06-17","cited_by_count":15,"area":null},{"id":"2307.01497","title":"Accelerated stochastic approximation with state-dependent noise","created":"2023-07-04","cited_by_count":11,"area":null},{"id":"2204.08274","title":"Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime","created":"2022-04-11","cited_by_count":9,"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":"2306.14381","title":"Gradient Descent Converges Linearly for Logistic Regression on Separable Data","created":"2023-06-26","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":"2404.01141","title":"SoK: A Review of Differentially Private Linear Models For High-Dimensional Data","created":"2024-04-01","cited_by_count":5,"area":null},{"id":"2202.13718","title":"Fast Feature Selection with Fairness Constraints","created":"2022-02-28","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":"2310.07367","title":"Improved Analysis of Sparse Linear Regression in Local Differential Privacy Model","created":"2023-10-11","cited_by_count":4,"area":null},{"id":"2101.06262","title":"Local Search Algorithms for Rank-Constrained Convex Optimization","created":"2021-01-15","cited_by_count":3,"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":"2506.10205","title":"AWP: Activation-Aware Weight Pruning and Quantization with Projected Gradient Descent","created":"2025-06-11","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":"2305.01726","title":"Slow Kill for Big Data Learning","created":"2023-05-02","cited_by_count":2,"area":null},{"id":"2410.21634","title":"Faster Local Solvers for Graph Diffusion Equations","created":"2024-10-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":"2106.14630","title":"Improved Prediction and Network Estimation Using the Monotone Single Index Multi-variate Autoregressive Model","created":"2021-06-28","cited_by_count":1,"area":null},{"id":"2109.14856","title":"Robust High-Dimensional Regression with Coefficient Thresholding and its Application to Imaging Data Analysis","created":"2021-09-30","cited_by_count":1,"area":null},{"id":"2210.12277","title":"The Stochastic Proximal Distance Algorithm","created":"2022-10-21","cited_by_count":1,"area":null},{"id":"2210.12882","title":"Stochastic Mirror Descent for Large-Scale Sparse Recovery","created":"2022-10-23","cited_by_count":1,"area":null},{"id":"2306.10395","title":"Distributed Semi-Supervised Sparse Statistical Inference","created":"2023-06-17","cited_by_count":1,"area":null},{"id":"2405.18412","title":"Tensor Methods in High Dimensional Data Analysis: Opportunities and Challenges","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2604.04228","title":"Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2608.02588","title":"The Condition-Number Barrier in Sparse Least Squares","created":"2026-08-03","cited_by_count":1,"area":null},{"id":"2107.00472","title":"Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets","created":"2021-06-29","cited_by_count":0,"area":null},{"id":"2111.03932","title":"AGGLIO: Global Optimization for Locally Convex Functions","created":"2021-11-06","cited_by_count":0,"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":"2211.15057","title":"An adaptive shortest-solution guided decimation approach to sparse high-dimensional linear regression","created":"2022-11-28","cited_by_count":0,"area":null},{"id":"2301.06259","title":"Understanding Best Subset Selection: A Tale of Two C(omplex)ities","created":"2023-01-16","cited_by_count":0,"area":null},{"id":"2307.07405","title":"Performance of $\\ell_1$ Regularization for Sparse Convex Optimization","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2401.05394","title":"Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery","created":"2023-12-19","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},{"id":"2407.16968","title":"Stochastic Variance-Reduced Iterative Hard Thresholding in Graph Sparsity Optimization","created":"2024-07-24","cited_by_count":0,"area":null},{"id":"2409.01413","title":"Probabilistic Iterative Hard Thresholding for Sparse Learning","created":"2024-09-02","cited_by_count":0,"area":null},{"id":"2410.15762","title":"Solving Sparse \\& High-Dimensional-Output Regression via Compression","created":"2024-10-21","cited_by_count":0,"area":null},{"id":"2509.20323","title":"A Recovery Guarantee for Sparse Neural Networks","created":"2025-09-24","cited_by_count":0,"area":null},{"id":"2509.21699","title":"Exact Subgraph Isomorphism Network with Mixed $L_{0,2}$ Norm Constraint for Predictive Graph Mining","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2510.10665","title":"Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination","created":"2025-10-12","cited_by_count":0,"area":null},{"id":"2511.18167","title":"Sparse Polyak with optimal thresholding operators for high-dimensional M-estimation","created":"2025-11-22","cited_by_count":0,"area":null},{"id":"2603.20696","title":"High-dimensional online learning via asynchronous decomposition: Non-divergent results, dynamic regularization, and beyond","created":"2026-03-21","cited_by_count":0,"area":null},{"id":"2606.28652","title":"Adaptive Iterative Hard Thresholding for Online High-dimensional Quantile Regression","created":"2026-06-26","cited_by_count":0,"area":null},{"id":"2608.17466","title":"Online Generalized Sparse Regression: How Does Overparametrization Help?","created":"2026-08-18","cited_by_count":0,"area":null},{"id":"2609.19077","title":"Probabilistic Linear Explanations","created":"2026-09-16","cited_by_count":0,"area":null}],"next_cursor":null}