Arturs Backurs
16 papers · 2017–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
π Interdisciplinary Bridge π£ Hot Topic Early Bird π§ Keyword Pioneer π Conference Polyglot (5) π Academic Marathon (8)
πΊοΈ
Taxonomy Completionist
(28)
π
Conference Polyglot
(5)
π
Academic Marathon
(8)
π
Century Club
(16)
π₯
Unstoppable
(7)
ποΈ
Keyword Collector
(55)
Conferences
ICML (5)
ICLR (4)
NIPS (4)
COLT (2)
EMNLP (1)
Top co-authors
Keywords
computational complexity
(2)
differential privacy
(1)
viterbi algorithm
(1)
neural network training
(1)
local learning
(1)
density estimation
(1)
optimal transport
(1)
policy learning
(1)
kernel matrix
(1)
fine-grained complexity
(1)
empirical risk minimization
(1)
nearest neighbor
(1)
dynamic programming
(1)
nearest neighbor search
(1)
active learning
(1)
distance estimation
(1)
label complexity
(1)
model pruning
(1)
model compression
(1)
wasserstein distance
(1)
Papers
DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
COLT 2025
Differentially Private Synthetic Data via Foundation Model APIs 2: Text
ICML 2024
Efficiently Computing Similarities to Private Datasets
ICLR 2024
Privately Aligning Language Models with Reinforcement Learning
ICLR 2024
Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping
ICLR 2023
Differentially Private Model Compression
NIPS 2022
Differentially Private Fine-tuning of Language Models
ICLR 2022
Data-to-text Generation by Splicing Together Nearest Neighbors
EMNLP 2021
Faster Kernel Matrix Algebra via Density Estimation
ICML 2021
Active Local Learning
COLT 2020
Impossibility Results for Grammar-Compressed Linear Algebra
NIPS 2020
Scalable Nearest Neighbor Search for Optimal Transport
ICML 2020
Scalable Fair Clustering
ICML 2019
Space and Time Efficient Kernel Density Estimation in High Dimensions
NIPS 2019
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks
NIPS 2017
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
ICML 2017