research
∙
09/21/2023
Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation
We study the problem of in-context learning (ICL) with large language mo...
share
research
∙
05/24/2023
Differentially Private Synthetic Data via Foundation Model APIs 1: Images
Generating differentially private (DP) synthetic data that closely resem...
research
∙
05/23/2023
Selective Pre-training for Private Fine-tuning
Suppose we want to train text prediction models in email clients or word...
research
∙
02/13/2023
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
The development of efficient sampling algorithms catering to non-Euclide...
research
∙
12/23/2022
A construction of Maximally Recoverable LRCs for small number of local groups
Maximally Recoverable Local Reconstruction Codes (LRCs) are codes design...
research
∙
12/21/2022
Improved Field Size Bounds for Higher Order MDS Codes
Higher order MDS codes are an interesting generalization of MDS codes re...
research
∙
07/18/2022
Private Convex Optimization in General Norms
We propose a new framework for differentially private optimization of co...
research
∙
06/10/2022
Generic Reed-Solomon codes achieve list-decoding capacity
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MD...
research
∙
03/01/2022
Private Convex Optimization via Exponential Mechanism
In this paper, we study private optimization problems for non-smooth con...
research
∙
10/13/2021
Differentially Private Fine-tuning of Language Models
We give simpler, sparser, and faster algorithms for differentially priva...
research
∙
08/05/2021
Differentially Private n-gram Extraction
We revisit the problem of n-gram extraction in the differential privacy ...
research
∙
07/22/2021
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes
An (m,n,a,b)-tensor code consists of m× n matrices whose columns satisfy...
research
∙
07/14/2021
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
Sequencing a DNA strand, as part of the read process in DNA storage, pro...
research
∙
06/05/2021
Numerical Composition of Differential Privacy
We give a fast algorithm to optimally compose privacy guarantees of diff...
research
∙
02/05/2021
Fast and Memory Efficient Differentially Private-SGD via JL Projections
Differentially Private-SGD (DP-SGD) of Abadi et al. (2016) and its varia...
research
∙
12/14/2020
Improved Maximally Recoverable LRCs using Skew Polynomials
An (n,r,h,a,q)-Local Reconstruction Code is a linear code over 𝔽_q of le...
research
∙
02/22/2020
Differentially Private Set Union
We study the basic operation of set union in the global model of differe...
research
∙
02/21/2020
Locally Private Hypothesis Selection
We initiate the study of hypothesis selection under local differential p...
research
∙
02/13/2019
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
We study the complexity of Boolean constraint satisfaction problems (CSP...
research
∙
09/27/2018
Spanoids - an abstraction of spanning structures, and a barrier for LCCs
We introduce a simple logical inference structure we call a spanoid (gen...
research
∙
11/15/2017
Gaussian width bounds with applications to arithmetic progressions in random settings
Motivated by two problems on arithmetic progressions (APs)---concerning ...
research
∙
10/27/2017
On Maximally Recoverable Local Reconstruction Codes
In recent years the explosion in the volumes of data being stored online...
research
∙
05/12/2016