3 citations · 9 across the 9 of their papers we have counts for
10 papers
Edit-Neighboring Data Streams and Privacy under Continual Observation
Joel Daniel Andersson, Anamay Chaturvedi, Monika Henzinger +1
Differential privacy under Continual Observation (CO) quantifies the loss in privacy that occurs when outputs generated using a stream of sensitive input data are published in the…
Near-Optimal Generalized Private Testing
Anamay Chaturvedi, Monika Henzinger, Jalaj Upadhyay
In differential privacy (DP), the generalized private testing problem was introduced by Liu and Talwar (STOC 2019). Given a dataset and a sequence of black-box…
Streaming Submodular Maximization with Differential Privacy
Anamay Chaturvedi, Huy Lê Nguyen, Thy Nguyen
In this work, we study the problem of privately maximizing a submodular function in the streaming setting. Extensive work has been done on privately maximizing submodular functions…
Improved Learning-augmented Algorithms for k-means and k-medians Clustering
Thy Nguyen, Anamay Chaturvedi, Huy Lê Nguyen
We consider the problem of clustering in the learning-augmented setting, where we are given a data set in -dimensional Euclidean space, and a label for each data point given by…
Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals
Sidhant Bansal, Arnab Bhattacharyya, Anamay Chaturvedi +1
A {\em universal 1-bit compressive sensing (CS)} scheme consists of a measurement matrix such that all signals belonging to a particular class can be approximately recovere…
Bounded Space Differentially Private Quantiles
Daniel Alabi, Omri Ben-Eliezer, Anamay Chaturvedi
Estimating the quantiles of a large dataset is a fundamental problem in both the streaming algorithms literature and the differential privacy literature. However, all existing priv…
Locally Private -Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error
Anamay Chaturvedi, Matthew Jones, Huy L. Nguyen
Given a data set of size in -dimensional Euclidean space, the -means problem asks for a set of points (called centers) so that the sum of the -distances be…
Differentially private -means clustering via exponential mechanism and max cover
Anamay Chaturvedi, Huy Nguyen, Eric Xu
We introduce a new -differentially private algorithm for the -means clustering problem. Given a dataset in Euclidean space, the -means clustering problem requires…
Differentially Private Decomposable Submodular Maximization
Anamay Chaturvedi, Huy Nguyen, Lydia Zakynthinou
We study the problem of differentially private constrained maximization of decomposable submodular functions. A submodular function is decomposable if it takes the form of a sum of…
Learning Gaussian Graphical Models via Multiplicative Weights
Anamay Chaturvedi, Jonathan Scarlett
Graphical model selection in Markov random fields is a fundamental problem in statistics and machine learning. Two particularly prominent models, the Ising model and Gaussian model…