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)

Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NeurIPS 2019 Fast and Provable ADMM for Learning with Generative Priors NeurIPS 2019 Fast and Robust Shortest Paths on Manifolds Learned from Data AISTATS 2019 Fast and Stable Maximum Likelihood Estimation for Incomplete Multinomial Models ICML 2019 Fast Decomposable Submodular Function Minimization using Constrained Total Variation NeurIPS 2019 Fast determinantal point processes via distortion-free intermediate sampling COLT 2019 Faster Algorithms for Binary Matrix Factorization ICML 2019 Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds AISTATS 2019 Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization AAAI 2019 Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization ICML 2019 Faster width-dependent algorithm for mixed packing and covering LPs NeurIPS 2019 Fast Iterative Combinatorial Auctions via Bayesian Learning AAAI 2019 Fast Low-rank Metric Learning for Large-scale and High-dimensional Data NeurIPS 2019 Fast Parallel Algorithms for Statistical Subset Selection Problems NeurIPS 2019 Fast PMI-Based Word Embedding with Efficient Use of Unobserved Patterns AAAI 2019 Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression NeurIPS 2019 Fast Proximal Gradient Descent for A Class of Non-convex and Non-smooth Sparse Learning Problems UAI 2019 Fast Sparse Group Lasso NeurIPS 2019 Fast Stochastic Algorithms for Low-rank and Nonsmooth Matrix Problems AISTATS 2019 Fast structure learning with modular regularization NeurIPS 2019 Feature subset selection for the multinomial logit model via mixed-integer optimization AISTATS 2019 FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms ACL 2019 Finding Mixed Nash Equilibria of Generative Adversarial Networks ICML 2019 Finding Optimal Solutions in HTN Planning - A SAT-based Approach IJCAI 2019 Finding Statistically Significant Interactions between Continuous Features IJCAI 2019