Mathematics & Optimization

Neyman-Pearson classification under a strict constraint COLT 2011 Noise Thresholds for Spectral Clustering NeurIPS 2011 Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NeurIPS 2011 Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NeurIPS 2011 On fast approximate submodular minimization NeurIPS 2011 On Learning Discrete Graphical Models using Greedy Methods NeurIPS 2011 Online Learning: Beyond Regret COLT 2011 Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011 Online Learning of Structured Predictors with Multiple Kernels AISTATS 2011 Online Learning: Stochastic, Constrained, and Smoothed Adversaries NeurIPS 2011 Online Submodular Set Cover, Ranking, and Repeated Active Learning NeurIPS 2011 On the accuracy of l1-filtering of signals with block-sparse structure NeurIPS 2011 On the Estimation of α-Divergences AISTATS 2011 On the Universality of Online Mirror Descent NeurIPS 2011 On Time Varying Undirected Graphs AISTATS 2011 Optimal aggregation of affine estimators COLT 2011 Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011 Optimal Distributed Market-Based Planning for Multi-Agent Systems with Shared Resources AISTATS 2011 Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness NeurIPS 2011 Orthogonal Matching Pursuit with Replacement NeurIPS 2011 Parallel Algorithm for Learning Optimal Bayesian Network Structure JMLR 2011 Parameter Screening and Optimisation for ILP using Designed Experiments JMLR 2011 Penalty Decomposition Methods for Rank Minimization NeurIPS 2011 Phase transition in the family of p-resistances NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011