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)

Sample Complexity of Policy Gradient Finding Second-Order Stationary Points AAAI 2021 Sample Complexity of Robust Linear Classification on Separated Data ICML 2021 Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond NeurIPS 2021 Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization IJCAI 2021 Sample-Efficient L0-L2 Constrained Structure Learning of Sparse Ising Models AAAI 2021 Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model NeurIPS 2021 Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity ICML 2021 Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting NeurIPS 2021 Sample Efficient Reinforcement Learning with REINFORCE AAAI 2021 Sample-Optimal PAC Learning of Halfspaces with Malicious Noise ICML 2021 Sample Selection for Fair and Robust Training NeurIPS 2021 Sample-Specific Output Constraints for Neural Networks AAAI 2021 Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC AISTATS 2021 SANDI: Story-and-Images Alignment EACL 2021 Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot? NeurIPS 2021 SAPE: Spatially-Adaptive Progressive Encoding for Neural Optimization NeurIPS 2021 SAT-based Decision Tree Learning for Large Data Sets AAAI 2021 Satisfiability and Algorithms for Non-uniform Random k-SAT AAAI 2021 SBO-RNN: Reformulating Recurrent Neural Networks via Stochastic Bilevel Optimization NeurIPS 2021 Scalability vs. Utility: Do We Have To Sacrifice One for the Other in Data Importance Quantification? CVPR 2021 Scalable Bayesian GPFA with automatic relevance determination and discrete noise models NeurIPS 2021 Scalable Certified Segmentation via Randomized Smoothing ICML 2021 Scalable Constrained Bayesian Optimization AISTATS 2021 Scalable Evaluation of Multi-Agent Reinforcement Learning with Melting Pot ICML 2021 Scalable First-Order Methods for Robust MDPs AAAI 2021