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)

Reversible and irreversible bracket-based dynamics for deep graph neural networks NeurIPS 2023 Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations NeurIPS 2023 Revisiting Rolling Shutter Bundle Adjustment: Toward Accurate and Fast Solution CVPR 2023 Revisiting Sampling for Combinatorial Optimization ICML 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 Revisiting Weighted Strategy for Non-stationary Parametric Bandits AISTATS 2023 Reward Learning as Doubly Nonparametric Bandits: Optimal Design and Scaling Laws AISTATS 2023 Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways (Extended Abstract) IJCAI 2023 RF-Chord: Towards Deployable RFID Localization System for Logistic Networks NSDI 2023 Riemannian Accelerated Gradient Methods via Extrapolation AISTATS 2023 Riemannian Projection-free Online Learning NeurIPS 2023 Riemannian stochastic optimization methods avoid strict saddle points NeurIPS 2023 Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems NeurIPS 2023 RingLeader: Efficiently Offloading Intra-Server Orchestration to NICs NSDI 2023 Risk-limiting financial audits via weighted sampling without replacement UAI 2023 Robust and Fast Measure of Information via Low-Rank Representation AAAI 2023 Robust and private stochastic linear bandits ICML 2023 Robust Average-Reward Markov Decision Processes AAAI 2023 Robust Budget Pacing with a Single Sample ICML 2023 Robust High-Dimensional Low-Rank Matrix Estimation: Optimal Rate and Data-Adaptive Tuning JMLR 2023 Robust Learning for Smoothed Online Convex Optimization with Feedback Delay NeurIPS 2023 Robust Linear Regression for General Feature Distribution AISTATS 2023 Robust Lipschitz Bandits to Adversarial Corruptions NeurIPS 2023 Robust Load Balancing with Machine Learned Advice JMLR 2023 Robust Matrix Sensing in the Semi-Random Model NeurIPS 2023