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)

Efficient Combination of Rematerialization and Offloading for Training DNNs NeurIPS 2021 Efficient Computation and Analysis of Distributional Shapley Values AISTATS 2021 Efficient constrained sampling via the mirror-Langevin algorithm NeurIPS 2021 Efficient Coreset Constructions via Sensitivity Sampling ACML 2021 Efficient debiased evidence estimation by multilevel Monte Carlo sampling UAI 2021 Efficient Differentiable Simulation of Articulated Bodies ICML 2021 Efficient Empowerment Estimation for Unsupervised Stabilization ICLR 2021 Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination NeurIPS 2021 Efficient Generalization with Distributionally Robust Learning NeurIPS 2021 Efficient greedy coordinate descent via variable partitioning UAI 2021 Efficient Inference of Flexible Interaction in Spiking-neuron Networks ICLR 2021 Efficient Initial Pose-Graph Generation for Global SfM CVPR 2021 Efficient Learning of Discrete-Continuous Computation Graphs NeurIPS 2021 Efficient Lottery Ticket Finding: Less Data is More ICML 2021 Efficiently Learning One Hidden Layer ReLU Networks From Queries NeurIPS 2021 Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021 Efficient methods for Gaussian Markov random fields under sparse linear constraints NeurIPS 2021 Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization AISTATS 2021 Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems NeurIPS 2021 EfficientNetV2: Smaller Models and Faster Training ICML 2021 Efficient Neural Network Training via Forward and Backward Propagation Sparsification NeurIPS 2021 Efficient Neural Network Verification via Layer-based Semidefinite Relaxations and Linear Cuts IJCAI 2021 Efficient On-Chip Learning for Optical Neural Networks Through Power-Aware Sparse Zeroth-Order Optimization AAAI 2021 Efficient Online Estimation of Causal Effects by Deciding What to Observe NeurIPS 2021 Efficient online inference for nonparametric mixture models UAI 2021