default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/colt/colt2021.bht:"
download as .bib file
@inproceedings{DBLP:conf/colt/0001LP0V21,
author = {Christopher Jung and
Changhwa Lee and
Mallesh M. Pai and
Aaron Roth and
Rakesh Vohra},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Moment Multicalibration for Uncertainty Estimation},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2634--2678},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/jung21a.html},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/colt/0001LP0V21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/0001Z21,
author = {Pan Peng and
Jiapeng Zhang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Towards a Query-Optimal and Time-Efficient Algorithm for Clustering
with a Faulty Oracle},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3662--3680},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/peng21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/0001Z21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/0001ZZ21,
author = {Daniel Russo and
Assaf Zeevi and
Tianyi Zhang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning to Stop with Surprisingly Few Samples},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3887--3888},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/russo21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/0001ZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/0002CLP21,
author = {Marco Bressan and
Nicol{\`{o}} Cesa{-}Bianchi and
Silvio Lattanzi and
Andrea Paudice},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {775--803},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bressan21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/0002CLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/0005WCG021,
author = {Gen Li and
Yuting Wei and
Yuejie Chi and
Yuantao Gu and
Yuxin Chen},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Softmax Policy Gradient Methods Can Take Exponential Time to Converge},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3107--3110},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/li21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/0005WCG021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AbbeCGP21,
author = {Emmanuel Abbe and
Elisabetta Cornacchia and
Yuzhou Gu and
Yury Polyanskiy},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Stochastic block model entropy and broadcasting on trees with survey},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1--25},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/abbe21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AbbeCGP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AgarwalABLU21,
author = {Sushant Agarwal and
Nivasini Ananthakrishnan and
Shai Ben{-}David and
Tosca Lechner and
Ruth Urner},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Open Problem: Are all VC-classes {CPAC} learnable?},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4636--4641},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/open-problem-agarwal21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AgarwalABLU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AgrawalJK21,
author = {Shubhada Agrawal and
Sandeep Juneja and
Wouter M. Koolen},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Regret Minimization in Heavy-Tailed Bandits},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {26--62},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/agrawal21a.html},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AgrawalJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AmirKL21,
author = {Idan Amir and
Tomer Koren and
Roi Livni},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {{SGD} Generalizes Better Than {GD} (And Regularization Doesn't Help)},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {63--92},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/amir21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AmirKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AnariCSS21,
author = {Nima Anari and
Moses Charikar and
Kirankumar Shiragur and
Aaron Sidford},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications
for Profile Maximum Likelihood},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {93--158},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/anari21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AnariCSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AndradeFP21,
author = {Gabriel P. Andrade and
Rafael M. Frongillo and
Georgios Piliouras},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning in Matrix Games can be Arbitrarily Complex},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {159--185},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/andrade21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AndradeFP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AshlagiGK21,
author = {Yair Ashlagi and
Lee{-}Ad Gottlieb and
Aryeh Kontorovich},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Functions with average smoothness: structure, algorithms, and learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {186--236},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/ashlagi21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AshlagiGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AwasthiC0V21,
author = {Pranjal Awasthi and
Vaggos Chatziafratis and
Xue Chen and
Aravindan Vijayaraghavan},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Adversarially Robust Low Dimensional Representations},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {237--325},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/awasthi21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AwasthiC0V21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AzizianIMM21,
author = {Wa{\"{\i}}ss Azizian and
Franck Iutzeler and
J{\'{e}}r{\^{o}}me Malick and
Panayotis Mertikopoulos},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Last-Iterate Convergence Rate of Optimistic Mirror Descent in
Stochastic Variational Inequalities},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {326--358},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/azizian21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/AzizianIMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BabyW21,
author = {Dheeraj Baby and
Yu{-}Xiang Wang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Optimal Dynamic Regret in Exp-Concave Online Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {359--409},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/baby21a.html},
timestamp = {Tue, 28 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BabyW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BandeiraBKMW21,
author = {Afonso S. Bandeira and
Jess Banks and
Dmitriy Kunisky and
Cristopher Moore and
Alexander S. Wein},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Spectral Planting and the Hardness of Refuting Cuts, Colorability,
and Communities in Random Graphs},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {410--473},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bandeira21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BandeiraBKMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BassilyGN21,
author = {Raef Bassily and
Crist{\'{o}}bal Guzm{\'{a}}n and
Anupama Nandi},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Non-Euclidean Differentially Private Stochastic Convex Optimization},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {474--499},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bassily21a.html},
timestamp = {Wed, 20 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BassilyGN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BennettDSV21,
author = {Huck Bennett and
Anindya De and
Rocco A. Servedio and
Emmanouil{-}Vasileios Vlatakis{-}Gkaragkounis},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Reconstructing weighted voting schemes from partial information about
their power indices},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {500--565},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bennett21a.html},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BennettDSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BergOS21,
author = {Tomer Berg and
Or Ordentlich and
Ofer Shayevitz},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Deterministic Finite-Memory Bias Estimation},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {566--585},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/berg21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BergOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BesbesFL21,
author = {Omar Besbes and
Yuri Fonseca and
Ilan Lobel},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Online Learning from Optimal Actions},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {586},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/besbes21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BesbesFL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BlockDR21,
author = {Adam Block and
Yuval Dagan and
Alexander Rakhlin},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Majorizing Measures, Sequential Complexities, and Online Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {587--590},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/block21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BlockDR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BlumHQS21,
author = {Avrim Blum and
Steve Hanneke and
Jian Qian and
Han Shao},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Robust learning under clean-label attack},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {591--634},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/blum21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BlumHQS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BodinM21,
author = {Antoine Bodin and
Nicolas Macris},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Rank-one matrix estimation: analytic time evolution of gradient descent
dynamics},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {635--678},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bodin21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BodinM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BranzeiP21,
author = {Simina Br{\^{a}}nzei and
Yuval Peres},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Multiplayer Bandit Learning, from Competition to Cooperation},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {679--723},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/branzei21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BranzeiP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BravermanK0S21,
author = {Vladimir Braverman and
Robert Krauthgamer and
Aditya Krishnan and
Shay Sapir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Near-Optimal Entrywise Sampling of Numerically Sparse Matrices},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {759--773},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/braverman21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BravermanK0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BravermanKMS21,
author = {Mark Braverman and
Gillat Kol and
Shay Moran and
Raghuvansh R. Saxena},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Near Optimal Distributed Learning of Halfspaces with Two Parties},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {724--758},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/braverman21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BravermanKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BrennanBH0S21,
author = {Matthew S. Brennan and
Guy Bresler and
Samuel B. Hopkins and
Jerry Li and
Tselil Schramm},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {774},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/brennan21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BrennanBH0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BubeckBS21,
author = {S{\'{e}}bastien Bubeck and
Thomas Budzinski and
Mark Sellke},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal
Regret With Neither Communication Nor Collisions},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {821--822},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bubeck21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BubeckBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BubeckLN21,
author = {S{\'{e}}bastien Bubeck and
Yuanzhi Li and
Dheeraj M. Nagaraj},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {A Law of Robustness for Two-Layers Neural Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {804--820},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/bubeck21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BubeckLN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CabannesBR21,
author = {Vivien A. Cabannes and
Francis R. Bach and
Alessandro Rudi},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Fast Rates for Structured Prediction},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {823--865},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/cabannes21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/CabannesBR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CarmonJJS21,
author = {Yair Carmon and
Arun Jambulapati and
Yujia Jin and
Aaron Sidford},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Thinking Inside the Ball: Near-Optimal Minimization of the Maximal
Loss},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {866--882},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/carmon21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/CarmonJJS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CasgrainK21,
author = {Philippe Casgrain and
Anastasis Kratsios},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Optimizing Optimizers: Regret-optimal gradient descent algorithms},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {883--926},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/casgrain21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/CasgrainK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChatterjiLB21,
author = {Niladri S. Chatterji and
Philip M. Long and
Peter L. Bartlett},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {When does gradient descent with logistic loss interpolate using deep
networks with smoothed ReLU activations?},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {927--1027},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chatterji21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChatterjiLB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChenD21,
author = {Xue Chen and
Michal Derezinski},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Query complexity of least absolute deviation regression via robust
uniform convergence},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1144--1179},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chen21d.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChenD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChenH21,
author = {Xinyi Chen and
Elad Hazan},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Black-Box Control for Linear Dynamical Systems},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1114--1143},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chen21c.html},
timestamp = {Mon, 07 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChenH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChenJLW21,
author = {Xi Chen and
Rajesh Jayaram and
Amit Levi and
Erik Waingarten},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning and testing junta distributions with sub cube conditioning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1060--1113},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chen21b.html},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChenJLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChenKO21,
author = {Wei{-}Ning Chen and
Peter Kairouz and
Ayfer {\"{O}}zg{\"{u}}r},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Breaking The Dimension Dependence in Sparse Distribution Estimation
under Communication Constraints},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1028--1059},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chen21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChenKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChenLW21,
author = {Liyu Chen and
Haipeng Luo and
Chen{-}Yu Wei},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Minimax Regret for Stochastic Shortest Path with Adversarial Costs
and Known Transition},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1180--1215},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chen21e.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChenLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChenLW21a,
author = {Liyu Chen and
Haipeng Luo and
Chen{-}Yu Wei},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Impossible Tuning Made Possible: {A} New Expert Algorithm and Its
Applications},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1216--1259},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chen21f.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChenLW21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChewiLACGR21,
author = {Sinho Chewi and
Chen Lu and
Kwangjun Ahn and
Xiang Cheng and
Thibaut Le Gouic and
Philippe Rigollet},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1260--1300},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/chewi21a.html},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/ChewiLACGR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CohenKKM21,
author = {Alon Cohen and
Haim Kaplan and
Tomer Koren and
Yishay Mansour},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Online Markov Decision Processes with Aggregate Bandit Feedback},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1301--1329},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/cohen21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/CohenKKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CossonS21,
author = {Romain Cosson and
Devavrat Shah},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Quantifying Variational Approximation for Log-Partition Function},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1330--1357},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/cosson21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/CossonS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DanielyV21,
author = {Amit Daniely and
Gal Vardi},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {From Local Pseudorandom Generators to Hardness of Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1358--1394},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/daniely21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DanielyV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DaskalakisKTZ21,
author = {Constantinos Daskalakis and
Vasilis Kontonis and
Christos Tzamos and
Emmanouil Zampetakis},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {A Statistical Taylor Theorem and Extrapolation of Truncated Densities},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1395--1398},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/daskalakis21a.html},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DaskalakisKTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DeOS21,
author = {Anindya De and
Ryan O'Donnell and
Rocco A. Servedio},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning sparse mixtures of permutations from noisy information},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1429--1466},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/de21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DeOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DeS21,
author = {Anindya De and
Rocco A. Servedio},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Weak learning convex sets under normal distributions},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1399--1428},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/de21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DeS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DerezinskiLDM21,
author = {Michal Derezinski and
Zhenyu Liao and
Edgar Dobriban and
Michael W. Mahoney},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Sparse sketches with small inversion bias},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1467--1510},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/derezinski21a.html},
timestamp = {Wed, 27 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DerezinskiLDM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DiakonikolasIKL21,
author = {Ilias Diakonikolas and
Russell Impagliazzo and
Daniel M. Kane and
Rex Lei and
Jessica Sorrell and
Christos Tzamos},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Boosting in the Presence of Massart Noise},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1585--1644},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/diakonikolas21d.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DiakonikolasIKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DiakonikolasK21,
author = {Ilias Diakonikolas and
Daniel M. Kane},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Sample Complexity of Robust Covariance Testing},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1511--1521},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/diakonikolas21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DiakonikolasK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DiakonikolasKKT21,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Vasilis Kontonis and
Christos Tzamos and
Nikos Zarifis},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Agnostic Proper Learning of Halfspaces under Gaussian Marginals},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1522--1551},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/diakonikolas21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DiakonikolasKKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DiakonikolasKPZ21,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Thanasis Pittas and
Nikos Zarifis},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Optimality of Polynomial Regression for Agnostic Learning under
Gaussian Marginals in the {SQ} Model},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1552--1584},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/diakonikolas21c.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DiakonikolasKPZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DiakonikolasKSS21,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Alistair Stewart and
Yuxin Sun},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Outlier-Robust Learning of Ising Models Under Dobrushin's Condition},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1645--1682},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/diakonikolas21e.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DiakonikolasKSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DingLLW21,
author = {Zhiyan Ding and
Qin Li and
Jianfeng Lu and
Stephen J. Wright},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Random Coordinate Langevin Monte Carlo},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1683--1710},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/ding21a.html},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/DingLLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DurmusMNSW21,
author = {Alain Durmus and
Eric Moulines and
Alexey Naumov and
Sergey Samsonov and
Hoi{-}To Wai},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On the Stability of Random Matrix Product with Markovian Noise: Application
to Linear Stochastic Approximation and {TD} Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1711--1752},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/durmus21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DurmusMNSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DwivediM21,
author = {Raaz Dwivedi and
Lester Mackey},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Kernel Thinning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1753},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/dwivedi21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/DwivediM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/EldanMS21,
author = {Ronen Eldan and
Dan Mikulincer and
Tselil Schramm},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Non-asymptotic approximations of neural networks by Gaussian processes},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1754--1775},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/eldan21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/EldanMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ErdogduH21,
author = {Murat A. Erdogdu and
Rasa Hosseinzadeh},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On the Convergence of Langevin Monte Carlo: The Interplay between
Tail Growth and Smoothness},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1776--1822},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/erdogdu21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ErdogduH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ErvenSKK21,
author = {Tim van Erven and
Sarah Sachs and
Wouter M. Koolen and
Wojciech Kotlowski},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Robust Online Convex Optimization in the Presence of Outliers},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4174--4194},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/vanerven21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ErvenSKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/EsfandiariKM21,
author = {Hossein Esfandiari and
Amin Karbasi and
Vahab S. Mirrokni},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Adaptivity in Adaptive Submodularity},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1823--1846},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/esfandiari21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/EsfandiariKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/EvenM21,
author = {Mathieu Even and
Laurent Massouli{\'{e}}},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Concentration of Non-Isotropic Random Tensors with Applications to
Learning and Empirical Risk Minimization},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1847--1886},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/even21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/EvenM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FangLYZ21,
author = {Cong Fang and
Jason D. Lee and
Pengkun Yang and
Tong Zhang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Modeling from Features: a Mean-field Framework for Over-parameterized
Deep Neural Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1887--1936},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/fang21a.html},
timestamp = {Mon, 06 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/FangLYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FederP21,
author = {Meir Feder and
Yury Polyanskiy},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Sequential prediction under log-loss and misspecification},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1937--1964},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/feder21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/FederP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FontaineBD21,
author = {Xavier Fontaine and
Valentin De Bortoli and
Alain Durmus},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Convergence rates and approximation results for {SGD} and its continuous-time
counterpart},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {1965--2058},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/fontaine21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/FontaineBD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FosterRSX21,
author = {Dylan J. Foster and
Alexander Rakhlin and
David Simchi{-}Levi and
Yunzong Xu},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Instance-Dependent Complexity of Contextual Bandits and Reinforcement
Learning: {A} Disagreement-Based Perspective},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2059},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/foster21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/FosterRSX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FotakisKKT21,
author = {Dimitris Fotakis and
Alkis Kalavasis and
Vasilis Kontonis and
Christos Tzamos},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Efficient Algorithms for Learning from Coarse Labels},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2060--2079},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/fotakis21a.html},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/FotakisKKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GanassaliML21,
author = {Luca Ganassali and
Laurent Massouli{\'{e}} and
Marc Lelarge},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Impossibility of Partial Recovery in the Graph Alignment Problem},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2080--2102},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/ganassali21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/GanassaliML21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GarberW21,
author = {Dan Garber and
Noam Wolf},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Frank-Wolfe with a Nearest Extreme Point Oracle},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2103--2132},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/garber21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/GarberW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Ghazi0M21,
author = {Badih Ghazi and
Ravi Kumar and
Pasin Manurangsi},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On Avoiding the Union Bound When Answering Multiple Differentially
Private Queries},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2133--2146},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/ghazi21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Ghazi0M21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GiannouVM21,
author = {Angeliki Giannou and
Emmanouil{-}Vasileios Vlatakis{-}Gkaragkounis and
Panayotis Mertikopoulos},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Survival of the strictest: Stable and unstable equilibria under regularized
learning with partial information},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2147--2148},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/giannou21a.html},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/GiannouVM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Golowich21,
author = {Noah Golowich},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Differentially Private Nonparametric Regression Under a Growth Condition},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2149--2192},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/golowich21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Golowich21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GordonMRS21,
author = {Spencer Gordon and
Bijan H. Mazaheri and
Yuval Rabani and
Leonard J. Schulman},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Source Identification for Mixtures of Product Distributions},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2193--2216},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/gordon21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/GordonMRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Grunwald0Z21,
author = {Peter Gr{\"{u}}nwald and
Thomas Steinke and
Lydia Zakynthinou},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate
bounds that handle general {VC} classes},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2217--2247},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/grunwald21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Grunwald0Z21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Guo0T021,
author = {Chenghao Guo and
Zhiyi Huang and
Zhihao Gavin Tang and
Xinzhi Zhang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Generalizing Complex Hypotheses on Product Distributions: Auctions,
Prophet Inequalities, and Pandora's Problem},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2248--2288},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/guo21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Guo0T021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Hanneke21,
author = {Steve Hanneke},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Open Problem: Is There an Online Learning Algorithm That Learns Whenever
Online Learning Is Possible?},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4642--4646},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/open-problem-hanneke21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Hanneke21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HannekeLM21,
author = {Steve Hanneke and
Roi Livni and
Shay Moran},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Online Learning with Simple Predictors and a Combinatorial Characterization
of Minimax in 0/1 Games},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2289--2314},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/hanneke21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HannekeLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HaoChenWL021,
author = {Jeff Z. HaoChen and
Colin Wei and
Jason D. Lee and
Tengyu Ma},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Shape Matters: Understanding the Implicit Bias of the Noise Covariance},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2315--2357},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/haochen21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HaoChenWL021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HopkinsKLM21,
author = {Max Hopkins and
Daniel Kane and
Shachar Lovett and
Michal Moshkovitz},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Bounded Memory Active Learning through Enriched Queries},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2358--2387},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/hopkins21a.html},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HopkinsKLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HsiehAM21,
author = {Yu{-}Guan Hsieh and
Kimon Antonakopoulos and
Panayotis Mertikopoulos},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence
to Nash Equilibrium},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2388--2422},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/hsieh21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HsiehAM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HsuSSV21,
author = {Daniel Hsu and
Clayton Sanford and
Rocco A. Servedio and
Emmanouil V. Vlatakis{-}Gkaragkounis},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On the Approximation Power of Two-Layer Networks of Random ReLUs},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2423--2461},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/hsu21a.html},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HsuSSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HuKU21,
author = {Yichun Hu and
Nathan Kallus and
Masatoshi Uehara},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Fast Rates for the Regret of Offline Reinforcement Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2462},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/hu21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HuKU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HuangNW21,
author = {De Huang and
Jonathan Niles{-}Weed and
Rachel A. Ward},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond
rank-one updates},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2463--2498},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/huang21a.html},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/HuangNW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/IliopoulosZ21,
author = {Fotis Iliopoulos and
Ilias Zadik},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Group testing and local search: is there a computational-statistical
gap?},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2499--2551},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/iliopoulos21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/IliopoulosZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Ito21,
author = {Shinji Ito},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent
Regret Bounds},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2552--2583},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/ito21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Ito21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Jin0XG21,
author = {Tianyuan Jin and
Pan Xu and
Xiaokui Xiao and
Quanquan Gu},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Double Explore-then-Commit: Asymptotic Optimality and Beyond},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2584--2633},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/jin21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Jin0XG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KachamW21,
author = {Praneeth Kacham and
David P. Woodruff},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Reduced-Rank Regression with Operator Norm Error},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2679--2716},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kacham21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KachamW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KairouzDRT21,
author = {Peter Kairouz and
M{\'{o}}nica Ribero Diaz and
Keith Rush and
Abhradeep Thakurta},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {(Nearly) Dimension Independent Private {ERM} with AdaGrad Ratesvia
Publicly Estimated Subspaces},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2717--2746},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kairouz21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KairouzDRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KaplanMS21,
author = {Haim Kaplan and
Yishay Mansour and
Uri Stemmer},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Sparse Vector Technique, Revisited},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2747--2776},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kaplan21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KaplanMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KirschnerLVS21,
author = {Johannes Kirschner and
Tor Lattimore and
Claire Vernade and
Csaba Szepesv{\'{a}}ri},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Asymptotically Optimal Information-Directed Sampling},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2777--2821},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kirschner21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KirschnerLVS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Kunisky21,
author = {Dmitriy Kunisky},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Hypothesis testing with low-degree polynomials in the Morris class
of exponential families},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2822--2848},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kunisky21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Kunisky21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KurR21,
author = {Gil Kur and
Alexander Rakhlin},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On the Minimal Error of Empirical Risk Minimization},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2849--2852},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kur21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KurR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KuzborskijS21,
author = {Ilja Kuzborskij and
Csaba Szepesv{\'{a}}ri},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Nonparametric Regression with Shallow Overparameterized Neural Networks
Trained by {GD} with Early Stopping},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2853--2890},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/kuzborskij21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KuzborskijS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Lamperski21,
author = {Andrew G. Lamperski},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Projected Stochastic Gradient Langevin Algorithms for Constrained
Sampling and Non-Convex Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2891--2937},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/lamperski21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Lamperski21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Lattimore021,
author = {Tor Lattimore and
Andr{\'{a}}s Gy{\"{o}}rgy},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Improved Regret for Zeroth-Order Stochastic Convex Bandits},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2938--2964},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/lattimore21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Lattimore021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Lattimore021a,
author = {Tor Lattimore and
Andr{\'{a}}s Gy{\"{o}}rgy},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Mirror Descent and the Information Ratio},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2965--2992},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/lattimore21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Lattimore021a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LeeST21,
author = {Yin Tat Lee and
Ruoqi Shen and
Kevin Tian},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Structured Logconcave Sampling with a Restricted Gaussian Oracle},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {2993--3050},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/lee21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/LeeST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LiJ21,
author = {Chris Junchi Li and
Michael I. Jordan},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Stochastic Approximation for Online Tensorial Independent Component
Analysis},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3051--3106},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/li21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/LiJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LiW021,
author = {Yi Li and
David P. Woodruff and
Taisuke Yasuda},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings
and Independence Testing},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3111--3195},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/li21c.html},
timestamp = {Wed, 15 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/LiW021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Lu0W21,
author = {Yulong Lu and
Jianfeng Lu and
Min Wang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {A Priori Generalization Analysis of the Deep Ritz Method for Solving
High Dimensional Elliptic Partial Differential Equations},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3196--3241},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/lu21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Lu0W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LykourisSSS21,
author = {Thodoris Lykouris and
Max Simchowitz and
Alex Slivkins and
Wen Sun},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Corruption-robust exploration in episodic reinforcement learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3242--3245},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/lykouris21a.html},
timestamp = {Tue, 13 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/LykourisSSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MakarychevV21,
author = {Yury Makarychev and
Ali Vakilian},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Approximation Algorithms for Socially Fair Clustering},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3246--3264},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/makarychev21a.html},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MakarychevV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MalachYSS21,
author = {Eran Malach and
Gilad Yehudai and
Shai Shalev{-}Shwartz and
Ohad Shamir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Connection Between Approximation, Depth Separation and Learnability
in Neural Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3265--3295},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/malach21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MalachYSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MaoRT21,
author = {Cheng Mao and
Mark Rudelson and
Konstantin E. Tikhomirov},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Random Graph Matching with Improved Noise Robustness},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3296--3329},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/mao21a.html},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/MaoRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MasoudianS21,
author = {Saeed Masoudian and
Yevgeny Seldin},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained
Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3330--3350},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/masoudian21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MasoudianS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MeiMM21,
author = {Song Mei and
Theodor Misiakiewicz and
Andrea Montanari},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning with invariances in random features and kernel models},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3351--3418},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/mei21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MeiMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MoitraMS21,
author = {Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning to Sample from Censored Markov Random Fields},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3419--3451},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/moitra21a.html},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MoitraMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MontasserHS21,
author = {Omar Montasser and
Steve Hanneke and
Nathan Srebro},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Adversarially Robust Learning with Unknown Perturbation Sets},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3452--3482},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/montasser21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MontasserHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Nanashima21,
author = {Mikito Nanashima},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {A Theory of Heuristic Learnability},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3483--3525},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/nanashima21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Nanashima21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Neu21,
author = {Gergely Neu},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Information-Theoretic Generalization Bounds for Stochastic Gradient
Descent},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3526--3545},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/neu21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Neu21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Niles-WeedZ21,
author = {Jonathan Niles{-}Weed and
Ilias Zadik},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {It was "all" for "nothing": sharp phase transitions for noiseless
discrete channels},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3546--3547},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/nilesweed21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Niles-WeedZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PaquetteLPP21,
author = {Courtney Paquette and
Kiwon Lee and
Fabian Pedregosa and
Elliot Paquette},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {{SGD} in the Large: Average-case Analysis, Asymptotics, and Stepsize
Criticality},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3548--3626},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/paquette21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/PaquetteLPP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ParkLYS21,
author = {Sejun Park and
Jaeho Lee and
Chulhee Yun and
Jinwoo Shin},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Provable Memorization via Deep Neural Networks using Sub-linear Parameters},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3627--3661},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/park21a.html},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ParkLYS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PerdomoSAB21,
author = {Juan C. Perdomo and
Max Simchowitz and
Alekh Agarwal and
Peter L. Bartlett},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Towards a Dimension-Free Understanding of Adaptive Linear Control},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3681--3770},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/perdomo21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/PerdomoSAB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Plevrakis21,
author = {Orestis Plevrakis},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning from Censored and Dependent Data: The case of Linear Dynamics},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3771--3787},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/plevrakis21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Plevrakis21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PodimataS21,
author = {Chara Podimata and
Alex Slivkins},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Adaptive Discretization for Adversarial Lipschitz Bandits},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3788--3805},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/podimata21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/PodimataS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PuchkinZ21,
author = {Nikita Puchkin and
Nikita Zhivotovskiy},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Exponential savings in agnostic active learning through abstention},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3806--3832},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/puchkin21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/PuchkinZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/QiaoV21,
author = {Mingda Qiao and
Gregory Valiant},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Exponential Weights Algorithms for Selective Learning},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3833--3858},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/qiao21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/QiaoV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/RashtchianW0Z21,
author = {Cyrus Rashtchian and
David P. Woodruff and
Peng Ye and
Hanlin Zhu},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Average-Case Communication Complexity of Statistical Problems},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3859--3886},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/rashtchian21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/RashtchianW0Z21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/SafranYS21,
author = {Itay Safran and
Gilad Yehudai and
Ohad Shamir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Effects of Mild Over-parameterization on the Optimization Landscape
of Shallow ReLU Neural Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3889--3934},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/safran21a.html},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/SafranYS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/SebbouhGD21,
author = {Othmane Sebbouh and
Robert M. Gower and
Aaron Defazio},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Almost sure convergence rates for Stochastic Gradient Descent and
Stochastic Heavy Ball},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3935--3971},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/sebbouh21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/SebbouhGD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ShermanK21,
author = {Uri Sherman and
Tomer Koren},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Lazy {OCO:} Online Convex Optimization on a Switching Budget},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3972--3988},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/sherman21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ShermanK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Skorski21,
author = {Maciej Skorski},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Johnson-Lindenstrauss Transforms with Best Confidence},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3989--4007},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/skorski21a.html},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Skorski21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/SuggalaRN21,
author = {Arun Sai Suggala and
Pradeep Ravikumar and
Praneeth Netrapalli},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Efficient Bandit Convex Optimization: Beyond Linear Losses},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4008--4067},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/suggala21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/SuggalaRN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/TangY21,
author = {Rong Tang and
Yun Yang},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On Empirical Bayes Variational Autoencoder: An Excess Risk Bound},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4068--4125},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/tang21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/TangY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/UllahM0RA21,
author = {Enayat Ullah and
Tung Mai and
Anup Rao and
Ryan A. Rossi and
Raman Arora},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Machine Unlearning via Algorithmic Stability},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4126--4142},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/ullah21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/UllahM0RA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/VacherMRBV21,
author = {Adrien Vacher and
Boris Muzellec and
Alessandro Rudi and
Francis R. Bach and
Fran{\c{c}}ois{-}Xavier Vialard},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {A Dimension-free Computational Upper-bound for Smooth Optimal Transport
Estimation},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4143--4173},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/vacher21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/VacherMRBV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/VakiliSJ21,
author = {Sattar Vakili and
Jonathan Scarlett and
Tara Javidi},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Open Problem: Tight Online Confidence Intervals for {RKHS} Elements},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4647--4652},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/open-problem-vakili21a.html},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/VakiliSJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Vardi0PS21,
author = {Gal Vardi and
Daniel Reichman and
Toniann Pitassi and
Ohad Shamir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Size and Depth Separation in Approximating Benign Functions with Neural
Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4195--4223},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/vardi21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Vardi0PS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/VardiS21,
author = {Gal Vardi and
Ohad Shamir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Implicit Regularization in ReLU Networks with the Square Loss},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4224--4258},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/vardi21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/VardiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/WeiL21,
author = {Chen{-}Yu Wei and
Haipeng Luo},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Non-stationary Reinforcement Learning without Prior Knowledge: an
Optimal Black-box Approach},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4300--4354},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/wei21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/WeiL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/WeiLZL21,
author = {Chen{-}Yu Wei and
Chung{-}Wei Lee and
Mengxiao Zhang and
Haipeng Luo},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent
in Infinite-horizon Competitive Markov Games},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4259--4299},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/wei21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/WeiLZL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/WeiszAJAJS21,
author = {Gell{\'{e}}rt Weisz and
Philip Amortila and
Barnab{\'{a}}s Janzer and
Yasin Abbasi{-}Yadkori and
Nan Jiang and
Csaba Szepesv{\'{a}}ri},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {On Query-efficient Planning in MDPs under Linear Realizability of
the Optimal State-value Function},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4355--4385},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/weisz21a.html},
timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/WeiszAJAJS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/WoodworthBSS21,
author = {Blake E. Woodworth and
Brian Bullins and
Ohad Shamir and
Nathan Srebro},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {The Min-Max Complexity of Distributed Stochastic Convex Optimization
with Intermittent Communication},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4386--4437},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/woodworth21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/WoodworthBSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Xu0D21,
author = {Haike Xu and
Tengyu Ma and
Simon S. Du},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step
Bootstrap},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4438--4472},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/xu21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/Xu0D21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/YunSJ21,
author = {Chulhee Yun and
Suvrit Sra and
Ali Jadbabaie},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Open Problem: Can Single-Shuffle {SGD} be Better than Reshuffling
{SGD} and GD?},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4653--4658},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/open-problem-yun21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/YunSJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ZanetteCA21,
author = {Andrea Zanette and
Ching{-}An Cheng and
Alekh Agarwal},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Cautiously Optimistic Policy Optimization and Exploration with Linear
Function Approximation},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4473--4525},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/zanette21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ZanetteCA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ZhangJD21,
author = {Zihan Zhang and
Xiangyang Ji and
Simon S. Du},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Is Reinforcement Learning More Difficult Than Bandits? {A} Near-optimal
Algorithm Escaping the Curse of Horizon},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4528--4531},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/zhang21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ZhangJD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ZhangL21,
author = {Chicheng Zhang and
Yinan Li},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Improved Algorithms for Efficient Active Learning Halfspaces with
Massart and Tsybakov Noise},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4526--4527},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/zhang21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ZhangL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Zhou0J21,
author = {Mo Zhou and
Rong Ge and
Chi Jin},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {A Local Convergence Theory for Mildly Over-Parameterized Two-Layer
Neural Network},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4577--4632},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/zhou21b.html},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/Zhou0J21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ZhouGS21,
author = {Dongruo Zhou and
Quanquan Gu and
Csaba Szepesv{\'{a}}ri},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov
Decision Processes},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4532--4576},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/zhou21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ZhouGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ZouWBGK21,
author = {Difan Zou and
Jingfeng Wu and
Vladimir Braverman and
Quanquan Gu and
Sham M. Kakade},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Benign Overfitting of Constant-Stepsize {SGD} for Linear Regression},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4633--4635},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/zou21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ZouWBGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/2021,
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
publisher = {{PMLR}},
year = {2021},
url = {https://proceedings.mlr.press/v134/},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-10-15 05:47 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
