47 citations · 189 across the 27 of their papers we have counts for
6 papers · 1 filter
MOSES: A Streaming Algorithm for Linear Dimensionality Reduction
Armin Eftekhari, Raphael A. Hauser, Andreas Grammenos
This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its dimension. More speci…
Stable Super-Resolution of Images: A Theoretical Study
Armin Eftekhari, Tamir Bendory, Gongguo Tang
We study the ubiquitous super-resolution problem, in which one aims at localizing positive point sources in an image, blurred by the point spread function of the imaging device. To…
PCA by Optimisation of Symmetric Functions has no Spurious Local Optima
Raphael A. Hauser, Armin Eftekhari
Principal Component Analysis (PCA) finds the best linear representation of data, and is an indispensable tool in many learning and inference tasks. Classically, principal component…
Explicit Stabilised Gradient Descent for Faster Strongly Convex Optimisation
Armin Eftekhari, Bart Vandereycken, Gilles Vilmart +1
This paper introduces the Runge-Kutta Chebyshev descent method (RKCD) for strongly convex optimisation problems. This new algorithm is based on explicit stabilised integrators for…
Sparse Inverse Problems Over Measures: Equivalence of the Conditional Gradient and Exchange Methods
Armin Eftekhari, Andrew Thompson
We study an optimization program over nonnegative Borel measures that encourages sparsity in its solution. Efficient solvers for this program are in increasing demand, as it arises…
Sparse non-negative super-resolution -- simplified and stabilised
Armin Eftekhari, Jared Tanner, Andrew Thompson +2
The convolution of a discrete measure, , with a local window function, , is a common model for a measurement device whose resolution is substantia…