Skip to content
conftrace_

Papers (including subtopics)

Online Learning: Random Averages, Combinatorial Parameters, and Learnability NeurIPS 2010 Online Markov Decision Processes under Bandit Feedback NeurIPS 2010 Online Passive-Aggressive Algorithms on a Budget AISTATS 2010 On-Line Sequential Bin Packing JMLR 2010 On the Convexity of Latent Social Network Inference NeurIPS 2010 Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets NeurIPS 2010 Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure JMLR 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Parallelized Stochastic Gradient Descent NeurIPS 2010 Parametric Bandits: The Generalized Linear Case NeurIPS 2010 Policy gradients in linearly-solvable MDPs NeurIPS 2010 Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching AISTATS 2010 Practical Large-Scale Optimization for Max-norm Regularization NeurIPS 2010 Random Conic Pursuit for Semidefinite Programming NeurIPS 2010 Random Walk Approach to Regret Minimization NeurIPS 2010 REGO: Rank-based Estimation of Renyi Information using Euclidean Graph Optimization AISTATS 2010 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 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 Segmentation as Maximum-Weight Independent Set NeurIPS 2010