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)

A Novel Sequential Coreset Method for Gradient Descent Algorithms ICML 2021 Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics AAAI 2021 A Nullspace Property for Subspace-Preserving Recovery ICML 2021 Anytime Heuristic and Monte Carlo Methods for Large-Scale Simultaneous Coalition Structure Generation and Assignment AAAI 2021 Anytime Multi-Agent Path Finding via Large Neighborhood Search IJCAI 2021 A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021 A Partitioned-Block Frequency-Domain Adaptive Kalman Filter for Stereophonic Acoustic Echo Cancellation Interspeech 2021 Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components NeurIPS 2021 Approximate Distributionally Robust Nonlinear Optimization with Application to Model Predictive Control: A Functional Approach L4DC 2021 Approximate Group Fairness for Clustering ICML 2021 Approximate implication with d-separation UAI 2021 Approximate Message Passing with Spectral Initialization for Generalized Linear Models AISTATS 2021 Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021 Approximate optimization of convex functions with outlier noise NeurIPS 2021 Approximating the Permanent with Deep Rejection Sampling NeurIPS 2021 Approximating the Shapley Value Using Stratified Empirical Bernstein Sampling IJCAI 2021 Approximation Algorithms for Orthogonal Non-negative Matrix Factorization AISTATS 2021 Approximation Algorithms for Socially Fair Clustering COLT 2021 Approximation Theory Based Methods for RKHS Bandits ICML 2021 A Precise Performance Analysis of Support Vector Regression ICML 2021 A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021 A Quasiconvex Formulation for Radial Cameras CVPR 2021 ARAPReg: An As-Rigid-As Possible Regularization Loss for Learning Deformable Shape Generators ICCV 2021 A Regression Approach to Learning-Augmented Online Algorithms NeurIPS 2021 Are We Forgetting about Compositional Optimisers in Bayesian Optimisation? JMLR 2021