← Search

Armin Eftekhari

7 accepted papers

2021

Principal Component Hierarchy for Sparse Quadratic Programs

ICML 2021spotlight

We propose a novel approximation hierarchy for cardinality-constrained, convex quadratic programs that exploits the rank-dominating eigenvectors of the quadratic matrix. Each level of approximation admits a min-max characterization whose objective function can be optimized over the binary variables…

2021

Subquadratic Overparameterization for Shallow Neural Networks

NeurIPS 2021poster

Overparameterization refers to the important phenomenon where the width of a neural network is chosen such that learning algorithms can provably attain zero loss in nonconvex training. The existing theory establishes such global convergence using various initialization strategies, training modificat…

Cited by 36SourcePDFScholar
2020

Scalable Learning-Based Sampling Optimization for Compressive Dynamic MRI

ICASSP 2020accepted

Compressed sensing applied to magnetic resonance imaging (MRI) allows to reduce the scanning time by enabling images to be reconstructed from highly undersampled data. In this paper, we tackle the problem of designing a sampling mask for an arbitrary reconstruction method and a limited acquisition b…

Cited by 0SourceScholar
2019

An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints

NeurIPS 2019poster

We propose a practical inexact augmented Lagrangian method (iALM) for nonconvex problems with nonlinear constraints. We characterize the total computational complexity of our method subject to a verifiable geometric condition, which is closely related to the Polyak-Lojasiewicz and Mangasarian-Fromow…

Cited by 95SourcePDFScholar