Imagen de Portada

Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dai, J. G., Deng, Tianze, Li, Yueying, Peng, Tianyi
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bayesian Inference with Shaped Deep Non-linear MLPs
por: Hanin, Boris, et al.
Publicado: (2026)

Suboptimal Performance of the Bayes Optimal Algorithm in Frequentist Best Arm Identification
por: Komiyama, Junpei
Publicado: (2022)

Optimal Scaling for the Proximal Langevin Algorithm in High Dimensions
por: Pillai, Natesh S.
Publicado: (2022)

Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective
por: Srinivasan, Vishwak, et al.
Publicado: (2025)

Algorithms and Scientific Software for Quasi-Monte Carlo, Fast Gaussian Process Regression, and Scientific Machine Learning
por: Sorokin, Aleksei G.
Publicado: (2025)

Inequalities for Optimization of Classification Algorithms: A Perspective Motivated by Diagnostic Testing
por: Patrone, Paul N., et al.
Publicado: (2025)

Anchored Langevin Algorithms
por: Gurbuzbalaban, Mert, et al.
Publicado: (2025)

Learning Optimal Search Strategies
por: Ankirchner, Stefan, et al.
Publicado: (2026)

On the Relation between Rectified Flows and Optimal Transport
por: Hertrich, Johannes, et al.
Publicado: (2025)

Recent Advances in Optimal Transport for Machine Learning
por: Montesuma, Eduardo Fernandes, et al.
Publicado: (2023)

Optimal Scheduling Algorithms for LLM Inference: Theory and Practice
por: Bari, Agrim, et al.
Publicado: (2025)

High-Order Langevin Monte Carlo Algorithms
por: Dang, Thanh, et al.
Publicado: (2025)

Scalable Machine Learning Algorithms using Path Signatures
por: Tóth, Csaba
Publicado: (2025)

A User's Guide to Sampling Strategies for Sliced Optimal Transport
por: Sisouk, Keanu, et al.
Publicado: (2025)

Optimal Transport-Based Domain Adaptation for Rotated Linear Regression
por: Britos, Brian, et al.
Publicado: (2025)

Expected Batch Optimal Transport Plans and Consequences for Flow Matching
por: Boïté, Samuel, et al.
Publicado: (2026)

Variational Smoothing and Inference for SDEs from Sparse Data with Dynamic Neural Flows
por: Wang, Yu, et al.
Publicado: (2026)

Differentiable Expectation-Maximisation and Applications to Gaussian Mixture Model Optimal Transport
por: Boïté, Samuel, et al.
Publicado: (2025)

Fooling Algorithms in Non-Stationary Bandits using Belief Inertia
por: Mendelson, Gal, et al.
Publicado: (2025)

Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions
por: Cheng, Xiang, et al.
Publicado: (2023)

Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework
por: Chen, Zaiwei, et al.
Publicado: (2026)

Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors
por: Labarthe, Aldric
Publicado: (2026)

Dual Filter: A Transformer-like Inference Architecture for Hidden Markov Models
por: Chang, Heng-Sheng, et al.
Publicado: (2025)

Regime-Switching Langevin Monte Carlo Algorithms
por: Wang, Xiaoyu, et al.
Publicado: (2025)

Non-Reversible Langevin Algorithms for Constrained Sampling
por: Du, Hengrong, et al.
Publicado: (2025)

Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version
por: Leão, Dorival, et al.
Publicado: (2026)

Optimality of Approximate Message Passing Algorithms for Spiked Matrix Models with Rotationally Invariant Noise
por: Dudeja, Rishabh, et al.
Publicado: (2024)

On the Equivalence of Random Network Distillation, Deep Ensembles, and Bayesian Inference
por: Zanger, Moritz A., et al.
Publicado: (2026)

Multiscale Flow for Robust and Optimal Cosmological Analysis
por: Dai, Biwei, et al.
Publicado: (2023)

Bayesian Inference with Deep Weakly Nonlinear Networks
por: Hanin, Boris, et al.
Publicado: (2024)

Interacting Particle Langevin Algorithm for Maximum Marginal Likelihood Estimation
por: Akyildiz, Ö. Deniz, et al.
Publicado: (2023)

Enabling Probabilistic Learning on Manifolds through Double Diffusion Maps
por: Giovanis, Dimitris G, et al.
Publicado: (2025)

On Convergence of the Alternating Directions SGHMC Algorithm
por: Ghosh, Soumyadip, et al.
Publicado: (2024)

Concentration of the Langevin Algorithm's Stationary Distribution
por: Altschuler, Jason M., et al.
Publicado: (2022)

Near-Optimal Clustering in Mixture of Markov Chains
por: Lee, Junghyun, et al.
Publicado: (2025)

Optimal Transportation and Alignment Between Gaussian Measures
por: Dandapanthula, Sanjit, et al.
Publicado: (2025)

Mind the Gap: Navigating Inference with Optimal Transport Maps
por: Algren, Malte, et al.
Publicado: (2025)

Constrained Density Estimation via Optimal Transport
por: Hu, Yinan, et al.
Publicado: (2026)

Model Predictive Control is Almost Optimal for Restless Bandit
por: Gast, Nicolas, et al.
Publicado: (2024)

Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport
por: Ponnoprat, Donlapark, et al.
Publicado: (2026)