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)

Multi-View 3D Reconstruction of a Texture-Less Smooth Surface of Unknown Generic Reflectance CVPR 2021 Multiwavelet-based Operator Learning for Differential Equations NeurIPS 2021 NAS-Bench-x11 and the Power of Learning Curves NeurIPS 2021 NCUEE-NLP at MEDIQA 2021: Health Question Summarization Using PEGASUS Transformers NAACL 2021 Nearest neighbor search under uncertainty UAI 2021 Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021 Near-Optimal Algorithms for Explainable k-Medians and k-Means ICML 2021 Near-Optimal Confidence Sequences for Bounded Random Variables ICML 2021 Near-Optimal Data Source Selection for Bayesian Learning L4DC 2021 Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021 Near-Optimal Entrywise Anomaly Detection for Low-Rank Matrices with Sub-Exponential Noise ICML 2021 Near-Optimal Entrywise Sampling of Numerically Sparse Matrices COLT 2021 Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness NeurIPS 2021 Near-Optimal MNL Bandits Under Risk Criteria AAAI 2021 Necessarily Optimal One-Sided Matchings AAAI 2021 Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021 NEO: Non Equilibrium Sampling on the Orbits of a Deterministic Transform NeurIPS 2021 Network Inference and Influence Maximization from Samples ICML 2021 Neural Learning of One-of-Many Solutions for Combinatorial Problems in Structured Output Spaces ICLR 2021 Neural Lyapunov Redesign L4DC 2021 Neural Splines: Fitting 3D Surfaces With Infinitely-Wide Neural Networks CVPR 2021 Neuron Matching in C. elegans With Robust Approximate Linear Regression Without Correspondence WACV 2021 Never Go Full Batch (in Stochastic Convex Optimization) NeurIPS 2021 New Algorithms for Japanese Residency Matching IJCAI 2021 New Length Dependent Algorithm for Maximum Satisfiability Problem AAAI 2021