Optimization

Mind the Duality Gap: Logarithmic regret algorithms for online optimization NeurIPS 2008 Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data JMLR 2008 Multi-class Discriminant Kernel Learning via Convex Programming JMLR 2008 Multi-label Multiple Kernel Learning NeurIPS 2008 Multi-resolution Exploration in Continuous Spaces NeurIPS 2008 Multi-stage Convex Relaxation for Learning with Sparse Regularization NeurIPS 2008 Near-optimal Regret Bounds for Reinforcement Learning NeurIPS 2008 Nonparametric regression and classification with joint sparsity constraints NeurIPS 2008 One sketch for all: Theory and Application of Conditional Random Sampling NeurIPS 2008 Online Learning of Complex Prediction Problems Using Simultaneous Projections JMLR 2008 Online Metric Learning and Fast Similarity Search NeurIPS 2008 Online Optimization in X-Armed Bandits NeurIPS 2008 On the Design of Loss Functions for Classification: theory, robustness to outliers, and SavageBoost NeurIPS 2008 On the Efficient Minimization of Classification Calibrated Surrogates NeurIPS 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 Optimal Solutions for Sparse Principal Component Analysis JMLR 2008 Optimization on a Budget: A Reinforcement Learning Approach NeurIPS 2008 Phase transitions for high-dimensional joint support recovery NeurIPS 2008 Proofs and Experiments in Scalable, Near-Optimal Search by Multiple Robots RSS 2008 PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008 Regularized Policy Iteration NeurIPS 2008 Robust Regression and Lasso NeurIPS 2008 Shark JMLR 2008 Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms NeurIPS 2008