activity
20112025
most citedA near-stationary subspace for ridge approximation

47 citations · 189 across the 27 of their papers we have counts for

collaborators
Showing 2016Show all

7 papers · 1 filter

cs.IT2016

Randomized Learning of the Second-Moment Matrix of a Smooth Function

Armin Eftekhari, Michael B. Wakin, Ping Li +1

Consider an open set , equipped with a probability measure . An important characteristic of a smooth function $f:\mathbb{D}\rightarrow\mathbb{R}…

cs.IT2016

Weighted Matrix Completion and Recovery with Prior Subspace Information

Armin Eftekhari, Dehui Yang, Michael B. Wakin

An incoherent low-rank matrix can be efficiently reconstructed after observing a few of its entries at random, and then solving a convex program that minimizes the nuclear norm. In…

cs.IT2016★ 2 cited

Streaming Principal Component Analysis From Incomplete Data

Armin Eftekhari, Gregory Ongie, Laura Balzano +1

Linear subspace models are pervasive in computational sciences and particularly used for large datasets which are often incomplete due to privacy issues or sampling constraints. Th…

cs.IT2016★ 3 cited

What to Expect When You Are Expecting on the Grassmannian

Armin Eftekhari, Laura Balzano, Michael B. Wakin

Consider an incoming sequence of vectors, all belonging to an unknown subspace , and each with many missing entries. In order to estimate , it i…

nlin.CD2016★ 24 cited

Stabilizing Embedology: Geometry-Preserving Delay-Coordinate Maps

Armin Eftekhari, Han Lun Yap, Michael B. Wakin +1

Delay-coordinate mapping is an effective and widely used technique for reconstructing and analyzing the dynamics of a nonlinear system based on time-series outputs. The efficacy of…

cs.IT2016

MC^2: A Two-Phase Algorithm for Leveraged Matrix Completion

Armin Eftekhari, Michael B. Wakin, Rachel A. Ward

Leverage scores, loosely speaking, reflect the importance of the rows and columns of a matrix. Ideally, given the leverage scores of a rank- matrix ,…