Copertina

Admission Control of Quasi-Reversible Queueing Systems: Optimization and Reinforcement Learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Comte, Céline, Moyal, Pascal
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Optimization and Control Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach
di: Alahyane, Abdelkrim, et al.
Pubblicazione: (2026)

Optimizing Asynchronous Federated Learning: A Delicate Trade-Off Between Model-Parameter Staleness and Update Frequency
di: Alahyane, Abdelkrim, et al.
Pubblicazione: (2025)

Score-Aware Policy-Gradient and Performance Guarantees using Local Lyapunov Stability
di: Comte, Céline, et al.
Pubblicazione: (2023)

Online Learning and Optimization for Queues with Unknown Demand Curve and Service Distribution
di: Chen, Xinyun, et al.
Pubblicazione: (2023)

Learning-Based Pricing and Matching for Two-Sided Queues
di: Yang, Zixian, et al.
Pubblicazione: (2024)

Wasserstein Formulation of Reinforcement Learning. An Optimal Transport Perspective on Policy Optimization
di: Dus, Mathias
Pubblicazione: (2026)

Reinforcement Learning with Random Time Horizons
di: Borrell, Enric Ribera, et al.
Pubblicazione: (2025)

Value Mirror Descent for Reinforcement Learning
di: Jia, Zhichao, et al.
Pubblicazione: (2026)

Reinforcement Learning and Regret Bounds for Admission Control
di: Weber, Lucas, et al.
Pubblicazione: (2024)

A Generalization Result for Convergence in Learning-to-Optimize
di: Sucker, Michael, et al.
Pubblicazione: (2024)

Convergence of Actor-Critic Learning for Mean Field Games and Mean Field Control in Continuous Spaces
di: Fouque, Jean-Pierre, et al.
Pubblicazione: (2025)

Service Rate Control in Queues with Abandonments
di: Wu, Runhua, et al.
Pubblicazione: (2025)

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
di: Yang, Zixian, et al.
Pubblicazione: (2025)

A Distributional View of High Dimensional Optimization
di: Benning, Felix
Pubblicazione: (2025)

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

Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
di: Cory-Wright, Ryan, et al.
Pubblicazione: (2025)

Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks
di: Hu, Jie, et al.
Pubblicazione: (2024)

Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting
di: Ustimenko, Aleksei, et al.
Pubblicazione: (2023)

Data-driven Multistage Distributionally Robust Linear Optimization with Nested Distance
di: Gao, Rui, et al.
Pubblicazione: (2024)

Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization
di: Kassing, Sebastian, et al.
Pubblicazione: (2025)

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
di: Narasimha, Dheeraj, et al.
Pubblicazione: (2025)

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
di: Sato, Kanji, et al.
Pubblicazione: (2022)

When Machine Learning Meets Importance Sampling: A More Efficient Rare Event Estimation Approach
di: Zhao, Ruoning, et al.
Pubblicazione: (2025)

Approximate Computation of Loss Probability for Queueing System with Capacity Sharing Discipline
di: Yashina, M. V., et al.
Pubblicazione: (2024)

Ergodic Risk Sensitive Control of Markovian Multiclass Many-Server Queues with Abandonment
di: Anugu, Sumith Reddy, et al.
Pubblicazione: (2024)

Randomized Routing to Remote Queues
di: He, Shuangchi, et al.
Pubblicazione: (2025)

Hidden Convexity in Queueing Models
di: Chen, Xin, et al.
Pubblicazione: (2025)

Rates of Convergence in the Central Limit Theorem for Markov Chains, with an Application to TD Learning
di: Srikant, R.
Pubblicazione: (2024)

Set Invariance with Probability One for Controlled Diffusion: Score-based Approach
di: Wang, Wenqing, et al.
Pubblicazione: (2025)

Dynamic Pricing and Matching for Two-Sided Queues
di: Varma, Sushil Mahavir, et al.
Pubblicazione: (2019)

Non-convex entropic mean-field optimization via Best Response flow
di: Lascu, Razvan-Andrei, et al.
Pubblicazione: (2025)

ODE approximation for the Adam algorithm: General and overparametrized setting
di: Dereich, Steffen, et al.
Pubblicazione: (2025)

Flatness-Aware Stochastic Gradient Langevin Dynamics
di: Bruno, Stefano, et al.
Pubblicazione: (2025)

Representative Action Selection for Large Action Space Bandit Families
di: Zhou, Quan, et al.
Pubblicazione: (2025)

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

Benchmarking Diffusion Annealing-Based Bayesian Inverse Problem Solvers
di: Crafts, Evan Scope, et al.
Pubblicazione: (2025)

A stochastic gradient descent algorithm with random search directions
di: Gbaguidi, Eméric
Pubblicazione: (2025)

Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
di: Dang, Thanh, et al.
Pubblicazione: (2025)

Representative Action Selection for Large Action Space: From Bandits to MDPs
di: Zhou, Quan, et al.
Pubblicazione: (2025)

Wasserstein Convergence of Score-based Generative Models under Semiconvexity and Discontinuous Gradients
di: Bruno, Stefano, et al.
Pubblicazione: (2025)