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)

Blind Demixing via Wirtinger Flow with Random Initialization AISTATS 2019 Blink: Fast Connectivity Recovery Entirely in the Data Plane NSDI 2019 Block Coordinate Regularization by Denoising NeurIPS 2019 Blocking Bandits NeurIPS 2019 Block Stability for MAP Inference AISTATS 2019 Borda Count in Collective Decision Making: A Summary of Recent Results AAAI 2019 Bottleneck Potentials in Markov Random Fields ICCV 2019 Bounding Inefficiency of Equilibria in Continuous Actions Games using Submodularity and Curvature AISTATS 2019 Branch-and-Cut-and-Price for Multi-Agent Pathfinding IJCAI 2019 Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization NeurIPS 2019 Calibration Wizard: A Guidance System for Camera Calibration Based on Modelling Geometric and Corner Uncertainty ICCV 2019 Cascaded Algorithm-Selection and Hyper-Parameter Optimization with Extreme-Region Upper Confidence Bound Bandit IJCAI 2019 Cascading Linear Submodular Bandits: Accounting for Position Bias and Diversity in Online Learning to Rank UAI 2019 Categorical Feature Compression via Submodular Optimization ICML 2019 Categorized Bandits NeurIPS 2019 Causes and Corrections for Bimodal Multi-Path Scanning With Structured Light CVPR 2019 Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback NeurIPS 2019 Certainty Equivalence is Efficient for Linear Quadratic Control NeurIPS 2019 Characterization of Convex Objective Functions and Optimal Expected Convergence Rates for SGD ICML 2019 Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Group ICML 2019 Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019 Clause Learning and New Bounds for Graph Coloring IJCAI 2019 Clipped Matrix Completion: A Remedy for Ceiling Effects AAAI 2019 Cogra: Concept-Drift-Aware Stochastic Gradient Descent for Time-Series Forecasting AAAI 2019 Combinatorial Algorithms for Optimal Design COLT 2019