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)

Newton-LESS: Sparsification without Trade-offs for the Sketched Newton Update NeurIPS 2021 Newton Method over Networks is Fast up to the Statistical Precision ICML 2021 Newton Optimization on Helmholtz Decomposition for Continuous Games AAAI 2021 NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs NeurIPS 2021 Noise Robust Pitch Stylization Using Minimum Mean Absolute Error Criterion Interspeech 2021 Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization AISTATS 2021 Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm NeurIPS 2021 Non-asymptotic convergence bounds for Wasserstein approximation using point clouds NeurIPS 2021 Non-conservative Design of Robust Tracking Controllers Based on Input-output Data L4DC 2021 Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis NeurIPS 2021 Non-Euclidean Differentially Private Stochastic Convex Optimization COLT 2021 Non-Exponentially Weighted Aggregation: Regret Bounds for Unbounded Loss Functions ICML 2021 Nonlinear Data-Enabled Prediction and Control L4DC 2021 Nonparametric Continuous Sensor Registration JMLR 2021 Non-parametric Quantile Regression via the K-NN Fused Lasso JMLR 2021 Non-Parametric Stochastic Sequential Assignment With Random Arrival Times IJCAI 2021 Non-PSD matrix sketching with applications to regression and optimization UAI 2021 Non-uniform Consistency of Online Learning with Random Sampling ALT 2021 No-regret Algorithms for Capturing Events in Poisson Point Processes ICML 2021 No-regret approximate inference via Bayesian optimisation UAI 2021 No-regret Online Learning over Riemannian Manifolds NeurIPS 2021 Normal Integration via Inverse Plane Fitting With Minimum Point-to-Plane Distance CVPR 2021 No-substitution k-means Clustering with Adversarial Order ALT 2021 NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem AAAI 2021 Oblivious Sketching-based Central Path Method for Linear Programming ICML 2021