Imagen de Portada

Online Packet Scheduling with Deadlines and Learning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Genalti, Gianmarco, Azize, Achraf, Perchet, Vianney
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Learning-Augmented Online Packet Scheduling with Deadlines
por: Liang, Ya-Chun, et al.
Publicado: (2023)

Non-clairvoyant Scheduling with Partial Predictions
por: Benomar, Ziyad, et al.
Publicado: (2024)

Optimal Best Arm Identification under Differential Privacy
por: Jourdan, Marc, et al.
Publicado: (2025)

Learning in Prophet Inequalities with Noisy Observations
por: Kim, Jung-hun, et al.
Publicado: (2026)

Instance-dependent Stochastic Lipschitz bandit
por: Potfer, Marius, et al.
Publicado: (2026)

On Tradeoffs in Learning-Augmented Algorithms
por: Benomar, Ziyad, et al.
Publicado: (2025)

Some Targets Are Harder to Identify than Others: Quantifying the Target-dependent Membership Leakage
por: Azize, Achraf, et al.
Publicado: (2024)

The Value of Reward Lookahead in Reinforcement Learning
por: Merlis, Nadav, et al.
Publicado: (2024)

Concentrated Differential Privacy for Bandits
por: Azize, Achraf, et al.
Publicado: (2023)

Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
por: Potfer, Marius, et al.
Publicado: (2025)

A survey on multi-player bandits
por: Boursier, Etienne, et al.
Publicado: (2022)

Covariance-adapting algorithm for semi-bandits with application to sparse rewards
por: Perrault, Pierre, et al.
Publicado: (2026)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
por: Genalti, Gianmarco, et al.
Publicado: (2025)

Stable Matching with Ties: Approximation Ratios and Learning
por: Lin, Shiyun, et al.
Publicado: (2024)

On the Hardness of Reinforcement Learning with Transition Look-Ahead
por: Pla, Corentin, et al.
Publicado: (2025)

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback
por: Fiegel, Côme, et al.
Publicado: (2026)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
por: Yahmed, Ahmed Ben, et al.
Publicado: (2025)

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
por: Genalti, Gianmarco, et al.
Publicado: (2023)

Replicable Constrained Bandits
por: Bollini, Matteo, et al.
Publicado: (2026)

Data-Dependent Regret Bounds for Constrained MABs
por: Genalti, Gianmarco, et al.
Publicado: (2025)

Learning to Allocate Resources with Censored Feedback
por: Montanari, Giovanni, et al.
Publicado: (2026)

Adaptive Bandit Algorithms for Contextual Matching Markets
por: Lin, Shiyun, et al.
Publicado: (2026)

Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier
por: Fiegel, Come, et al.
Publicado: (2026)

Differentially Private Best-Arm Identification
por: Azize, Achraf, et al.
Publicado: (2024)

Deadline-Aware Online Scheduling for LLM Fine-Tuning with Spot Market Predictions
por: Kong, Linggao, et al.
Publicado: (2025)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
por: Yahmed, Ahmed Ben, et al.
Publicado: (2025)

Mode Estimation with Partial Feedback
por: Arnal, Charles, et al.
Publicado: (2024)

Improved Algorithms for Contextual Dynamic Pricing
por: Tullii, Matilde, et al.
Publicado: (2024)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
por: Germano, Jacopo, et al.
Publicado: (2023)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
por: Genalti, Gianmarco, et al.
Publicado: (2024)

Improved learning rates in multi-unit uniform price auctions
por: Potfer, Marius, et al.
Publicado: (2025)

Autoregressive Bandits
por: Bacchiocchi, Francesco, et al.
Publicado: (2022)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
por: Azize, Achraf, et al.
Publicado: (2025)

DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation
por: Garrido-Lucero, Felipe, et al.
Publicado: (2023)

Adaptive Deadline and Batch Layered Synchronized Federated Learning
por: Goren, Asaf, et al.
Publicado: (2025)

Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
por: Lechowicz, Adam, et al.
Publicado: (2024)

Online matching on stochastic block model
por: Cherifa, Maria, et al.
Publicado: (2025)

Quantum Generative Models for Computational Fluid Dynamics: A First Exploration of Latent Space Learning in Lattice Boltzmann Simulations
por: Hsain, Achraf, et al.
Publicado: (2025)

TempoNet: Slack-Quantized Transformer-Guided Reinforcement Scheduler for Adaptive Deadline-Centric Real-Time Dispatchs
por: Fu, Rong, et al.
Publicado: (2026)

Calibrated Forecasting and Persuasion
por: Jain, Atulya, et al.
Publicado: (2024)