Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/colt/colt2018.bht:"
@inproceedings{DBLP:conf/colt/0002KKNS18, author = {Prateek Jain and Sham M. Kakade and Rahul Kidambi and Praneeth Netrapalli and Aaron Sidford}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Accelerating Stochastic Gradient Descent for Least Squares Regression}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {545--604}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/jain18a.html}, timestamp = {Wed, 03 Apr 2019 18:17:23 +0200}, biburl = {https://dblp.org/rec/conf/colt/0002KKNS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/0003G18, author = {Yu Cheng and Rong Ge}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Non-Convex Matrix Completion Against a Semi-Random Adversary}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1362--1394}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/cheng18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/0003G18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Abbasi-YadkoriB18, author = {Yasin Abbasi{-}Yadkori and Peter L. Bartlett and Victor Gabillon and Alan Malek and Michal Valko}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Best of both worlds: Stochastic {\&} adversarial best-arm identification}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {918--949}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/abbasi-yadkori18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Abbasi-YadkoriB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AbernethyLLW18, author = {Jacob D. Abernethy and Kevin A. Lai and Kfir Y. Levy and Jun{-}Kun Wang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Faster Rates for Convex-Concave Games}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1595--1625}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/abernethy18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/AbernethyLLW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AgarwalH18, author = {Naman Agarwal and Elad Hazan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Lower Bounds for Higher-Order Convex Optimization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {774--792}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/agarwal18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/AgarwalH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AlabiIK18, author = {Daniel Alabi and Nicole Immorlica and Adam Kalai}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Unleashing Linear Optimizers for Group-Fair Learning and Optimization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {2043--2066}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/alabi18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/AlabiIK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AlaouiJ18, author = {Ahmed El Alaoui and Michael I. Jordan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Detection limits in the high-dimensional spiked rectangular model}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {410--438}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/el-alaoui18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/AlaouiJ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AltschulerT18, author = {Jason M. Altschuler and Kunal Talwar}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Online learning over a finite action set with limited switching}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1569--1573}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/altschuler18a.html}, timestamp = {Wed, 27 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/AltschulerT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AroraHK18, author = {Sanjeev Arora and Wei Hu and Pravesh K. Kothari}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {An Analysis of the t-SNE Algorithm for Data Visualization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1455--1462}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/arora18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/AroraHK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BarbierKMMZ18, author = {Jean Barbier and Florent Krzakala and Nicolas Macris and L{\'{e}}o Miolane and Lenka Zdeborov{\'{a}}}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Models}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {728--731}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/barbier18a.html}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/BarbierKMMZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BeameGY18, author = {Paul Beame and Shayan Oveis Gharan and Xin Yang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {843--856}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/beame18a.html}, timestamp = {Thu, 23 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BeameGY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Belkin18, author = {Mikhail Belkin}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Approximation beats concentration? An approximation view on inference with smooth radial kernels}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1348--1361}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/belkin18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Belkin18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Bernton18, author = {Espen Bernton}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Langevin Monte Carlo and {JKO} splitting}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1777--1798}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/bernton18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Bernton18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Bhandari0S18, author = {Jalaj Bhandari and Daniel Russo and Raghav Singal}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximation}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1691--1692}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/bhandari18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Bhandari0S18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BhattacharyyaGS18, author = {Arnab Bhattacharyya and Suprovat Ghoshal and Rishi Saket}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Hardness of Learning Noisy Halfspaces using Polynomial Thresholds}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {876--917}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/bhattacharyya18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BhattacharyyaGS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BhojanapalliB0N18, author = {Srinadh Bhojanapalli and Nicolas Boumal and Prateek Jain and Praneeth Netrapalli}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3243--3270}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/bhojanapalli18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BhojanapalliB0N18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BlumH18, author = {Avrim Blum and Lunjia Hu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Active Tolerant Testing}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {474--497}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/blum18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BlumH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Borsos0L18, author = {Zalan Borsos and Andreas Krause and Kfir Y. Levy}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Online Variance Reduction for Stochastic Optimization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {324--357}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/borsos18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Borsos0L18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BrennanBH18, author = {Matthew S. Brennan and Guy Bresler and Wasim Huleihel}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {48--166}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/brennan18a.html}, timestamp = {Tue, 17 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BrennanBH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BreslerN18, author = {Guy Bresler and Dheeraj Nagaraj}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Optimal Single Sample Tests for Structured versus Unstructured Network Data}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1657--1690}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/bresler18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BreslerN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BubeckR18, author = {S{\'{e}}bastien Bubeck and Philippe Rigollet}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Conference on Learning Theory 2018: Preface}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/bubeck18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BubeckR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/BusicM18, author = {Ana Busic and Sean P. Meyn}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Action-Constrained Markov Decision Processes With Kullback-Leibler Cost}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1431--1444}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/busic18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/BusicM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/CarpenterDSS18, author = {Timothy Carpenter and Ilias Diakonikolas and Anastasios Sidiropoulos and Alistair Stewart}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1234--1262}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/carpenter18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/CarpenterDSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/CasselMZ18, author = {Asaf B. Cassel and Shie Mannor and Assaf Zeevi}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {A General Approach to Multi-Armed Bandits Under Risk Criteria}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1295--1306}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/cassel18a.html}, timestamp = {Sun, 03 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/CasselMZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Cesa-BianchiGM18, author = {Nicol{\`{o}} Cesa{-}Bianchi and Claudio Gentile and Yishay Mansour}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Nonstochastic Bandits with Composite Anonymous Feedback}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {750--773}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/cesa-bianchi18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Cesa-BianchiGM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChenFK18, author = {Bangrui Chen and Peter I. Frazier and David Kempe}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Incentivizing Exploration by Heterogeneous Users}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {798--818}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/chen18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/ChenFK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChenGW18, author = {Niangjun Chen and Gautam Goel and Adam Wierman}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1574--1594}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/chen18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/ChenGW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChengCBJ18, author = {Xiang Cheng and Niladri S. Chatterji and Peter L. Bartlett and Michael I. Jordan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Underdamped Langevin {MCMC:} {A} non-asymptotic analysis}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {300--323}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/cheng18a.html}, timestamp = {Fri, 22 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/ChengCBJ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChernozhukovWZ18, author = {Victor Chernozhukov and Kaspar W{\"{u}}thrich and Yinchu Zhu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Exact and Robust Conformal Inference Methods for Predictive Machine Learning with Dependent Data}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {732--749}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/chernozhukov18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/ChernozhukovWZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/CutkoskyO18, author = {Ashok Cutkosky and Francesco Orabona}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Black-Box Reductions for Parameter-free Online Learning in Banach Spaces}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1493--1529}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/cutkosky18a.html}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/CutkoskyO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DaganS18, author = {Yuval Dagan and Ohad Shamir}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Detecting Correlations with Little Memory and Communication}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1145--1198}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/dagan18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DaganS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DalalTSM18, author = {Gal Dalal and Gugan Thoppe and Bal{\'{a}}zs Sz{\"{o}}r{\'{e}}nyi and Shie Mannor}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1199--1233}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/dalal18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DalalTSM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DaskalakisDG18, author = {Constantinos Daskalakis and Nishanth Dikkala and Nick Gravin}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Testing Symmetric Markov Chains From a Single Trajectory}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {385--409}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/daskalakis18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DaskalakisDG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Diakonikolas0S18, author = {Ilias Diakonikolas and Jerry Li and Ludwig Schmidt}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {819--842}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/diakonikolas18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Diakonikolas0S18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DuchiRY18, author = {John C. Duchi and Feng Ruan and Chulhee Yun}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Minimax Bounds on Stochastic Batched Convex Optimization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3065--3162}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/duchi18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DuchiRY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DudejaH18, author = {Rishabh Dudeja and Daniel Hsu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Learning Single-Index Models in Gaussian Space}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1887--1930}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/dudeja18a.html}, timestamp = {Mon, 08 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DudejaH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DurfeeLS18, author = {David Durfee and Kevin A. Lai and Saurabh Sawlani}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {{\textdollar}{\textbackslash}ell{\_}1{\textdollar} Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1626--1656}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/durfee18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DurfeeLS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DwivediCW018, author = {Raaz Dwivedi and Yuansi Chen and Martin J. Wainwright and Bin Yu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Log-concave sampling: Metropolis-Hastings algorithms are fast!}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {793--797}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/dwivedi18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DwivediCW018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/DworkF18, author = {Cynthia Dwork and Vitaly Feldman}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Privacy-preserving Prediction}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1693--1702}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/dwork18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/DworkF18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/FeffermanIKLN18, author = {Charles Fefferman and Sergei Ivanov and Yaroslav Kurylev and Matti Lassas and Hariharan Narayanan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Fitting a Putative Manifold to Noisy Data}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {688--720}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/fefferman18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/FeffermanIKLN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/FeiC18, author = {Yingjie Fei and Yudong Chen}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Hidden Integrality of {SDP} Relaxations for Sub-Gaussian Mixture Models}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1931--1965}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/fei18a.html}, timestamp = {Tue, 10 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/FeiC18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/FeldmanS18, author = {Vitaly Feldman and Thomas Steinke}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Calibrating Noise to Variance in Adaptive Data Analysis}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {535--544}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/feldman18a.html}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/FeldmanS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/FosterKLMS18, author = {Dylan J. Foster and Satyen Kale and Haipeng Luo and Mehryar Mohri and Karthik Sridharan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Logistic Regression: The Importance of Being Improper}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {167--208}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/foster18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/FosterKLMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/FosterRS18, author = {Dylan J. Foster and Alexander Rakhlin and Karthik Sridharan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Online Learning: Sufficient Statistics and the Burkholder Method}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3028--3064}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/foster18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/FosterRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/GolowichRS18, author = {Noah Golowich and Alexander Rakhlin and Ohad Shamir}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Size-Independent Sample Complexity of Neural Networks}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {297--299}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/golowich18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/GolowichRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/GouleakisTZ18, author = {Themis Gouleakis and Christos Tzamos and Manolis Zampetakis}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Certified Computation from Unreliable Datasets}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3271--3294}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/gouleakis18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/GouleakisTZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HanJW18, author = {Yanjun Han and Jiantao Jiao and Tsachy Weissman}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Local moment matching: {A} unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3189--3221}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/han18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HanJW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HanOW18, author = {Yanjun Han and Ayfer {\"{O}}zg{\"{u}}r and Tsachy Weissman}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3163--3188}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/han18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HanOW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HandV18, author = {Paul Hand and Vladislav Voroninski}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {970--978}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/hand18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HandV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HannekeKKT18, author = {Steve Hanneke and Adam Tauman Kalai and Gautam Kamath and Christos Tzamos}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Actively Avoiding Nonsense in Generative Models}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {209--227}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/hanneke18a.html}, timestamp = {Wed, 11 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HannekeKKT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HazanL18, author = {Elad Hazan and Roi Livni}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Open problem: Improper learning of mixtures of Gaussians}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3399--3402}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/hazan18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HazanL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Hinder18, author = {Oliver Hinder}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Cutting plane methods can be extended into nonconvex optimization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1451--1454}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/hinder18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Hinder18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HoevenEK18, author = {Dirk van der Hoeven and Tim van Erven and Wojciech Kotlowski}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {The Many Faces of Exponential Weights in Online Learning}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {2067--2092}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/hoeven18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HoevenEK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HoldenPP18, author = {Nina Holden and Robin Pemantle and Yuval Peres}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Subpolynomial trace reconstruction for random strings {\textbackslash}\{and arbitrary deletion probability}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1799--1840}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/holden18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HoldenPP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/IndykW18, author = {Piotr Indyk and Tal Wagner}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Approximate Nearest Neighbors in Limited Space}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {2012--2036}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/indyk18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/IndykW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/JainKM18, author = {Vishesh Jain and Frederic Koehler and Elchanan Mossel}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1326--1347}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/jain18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/JainKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/JainKM18a, author = {Vishesh Jain and Frederic Koehler and Elchanan Mossel}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {The Vertex Sample Complexity of Free Energy is Polynomial}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1395--1419}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/jain18c.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/JainKM18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/JiangA18, author = {Nan Jiang and Alekh Agarwal}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3395--3398}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/jiang18a.html}, timestamp = {Tue, 05 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/JiangA18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/JinNJ18, author = {Chi Jin and Praneeth Netrapalli and Michael I. Jordan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1042--1085}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/jin18a.html}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/JinNJ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Kasiviswanathan18, author = {Shiva Prasad Kasiviswanathan and Mark Rudelson}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Restricted Eigenvalue from Stable Rank with Applications to Sparse Linear Regression}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1011--1041}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/kasiviswanathan18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Kasiviswanathan18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/KirschnerK18, author = {Johannes Kirschner and Andreas Krause}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Information Directed Sampling and Bandits with Heteroscedastic Noise}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {358--384}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/kirschner18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/KirschnerK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/KlivansKM18, author = {Adam R. Klivans and Pravesh K. Kothari and Raghu Meka}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Efficient Algorithms for Outlier-Robust Regression}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1420--1430}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/klivans18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/KlivansKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/KlusowskiW18, author = {Jason M. Klusowski and Yihong Wu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Counting Motifs with Graph Sampling}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1966--2011}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/klusowski18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/KlusowskiW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Kolmogorov18, author = {Vladimir Kolmogorov}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {A Faster Approximation Algorithm for the Gibbs Partition Function}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {228--249}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/kolmogorov18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Kolmogorov18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/KpotufeM18, author = {Samory Kpotufe and Guillaume Martinet}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Marginal Singularity, and the Benefits of Labels in Covariate-Shift}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1882--1886}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/kpotufe18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/KpotufeM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LeeSV18, author = {Yin Tat Lee and Aaron Sidford and Santosh S. Vempala}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Efficient Convex Optimization with Membership Oracles}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1292--1294}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/lee18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/LeeSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LiL18, author = {Yuanzhi Li and Yingyu Liang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Learning Mixtures of Linear Regressions with Nearly Optimal Complexity}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1125--1144}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/li18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/LiL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LiMZ18, author = {Yuanzhi Li and Tengyu Ma and Hongyang Zhang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Algorithmic Regularization in Over-parameterized Matrix Sensing and Neural Networks with Quadratic Activations}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {2--47}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/li18a.html}, timestamp = {Sat, 30 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/LiMZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LocatelliC18, author = {Andrea Locatelli and Alexandra Carpentier}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Adaptivity to Smoothness in X-armed bandits}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1463--1492}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/locatelli18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/LocatelliC18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LuoWA018, author = {Haipeng Luo and Chen{-}Yu Wei and Alekh Agarwal and John Langford}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Efficient Contextual Bandits in Non-stationary Worlds}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1739--1776}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/luo18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/LuoWA018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LykourisST18, author = {Thodoris Lykouris and Karthik Sridharan and {\'{E}}va Tardos}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Small-loss bounds for online learning with partial information}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {979--986}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/lykouris18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/LykourisST18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MangoubiV18, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1086--1124}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/mangoubi18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/MangoubiV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MaoPW18, author = {Cheng Mao and Ashwin Pananjady and Martin J. Wainwright}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Breaking the {\textdollar}1/{\textbackslash}sqrtn{\textdollar} Barrier: Faster Rates for Permutation-based Models in Polynomial Time}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {2037--2042}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/mao18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/MaoPW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MaurerP18, author = {Andreas Maurer and Massimiliano Pontil}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Empirical bounds for functions with weak interactions}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {987--1010}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/maurer18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/MaurerP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MeisterV18, author = {Michela Meister and Gregory Valiant}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {A Data Prism: Semi-verified learning in the small-alpha regime}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1530--1546}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/meister18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/MeisterV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MondelliM18, author = {Marco Mondelli and Andrea Montanari}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Fundamental Limits of Weak Recovery with Applications to Phase Retrieval}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1445--1450}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/mondelli18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/MondelliM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Mou0Z018, author = {Wenlong Mou and Liwei Wang and Xiyu Zhai and Kai Zheng}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Generalization Bounds of {SGLD} for Non-convex Learning: Two Theoretical Viewpoints}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {605--638}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/mou18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Mou0Z018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/NachumSY18, author = {Ido Nachum and Jonathan Shafer and Amir Yehudayoff}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {A Direct Sum Result for the Information Complexity of Learning}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1547--1568}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/nachum18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/NachumSY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/NeuR18, author = {Gergely Neu and Lorenzo Rosasco}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Iterate Averaging as Regularization for Stochastic Gradient Descent}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {3222--3242}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/neu18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/NeuR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Pillaud-VivienR18, author = {Loucas Pillaud{-}Vivien and Alessandro Rudi and Francis R. Bach}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Exponential Convergence of Testing Error for Stochastic Gradient Methods}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {250--296}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/pillaud-vivien18a.html}, timestamp = {Mon, 09 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/Pillaud-VivienR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/RaghavanSVW18, author = {Manish Raghavan and Aleksandrs Slivkins and Jennifer Wortman Vaughan and Zhiwei Steven Wu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {The Externalities of Exploration and How Data Diversity Helps Exploitation}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1724--1738}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/raghavan18a.html}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/RaghavanSVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/RoughgardenW18, author = {Tim Roughgarden and Joshua R. Wang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1307--1325}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/roughgarden18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/RoughgardenW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Sharpnack18, author = {James Sharpnack}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Learning Patterns for Detection with Multiscale Scan Statistics}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {950--969}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/sharpnack18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Sharpnack18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/SimchowitzMTJR18, author = {Max Simchowitz and Horia Mania and Stephen Tu and Michael I. Jordan and Benjamin Recht}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Learning Without Mixing: Towards {A} Sharp Analysis of Linear System Identification}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {439--473}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/simchowitz18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/SimchowitzMTJR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/TanV18, author = {Yan Shuo Tan and Roman Vershynin}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {498--534}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/tan18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/TanV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/TripuraneniFBJ18, author = {Nilesh Tripuraneni and Nicolas Flammarion and Francis R. Bach and Michael I. Jordan}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Averaging Stochastic Gradient Descent on Riemannian Manifolds}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {650--687}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/tripuraneni18a.html}, timestamp = {Mon, 09 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/TripuraneniFBJ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/TsitsiklisXX18, author = {John N. Tsitsiklis and Kuang Xu and Zhi Xu}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Private Sequential Learning}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {721--727}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/tsitsiklis18a.html}, timestamp = {Wed, 27 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/TsitsiklisXX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/TzenLR18, author = {Belinda Tzen and Tengyuan Liang and Maxim Raginsky}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Local Optimality and Generalization Guarantees for the Langevin Algorithm via Empirical Metastability}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {857--875}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/tzen18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/TzenLR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Weed18, author = {Jonathan Weed}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {An explicit analysis of the entropic penalty in linear programming}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1841--1855}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/weed18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Weed18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/WeiL18, author = {Chen{-}Yu Wei and Haipeng Luo}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {More Adaptive Algorithms for Adversarial Bandits}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1263--1291}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/wei18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/WeiL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Wibisono18, author = {Andre Wibisono}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {2093--3027}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/wibisono18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Wibisono18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Yarotsky18, author = {Dmitry Yarotsky}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Optimal approximation of continuous functions by very deep ReLU networks}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {639--649}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/yarotsky18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Yarotsky18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Zhang18, author = {Chicheng Zhang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Efficient active learning of sparse halfspaces}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1856--1880}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/zhang18b.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/Zhang18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ZhangS18, author = {Hongyi Zhang and Suvrit Sra}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {An Estimate Sequence for Geodesically Convex Optimization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1703--1723}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/zhang18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/ZhangS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/colt/2018, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/2018.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.