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)

The Landscape of Non-convex Empirical Risk with Degenerate Population Risk NIPS 2019
No-Regret Learning in Unknown Games with Correlated Payoffs NIPS 2019
Pareto Multi-Task Learning NIPS 2019
Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates NIPS 2019
Contextual Bandits with Cross-Learning NIPS 2019
Variance Reduction for Matrix Games NIPS 2019
Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games NIPS 2019
Scalable Global Optimization via Local Bayesian Optimization NIPS 2019
Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis NIPS 2019
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching NIPS 2019
Private Learning Implies Online Learning: An Efficient Reduction NIPS 2019
Kernel quadrature with DPPs NIPS 2019
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NIPS 2019
Greedy Sampling for Approximate Clustering in the Presence of Outliers NIPS 2019
Robust Principal Component Analysis with Adaptive Neighbors NIPS 2019
Near Neighbor: Who is the Fairest of Them All? NIPS 2019
Efficiently escaping saddle points on manifolds NIPS 2019
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families NIPS 2019
Correlation clustering with local objectives NIPS 2019
Logarithmic Regret for Online Control NIPS 2019
Offline Contextual Bayesian Optimization NIPS 2019
Faster width-dependent algorithm for mixed packing and covering LPs NIPS 2019
Sobolev Independence Criterion NIPS 2019
Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions NIPS 2019
Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond NIPS 2019