Saved in:
| Main Authors: | Aubert, Julien, Köhler, Louis, Lehéricy, Luc, Mezzadri, Giulia, Reynaud-Bouret, Patricia |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.13186 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
General oracle inequalities for a penalized log-likelihood criterion based on non-stationary data
by: Aubert, Julien, et al.
Published: (2024)
by: Aubert, Julien, et al.
Published: (2024)
Spiking Neural Models for Decision-Making Tasks with Learning
by: Jaffard, Sophie, et al.
Published: (2025)
by: Jaffard, Sophie, et al.
Published: (2025)
CHANI: Correlation-based Hawkes Aggregation of Neurons with bio-Inspiration
by: Jaffard, Sophie, et al.
Published: (2024)
by: Jaffard, Sophie, et al.
Published: (2024)
Optimal cross-learning for contextual bandits with unknown context distributions
by: Schneider, Jon, et al.
Published: (2024)
by: Schneider, Jon, et al.
Published: (2024)
Quantum contextual bandits and recommender systems for quantum data
by: Brahmachari, Shrigyan, et al.
Published: (2023)
by: Brahmachari, Shrigyan, et al.
Published: (2023)
VITS : Variational Inference Thompson Sampling for contextual bandits
by: Clavier, Pierre, et al.
Published: (2023)
by: Clavier, Pierre, et al.
Published: (2023)
Best-of-Both Worlds for linear contextual bandits with paid observations
by: Boyer, Nathan, et al.
Published: (2025)
by: Boyer, Nathan, et al.
Published: (2025)
Leveraging heterogeneous spillover in maximizing contextual bandit rewards
by: Faruk, Ahmed Sayeed, et al.
Published: (2023)
by: Faruk, Ahmed Sayeed, et al.
Published: (2023)
Anytime-valid off-policy inference for contextual bandits
by: Waudby-Smith, Ian, et al.
Published: (2022)
by: Waudby-Smith, Ian, et al.
Published: (2022)
A conversion theorem and minimax optimality for continuum contextual bandits
by: Akhavan, Arya, et al.
Published: (2024)
by: Akhavan, Arya, et al.
Published: (2024)
Vector preference-based contextual bandits under distributional shifts
by: Shukla, Apurv, et al.
Published: (2025)
by: Shukla, Apurv, et al.
Published: (2025)
Precision autotuning for linear solvers via contextual bandit-based RL
by: Carson, Erin, et al.
Published: (2026)
by: Carson, Erin, et al.
Published: (2026)
Online learning in bandits with predicted context
by: Guo, Yongyi, et al.
Published: (2023)
by: Guo, Yongyi, et al.
Published: (2023)
Stochastic contextual bandits with graph feedback: from independence number to MAS number
by: Wen, Yuxiao, et al.
Published: (2024)
by: Wen, Yuxiao, et al.
Published: (2024)
Neural Coding as a Statistical Testing Problem
by: Ost, Guilherme, et al.
Published: (2022)
by: Ost, Guilherme, et al.
Published: (2022)
A single algorithm for both restless and rested rotting bandits
by: Seznec, Julien, et al.
Published: (2026)
by: Seznec, Julien, et al.
Published: (2026)
Pair-Matching: Links Prediction with Adaptive Queries
by: Giraud, Christophe, et al.
Published: (2019)
by: Giraud, Christophe, et al.
Published: (2019)
Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)
by: Carpentier, Alexandra, et al.
Published: (2026)
Spectral bandits for smooth graph functions with applications in recommender systems
by: Kocák, Tomáš, et al.
Published: (2026)
by: Kocák, Tomáš, et al.
Published: (2026)
Covariance-adapting algorithm for semi-bandits with application to sparse rewards
by: Perrault, Pierre, et al.
Published: (2026)
by: Perrault, Pierre, et al.
Published: (2026)
Efficient learning by implicit exploration in bandit problems with side observations
by: Kocak, Tomas, et al.
Published: (2026)
by: Kocak, Tomas, et al.
Published: (2026)
Reinforcement learning with combinatorial actions for coupled restless bandits
by: Xu, Lily, et al.
Published: (2025)
by: Xu, Lily, et al.
Published: (2025)
Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)
by: Kocák, Tomáš, et al.
Published: (2026)
Provable local learning rule by expert aggregation for a Hawkes network
by: Jaffard, Sophie, et al.
Published: (2023)
by: Jaffard, Sophie, et al.
Published: (2023)
Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)
by: Thuot, Victor, et al.
Published: (2024)
Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
by: Mei, Jincheng, et al.
Published: (2025)
by: Mei, Jincheng, et al.
Published: (2025)
Non-asymptotic statistical test of the diffusion coefficient of stochastic differential equations
by: Melnykova, Anna, et al.
Published: (2023)
by: Melnykova, Anna, et al.
Published: (2023)
Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)
by: Potfer, Marius, et al.
Published: (2026)
Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)
by: Valko, Michal, et al.
Published: (2026)
Approximate information maximization for bandit games
by: Barbier-Chebbah, Alex, et al.
Published: (2023)
by: Barbier-Chebbah, Alex, et al.
Published: (2023)
Risk and optimal policies in bandit experiments
by: Adusumilli, Karun
Published: (2021)
by: Adusumilli, Karun
Published: (2021)
Multi-task neural networks by learned contextual inputs
by: Sandnes, Anders T., et al.
Published: (2023)
by: Sandnes, Anders T., et al.
Published: (2023)
On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)
by: Huang, Bruce, et al.
Published: (2025)
Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)
by: Sharma, Dravyansh, et al.
Published: (2025)
Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)
by: Carpentier, Alexandra, et al.
Published: (2026)
Linear bandits with polylogarithmic minimax regret
by: Lumbreras, Josep, et al.
Published: (2024)
by: Lumbreras, Josep, et al.
Published: (2024)
Efficient kernelized bandit algorithms via exploration distributions
by: Hu, Bingshan, et al.
Published: (2025)
by: Hu, Bingshan, et al.
Published: (2025)
Leveraging priors on distribution functions for multi-arm bandits
by: Vashishtha, Sumit, et al.
Published: (2025)
by: Vashishtha, Sumit, et al.
Published: (2025)
When and why randomised exploration works (in linear bandits)
by: Abeille, Marc, et al.
Published: (2025)
by: Abeille, Marc, 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)
Similar Items
-
General oracle inequalities for a penalized log-likelihood criterion based on non-stationary data
by: Aubert, Julien, et al.
Published: (2024) -
Spiking Neural Models for Decision-Making Tasks with Learning
by: Jaffard, Sophie, et al.
Published: (2025) -
CHANI: Correlation-based Hawkes Aggregation of Neurons with bio-Inspiration
by: Jaffard, Sophie, et al.
Published: (2024) -
Optimal cross-learning for contextual bandits with unknown context distributions
by: Schneider, Jon, et al.
Published: (2024) -
Quantum contextual bandits and recommender systems for quantum data
by: Brahmachari, Shrigyan, et al.
Published: (2023)