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)

Low Resource Quadratic Forms for Knowledge Graph Embeddings EMNLP 2021 L-SVRG and L-Katyusha with Arbitrary Sampling JMLR 2021 LTL-Constrained Steady-State Policy Synthesis IJCAI 2021 Machine learning structure preserving brackets for forecasting irreversible processes NeurIPS 2021 Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites IJCAI 2021 Majorizing Measures, Sequential Complexities, and Online Learning COLT 2021 Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths ICCV 2021 Making the most of your day: online learning for optimal allocation of time NeurIPS 2021 Making transport more robust and interpretable by moving data through a small number of anchor points ICML 2021 Manipulation of k-Coalitional Games on Social Networks IJCAI 2021 Margin-Independent Online Multiclass Learning via Convex Geometry NeurIPS 2021 Market-Based Explanations of Collective Decisions AAAI 2021 Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021 Matrix Completion with Model-free Weighting ICML 2021 Matrix encoding networks for neural combinatorial optimization NeurIPS 2021 Matrix games with bandit feedback UAI 2021 Maximin Fairness with Mixed Divisible and Indivisible Goods AAAI 2021 Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions ACML 2021 Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT AISTATS 2021 Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations ACML 2021 Mean Field Equilibrium in Multi-Armed Bandit Game with Continuous Reward IJCAI 2021 Measure Transport with Kernel Stein Discrepancy AISTATS 2021 Measuring the relative importance of full text sections for information retrieval from scientific literature. NAACL 2021 Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering NeurIPS 2021 Mercer Features for Efficient Combinatorial Bayesian Optimization AAAI 2021