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)

Boosting Learning for LDPC Codes to Improve the Error-Floor Performance NeurIPS 2023 Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces NeurIPS 2023 BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization NeurIPS 2023 Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model AISTATS 2023 Breaking the Lower Bound with (Little) Structure: Acceleration in Non-Convex Stochastic Optimization with Heavy-Tailed Noise COLT 2023 Breeding Machine Translations: Evolutionary approach to survive and thrive in the world of automated evaluation ACL 2023 Bringing regularized optimal transport to lightspeed: a splitting method adapted for GPUs NeurIPS 2023 Buffered Asynchronous SGD for Byzantine Learning JMLR 2023 Building Rearticulable Models for Arbitrary 3D Objects From 4D Point Clouds CVPR 2023 Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark NeurIPS 2023 Bures-Wasserstein Barycenters and Low-Rank Matrix Recovery AISTATS 2023 Buying Information for Stochastic Optimization ICML 2023 BWoS: Formally Verified Block-based Work Stealing for Parallel Processing OSDI 2023 Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NeurIPS 2023 Byzantine-Tolerant Methods for Distributed Variational Inequalities NeurIPS 2023 Can You Improve My Code? Optimizing Programs with Local Search IJCAI 2023 Cascading Bandits: Optimizing Recommendation Frequency in Delayed Feedback Environments NeurIPS 2023 Cascading Contextual Assortment Bandits NeurIPS 2023 Causal Effect Identification in Uncertain Causal Networks NeurIPS 2023 Chordal Averaging on Flag Manifolds and Its Applications ICCV 2023 Cilantro: Performance-Aware Resource Allocation for General Objectives via Online Feedback OSDI 2023 Circuit Minimization with QBF-Based Exact Synthesis AAAI 2023 City-Scale Pollution Aware Traffic Routing by Sampling Max Flows Using MCMC AAAI 2023 Class Fairness in Online Matching AAAI 2023 CLIP-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential Experiments NeurIPS 2023