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)

Nonparametric Risk Bounds for Time-Series Forecasting JMLR 2017 Non-parametric Structured Output Networks NeurIPS 2017 Nonparanormal Information Estimation ICML 2017 Non-Stationary Spectral Kernels NeurIPS 2017 Non-Uniform MCE Training of Deep Long Short-Term Memory Recurrent Neural Networks for Keyword Spotting Interspeech 2017 Non-Uniform Subset Selection for Active Learning in Structured Data CVPR 2017 No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis ICML 2017 Not Afraid of the Dark: NIR-VIS Face Recognition via Cross-Spectral Hallucination and Low-Rank Embedding CVPR 2017 On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017 On Blackbox Backpropagation and Jacobian Sensing NeurIPS 2017 On Calibration of Modern Neural Networks ICML 2017 On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models JMLR 2017 On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities COLT 2017 On Improving Acoustic Models for TORGO Dysarthric Speech Database Interspeech 2017 On Kernelized Multi-armed Bandits ICML 2017 On Learning vs. Refutation COLT 2017 Online Algorithm Selection IJCAI 2017 Online and Linear-Time Attention by Enforcing Monotonic Alignments ICML 2017 Online Asymmetric Similarity Learning for Cross-Modal Retrieval CVPR 2017 Online Bayesian Passive-Aggressive Learning JMLR 2017 Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads IJCAI 2017 Online but Accurate Inference for Latent Variable Models with Local Gibbs Sampling JMLR 2017 Online control of the false discovery rate with decaying memory NeurIPS 2017 Online Convex Optimization with Stochastic Constraints NeurIPS 2017 Online Dynamic Programming NeurIPS 2017