1.9k citations · 2.8k across the 40 of their papers we have counts for
47 papers
Fairness for Image Generation with Uncertain Sensitive Attributes
Ajil Jalal, Sushrut Karmalkar, Jessica Hoffmann +2
This work tackles the issue of fairness in the context of generative procedures, such as image super-resolution, which entail different definitions from the standard classification…
Instance-Optimal Compressed Sensing via Posterior Sampling
Ajil Jalal, Sushrut Karmalkar, Alexandros G. Dimakis +1
We characterize the measurement complexity of compressed sensing of signals drawn from a known prior distribution, even when the support of the prior is the entire space (rather th…
Fast Splitting Algorithms for Sparsity-Constrained and Noisy Group Testing
Eric Price, Jonathan Scarlett, Nelvin Tan
In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is pre…
A Simple Proof of a New Set Disjointness with Applications to Data Streams
Akshay Kamath, Eric Price, David P. Woodruff
The multiplayer promise set disjointness is one of the most widely used problems from communication complexity in applications. In this problem there are players with subsets $…
L1 Regression with Lewis Weights Subsampling
Aditya Parulekar, Advait Parulekar, Eric Price
We consider the problem of finding an approximate solution to regression while only observing a small number of labels. Given an unlabeled data matrix , we…
Linear Bandit Algorithms with Sublinear Time Complexity
Shuo Yang, Tongzheng Ren, Sanjay Shakkottai +3
We propose two linear bandits algorithms with per-step complexity sublinear in the number of arms . The algorithms are designed for applications where the arm set is extremely l…