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

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)

Consensus Maximization for Semantic Region Correspondences CVPR 2018 Consequence-based Reasoning for Description Logics with Disjunction, Inverse Roles, Number Restrictions, and Nominals IJCAI 2018 Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids RSS 2018 Constant Regret, Generalized Mixability, and Mirror Descent NeurIPS 2018 Constrained Coalition Formation on Valuation Structures: Formal Framework, Applications, and Islands of Tractability (Extended Abstract) IJCAI 2018 Constrained Interacting Submodular Groupings ICML 2018 Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars ACL 2018 Construction of Incoherent Dictionaries via Direct Babel Function Minimization ACML 2018 Contextual Bandits for Adapting Treatment in a Mouse Model of de Novo Carcinogenesis MLHC 2018 Contextual Bandits with Stochastic Experts AISTATS 2018 Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NeurIPS 2018 Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NeurIPS 2018 Contextual Pricing for Lipschitz Buyers NeurIPS 2018 Continuous and Discrete-time Accelerated Stochastic Mirror Descent for Strongly Convex Functions ICML 2018 Continuous Relaxation of MAP Inference: A Nonconvex Perspective CVPR 2018 Continuous-time Value Function Approximation in Reproducing Kernel Hilbert Spaces NeurIPS 2018 Contour location via entropy reduction leveraging multiple information sources NeurIPS 2018 Convergence diagnostics for stochastic gradient descent with constant learning rate AISTATS 2018 Convergence guarantees for a class of non-convex and non-smooth optimization problems ICML 2018 Convergence of Cubic Regularization for Nonconvex Optimization under KL Property NeurIPS 2018 Convex Elicitation of Continuous Properties NeurIPS 2018 Convex Optimization over Intersection of Simple Sets: improved Convergence Rate Guarantees via an Exact Penalty Approach AISTATS 2018 Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing COLT 2018 Convolutional Imputation of Matrix Networks ICML 2018 Coordinate Descent Faceoff: Primal or Dual? ALT 2018