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)

Learning to Listen: Critically Considering the Role of AI in Human Storytelling and Character Creation NAACL 2018 Learning to Optimize Combinatorial Functions ICML 2018 Learning to Round for Discrete Labeling Problems AISTATS 2018 Learning to See in the Dark CVPR 2018 LEARNING TO SHARE: SIMULTANEOUS PARAMETER TYING AND SPARSIFICATION IN DEEP LEARNING ICLR 2018 Learning to Speed Up Structured Output Prediction ICML 2018 Learning to Teach with Dynamic Loss Functions NeurIPS 2018 Learning towards Minimum Hyperspherical Energy NeurIPS 2018 Learning Transferable Architectures for Scalable Image Recognition CVPR 2018 Learning under p-Tampering Attacks ALT 2018 Learning unknown ODE models with Gaussian processes ICML 2018 Learning What Information to Give in Partially Observed Domains CoRL 2018 Learning with Abandonment ICML 2018 Learning with Complex Loss Functions and Constraints AISTATS 2018 Learning with Noise-Contrastive Estimation: Easing training by learning to scale COLING 2018 Learning Without Mixing: Towards A Sharp Analysis of Linear System Identification COLT 2018 Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity NeurIPS 2018 Learning with SGD and Random Features NeurIPS 2018 Least-Squares Temporal Difference Learning for the Linear Quadratic Regulator ICML 2018 Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games ICML 2018 Leveraged volume sampling for linear regression NeurIPS 2018 Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms ICML 2018 LHD: Improving Cache Hit Rate by Maximizing Hit Density NSDI 2018 Lifted Filtering via Exchangeable Decomposition IJCAI 2018 Lifted Weighted Mini-Bucket NeurIPS 2018