Co-occurring keywords · papers mentioning both
Papers
Towards An Efficient Approach for the Nonconvex lp Ball Projection: Algorithm and Analysis
JMLR 2022
Towards Fully Sparse Training: Information Restoration with Spatial Similarity
AAAI 2022
Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity
NeurIPS 2022
A Note on Sparse Generalized Eigenvalue Problem
NeurIPS 2021
A Novel Sequential Coreset Method for Gradient Descent Algorithms
ICML 2021
Distributed Machine Learning with Sparse Heterogeneous Data
NeurIPS 2021
Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares
NeurIPS 2021
Efficient On-Chip Learning for Optical Neural Networks Through Power-Aware Sparse Zeroth-Order Optimization
AAAI 2021
Expanding Boundaries of Gap Safe Screening
JMLR 2021
Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit
JMLR 2021
Homomorphic Sensing: Sparsity and Noise
ICML 2021
Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases
AAAI 2021
Low Resource Quadratic Forms for Knowledge Graph Embeddings
EMNLP 2021
Neural Architecture Search as Sparse Supernet
AAAI 2021
Revitalizing Optimization for 3D Human Pose and Shape Estimation: A Sparse Constrained Formulation
ICCV 2021
Sample-Efficient L0-L2 Constrained Structure Learning of Sparse Ising Models
AAAI 2021
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations
JMLR 2021
Sparse Multi-Path Corrections in Fringe Projection Profilometry
CVPR 2021
Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
NeurIPS 2021
Square Root Bundle Adjustment for Large-Scale Reconstruction
CVPR 2021
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization
JMLR 2021
The Flip Side of the Reweighted Coin: Duality of Adaptive Dropout and Regularization
NeurIPS 2021
A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization
NeurIPS 2020
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
ICML 2020
A Sparse Semismooth Newton Based Proximal Majorization-Minimization Algorithm for Nonconvex Square-Root-Loss Regression Problems
JMLR 2020