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)

Multivariate Probability Calibration with Isotonic Bernstein Polynomials IJCAI 2020 Munchausen Reinforcement Learning NeurIPS 2020 MuTual: A Dataset for Multi-Turn Dialogue Reasoning ACL 2020 Mutual exclusivity as a challenge for deep neural networks NeurIPS 2020 Mutual Information Gradient Estimation for Representation Learning ICLR 2020 Mutual Transfer Learning for Massive Data ICML 2020 MUXConv: Information Multiplexing in Convolutional Neural Networks CVPR 2020 Myersonian Regression NeurIPS 2020 NAAGN: Noise-Aware Attention-Gated Network for Speech Enhancement Interspeech 2020 NADS: Neural Architecture Distribution Search for Uncertainty Awareness ICML 2020 NanoFlow: Scalable Normalizing Flows with Sublinear Parameter Complexity NeurIPS 2020 NAS-Bench-1Shot1: Benchmarking and Dissecting One-shot Neural Architecture Search ICLR 2020 NAS evaluation is frustratingly hard ICLR 2020 NAS-FCOS: Fast Neural Architecture Search for Object Detection CVPR 2020 Naturalness Enhancement with Linguistic Information in End-to-End TTS Using Unsupervised Parallel Encoding Interspeech 2020 Natural Policy Gradient Primal-Dual Method for Constrained Markov Decision Processes NeurIPS 2020 Near-linear time Gaussian process optimization with adaptive batching and resparsification ICML 2020 Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding COLT 2020 Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs IJCAI 2020 Near-Optimal Algorithms for Minimax Optimization COLT 2020 Near-Optimal Latency Versus Cost Tradeoffs in Geo-Distributed Storage NSDI 2020 Near-optimal Regret Bounds for Stochastic Shortest Path ICML 2020 Near-optimal sample complexity bounds for learning Latent $k-$polytopes and applications to Ad-Mixtures ICML 2020 Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals NeurIPS 2020 Near-Tight Margin-Based Generalization Bounds for Support Vector Machines ICML 2020