Skip to content
conftrace_

Optimization & Theory

43,292 papers (3 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Optimization (17,731) Learning Theory (6,809) Bayesian Inference (6,267) Theory (5,579) Statistical Learning (4,564) Neural Network Optimization (4,155) Stochastic Processes (2,948) Stochastic Methods (1,283) Loss Functions (1,220) Distributed Learning (1,202) Online Algorithms (1,013) Statistics (822) Generalization (376) Information Theory (370) Sample Complexity (282) Sparse Optimization (241) Game Theory (151) Convex Optimization (132) Optimal Transport (104) Robust Optimization (84) Distributed Optimization (73) Approximation Algorithms (33)

Papers per year

1
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

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 Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011 Bounds on Individual Risk for Log-loss Predictors COLT 2011 Budgeted Optimization with Concurrent Stochastic-Duration Experiments NeurIPS 2011 Clustered Multi-Task Learning Via Alternating Structure Optimization NeurIPS 2011 Collaborative Filtering with the Trace Norm: Learning, Bounding, and Transducing COLT 2011 Committing Bandits NeurIPS 2011 Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs NeurIPS 2011 Competitive Closeness Testing COLT 2011 Complexity-Based Approach to Calibration with Checking Rules COLT 2011 Complexity of Inference in Latent Dirichlet Allocation NeurIPS 2011 Composite Multiclass Losses NeurIPS 2011 Computationally Efficient Sufficient Dimension Reduction via Squared-Loss Mutual Information ACML 2011 Concave Gaussian Variational Approximations for Inference in Large-Scale Bayesian Linear Models AISTATS 2011 Concentration-Based Guarantees for Low-Rank Matrix Reconstruction COLT 2011 Confidence Sets for Network Structure NeurIPS 2011 Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011 Contextual Bandits with Linear Payoff Functions AISTATS 2011 Contextual Bandits with Similarity Information COLT 2011 Contextual Gaussian Process Bandit Optimization NeurIPS 2011 Continuous-Time Regression Models for Longitudinal Networks NeurIPS 2011 Convergence of Distributed Asynchronous Learning Vector Quantization Algorithms JMLR 2011 Convergence Rates of Efficient Global Optimization Algorithms JMLR 2011