Skip to content
conftrace_

hard thresholding

25 papers

Papers

Towards Nonlinear Sparse AUC Maximization via Compositional Stochastic Hard Thresholding AAAI 2026 A Fast and Provable Algorithm for Sparse Phase Retrieval ICLR 2024 High-dimensional Linear Bandits with Knapsacks ICML 2024 Regularized K-means Through Hard-Thresholding JMLR 2022 Robust Bayesian Regression via Hard Thresholding NeurIPS 2022 Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity NeurIPS 2022 Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit JMLR 2021 Sparse Convex Optimization via Adaptively Regularized Hard Thresholding JMLR 2021 An Effective Hard Thresholding Method Based on Stochastic Variance Reduction for Nonconvex Sparse Learning AAAI 2020 Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding COLT 2020 One-Bit Compressed Sensing via One-Shot Hard Thresholding UAI 2020 Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression COLT 2019 A Tight Bound of Hard Thresholding JMLR 2018 Covariate Adjusted Precision Matrix Estimation via Nonconvex Optimization ICML 2018 Efficient Stochastic Gradient Hard Thresholding NeurIPS 2018 Gradient Hard Thresholding Pursuit JMLR 2018 Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation NeurIPS 2018 Nearly Optimal Robust Matrix Completion ICML 2017 On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit ICML 2017 Partial Hard Thresholding: Towards A Principled Analysis of Support Recovery NeurIPS 2017 Robust Regression via Heuristic Hard Thresholding IJCAI 2017 No penalty no tears: Least squares in high-dimensional linear models ICML 2016 Structured Sparse Regression via Greedy Hard Thresholding NeurIPS 2016 Robust Regression via Hard Thresholding NeurIPS 2015 Orthogonal Matching Pursuit with Replacement NeurIPS 2011