Skip to content
conftrace_

Papers (including subtopics)

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 Universality of Online Mirror Descent NeurIPS 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 Prediction strategies without loss NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Pylon Model for Semantic Segmentation NeurIPS 2011 Quasi-Newton Methods for Markov Chain Monte Carlo NeurIPS 2011 Randomized Algorithms for Comparison-based Search NeurIPS 2011 Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound NeurIPS 2011