Skip to content
conftrace_

Sparse Optimization

416 papers

22
30
29
14
'10
'15
'20
'25

Papers

tntorch: Tensor Network Learning with PyTorch JMLR 2022 Towards An Efficient Approach for the Nonconvex lp Ball Projection: Algorithm and Analysis JMLR 2022 Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity NeurIPS 2022 A Note on Sparse Generalized Eigenvalue Problem NeurIPS 2021 A Nullspace Property for Subspace-Preserving Recovery ICML 2021 Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021 Distributed Machine Learning with Sparse Heterogeneous Data NeurIPS 2021 Dual Principal Component Pursuit for Robust Subspace Learning: Theory and Algorithms for a Holistic Approach ICML 2021 Expanding Boundaries of Gap Safe Screening JMLR 2021 General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds NeurIPS 2021 Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit JMLR 2021 Homomorphic Sensing: Sparsity and Noise ICML 2021 Inferring serial correlation with dynamic backgrounds ICML 2021 Low-Rank Registration Based Manifolds for Convection-Dominated PDEs AAAI 2021 Low-Rank Tensor Completion by Approximating the Tensor Average Rank ICCV 2021 Mixed-Features Vectors and Subspace Splitting ICLR 2021 Physics-informed Spline Learning for Nonlinear Dynamics Discovery IJCAI 2021 Regularized Submodular Maximization at Scale ICML 2021 Revitalizing Optimization for 3D Human Pose and Shape Estimation: A Sparse Constrained Formulation ICCV 2021 Soft Tensor Regression JMLR 2021 Sparse and Smooth Signal Estimation: Convexification of L0-Formulations JMLR 2021 Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient ICML 2021 Support Recovery of Sparse Signals from a Mixture of Linear Measurements NeurIPS 2021 A Deep Neural Network Model of Particle Thermal Radiation in Packed Bed AAAI 2020 A Greedy Anytime Algorithm for Sparse PCA COLT 2020