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
14
29
44
31
52
189
195
212
235
352
382
457
787
816
828
1,066
1,391
1,913
3,012
3,646
4,303
4,450
5,357
6,155
5,854
1,521
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Non-Convex Matrix Completion Against a Semi-Random Adversary
COLT 2018
Non-delusional Q-learning and value-iteration
NeurIPS 2018
Nonlinear Structured Signal Estimation in High Dimensions via Iterative Hard Thresholding
AISTATS 2018
Nonlocal Neural Networks, Nonlocal Diffusion and Nonlocal Modeling
NeurIPS 2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations
NeurIPS 2018
Nonparametric Bayesian Lomax delegate racing for survival analysis with competing risks
NeurIPS 2018
Nonparametric Bayesian sparse graph linear dynamical systems
AISTATS 2018
Nonparametric Density Estimation under Adversarial Losses
NeurIPS 2018
Non-parametric estimation of Jensen-Shannon Divergence in Generative Adversarial Network training
AISTATS 2018
Nonparametric learning from Bayesian models with randomized objective functions
NeurIPS 2018
Nonparametric Sharpe Ratio Function Estimation in Heteroscedastic Regression Models via Convex Optimization
AISTATS 2018
Nonrigid Points Alignment with Soft-weighted Selection
IJCAI 2018
Nonstochastic Bandits with Composite Anonymous Feedback
COLT 2018
Normal Bandits of Unknown Means and Variances
JMLR 2018
Not All Samples Are Created Equal: Deep Learning with Importance Sampling
ICML 2018
Not-So-Random Features
ICLR 2018
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving
IJCAI 2018
Numerical Analysis near Singularities in RBF Networks
JMLR 2018
Objective Function Learning to Match Human Judgements for Optimization-Based Summarization
NAACL 2018
Obtaining Reliable Human Ratings of Valence, Arousal, and Dominance for 20,000 English Words
ACL 2018
On Acceleration with Noise-Corrupted Gradients
ICML 2018
On Binary Classification in Extreme Regions
NeurIPS 2018
On Concept Forgetting in Description Logics with Qualified Number Restrictions
IJCAI 2018
On denoising modulo 1 samples of a function
AISTATS 2018
On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization
JMLR 2018