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)
The Smoothed Complexity of Computing Kemeny and Slater Rankings
AAAI 2021
The Sparse Vector Technique, Revisited
COLT 2021
The Spatio-Temporal Poisson Point Process: A Simple Model for the Alignment of Event Camera Data
ICCV 2021
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks
ICML 2021
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits
AAAI 2021
The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound
IJCAI 2021
The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation
NeurIPS 2021
The Value of Information When Deciding What to Learn
NeurIPS 2021
Think Global and Act Local: Bayesian Optimisation over High-Dimensional Categorical and Mixed Search Spaces
ICML 2021
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss
COLT 2021
Thompson Sampling Algorithms for Cascading Bandits
JMLR 2021
Thompson Sampling for Bandits with Clustered Arms
IJCAI 2021
Three Operator Splitting with a Nonconvex Loss Function
ICML 2021
Three Operator Splitting with Subgradients, Stochastic Gradients, and Adaptive Learning Rates
NeurIPS 2021
Thresholded Adaptive Validation: Tuning the Graphical Lasso for Graph Recovery
AISTATS 2021
TIDOT: A Teacher Imitation Learning Approach for Domain Adaptation with Optimal Transport
IJCAI 2021
Tighter Expected Generalization Error Bounds via Wasserstein Distance
NeurIPS 2021
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits
AISTATS 2021
Tight sampling and discarding bounds for scenario programs with an arbitrary number of removed samples
L4DC 2021
Timeline Summarization based on Event Graph Compression via Time-Aware Optimal Transport
EMNLP 2021
T-LoHo: A Bayesian Regularization Model for Structured Sparsity and Smoothness on Graphs
NeurIPS 2021
TMCOSS: Thresholded Multi-Criteria Online Subset Selection for Data-Efficient Autonomous Driving
ICCV 2021
TNASP: A Transformer-based NAS Predictor with a Self-evolution Framework
NeurIPS 2021
Topic-Guided Abstractive Multi-Document Summarization
EMNLP 2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy
ICML 2021