activity
20172022
most citedFast Low-Rank Matrix Estimation without the Condition Number

6 citations · 17 across the 10 of their papers we have counts for

collaborators
Showing stat.MLShow all

6 papers · 1 filter

stat.ML20192 cited

Learning Generative Models of Structured Signals from Their Superposition Using GANs with Application to Denoising and Demixing

Mohammadreza Soltani, Swayambhoo Jain, Abhinav Sambasivan

Recently, Generative Adversarial Networks (GANs) have emerged as a popular alternative for modeling complex high dimensional distributions. Most of the existing works implicitly as…

stat.ML20176 cited

Fast Low-Rank Matrix Estimation without the Condition Number

Mohammadreza Soltani, Chinmay Hegde

In this paper, we study the general problem of optimizing a convex function over the set of matrices, subject to rank constraints on . However, existing firs…

stat.ML2017

Reconstruction from Periodic Nonlinearities, With Applications to HDR Imaging

Viraj Shah, Mohammadreza Soltani, Chinmay Hegde

We consider the problem of reconstructing signals and images from periodic nonlinearities. For such problems, we design a measurement scheme that supports efficient reconstruction;…

stat.ML2017

Demixing Structured Superposition Signals from Periodic and Aperiodic Nonlinear Observations

Mohammadreza Soltani, Chinmay Hegde

We consider the demixing problem of two (or more) structured high-dimensional vectors from a limited number of nonlinear observations where this nonlinearity is due to either a per…

stat.ML20171 cited

Fast Algorithms for Learning Latent Variables in Graphical Models

Mohammadreza Soltani, Chinmay Hegde

We study the problem of learning latent variables in Gaussian graphical models. Existing methods for this problem assume that the precision matrix of the observed variables is the…

stat.ML20175 cited

Improved Algorithms for Matrix Recovery from Rank-One Projections

Mohammadreza Soltani, Chinmay Hegde

We consider the problem of estimation of a low-rank matrix from a limited number of noisy rank-one projections. In particular, we propose two fast, non-convex \emph{proper} algorit…