Multitask Online Learning: Listen to the Neighborhood Buzz
Fuente:
arXiv
Saved in:
| Main Authors: | Achddou, Juliette, Cesa-Bianchi, Nicolò, Laforgue, Pierre |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Distributed Online Optimization with Stochastic Agent Availability
by: Achddou, Juliette, et al.
Published: (2024)
by: Achddou, Juliette, et al.
Published: (2024)
Online Linear Regression with Paid Stochastic Features
by: Merlis, Nadav, et al.
Published: (2025)
by: Merlis, Nadav, et al.
Published: (2025)
Cooperative Online Learning with Feedback Graphs
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)
Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)
by: Zhao, Yuheng, et al.
Published: (2026)
Decentralized Online Convex Optimization with Unknown Feedback Delays
by: Qiu, Hao, et al.
Published: (2026)
by: Qiu, Hao, et al.
Published: (2026)
Beyond Bandit Feedback in Online Multiclass Classification
by: van der Hoeven, Dirk, et al.
Published: (2021)
by: van der Hoeven, Dirk, et al.
Published: (2021)
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)
by: Esposito, Emmanuel, et al.
Published: (2022)
Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)
by: Bachoc, François, et al.
Published: (2024)
Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)
by: Bachoc, François, et al.
Published: (2025)
Lookahead identification in adversarial bandits: accuracy and memory bounds
by: Brukhim, Nataly, et al.
Published: (2026)
by: Brukhim, Nataly, et al.
Published: (2026)
Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)
by: Jin, Tianyuan, et al.
Published: (2024)
Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)
by: Qiu, Hao, et al.
Published: (2026)
Adaptive maximization of social welfare
by: Cesa-Bianchi, Nicolo, et al.
Published: (2023)
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)
by: Di Gennaro, Federico, et al.
Published: (2025)
Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)
by: Rumi, Alberto, et al.
Published: (2026)
A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)
by: Jacobsen, Andrew, et al.
Published: (2026)
Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)
by: Jacobsen, Andrew, et al.
Published: (2025)
Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)
by: Eldowa, Khaled, et al.
Published: (2024)
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)
by: Kuroki, Yuko, et al.
Published: (2023)
Learning Conditional Averages
by: Bressan, Marco, et al.
Published: (2026)
by: Bressan, Marco, et al.
Published: (2026)
A Regret Analysis of Bilateral Trade
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)
Sketch In, Sketch Out: Accelerating both Learning and Inference for Structured Prediction with Kernels
by: Ahmad, Tamim El, et al.
Published: (2023)
by: Ahmad, Tamim El, et al.
Published: (2023)
A Theory of Interpretable Approximations
by: Bressan, Marco, et al.
Published: (2024)
by: Bressan, Marco, et al.
Published: (2024)
Of Dice and Games: A Theory of Generalized Boosting
by: Bressan, Marco, et al.
Published: (2024)
by: Bressan, Marco, et al.
Published: (2024)
Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)
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)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)
Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
The Invisible Handshake: Persistent Overpricing by Adaptive Market Agents
by: Foscari, Luigi, et al.
Published: (2025)
by: Foscari, Luigi, et al.
Published: (2025)
A Probabilistic Approach to Learning the Degree of Equivariance in Steerable CNNs
by: Veefkind, Lars, et al.
Published: (2024)
by: Veefkind, Lars, et al.
Published: (2024)
Deep Sketched Output Kernel Regression for Structured Prediction
by: Ahmad, Tamim El, et al.
Published: (2024)
by: Ahmad, Tamim El, et al.
Published: (2024)
Adaptive Sampling for Continuous Group Equivariant Neural Networks
by: Inal, Berfin, et al.
Published: (2024)
by: Inal, Berfin, et al.
Published: (2024)
Buzz, Choose, Forget: A Meta-Bandit Framework for Bee-Like Decision Making
by: Claeys, Emmanuelle, et al.
Published: (2025)
by: Claeys, Emmanuelle, et al.
Published: (2025)
Online Continual Graph Learning
by: Donghi, Giovanni, et al.
Published: (2025)
by: Donghi, Giovanni, et al.
Published: (2025)
Offline Multitask Representation Learning for Reinforcement Learning
by: Ishfaq, Haque, et al.
Published: (2024)
by: Ishfaq, Haque, et al.
Published: (2024)
Relaxed Equivariance via Multitask Learning
by: Elhag, Ahmed A., et al.
Published: (2024)
by: Elhag, Ahmed A., et al.
Published: (2024)
Online Control of Adaptive Large Neighborhood Search using Deep Reinforcement Learning
by: Reijnen, Robbert, et al.
Published: (2022)
by: Reijnen, Robbert, et al.
Published: (2022)
Multitask Learning with Stochastic Interpolants
by: Negrel, Hugo, et al.
Published: (2025)
by: Negrel, Hugo, et al.
Published: (2025)
The Unreasonable Effectiveness of Randomized Representations in Online Continual Graph Learning
by: Donghi, Giovanni, et al.
Published: (2025)
by: Donghi, Giovanni, et al.
Published: (2025)
Equivariant amortized inference of poses for cryo-EM
by: de Ruijter, Larissa, et al.
Published: (2024)
by: de Ruijter, Larissa, et al.
Published: (2024)
Similar Items
-
Distributed Online Optimization with Stochastic Agent Availability
by: Achddou, Juliette, et al.
Published: (2024) -
Online Linear Regression with Paid Stochastic Features
by: Merlis, Nadav, et al.
Published: (2025) -
Cooperative Online Learning with Feedback Graphs
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021) -
Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026) -
Decentralized Online Convex Optimization with Unknown Feedback Delays
by: Qiu, Hao, et al.
Published: (2026)