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)

Group-Fair Online Allocation in Continuous Time NeurIPS 2020 Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint AISTATS 2020 Guided Learning of Nonconvex Models through Successive Functional Gradient Optimization ICML 2020 Guiding CDCL SAT Search via Random Exploration amid Conflict Depression AAAI 2020 Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities COLT 2020 Hamiltonian Monte Carlo Swindles AISTATS 2020 Hamilton-Jacobi-Bellman Equations for Q-Learning in Continuous Time L4DC 2020 Hard Examples for Common Variable Decision Heuristics AAAI 2020 Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models COLT 2020 Hard Shape-Constrained Kernel Machines NeurIPS 2020 Hedging in games: Faster convergence of external and swap regrets NeurIPS 2020 Hiding in Multilayer Networks AAAI 2020 Hierarchical Clustering: A 0.585 Revenue Approximation COLT 2020 Hierarchically Robust Representation Learning CVPR 2020 High Dimensional Discrete Integration over the Hypergrid UAI 2020 High-dimensional Gaussian graphical models on network-linked data JMLR 2020 High-Dimensional Interactions Detection with Sparse Principal Hessian Matrix JMLR 2020 High-dimensional quantile tensor regression JMLR 2020 High-Dimensional Sparse Linear Bandits NeurIPS 2020 Highly smooth minimization of non-smooth problems COLT 2020 High probability guarantees for stochastic convex optimization COLT 2020 Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics NeurIPS 2020 How Good is SGD with Random Shuffling? COLT 2020 How many samples is a good initial point worth in Low-rank Matrix Recovery? NeurIPS 2020 How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics AAAI 2020