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)

Deep Learning-Based Alternative Route Computation AISTATS 2024
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements AISTATS 2024
An Improved Algorithm for Learning Drifting Discrete Distributions AISTATS 2024
Sinkhorn Flow as Mirror Flow: A Continuous-Time Framework for Generalizing the Sinkhorn Algorithm AISTATS 2024
First Passage Percolation with Queried Hints AISTATS 2024
User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates AISTATS 2024
Asynchronous Randomized Trace Estimation AISTATS 2024
Computing epidemic metrics with edge differential privacy AISTATS 2024
FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning AISTATS 2024
Decentralized Multi-Level Compositional Optimization Algorithms with Level-Independent Convergence Rate AISTATS 2024
Krylov Cubic Regularized Newton: A Subspace Second-Order Method with Dimension-Free Convergence Rate AISTATS 2024
Soft-constrained Schrödinger Bridge: a Stochastic Control Approach AISTATS 2024
Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion AISTATS 2024
Fast Fourier Bayesian Quadrature AISTATS 2024
Sample Efficient Learning of Factored Embeddings of Tensor Fields AISTATS 2024
Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints AISTATS 2024
Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs AISTATS 2024
Adaptive Federated Minimax Optimization with Lower Complexities AISTATS 2024
On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: a regret lower bound for WSU-UX AISTATS 2024
Sharpened Lazy Incremental Quasi-Newton Method AISTATS 2024
SDEs for Minimax Optimization AISTATS 2024
Parameter-Agnostic Optimization under Relaxed Smoothness AISTATS 2024
Stochastic Frank-Wolfe: Unified Analysis and Zoo of Special Cases AISTATS 2024
CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption ALT 2024
Dueling Optimization with a Monotone Adversary ALT 2024