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)

A Hybrid Approximation to the Marginal Likelihood AISTATS 2021
Efficient Designs Of SLOPE Penalty Sequences In Finite Dimension AISTATS 2021
Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC AISTATS 2021
A Spectral Analysis of Dot-product Kernels AISTATS 2021
Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021
Rao-Blackwellised parallel MCMC AISTATS 2021
Calibrated Adaptive Probabilistic ODE Solvers AISTATS 2021
Online Robust Control of Nonlinear Systems with Large Uncertainty AISTATS 2021
Wyner-Ziv Estimators: Efficient Distributed Mean Estimation with Side-Information AISTATS 2021
A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces AISTATS 2021
Local SGD: Unified Theory and New Efficient Methods AISTATS 2021
Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021
Sequential Random Sampling Revisited: Hidden Shuffle Method AISTATS 2021
Couplings for Multinomial Hamiltonian Monte Carlo AISTATS 2021
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits AISTATS 2021
A Scalable Gradient Free Method for Bayesian Experimental Design with Implicit Models AISTATS 2021
Direct-Search for a Class of Stochastic Min-Max Problems AISTATS 2021
Robust Learning under Strong Noise via SQs AISTATS 2021
Entropy Partial Transport with Tree Metrics: Theory and Practice AISTATS 2021
Combinatorial Gaussian Process Bandits with Probabilistically Triggered Arms AISTATS 2021
Differentiating the Value Function by using Convex Duality AISTATS 2021
An Adaptive-MCMC Scheme for Setting Trajectory Lengths in Hamiltonian Monte Carlo AISTATS 2021
Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization AISTATS 2021
Regularized ERM on random subspaces AISTATS 2021
Last-Iterate Convergence Rates for Min-Max Optimization: Convergence of Hamiltonian Gradient Descent and Consensus Optimization ALT 2021