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)

An Efficient Low-Rank Tensors Representation for Algorithms in Complex Probabilistic Graphical Models PGM 2020 An efficient nonconvex reformulation of stagewise convex optimization problems NeurIPS 2020 An Empirical Investigation of Beam-Aware Training in Supertagging EMNLP 2020 An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NeurIPS 2020 An Exact Single-Agent Task Selection Algorithm for the Crowdsourced Logistics IJCAI 2020 An Implicit Form of Krasulina's k-PCA Update without the Orthonormality Constraint AAAI 2020 An Improved Latent Low Rank Representation for Automatic Subspace Clustering IJCAI 2020 An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems AAAI 2020 An Inverse-free Truncated Rayleigh-Ritz Method for Sparse Generalized Eigenvalue Problem AISTATS 2020 An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles IJCAI 2020 An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays AISTATS 2020 An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020 A Novel Approach for Constrained Optimization in Graphical Models NeurIPS 2020 A novel variational form of the Schatten-p quasi-norm NeurIPS 2020 A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems AAAI 2020 APKeep: Realtime Verification for Real Networks NSDI 2020 Apprenticeship Learning via Frank-Wolfe AAAI 2020 Approval-Based Apportionment AAAI 2020 Approximate Heavily-Constrained Learning with Lagrange Multiplier Models NeurIPS 2020 Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types IJCAI 2020 Approximating shapes in images with low-complexity polygons CVPR 2020 Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions ICML 2020 A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players AISTATS 2020 A Practical Riemannian Algorithm for Computing Dominant Generalized Eigenspace UAI 2020 apricot: Submodular selection for data summarization in Python JMLR 2020