Mathematics & Optimization
19,283 papers (0 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
1
2
8
13
8
24
100
100
125
139
182
227
311
530
574
599
676
880
1,053
1,491
1,739
1,880
1,904
2,070
2,345
1,785
517
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
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 Priori Generalization Analysis of the Deep Ritz Method for Solving High Dimensional Elliptic Partial Differential Equations
COLT 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
Argument Pair Extraction with Mutual Guidance and Inter-sentence Relation Graph
EMNLP 2021
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance
ICML 2021
A Robust Loss for Point Cloud Registration
ICCV 2021
A Root of a Problem: Optimizing Single-Root Dependency Parsing
EMNLP 2021
A Runtime Analysis of Typical Decomposition Approaches in MOEA/D Framework for Many-objective Optimization Problems
IJCAI 2021
A SAT-based Resolution of Lam's Problem
AAAI 2021
A Scalable Deterministic Global Optimization Algorithm for Clustering Problems
ICML 2021