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)

Multi-View Stereo by Temporal Nonparametric Fusion ICCV 2019 Multiway clustering via tensor block models NeurIPS 2019 muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking NeurIPS 2019 Mutually Regressive Point Processes NeurIPS 2019 MVSCRF: Learning Multi-View Stereo With Conditional Random Fields ICCV 2019 Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments ICML 2019 Nasal Consonant Discrimination in Infant- and Adult-Directed Speech Interspeech 2019 NAS-Bench-101: Towards Reproducible Neural Architecture Search ICML 2019 NAS-FPN: Learning Scalable Feature Pyramid Architecture for Object Detection CVPR 2019 NATTACK: Learning the Distributions of Adversarial Examples for an Improved Black-Box Attack on Deep Neural Networks ICML 2019 Natural Analysts in Adaptive Data Analysis ICML 2019 Natural Option Critic AAAI 2019 Nearest-Neighbour-Induced Isolation Similarity and Its Impact on Density-Based Clustering AAAI 2019 Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019 Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit AISTATS 2019 Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin NeurIPS 2019 Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks JMLR 2019 Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs AISTATS 2019 Near-optimal method for highly smooth convex optimization COLT 2019 Necessary and Sufficient Geometries for Gradient Methods NeurIPS 2019 Negative Momentum for Improved Game Dynamics AISTATS 2019 NetScatter: Enabling Large-Scale Backscatter Networks NSDI 2019 Network-Specific Variational Auto-Encoder for Embedding in Attribute Networks IJCAI 2019 Neural Architecture Search: A Survey JMLR 2019 Neural Chinese Address Parsing NAACL 2019