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)

ESCAPED: Efficient Secure and Private Dot Product Framework for Kernel-based Machine Learning Algorithms with Applications in Healthcare AAAI 2021 Escape saddle points by a simple gradient-descent based algorithm NeurIPS 2021 Escaping Local Optima with Non-Elitist Evolutionary Algorithms AAAI 2021 Escaping Saddle Points with Compressed SGD NeurIPS 2021 Estimating $α$-Rank from A Few Entries with Low Rank Matrix Completion ICML 2021 Estimating High Order Gradients of the Data Distribution by Denoising NeurIPS 2021 Estimation and Inference for High Dimensional Generalized Linear Models: A Splitting and Smoothing Approach JMLR 2021 Ethical Dilemmas in Strategic Games AAAI 2021 Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021 Evolutionary Approach for AutoAugment Using the Thermodynamical Genetic Algorithm AAAI 2021 Evolutionary Gradient Descent for Non-convex Optimization IJCAI 2021 Evolution Strategies for Approximate Solution of Bayesian Games AAAI 2021 Exact and approximate hierarchical clustering using A* UAI 2021 Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries COLT 2021 Expanding Boundaries of Gap Safe Screening JMLR 2021 Experimental Design for Regret Minimization in Linear Bandits AISTATS 2021 Explicit loss asymptotics in the gradient descent training of neural networks NeurIPS 2021 Exploiting Chain Rule and Bayes' Theorem to Compare Probability Distributions NeurIPS 2021 Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approach NeurIPS 2021 Exploiting Sparsity for Neural Network Verification L4DC 2021 Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory AAAI 2021 Exponential Convergence Rates of Classification Errors on Learning with SGD and Random Features AISTATS 2021 Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing COLT 2021 Extendability of causal graphical models: Algorithms and computational complexity UAI 2021 Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice ICCV 2021