Mathematics & Optimization

Committing Bandits NeurIPS 2011 Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs NeurIPS 2011 Competitive Closeness Testing COLT 2011 Complexity-Based Approach to Calibration with Checking Rules COLT 2011 Concentration-Based Guarantees for Low-Rank Matrix Reconstruction COLT 2011 Confidence Sets for Network Structure NeurIPS 2011 Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011 Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011 Contextual Bandits with Similarity Information COLT 2011 Contextual Gaussian Process Bandit Optimization NeurIPS 2011 Continuous Rapid Action Value Estimates ACML 2011 Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NeurIPS 2011 Convergent Bounds on the Euclidean Distance NeurIPS 2011 Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011 Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011 Cross-Entropy Randomized Motion Planning RSS 2011 Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Functions on Graphs JMLR 2011 Data Skeletonization via Reeb Graphs NeurIPS 2011 Dimensionality Reduction Using the Sparse Linear Model NeurIPS 2011 Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators NeurIPS 2011 Directional Statistics on Permutations AISTATS 2011 Distributed Delayed Stochastic Optimization NeurIPS 2011 Divide-and-Conquer Matrix Factorization NeurIPS 2011 Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011 Domain Decomposition Approach for Fast Gaussian Process Regression of Large Spatial Data Sets JMLR 2011