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
2
6
6
5
16
67
72
80
102
133
171
219
398
425
440
487
649
812
1,162
1,353
1,487
1,474
1,600
1,870
1,441
372
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Towards Decoding as Continuous Optimisation in Neural Machine Translation
EMNLP 2017
Tracking Objects with Higher Order Interactions via Delayed Column Generation
AISTATS 2017
Training Deep Networks without Learning Rates Through Coin Betting
NeurIPS 2017
Transfer Learning and Distillation Techniques to Improve the Acoustic Modeling of Low Resource Languages
Interspeech 2017
Translation Synchronization via Truncated Least Squares
NeurIPS 2017
Truncated Max-Of-Convex Models
CVPR 2017
Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect
JMLR 2017
Unified representation of tractography and diffusion-weighted MRI data using sparse multidimensional arrays
NeurIPS 2017
Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques
JMLR 2017
Unsupervised Sequential Sensor Acquisition
AISTATS 2017
Using Constraint Programming to solve a Cryptanalytic Problem
IJCAI 2017
Voting by sequential elimination with few voters
IJCAI 2017
Weakening Covert Networks by Minimizing Inverse Geodesic Length
IJCAI 2017
Welfare Guarantees from Data
NeurIPS 2017
When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent
NeurIPS 2017
When Security Games Hit Traffic: Optimal Traffic Enforcement Under One Sided Uncertainty
IJCAI 2017
Which is the Fairest (Rent Division) of Them All? [Extended Abstract]
IJCAI 2017
XOR-Sampling for Network Design with Correlated Stochastic Events
IJCAI 2017
ZigZag: A New Approach to Adaptive Online Learning
COLT 2017
Zonotope Hit-and-run for Efficient Sampling from Projection DPPs
ICML 2017
A Bandit Framework for Strategic Regression
NeurIPS 2016
A Bounded p-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors
JMLR 2016
A Box-Constrained Approach for Hard Permutation Problems
ICML 2016
Accelerated Stochastic Gradient Descent for Minimizing Finite Sums
AISTATS 2016
Accelerating Online Convex Optimization via Adaptive Prediction
AISTATS 2016