← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

Improved Loss Bounds For Multiple Kernel Learning AISTATS 2011
Composite Multiclass Losses NIPS 2011
Theoretical Analysis of Bayesian Matrix Factorization JMLR 2011
Asymptotic Theory for Linear-Chain Conditional Random Fields AISTATS 2011
Error Analysis of Laplacian Eigenmaps for Semi-supervised Learning AISTATS 2011
Online Learning: Beyond Regret COLT 2011
Spectral Methods for Learning Multivariate Latent Tree Structure NIPS 2011
Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression NIPS 2011
Complexity of Inference in Latent Dirichlet Allocation NIPS 2011
Expressive Power and Approximation Errors of Restricted Boltzmann Machines NIPS 2011
Statistical Performance of Convex Tensor Decomposition NIPS 2011
Minimax Localization of Structural Information in Large Noisy Matrices NIPS 2011
Learning with the weighted trace-norm under arbitrary sampling distributions NIPS 2011
Scalable Training of Mixture Models via Coresets NIPS 2011
A More Powerful Two-Sample Test in High Dimensions using Random Projection NIPS 2011
Learning in Hilbert vs. Banach Spaces: A Measure Embedding Viewpoint NIPS 2011
Finite Time Analysis of Stratified Sampling for Monte Carlo NIPS 2011
Shallow vs. Deep Sum-Product Networks NIPS 2011
The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning NIPS 2011
Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs NIPS 2011
Oracle inequalities for computationally budgeted model selection COLT 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011
Noise Thresholds for Spectral Clustering NIPS 2011