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)

Preference-based Teaching COLT 2016 Preterm Birth Prediction: Stable Selection of Interpretable Rules from High Dimensional Data MLHC 2016 Pricing a Low-regret Seller ICML 2016 Primal-Dual Rates and Certificates ICML 2016 Principled Parallel Mean-Field Inference for Discrete Random Fields CVPR 2016 Prior-Less Compressible Structure From Motion CVPR 2016 Priors for Speaker Counting and Diarization with AHC Interspeech 2016 Privacy Odometers and Filters: Pay-as-you-Go Composition NeurIPS 2016 Probabilistic Linear Multistep Methods NeurIPS 2016 Probabilistic Low-Rank Matrix Completion from Quantized Measurements JMLR 2016 Probing the Compositionality of Intuitive Functions NeurIPS 2016 Product Review Summarization by Exploiting Phrase Properties COLING 2016 Progressive Feature Matching With Alternate Descriptor Selection and Correspondence Enrichment CVPR 2016 Proper Inner Product with Mean Displacement for Gaussian Noise Invariant ICA ACML 2016 Properly Learning Poisson Binomial Distributions in Almost Polynomial Time COLT 2016 Provable Algorithms for Inference in Topic Models ICML 2016 Provable Bayesian Inference via Particle Mirror Descent AISTATS 2016 Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NeurIPS 2016 Provable Non-convex Phase Retrieval with Outliers: Median TruncatedWirtinger Flow ICML 2016 Provably manipulation-resistant reputation systems COLT 2016 Proximal Stochastic Methods for Nonsmooth Nonconvex Finite-Sum Optimization NeurIPS 2016 Pseudo-Marginal Slice Sampling AISTATS 2016 Pure Exploration of Multi-armed Bandit Under Matroid Constraints COLT 2016 Purely Sequence-Trained Neural Networks for ASR Based on Lattice-Free MMI Interspeech 2016 Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation JMLR 2016