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)

Almost Envy-Freeness in Group Resource Allocation IJCAI 2019 Almost surely constrained convex optimization ICML 2019 A Local Block Coordinate Descent Algorithm for the CSC Model CVPR 2019 Alternating Minimizations Converge to Second-Order Optimal Solutions ICML 2019 A Memetic Approach for Sequential Security Games on a Plane with Moving Targets AAAI 2019 A Memoization Framework for Scaling Submodular Optimization to Large Scale Problems AISTATS 2019 A minimax near-optimal algorithm for adaptive rejection sampling ALT 2019 A Modified Algorithm for Multiple Input Spectrogram Inversion Interspeech 2019 Amortized Bethe Free Energy Minimization for Learning MRFs NeurIPS 2019 A Multi-Pairwise Extension of Procrustes Analysis for Multilingual Word Translation EMNLP 2019 An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sums NeurIPS 2019 An adaptive Mirror-Prox method for variational inequalities with singular operators NeurIPS 2019 An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors NeurIPS 2019 Analysis of Langevin Monte Carlo via Convex Optimization JMLR 2019 Analysis of Thompson Sampling for Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms AISTATS 2019 An Efficient Algorithm for Skeptical Preferred Acceptance in Dynamic Argumentation Frameworks IJCAI 2019 An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover IJCAI 2019 An Efficient Schmidt-EKF for 3D Visual-Inertial SLAM CVPR 2019 An Efficient Two Step Algorithm for High Dimensional Change Point Regression Models Without Grid Search JMLR 2019 An Embedding Framework for Consistent Polyhedral Surrogates NeurIPS 2019 An Equivalence between Wagering and Fair-Division Mechanisms AAAI 2019 A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019 A New Approach to Laplacian Solvers and Flow Problems JMLR 2019 A new dog learns old tricks: RL finds classic optimization algorithms ICLR 2019 A New Perspective on Pool-Based Active Classification and False-Discovery Control NeurIPS 2019