research
∙
06/09/2022
Unveiling Transformers with LEGO: a synthetic reasoning task
We propose a synthetic task, LEGO (Learning Equality and Group Operation...
share
research
∙
06/03/2022
Differentially Private Model Compression
Recent papers have shown that large pre-trained language models (LLMs) s...
research
∙
10/13/2021
Differentially Private Fine-tuning of Language Models
We give simpler, sparser, and faster algorithms for differentially priva...
research
∙
02/16/2021
Faster Kernel Matrix Algebra via Density Estimation
We study fast algorithms for computing fundamental properties of a posit...
research
∙
01/20/2021
Generating (Formulaic) Text by Splicing Together Nearest Neighbors
We propose to tackle conditional text generation tasks, especially those...
research
∙
10/27/2020
Impossibility Results for Grammar-Compressed Linear Algebra
To handle vast amounts of data, it is natural and popular to compress ve...
research
∙
08/31/2020
Active Local Learning
In this work we consider active local learning: given a query point x, a...
research
∙
08/24/2020
Fast and Simple Modular Subset Sum
We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...
research
∙
04/11/2020
Submodular Clustering in Low Dimensions
We study a clustering problem where the goal is to maximize the coverage...
research
∙
02/10/2019
Scalable Fair Clustering
We study the fair variant of the classic k-median problem introduced by ...
research
∙
08/26/2018
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities
Among the most important graph parameters is the Diameter, the largest d...
research
∙
07/12/2018
Fast Modular Subset Sum using Linear Sketching
Given n positive integers, the Modular Subset Sum problem asks if a subs...
research
∙
03/02/2018
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve
Can we analyze data without decompressing it? As our data keeps growing,...
research
∙
04/10/2017