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)

The Effect of Combination Functions on the Complexity of Relational Bayesian Networks PGM 2016 The Effects of Modified Speech Styles on Intelligibility for Non-Native Listeners Interspeech 2016 The Extended Littlestone’s Dimension for Learning with Mistakes and Abstentions COLT 2016 The Forget-me-not Process NeurIPS 2016 The Generalized Reparameterization Gradient NeurIPS 2016 The Information-Theoretic Requirements of Subspace Clustering with Missing Data ICML 2016 The knockoff filter for FDR control in group-sparse and multitask regression ICML 2016 The Knowledge Gradient for Sequential Decision Making with Stochastic Binary Feedbacks ICML 2016 The Limits of Learning with Missing Data NeurIPS 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 The Multiple Quantile Graphical Model NeurIPS 2016 The non-convex Burer-Monteiro approach works on smooth semidefinite programs NeurIPS 2016 The Nonparametric Kernel Bayes Smoother AISTATS 2016 The Optimal Sample Complexity of PAC Learning JMLR 2016 Theoretical Comparisons of Positive-Unlabeled Learning against Positive-Negative Learning NeurIPS 2016 The Parallel Knowledge Gradient Method for Batch Bayesian Optimization NeurIPS 2016 The Parameterized Complexity of Approximate Inference in Bayesian Networks PGM 2016 The Power of Adaptivity in Identifying Statistical Alternatives NeurIPS 2016 The Power of Depth for Feedforward Neural Networks COLT 2016 The Power of Optimization from Samples NeurIPS 2016 The Rhythmic Constraint on Prosodic Boundaries in Mandarin Chinese Based on Corpora of Silent Reading and Speech Perception Interspeech 2016 The Robustness of Estimator Composition NeurIPS 2016 The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM ICML 2016 The Solution Path Algorithm for Identity-Aware Multi-Object Tracking CVPR 2016 The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM NeurIPS 2016