conftrace_
← Mathematics & Optimization
Mathematics & Optimization ›

Optimization

12,959 papers (55 classified directly here)

Subtopics

Continuous Optimization (3,907) Stochastic Methods (2,788) Combinatorial Optimization (2,409) Online Algorithms (2,192) Optimization (1,207) Game Theory (944) Discrete Optimization (705) Convex Optimization (591) Optimal Transport (369) Sparse Optimization (347) Optimal Control (225) Global Optimization (190) Distributed Learning (157) Multi-Objective Optimization (125) Approximation Algorithms (110) Bayesian Optimization (100) Distributed Optimization (99) Theory (98) Non-Convex Optimization (76) Kernel Methods (73) Compressed Sensing (72) Robust Optimization (70) Evolutionary Algorithm (58) Linear Programming (43) Algorithms (10) Algorithm (10) Integer Programming (9) Submodular Optimization (9) Matrix Completion (8) Bilevel Optimization (8) Tensor Decomposition (6) Regularization (5)

Papers per year

1
15
119
411
1322
644
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Convergence Rates of Gradient Descent and MM Algorithms for Bradley-Terry Models AISTATS 2020
A Locally Adaptive Bayesian Cubature Method AISTATS 2020
A Continuous-time Perspective for Modeling Acceleration in Riemannian Optimization AISTATS 2020
Robust Stackelberg buyers in repeated auctions AISTATS 2020
Practical Nonisotropic Monte Carlo Sampling in High Dimensions via Determinantal Point Processes AISTATS 2020
RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization AISTATS 2020
Contextual Combinatorial Volatile Multi-armed Bandit with Adaptive Discretization AISTATS 2020
A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach AISTATS 2020
Bandit Convex Optimization in Non-stationary Environments AISTATS 2020
Decentralized Multi-player Multi-armed Bandits with No Collision Information AISTATS 2020
Automatic Differentiation of Some First-Order Methods in Parametric Optimization AISTATS 2020
Competing Bandits in Matching Markets AISTATS 2020
Locally Accelerated Conditional Gradients AISTATS 2020
Ensemble Gaussian Processes with Spectral Features for Online Interactive Learning with Scalability AISTATS 2020
Distributionally Robust Bayesian Quadrature Optimization AISTATS 2020
DAve-QN: A Distributed Averaged Quasi-Newton Method with Local Superlinear Convergence Rate AISTATS 2020
Online Learning Using Only Peer Prediction AISTATS 2020
Randomized Exploration in Generalized Linear Bandits AISTATS 2020
Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter AISTATS 2020
On the optimality of kernels for high-dimensional clustering AISTATS 2020
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020
Dependent randomized rounding for clustering and partition systems with knapsack constraints AISTATS 2020
Derivative-Free & Order-Robust Optimisation AISTATS 2020
Calibrated Surrogate Maximization of Linear-fractional Utility in Binary Classification AISTATS 2020
Accelerated Primal-Dual Algorithms for Distributed Smooth Convex Optimization over Networks AISTATS 2020