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 Axiomatic View of the Parimutuel Consensus Mechanism IJCAI 2018 An efficient distributed learning algorithm based on effective local functional approximations JMLR 2018 An Efficient Pruning Algorithm for Robust Isotonic Regression NeurIPS 2018 An Empirical Evaluation of Sketched SVD and its Application to Leverage Score Ordering ACML 2018 An Estimate Sequence for Geodesically Convex Optimization COLT 2018 A New and Flexible Approach to the Analysis of Paired Comparison Data JMLR 2018 An Exact Algorithm for Maximum k-Plexes in Massive Graphs IJCAI 2018 An explicit analysis of the entropic penalty in linear programming COLT 2018 An FPTAS for Computing Nash Equilibrium in Resource Graph Games IJCAI 2018 An Information-Theoretic Analysis for Thompson Sampling with Many Actions NeurIPS 2018 An Iterative, Sketching-based Framework for Ridge Regression ICML 2018 An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization COLT 2018 An Optimization Approach to Learning Falling Rule Lists AISTATS 2018 An Optimization Framework for Recovery of Speech from Phase-Encoded Spectrograms Interspeech 2018 An Order-based Algorithm for Learning Structure of Bayesian Networks PGM 2018 A Note on Quickly Sampling a Sparse Matrix with Low Rank Expectation JMLR 2018 Anytime Focal Search with Applications IJCAI 2018 Approximate message passing for amplitude based optimization ICML 2018 Approximate Nearest Neighbors in Limited Space COLT 2018 Approximate Ranking from Pairwise Comparisons AISTATS 2018 Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection JMLR 2018 Approximating Fair Queueing on Reconfigurable Switches NSDI 2018 Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models PGM 2018 Approximation algorithms for stochastic clustering NeurIPS 2018 Approximation Guarantees for Adaptive Sampling ICML 2018