72 citations · 542 across the 65 of their papers we have counts for
10 papers · 1 filter
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis +1
We consider the non-square matrix sensing problem, under restricted isometry property (RIP) assumptions. We focus on the non-convex formulation, where any rank- matrix $X \in \m…
Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably
Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis +1
A rank- matrix can be written as a product , where and . One could explo…
Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems
Dohyung Park, Anastasios Kyrillidis, Srinadh Bhojanapalli +2
We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce…
A simple and provable algorithm for sparse diagonal CCA
Megasthenis Asteris, Anastasios Kyrillidis, Oluwasanmi Koyejo +1
Given two sets of variables, derived from a common set of samples, sparse Canonical Correlation Analysis (CCA) seeks linear combinations of a small number of variables in each set,…
Formal Verification of Obstacle Avoidance and Navigation of Ground Robots
Stefan Mitsch, Khalil Ghorbal, David Vogelbacher +1
The safety of mobile robots in dynamic environments is predicated on making sure that they do not collide with obstacles. In support of such safety arguments, we analyze and formal…
Learning Sparse Additive Models with Interactions in High Dimensions
Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner +1
A function is referred to as a Sparse Additive Model (SPAM), if it is of the form , whe…