Mathematics & Optimization

An Art Gallery Approach to Ensuring that Landmarks are Distinguishable RSS 2011 An Asymptotic Behaviour of the Marginal Likelihood for General Markov Models JMLR 2011 Anechoic Blind Source Separation Using Wigner Marginals JMLR 2011 An Empirical Evaluation of Thompson Sampling NeurIPS 2011 A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011 An Exact Algorithm for F-Measure Maximization NeurIPS 2011 An Instantiation-Based Theorem Prover for First-Order Programming AISTATS 2011 A Non-Parametric Approach to Dynamic Programming NeurIPS 2011 A novel greedy algorithm for Nyström approximation AISTATS 2011 Approximate Model Selection for Large Scale LSSVM ACML 2011 Approximating Semidefinite Programs in Sublinear Time NeurIPS 2011 -Armed Bandits JMLR 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 A Simpler Approach to Matrix Completion JMLR 2011 Automatic Calibration of Multiple Coplanar Sensors RSS 2011 Better Algorithms for Benign Bandits JMLR 2011 Better Mini-Batch Algorithms via Accelerated Gradient Methods NeurIPS 2011 Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NeurIPS 2011 Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011 Bounds on Individual Risk for Log-loss Predictors COLT 2011 Budgeted Optimization with Concurrent Stochastic-Duration Experiments NeurIPS 2011 CAKE: Convex Adaptive Kernel Density Estimation AISTATS 2011 Can matrix coherence be efficiently and accurately estimated? AISTATS 2011 Clustered Multi-Task Learning Via Alternating Structure Optimization NeurIPS 2011 Collective Graphical Models NeurIPS 2011