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)

Near-Exact Privacy Amplification for Matrix Mechanisms ICLR 2025 Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback ICML 2025 Nearly Optimal Differentially Private ReLU Regression UAI 2025 Nearly Optimal Sample Complexity for Learning with Label Proportions ICML 2025 Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem ALT 2025 Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap AAAI 2025 NEAR: Neural Electromagnetic Array Response ICML 2025 Near-optimal Active Regression of Single-Index Models ICLR 2025 Near-Optimal Decision Trees in a SPLIT Second ICML 2025 Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles JMLR 2025 Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency ICLR 2025 Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form ICLR 2025 Near-Optimal Rates for O(1)-Smooth DP-SCO with a Single Epoch and Large Batches ALT 2025 Near-Optimal Regret Bounds for Federated Multi-armed Bandits with Fully Distributed Communication UAI 2025 Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model AISTATS 2025 Near-Optimal Sample Complexity in Reward-Free Kernel-based Reinforcement Learning AISTATS 2025 Near-optimal Sketchy Natural Gradients for Physics-Informed Neural Networks ICML 2025 Near-Polynomially Competitive Active Logistic Regression AISTATS 2025 Needles & Haystacks: Dataset and Benchmark for Domain-Agnostic Image-Based Rigid Slice-to-Volume Registration WACV 2025 NegMerge: Sign-Consensual Weight Merging for Machine Unlearning ICML 2025 Neighbour-Driven Gaussian Process Variational Autoencoders for Scalable Structured Latent Modelling ICML 2025 NeISF++: Neural Incident Stokes Field for Polarized Inverse Rendering of Conductors and Dielectrics CVPR 2025 NeKo: Cross-Modality Post-Recognition Error Correction with Tasks-Guided Mixture-of-Experts Language Model ACL 2025 NeRFPrior: Learning Neural Radiance Field as a Prior for Indoor Scene Reconstruction CVPR 2025 Nested Expectations with Kernel Quadrature ICML 2025