conftrace_
← Machine Learning
Machine Learning ›

Optimization & Theory

36,874 papers (3 classified directly here)

Subtopics

Optimization (14,983) Bayesian Inference (5,566) Learning Theory (5,334) Theory (4,955) Statistical Learning (4,117) Neural Network Optimization (3,649) Stochastic Processes (2,667) Loss Functions (1,162) Distributed Learning (1,135) Stochastic Methods (1,118) Online Algorithms (806) Statistics (684) Information Theory (318) Generalization (220) Sparse Optimization (158) Sample Complexity (99) Game Theory (30) Robust Optimization (17) Optimal Transport (14) Approximation Algorithms (10) Distributed Optimization (8) Convex Optimization (8)

Papers per year

1
52
337
806
3400
3289
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

From Stochastic Nonlinear Integrate-and-Fire to Generalized Linear Models NIPS 2011
Generalised Coupled Tensor Factorisation NIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem NIPS 2011
Analysis and Improvement of Policy Gradient Estimation NIPS 2011
On Tracking The Partition Function NIPS 2011
Algorithms for Hyper-Parameter Optimization NIPS 2011
Finite Time Analysis of Stratified Sampling for Monte Carlo NIPS 2011
The Fast Convergence of Boosting NIPS 2011
t-divergence Based Approximate Inference NIPS 2011
Shallow vs. Deep Sum-Product Networks NIPS 2011
Expressive Power and Approximation Errors of Restricted Boltzmann Machines NIPS 2011
Information Rates and Optimal Decoding in Large Neural Populations NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
Selecting the State-Representation in Reinforcement Learning NIPS 2011
A Reinforcement Learning Theory for Homeostatic Regulation NIPS 2011
Higher-Order Correlation Clustering for Image Segmentation NIPS 2011
Learning large-margin halfspaces with more malicious noise NIPS 2011
The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning NIPS 2011
A Global Structural EM Algorithm for a Model of Cancer Progression NIPS 2011
On U-processes and clustering performance NIPS 2011
Robust Lasso with missing and grossly corrupted observations NIPS 2011
Unifying Non-Maximum Likelihood Learning Objectives with Minimum KL Contraction NIPS 2011
Select and Sample - A Model of Efficient Neural Inference and Learning NIPS 2011
Clustered Multi-Task Learning Via Alternating Structure Optimization NIPS 2011
On Learning Discrete Graphical Models using Greedy Methods NIPS 2011