Ameya Velingker

activity

20142023

most citedPrivate Robust Estimation by Stabilizing Convex Relaxations

4 citations · 6 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2023

Fast $(1 + ε)$ -Approximation Algorithms for Binary Matrix Factorization

Ameya Velingker, Maximilian Vötsch, David P. Woodruff +1

We introduce efficient $(1 + ε)$ -approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}…

stat.ML2021★ 4 cited

Private Robust Estimation by Stabilizing Convex Relaxations

Pravesh K. Kothari, Pasin Manurangsi, Ameya Velingker

We give the first polynomial time and sample $(ε, δ)$ -differentially private (DP) algorithm to estimate the mean, covariance and higher moments in the presence of a constant fracti…

cs.IT2014★ 2 cited

An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets

Venkatesan Guruswami, Ameya Velingker

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable $X ∣ Y$ , with $X$ supported on $Z_{q} = {0, 1, \dots, q - 1}$ for prime $q$ ,…

Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization

Private Robust Estimation by Stabilizing Convex Relaxations

An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets

Fast $(1 + ε)$ -Approximation Algorithms for Binary Matrix Factorization