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)
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming
IJCAI 2021
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach
IJCAI 2021
Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions
L4DC 2021
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions
COLT 2021
Improved Complexity Bounds in Wasserstein Barycenter Problem
AISTATS 2021
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces
NeurIPS 2021
Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP
IJCAI 2021
Improved Guarantees and a Multiple-descent Curve for Column Subset Selection and the Nystrom Method (Extended Abstract)
IJCAI 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes
NeurIPS 2021
Improved Mutual Information Estimation
AAAI 2021
Improved Penalty Method via Doubly Stochastic Gradients for Bilevel Hyperparameter Optimization
AAAI 2021
Improved Regret Bound and Experience Replay in Regularized Policy Iteration
ICML 2021
Improved Regret Bounds for Tracking Experts with Memory
NeurIPS 2021
Improved Regret Bounds of Bilinear Bandits using Action Space Analysis
ICML 2021
Improved Regret for Zeroth-Order Stochastic Convex Bandits
COLT 2021
Improved Shrinkage Prediction under a Spiked Covariance Structure
JMLR 2021
Improving approximate optimal transport distances using quantization
UAI 2021
Improving Conditional Coverage via Orthogonal Quantile Regression
NeurIPS 2021
Improving Gaussian mixture latent variable model convergence with Optimal Transport
ACML 2021
Improving Lossless Compression Rates via Monte Carlo Bits-Back Coding
ICML 2021
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding
AAAI 2021
Improving Multimodal Fusion with Hierarchical Mutual Information Maximization for Multimodal Sentiment Analysis
EMNLP 2021
Improving the Morphology and Control Policy of Self-reconfiguring Modular Robots in Dynamic Environment (Student Abstract)
AAAI 2021
Improving Welfare in One-Sided Matchings using Simple Threshold Queries
IJCAI 2021
Incentive-Aware PAC Learning
AAAI 2021