Mathematics & Optimization

Regret Bounds and Minimax Policies under Partial Monitoring JMLR 2010 Regret Bounds for Gaussian Process Bandit Problems AISTATS 2010 Relaxed Clipping: A Global Training Method for Robust Regression and Classification NeurIPS 2010 Repeated Games against Budgeted Adversaries NeurIPS 2010 Restricted Eigenvalue Properties for Correlated Gaussian Designs JMLR 2010 Risk Bounds for Levy Processes in the PAC-Learning Framework AISTATS 2010 Robust Clustering as Ensembles of Affinity Relations NeurIPS 2010 Robust PCA via Outlier Pursuit NeurIPS 2010 Sample Complexity of Testing the Manifold Hypothesis NeurIPS 2010 Scrambled Objects for Least-Squares Regression NeurIPS 2010 Segmentation as Maximum-Weight Independent Set NeurIPS 2010 SFO: A Toolbox for Submodular Function Optimization JMLR 2010 Short-term memory in neuronal networks through dynamical compressed sensing NeurIPS 2010 Singularity-invariant leg rearrangements in doubly-planar Stewart-Gough platforms RSS 2010 Sodium entry efficiency during action potentials: A novel single-parameter family of Hodgkin-Huxley models NeurIPS 2010 Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms AISTATS 2010 Sparse Inverse Covariance Selection via Alternating Linearization Methods NeurIPS 2010 Spectral Regularization Algorithms for Learning Large Incomplete Matrices JMLR 2010 Stability Approach to Regularization Selection (StARS) for High Dimensional Graphical Models NeurIPS 2010 Stochastic Composite Likelihood JMLR 2010 Stochastic Modeling of the Expected Time to Search for an Intermittent Signal Source Under a Limited Sensing Range RSS 2010 Structured sparsity-inducing norms through submodular functions NeurIPS 2010 Subgraph Detection Using Eigenvector L1 Norms NeurIPS 2010 Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework NeurIPS 2010 The Coding Divergence for Measuring the Complexity of Separating Two Sets ACML 2010