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 Everlasting Database: Statistical Validity at a Fair Price NeurIPS 2018 The Fine Line between Linguistic Generalization and Failure in Seq2Seq-Attention Models NAACL 2018 The Finite Model Theory of Bayesian Networks: Descriptive Complexity IJCAI 2018 The Generalization Error of Dictionary Learning with Moreau Envelopes ICML 2018 The Geometry of Random Features AISTATS 2018 The glass ceiling in NLP EMNLP 2018 The Hidden Vulnerability of Distributed Learning in Byzantium ICML 2018 The Hierarchical Adaptive Forgetting Variational Filter ICML 2018 The Hitchhiker’s Guide to Testing Statistical Significance in Natural Language Processing ACL 2018 The Implicit Bias of Gradient Descent on Separable Data ICLR 2018 The Implicit Bias of Gradient Descent on Separable Data JMLR 2018 The Importance of Calibration for Estimating Proportions from Annotations NAACL 2018 The Kanerva Machine: A Generative Distributed Memory ICLR 2018 The K-Nearest Neighbour UCB Algorithm for Multi-Armed Bandits with Covariates ALT 2018 The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization NeurIPS 2018 The Limits of Maxing, Ranking, and Preference Learning ICML 2018 The Limits of Post-Selection Generalization NeurIPS 2018 The Lingering of Gradients: How to Reuse Gradients Over Time NeurIPS 2018 The Lovász-Softmax Loss: A Tractable Surrogate for the Optimization of the Intersection-Over-Union Measure in Neural Networks CVPR 2018 The Many Faces of Exponential Weights in Online Learning COLT 2018 The Mechanics of n-Player Differentiable Games ICML 2018 The Mirage of Action-Dependent Baselines in Reinforcement Learning ICML 2018 The Multilinear Structure of ReLU Networks ICML 2018 The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal NeurIPS 2018 Theoretical Analysis of Cross-Validation for Estimating the Risk of the k-Nearest Neighbor Classifier JMLR 2018