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)

Dynamic Covariance Models for Multivariate Financial Time Series ICML 2013 Dynamic Structured Model Selection ICCV 2013 EDML for Learning Parameters in Directed and Undirected Graphical Models NeurIPS 2013 Efficient Algorithm for Privately Releasing Smooth Queries NeurIPS 2013 Efficient and Robust Large-Scale Rotation Averaging ICCV 2013 Efficient Computation of Shortest Path-Concavity for 3D Meshes CVPR 2013 Efficient Exploration and Value Function Generalization in Deterministic Systems NeurIPS 2013 Efficient Hand Pose Estimation from a Single Depth Image ICCV 2013 Efficient Image Dehazing with Boundary Constraint and Contextual Regularization ICCV 2013 Efficient Large-Scale Structured Learning CVPR 2013 Efficient Learning of Simplices COLT 2013 Efficiently Sampling Probabilistic Programs via Program Analysis AISTATS 2013 Efficient Online Inference for Bayesian Nonparametric Relational Models NeurIPS 2013 Efficient Optimization for Sparse Gaussian Process Regression NeurIPS 2013 Efficient Ranking from Pairwise Comparisons ICML 2013 Efficient Sparse Group Feature Selection via Nonconvex Optimization ICML 2013 Efficient Variational Inference for Gaussian Process Regression Networks AISTATS 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 Embed and Project: Discrete Sampling with Universal Hashing NeurIPS 2013 Ensemble Video Object Cut in Highly Dynamic Scenes CVPR 2013 Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion NeurIPS 2013 Estimating LASSO Risk and Noise Level NeurIPS 2013 Estimating the Unseen: Improved Estimators for Entropy and other Properties NeurIPS 2013 Estimating Unknown Sparsity in Compressed Sensing ICML 2013 Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling COLT 2013