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)

Optimal Underdamped Langevin MCMC Method NIPS 2021
Scheduling jobs with stochastic holding costs NIPS 2021
Stochastic bandits with groups of similar arms. NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
Three Operator Splitting with Subgradients, Stochastic Gradients, and Adaptive Learning Rates NIPS 2021
On learning sparse vectors from mixture of responses NIPS 2021
Graphical Models in Heavy-Tailed Markets NIPS 2021
Asynchronous Decentralized Online Learning NIPS 2021
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient NIPS 2021
Implicit Regularization in Matrix Sensing via Mirror Descent NIPS 2021
Dueling Bandits with Team Comparisons NIPS 2021
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NIPS 2021
Optimal Order Simple Regret for Gaussian Process Bandits NIPS 2021
Heavy Ball Momentum for Conditional Gradient NIPS 2021
Robust Learning of Optimal Auctions NIPS 2021
Multi-Objective Meta Learning NIPS 2021
Efficient and Local Parallel Random Walks NIPS 2021
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm NIPS 2021
A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NIPS 2021
A Surrogate Objective Framework for Prediction+Programming with Soft Constraints NIPS 2021
Fair Scheduling for Time-dependent Resources NIPS 2021
Best-case lower bounds in online learning NIPS 2021
On Robust Optimal Transport: Computational Complexity and Barycenter Computation NIPS 2021
Asymptotically Best Causal Effect Identification with Multi-Armed Bandits NIPS 2021
Fair Exploration via Axiomatic Bargaining NIPS 2021