Mathematics & Optimization

Multi-stage Convex Relaxation for Learning with Sparse Regularization NeurIPS 2008 Near-minimax recursive density estimation on the binary hypercube NeurIPS 2008 Near-optimal Regret Bounds for Reinforcement Learning NeurIPS 2008 Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies JMLR 2008 Nonparametric regression and classification with joint sparsity constraints NeurIPS 2008 Non-parametric Regression Between Manifolds NeurIPS 2008 On Bootstrapping the ROC Curve 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 Models for Content Optimization NeurIPS 2008 Online Optimization in X-Armed Bandits NeurIPS 2008 Online Prediction on Large Diameter Graphs NeurIPS 2008 On the Efficient Minimization of Classification Calibrated Surrogates NeurIPS 2008 On the Equivalence of Linear Dimensionality-Reducing Transformations JMLR 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 On the Reliability of Clustering Stability in the Large Sample Regime NeurIPS 2008 On the Size and Recovery of Submatrices of Ones in a Random Binary Matrix JMLR 2008 Optimal Response Initiation: Why Recent Experience Matters NeurIPS 2008 Optimal Solutions for Sparse Principal Component Analysis JMLR 2008 Optimization on a Budget: A Reinforcement Learning Approach NeurIPS 2008 Particle Filter-based Policy Gradient in POMDPs NeurIPS 2008 Phase transitions for high-dimensional joint support recovery NeurIPS 2008 PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008 Rademacher Complexity Bounds for Non-I.I.D. Processes NeurIPS 2008