Skip to content
conftrace_

Optimization

14,850 papers (55 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Continuous Optimization (4,424) Stochastic Methods (2,991) Combinatorial Optimization (2,615) Online Algorithms (2,404) Optimization (1,521) Game Theory (1,046) Convex Optimization (864) Discrete Optimization (721) Optimal Transport (474) Sparse Optimization (416) Optimal Control (271) Global Optimization (200) Non-Convex Optimization (182) Distributed Learning (164) Approximation Algorithms (162) Multi-Objective Optimization (151) Distributed Optimization (136) Bayesian Optimization (132) Theory (109) Compressed Sensing (102) Algorithms (89) Robust Optimization (86) Submodular Optimization (77) Kernel Methods (75) Evolutionary Algorithm (72) Linear Programming (54) Tensor Decomposition (48) Bilevel Optimization (42) Integer Programming (38) Matrix Completion (33) Algorithm (21) Regularization (11)

Papers per year

1
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

The Price of Differential Privacy under Continual Observation ICML 2023 The probability flow ODE is provably fast NeurIPS 2023 The Rank-Reduced Kalman Filter: Approximate Dynamical-Low-Rank Filtering In High Dimensions NeurIPS 2023 The SKIM-FA Kernel: High-Dimensional Variable Selection and Nonlinear Interaction Discovery in Linear Time JMLR 2023 Thompson Exploration with Best Challenger Rule in Best Arm Identification ACML 2023 Thompson Sampling with Less Exploration is Fast and Optimal ICML 2023 Three-Way Trade-Off in Multi-Objective Learning: Optimization, Generalization and Conflict-Avoidance NeurIPS 2023 TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization ICLR 2023 Ties in Multiwinner Approval Voting IJCAI 2023 Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations ICML 2023 Tighter Analysis for ProxSkip ICML 2023 Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond ICML 2023 Tighter Robust Upper Bounds for Options via No-Regret Learning AAAI 2023 Tight Inapproximability for Graphical Games AAAI 2023 Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits ICML 2023 Time-Reversed Dissipation Induces Duality Between Minimizing Gradient Norm and Function Value NeurIPS 2023 Top-k data selection via distributed sample quantile inference L4DC 2023 Topological Distance Games AAAI 2023 Topological Planning with Post-unique and Unary Actions IJCAI 2023 TOT：Topology-Aware Optimal Transport for Multimodal Hate Detection AAAI 2023 Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT AAAI 2023 Toward Large Kernel Models ICML 2023 Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games NeurIPS 2023 Towards Optimal Effective Resistance Estimation NeurIPS 2023 Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes ICML 2023