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 Characterization for Linear Contextual MDPs AISTATS 2024 Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut NeurIPS 2024 Sample Complexity of Interventional Causal Representation Learning NeurIPS 2024 Sample Complexity of Neural Policy Mirror Descent for Policy Optimization on Low-Dimensional Manifolds JMLR 2024 Sample Complexity of Variance-Reduced Distributionally Robust Q-Learning JMLR 2024 Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NeurIPS 2024 Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity ICLR 2024 Sample-Efficient Agnostic Boosting NeurIPS 2024 Sample Efficient Bayesian Learning of Causal Graphs from Interventions NeurIPS 2024 Sample-efficient Bayesian Optimisation Using Known Invariances NeurIPS 2024 Sample-Efficient Constrained Reinforcement Learning with General Parameterization NeurIPS 2024 Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization NeurIPS 2024 Sample Efficient Learning of Factored Embeddings of Tensor Fields AISTATS 2024 Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation ICLR 2024 Sample-Efficient Learning of POMDPs with Multiple Observations In Hindsight ICLR 2024 Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data ICLR 2024 Sample-Efficient Multi-Agent RL: An Optimization Perspective ICLR 2024 Sample-efficient neural likelihood-free Bayesian inference of implicit HMMs AISTATS 2024 Sample-Efficient Private Learning of Mixtures of Gaussians NeurIPS 2024 Sample Efficient Reinforcement Learning with Partial Dynamics Knowledge AAAI 2024 Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty ICML 2024 Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity COLT 2024 Sampling for Beyond-Worst-Case Online Ranking AAAI 2024 Sampling from the Mean-Field Stationary Distribution COLT 2024 Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization ICLR 2024