Mathematics & Optimization

The Relationship Between No-Regret Learning and Online Conformal Prediction ICML 2025 The Role of Randomness in Stability ICML 2025 The Size of Teachers as a Measure of Data Complexity: PAC-Bayes Excess Risk Bounds and Scaling Laws AISTATS 2025 The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport ICML 2025 The Uniformly Rotated Mondrian Kernel AISTATS 2025 The Value of Recall in Extensive-Form Games AAAI 2025 The Z-Gromov-Wasserstein Distance JMLR 2025 Thin-Plate Spline-based Interpolation for Animation Line Inbetweening AAAI 2025 Thompson Sampling for Bandit Convex Optimisation COLT 2025 Three-view Focal Length Recovery From Homographies CVPR 2025 Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves AAAI 2025 Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent AISTATS 2025 Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold COLT 2025 Tightening Causal Bounds via Covariate-Aware Optimal Transport ICML 2025 Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity ICLR 2025 Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm IJCAI 2025 Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics ICLR 2025 Time Series Supplier Allocation via Deep Black-Litterman Model AAAI 2025 TKG-DM: Training-free Chroma Key Content Generation Diffusion Model CVPR 2025 To Each Metric Its Decoding: Post-Hoc Optimal Decision Rules of Probabilistic Hierarchical Classifiers ICML 2025 Tokenisation is NP-Complete ACL 2025 Tokenized Bandit for LLM Decoding and Alignment ICML 2025 Topological State Space Inference for Dynamical Systems L4DC 2025 Toward a Unified Theory of Gradient Descent under Generalized Smoothness ICML 2025 Toward Efficient Kernel-Based Solvers for Nonlinear PDEs ICML 2025