Cover Image

Distributed Online Optimization with Stochastic Agent Availability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Achddou, Juliette, Cesa-Bianchi, Nicolò, Qiu, Hao
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multitask Online Learning: Listen to the Neighborhood Buzz
by: Achddou, Juliette, et al.
Published: (2023)

Decentralized Online Convex Optimization with Unknown Feedback Delays
by: Qiu, Hao, et al.
Published: (2026)

Online Linear Regression with Paid Stochastic Features
by: Merlis, Nadav, et al.
Published: (2025)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

Cooperative Online Learning with Feedback Graphs
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

Beyond Bandit Feedback in Online Multiclass Classification
by: van der Hoeven, Dirk, et al.
Published: (2021)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)

Lookahead identification in adversarial bandits: accuracy and memory bounds
by: Brukhim, Nataly, et al.
Published: (2026)

Adaptive maximization of social welfare
by: Cesa-Bianchi, Nicolo, et al.
Published: (2023)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
by: Di Gennaro, Federico, et al.
Published: (2025)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)

Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)

The Invisible Handshake: Persistent Overpricing by Adaptive Market Agents
by: Foscari, Luigi, et al.
Published: (2025)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

A Regret Analysis of Bilateral Trade
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

A Theory of Interpretable Approximations
by: Bressan, Marco, et al.
Published: (2024)

Of Dice and Games: A Theory of Generalized Boosting
by: Bressan, Marco, et al.
Published: (2024)

Learning Conditional Averages
by: Bressan, Marco, et al.
Published: (2026)

Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Stochastic Online Optimization for Cyber-Physical and Robotic Systems
by: Ma, Hao, et al.
Published: (2024)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
by: Qiu, Hao, et al.
Published: (2025)

Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions
by: Hu, Piao, et al.
Published: (2024)

Stochastic Direct Search Method for Blind Resource Allocation
by: Achddou, Juliette, et al.
Published: (2022)

A Probabilistic Approach to Learning the Degree of Equivariance in Steerable CNNs
by: Veefkind, Lars, et al.
Published: (2024)

Adaptive Sampling for Continuous Group Equivariant Neural Networks
by: Inal, Berfin, et al.
Published: (2024)

Online Importance Sampling for Stochastic Gradient Optimization
by: Salaün, Corentin, et al.
Published: (2023)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)

Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks
by: Liu, Jingyuan, et al.
Published: (2025)

HypeMARL: Multi-Agent Reinforcement Learning For High-Dimensional, Parametric, and Distributed Systems
by: Botteghi, Nicolò, et al.
Published: (2025)

Equivariant amortized inference of poses for cryo-EM
by: de Ruijter, Larissa, et al.
Published: (2024)

On the Sample Complexity of One Hidden Layer Networks with Equivariance, Locality and Weight Sharing
by: Behboodi, Arash, et al.
Published: (2024)