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)
An Improved Upper Bound for SAT
AAAI 2021
An Inertial Newton Algorithm for Deep Learning
JMLR 2021
An Information-Theoretic Characterization of Morphological Fusion
EMNLP 2021
An Information-Theoretic Framework for Unifying Active Learning Problems
AAAI 2021
An Integer Linear Programming Framework for Mining Constraints from Data
ICML 2021
An LP-Based Approach for Goal Recognition as Planning
AAAI 2021
A No-go Theorem for Robust Acceleration in the Hyperbolic Plane
NeurIPS 2021
A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations
NeurIPS 2021
An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives
NeurIPS 2021
An Online Riemannian PCA for Stochastic Canonical Correlation Analysis
NeurIPS 2021
An online semi-definite programming with a generalised log-determinant regularizer and its applications
ACML 2021
An Online Sequential Test for Qualitative Treatment Effects
JMLR 2021
An Optimal Reduction of TV-Denoising to Adaptive Online Learning
AISTATS 2021
An Optimistic Acceleration of AMSGrad for Nonconvex Optimization
ACML 2021
A Note on Sparse Generalized Eigenvalue Problem
NeurIPS 2021
A novel notion of barycenter for probability distributions based on optimal weak mass transport
NeurIPS 2021
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
Application of kernel hypothesis testing on set-valued data
UAI 2021
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
NeurIPS 2021