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)

Probabilistic Multi-Task Feature Selection NeurIPS 2010 Quadratic Programming Feature Selection JMLR 2010 Rademacher Complexities and Bounding the Excess Risk in Active Learning JMLR 2010 Random Conic Pursuit for Semidefinite Programming NeurIPS 2010 Random Projection Trees Revisited NeurIPS 2010 Random Walk Approach to Regret Minimization NeurIPS 2010 Rate Minimaxity of the Lasso and Dantzig Selector for the Loss in Balls JMLR 2010 Rates of convergence for the cluster tree NeurIPS 2010 Real-time Multiattribute Bayesian Preference Elicitation with Pairwise Comparison Queries AISTATS 2010 Reduced-Rank Hidden Markov Models AISTATS 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 Regularized estimation of image statistics by Score Matching NeurIPS 2010 Relating Function Class Complexity and Cluster Structure in the Function Domain with Applications to Transduction AISTATS 2010 Relaxed Clipping: A Global Training Method for Robust Regression and Classification NeurIPS 2010 Repeated Games against Budgeted Adversaries NeurIPS 2010 Rescaling, thinning or complementing? On goodness-of-fit procedures for point process models and Generalized Linear Models NeurIPS 2010 Restricted Eigenvalue Properties for Correlated Gaussian Designs JMLR 2010 Reverse Multi-Label Learning NeurIPS 2010 Reward Design via Online Gradient Ascent NeurIPS 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