Skip to content
conftrace_

ALT 2022

43 papers

Efficient local planning with linear function approximation

Dong Yin, Botao Hao, Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvári

Faster Noisy Power Method

Zhiqiang Xu, Ping Li

Distributed Online Learning for Joint Regret with Communication Constraints

Dirk van der Hoeven, Hedi Hadiji, Tim van Erven

Asymptotic Degradation of Linear Regression Estimates with Strategic Data Sources

Benjamin Roussillon, Nicolas Gast, Patrick Loiseau, Panayotis Mertikopoulos

Scale-Free Adversarial Multi Armed Bandits

Sudeep Raja Putta, Shipra Agrawal

Infinitely Divisible Noise in the Low Privacy Regime

Rasmus Pagh, Nina Mesing Stausholm

The Mirror Langevin Algorithm Converges with Vanishing Bias

Ruilin Li, Molei Tao, Santosh S. Vempala, Andre Wibisono

On the Last Iterate Convergence of Momentum Methods

Xiaoyu Li, Mingrui Liu, Francesco Orabona

Adversarial Interpretation of Bayesian Inference

Hisham Husain, Jeremias Knoblauch

Efficient and Optimal Fixed-Time Regret with Two Experts

Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella

Multicalibrated Partitions for Importance Weights

Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder

Privacy Amplification via Shuffling for Linear Contextual Bandits

Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet, Matteo Pirotta

Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature

Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona

Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians

Sami Davies, Arya Mazumdar, Soumyabrata Pal, Cyrus Rashtchian

Leveraging Initial Hints for Free in Stochastic Linear Bandits

Ashok Cutkosky, Chris Dann, Abhimanyu Das, Qiuyi Zhang

Algorithms for learning a mixture of linear classifiers

Aidao Chen, Anindya De, Aravindan Vijayaraghavan

Implicit Parameter-free Online Learning with Truncated Linear Models

Keyi Chen, Ashok Cutkosky, Francesco Orabona

Social Learning in Non-Stationary Environments

Etienne Boursier, Vianney Perchet, Marco Scarsini

Universal Online Learning with Unbounded Losses: Memory Is All You Need

Moise Blanchard, Romain Cosson, Steve Hanneke

Learning with Distributional Inverters

Eric Binnendyk, Marco Carmosino, Antonina Kolokolova, R Ramyaa, Manuel Sabin

Learning what to remember

Robi Bhattacharjee, Gaurav Mahajan

Understanding Simultaneous Train and Test Robustness

Pranjal Awasthi, Sivaraman Balakrishnan, Aravindan Vijayaraghavan

Efficient Methods for Online Multiclass Logistic Regression

Naman Agarwal, Satyen Kale, Julian Zimmert

Algorithmic Learning Theory 2022: Preface

Sanjoy Dasgupta, Nika Haghtalab