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 Bounds for Online Facility Location with Predictions
AAAI 2025
Improved dependence on coherence in eigenvector and eigenvalue estimation error bounds
AISTATS 2025
Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants
AAAI 2025
Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
ICML 2025
Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
ICML 2025
Improved Lower Bounds for First-order Stochastic Non-convex Optimization under Markov Sampling
ICML 2025
Improved Margin Generalization Bounds for Voting Classifiers
COLT 2025
Improved Maximin Share Approximations for Chores by Bin Packing
AAAI 2025
Improved MMS Approximations for Few Agent Types
IJCAI 2025
Improved Online Confidence Bounds for Multinomial Logistic Bandits
ICML 2025
Improved Rank Aggregation Under Fairness Constraint
IJCAI 2025
Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance
ICML 2025
Improved Regret Bounds for Online Fair Division with Bandit Learning
AAAI 2025
Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
ICML 2025
Improving Community-Participated Patrol for Anti-Poaching
AAAI 2025
Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
ICLR 2025
Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averaging
ICML 2025
Improving Generalization with Flat Hilbert Bayesian Inference
ICML 2025
Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks
AAAI 2025
Improving Stochastic Cubic Newton with Momentum
AISTATS 2025
Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT
AAAI 2025
Inapproximability of Optimal Multi-Agent Pathfinding Problems
AAAI 2025
Incentives for Early Arrival in Cooperative Games (Extended Abstract)
IJCAI 2025
In-Context Linear Regression Demystified: Training Dynamics and Mechanistic Interpretability of Multi-Head Softmax Attention
ICML 2025
Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition
AAAI 2025