Arturs Backurs | DeepAI

AI Chat

Featured Co-authors

Yi Zhang
258 publications
Yin Tat Lee
64 publications
Cameron Musco
57 publications
Sébastien Bubeck
54 publications
Christos Tzamos
51 publications
Karl Bringmann
49 publications
Ludwig Schmidt
48 publications
Virginia Vassilevska Williams
45 publications
Sariel Har-Peled
44 publications
Gautam Kamath
43 publications
Janardhan Kulkarni
35 publications

∙ 06/09/2022

Unveiling Transformers with LEGO: a synthetic reasoning task

We propose a synthetic task, LEGO (Learning Equality and Group Operation...

8 Yi Zhang, et al. ∙

∙ 06/03/2022

Differentially Private Model Compression

Recent papers have shown that large pre-trained language models (LLMs) s...

0 Fatemehsadat Mireshghallah, et al. ∙

∙ 10/13/2021

Differentially Private Fine-tuning of Language Models

We give simpler, sparser, and faster algorithms for differentially priva...

0 Da Yu, et al. ∙

∙ 02/16/2021

Faster Kernel Matrix Algebra via Density Estimation

We study fast algorithms for computing fundamental properties of a posit...

25 Arturs Backurs, et al. ∙

∙ 01/20/2021

Generating (Formulaic) Text by Splicing Together Nearest Neighbors

We propose to tackle conditional text generation tasks, especially those...

0 Sam Wiseman, et al. ∙

∙ 10/27/2020

Impossibility Results for Grammar-Compressed Linear Algebra

To handle vast amounts of data, it is natural and popular to compress ve...

0 Amir Abboud, et al. ∙

∙ 08/31/2020

Active Local Learning

In this work we consider active local learning: given a query point x, a...

9 Arturs Backurs, et al. ∙

∙ 08/24/2020

Fast and Simple Modular Subset Sum

We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...

0 Kyriakos Axiotis, et al. ∙

∙ 04/11/2020

Submodular Clustering in Low Dimensions

We study a clustering problem where the goal is to maximize the coverage...

0 Arturs Backurs, et al. ∙

∙ 02/10/2019

Scalable Fair Clustering

We study the fair variant of the classic k-median problem introduced by ...

0 Arturs Backurs, et al. ∙

∙ 08/26/2018

Towards Tight Approximation Bounds for Graph Diameter and Eccentricities

Among the most important graph parameters is the Diameter, the largest d...

0 Arturs Backurs, et al. ∙

∙ 07/12/2018

Fast Modular Subset Sum using Linear Sketching

Given n positive integers, the Modular Subset Sum problem asks if a subs...

0 Kyriakos Axiotis, et al. ∙

∙ 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,...

0 Amir Abboud, et al. ∙

∙ 04/10/2017

On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks

Empirical risk minimization (ERM) is ubiquitous in machine learning and ...

0 Arturs Backurs, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world