Jekyll2023-02-08T10:42:20+00:00https://proceedings.mlr.press/v65/feed.xmlProceedings of Machine Learning ResearchProceedings of the 2017 Conference on Learning Theory on 07-10 July 2017
Published as Volume 65 by the Proceedings of Machine Learning Research on 18 June 2017.
Volume Edited by:
Satyen Kale
Ohad Shamir
Series Editors:
Neil D. Lawrence
Mark Reid
PMLROpen Problem: First-Order Regret Bounds for Contextual Bandits2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/agarwal17a[{"given"=>"Alekh", "family"=>"Agarwal"}, {"given"=>"Akshay", "family"=>"Krishnamurthy"}, {"given"=>"John", "family"=>"Langford"}, {"given"=>"Haipeng", "family"=>"Luo"}, {"given"=>"Schapire Robert", "family"=>"E."}]Corralling a Band of Bandit Algorithms2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/agarwal17b[{"given"=>"Alekh", "family"=>"Agarwal"}, {"given"=>"Haipeng", "family"=>"Luo"}, {"given"=>"Behnam", "family"=>"Neyshabur"}, {"given"=>"Robert E.", "family"=>"Schapire"}]Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/agarwal17c[{"given"=>"Arpit", "family"=>"Agarwal"}, {"given"=>"Shivani", "family"=>"Agarwal"}, {"given"=>"Sepehr", "family"=>"Assadi"}, {"given"=>"Sanjeev", "family"=>"Khanna"}]Thompson Sampling for the MNL-Bandit2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/agrawal17a[{"given"=>"Shipra", "family"=>"Agrawal"}, {"given"=>"Vashist", "family"=>"Avadhanula"}, {"given"=>"Vineet", "family"=>"Goyal"}, {"given"=>"Assaf", "family"=>"Zeevi"}]Homotopy Analysis for Tensor PCA2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/anandkumar17a[{"given"=>"Anima", "family"=>"Anandkumar"}, {"given"=>"Yuan", "family"=>"Deng"}, {"given"=>"Rong", "family"=>"Ge"}, {"given"=>"Hossein", "family"=>"Mobahi"}]Correspondence retrieval2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/andoni17a[{"given"=>"Alexandr", "family"=>"Andoni"}, {"given"=>"Daniel", "family"=>"Hsu"}, {"given"=>"Kevin", "family"=>"Shi"}, {"given"=>"Xiaorui", "family"=>"Sun"}]Efficient PAC Learning from the Crowd2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/awasthi17a[{"given"=>"Pranjal", "family"=>"Awasthi"}, {"given"=>"Avrim", "family"=>"Blum"}, {"given"=>"Nika", "family"=>"Haghtalab"}, {"given"=>"Yishay", "family"=>"Mansour"}]The Price of Selection in Differential Privacy2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/bafna17a[{"given"=>"Mitali", "family"=>"Bafna"}, {"given"=>"Jonathan", "family"=>"Ullman"}]Computationally Efficient Robust Sparse Estimation in High Dimensions2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/balakrishnan17a[{"given"=>"Sivaraman", "family"=>"Balakrishnan"}, {"given"=>"Simon S.", "family"=>"Du"}, {"given"=>"Jerry", "family"=>"Li"}, {"given"=>"Aarti", "family"=>"Singh"}]Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems2017-06-18T00:00:00+00:002017-06-18T00:00:00+00:00https://proceedings.mlr.press/v65/balcan17a[{"given"=>"Maria-Florina", "family"=>"Balcan"}, {"given"=>"Vaishnavh", "family"=>"Nagarajan"}, {"given"=>"Ellen", "family"=>"Vitercik"}, {"given"=>"Colin", "family"=>"White"}]