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)

Towards Quantum Machine Learning for Constrained Combinatorial Optimization: a Quantum QAP Solver ICML 2023 Towards Stable and Efficient Adversarial Training against l_1 Bounded Adversarial Attacks ICML 2023 Tractable and Near-Optimal Adversarial Algorithms for Robust Estimation in Contaminated Gaussian Models JMLR 2023 Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023 Trading-off price for data quality to achieve fair online allocation NeurIPS 2023 Training Deep Surrogate Models with Large Scale Online Learning ICML 2023 Training neural operators to preserve invariant measures of chaotic attractors NeurIPS 2023 Transfer Learning Enhanced DeepONet for Long-Time Prediction of Evolution Equations AAAI 2023 Transformer-Based Learned Optimization CVPR 2023 Transformer-based Stagewise Decomposition for Large-Scale Multistage Stochastic Optimization ICML 2023 Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters NeurIPS 2023 Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs AAAI 2023 Triple Eagle: Simple, Fast and Practical Budget-Feasible Mechanisms NeurIPS 2023 Truncating Trajectories in Monte Carlo Reinforcement Learning ICML 2023 Truthful Mechanisms for Steiner Tree Problems AAAI 2023 TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation AISTATS 2023 Tucker Decomposition with Frequency Attention for Temporal Knowledge Graph Completion ACL 2023 Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy ICML 2023 Two-Scale Gradient Descent Ascent Dynamics Finds Mixed Nash Equilibria of Continuous Games: A Mean-Field Perspective ICML 2023 Two-Stage Predict+Optimize for MILPs with Unknown Parameters in Constraints NeurIPS 2023 U-Calibration: Forecasting for an Unknown Agent COLT 2023 Ultrafast Euclidean Shortest Path Computation Using Hub Labeling AAAI 2023 Unbalanced CO-optimal Transport AAAI 2023 Unbalanced Low-rank Optimal Transport Solvers NeurIPS 2023 Unbalanced Optimal Transport: A Unified Framework for Object Detection CVPR 2023