COLT A*

52 papers

YearTitle / Authors
2012(weak) Calibration is Computationally Hard.
Elad Hazan, Sham M. Kakade
2012A Characterization of Scoring Rules for Linear Properties.
Jacob D. Abernethy, Rafael M. Frongillo
2012A Conjugate Property between Loss Functions and Uncertainty Sets in Classification Problems.
Takafumi Kanamori, Akiko Takeda, Taiji Suzuki
2012A Correlation Clustering Approach to Link Classification in Signed Networks.
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella
2012A Method of Moments for Mixture Models and Hidden Markov Models.
Animashree Anandkumar, Daniel J. Hsu, Sham M. Kakade
2012Active Learning Using Smooth Relative Regret Approximations with Applications.
Nir Ailon, Ron Begleiter, Esther Ezra
2012Analysis of Thompson Sampling for the Multi-armed Bandit Problem.
Shipra Agrawal, Navin Goyal
2012Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions.
Rocco A. Servedio, Li-Yang Tan, Justin Thaler
2012Autonomous Exploration For Navigating In MDPs.
Shiau Hong Lim, Peter Auer
2012COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland
Shie Mannor, Nathan Srebro, Robert C. Williamson
2012Commentary on "Near-Optimal Algorithms for Online Matrix Prediction".
Rina Foygel
2012Commentary on "Online Optimization with Gradual Variations".
Satyen Kale
2012Commentary on "The Optimality of Jeffreys Prior for Online Density Estimation and the Asymptotic Normality of Maximum Likelihood Estimators".
Peter Grünwald
2012Commentary on "Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences".
John C. Duchi
2012Competitive Classification and Closeness Testing.
Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh
2012Computational Bounds on Statistical Query Learning.
Vitaly Feldman, Varun Kanade
2012Consistency of Nearest Neighbor Classification under Selective Sampling.
Sanjoy Dasgupta
2012Differentially Private Online Learning.
Prateek Jain, Pravesh Kothari, Abhradeep Thakurta
2012Distance Preserving Embeddings for General n-Dimensional Manifolds.
Nakul Verma
2012Distributed Learning, Communication Complexity and Privacy.
Maria-Florina Balcan, Avrim Blum, Shai Fine, Yishay Mansour
2012Divergences and Risks for Multiclass Experiments.
Dario García-García, Robert C. Williamson
2012Exact Recovery of Sparsely-Used Dictionaries.
Daniel A. Spielman, Huan Wang, John Wright
2012Generalization Bounds for Online Learning Algorithms with Pairwise Loss Functions.
Yuyang Wang, Roni Khardon, Dmitry Pechyony, Rosie Jones
2012Kernels Based Tests with Non-asymptotic Bootstrap Approaches for Two-sample Problems.
Magalie Fromont, Béatrice Laurent, Matthieu Lerasle, Patricia Reynaud-Bouret
2012L1 Covering Numbers for Uniformly Bounded Convex Functions
Adityanand Guntuboyina, Bodhisattva Sen
2012Learning DNF Expressions from Fourier Spectrum.
Vitaly Feldman
2012Learning Functions of Halfspaces using Prefix Covers.
Parikshit Gopalan, Adam R. Klivans, Raghu Meka
2012Learning Valuation Functions.
Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang
2012Near-Optimal Algorithms for Online Matrix Prediction.
Elad Hazan, Satyen Kale, Shai Shalev-Shwartz
2012New Bounds for Learning Intervals with Implications for Semi-Supervised Learning.
David P. Helmbold, Philip M. Long
2012Online Optimization with Gradual Variations.
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, Shenghuo Zhu
2012Open Problem: Better Bounds for Online Logistic Regression.
H. Brendan McMahan, Matthew J. Streeter
2012Open Problem: Does AdaBoost Always Cycle?
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechies
2012Open Problem: Is Averaging Needed for Strongly Convex Stochastic Gradient Descent?
Ohad Shamir
2012Open Problem: Learning Dynamic Network Models from a Static Snapshot.
Jan Ramon, Constantin Comendant
2012Open Problem: Regret Bounds for Thompson Sampling.
Lihong Li, Olivier Chapelle
2012PAC-Bayesian Bound for Gaussian Process Regression and Multiple Kernel Additive Model.
Taiji Suzuki
2012Preface.
Shie Mannor, Nathan Srebro
2012Private Convex Optimization for Empirical Risk Minimization with Applications to High-dimensional Regression.
Daniel Kifer, Adam D. Smith, Abhradeep Thakurta
2012Random Design Analysis of Ridge Regression.
Daniel J. Hsu, Sham M. Kakade, Tong Zhang
2012Rare Probability Estimation under Regularly Varying Heavy Tails.
Mesrob I. Ohannessian, Munther A. Dahleh
2012Reconstruction from Anisotropic Random Measurements.
Mark Rudelson, Shuheng Zhou
2012Robust Interactive Learning.
Maria-Florina Balcan, Steve Hanneke
2012Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model.
Kamalika Chaudhuri, Fan Chung Graham, Alexander Tsiatas
2012The Best of Both Worlds: Stochastic and Adversarial Bandits.
Sébastien Bubeck, Aleksandrs Slivkins
2012The Optimality of Jeffreys Prior for Online Density Estimation and the Asymptotic Normality of Maximum Likelihood Estimators.
Fares Hedayati, Peter L. Bartlett
2012Tight Bounds on Proper Equivalence Query Learning of DNF.
Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio
2012Toward Understanding Complex Spaces: Graph Laplacians on Manifolds with Singularities and Boundaries.
Mikhail Belkin, Qichao Que, Yusu Wang, Xueyuan Zhou
2012Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences.
Benjamin Recht, Christopher Ré
2012Towards Minimax Policies for Online Linear Optimization with Bandit Feedback.
Sébastien Bubeck, Nicolò Cesa-Bianchi, Sham M. Kakade
2012Unified Algorithms for Online Learning and Competitive Analysis.
Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
2012Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem.
Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein