Image de couverture de livre

Sharp analysis of linear ensemble sampling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Akhavan, Arya, Janz, David, Szepesvári, Csaba
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Ensemble sampling for linear bandits: small ensembles suffice
par: Janz, David, et autres
Publié: (2023)

Exploration via linearly perturbed loss minimisation
par: Janz, David, et autres
Publié: (2023)

Eluder dimension: localise it!
par: Bakhtiari, Alireza, et autres
Publié: (2026)

High-probability zeroth-order online convex optimisation beyond Euclidean geometry
par: Janz, David, et autres
Publié: (2025)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
par: Maran, Davide, et autres
Publié: (2026)

Rectifying Regression in Reinforcement Learning
par: Ayoub, Alex, et autres
Publié: (2025)

Trajectory Data Suffices for Statistically Efficient Learning in Offline RL with Linear $q^π$-Realizability and Concentrability
par: Tkachuk, Volodymyr, et autres
Publié: (2024)

Balancing optimism and pessimism in offline-to-online learning
par: Sentenac, Flore, et autres
Publié: (2025)

Confident Natural Policy Gradient for Local Planning in $q_π$-realizable Constrained MDPs
par: Tian, Tian, et autres
Publié: (2024)

Gradient-free stochastic optimization for additive models
par: Akhavan, Arya, et autres
Publié: (2025)

Stochastic Gradient Descent for Gaussian Processes Done Right
par: Lin, Jihao Andreas, et autres
Publié: (2023)

Variance-sensitive Thompson sampling for generalised linear bandits, revisited
par: Perneczky, Tom, et autres
Publié: (2026)

Beyond Statistical Learning: Exact Learning Is Essential for General Intelligence
par: György, András, et autres
Publié: (2025)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
par: Liu, Shuai, et autres
Publié: (2026)

Learning to Reason Efficiently with Discounted Reinforcement Learning
par: Ayoub, Alex, et autres
Publié: (2025)

Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs
par: Zhong, Han, et autres
Publié: (2021)

Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
par: Liu, Shuai, et autres
Publié: (2024)

Regret Minimization via Saddle Point Optimization
par: Kirschner, Johannes, et autres
Publié: (2024)

To Believe or Not to Believe Your LLM
par: Yadkori, Yasin Abbasi, et autres
Publié: (2024)

When and why randomised exploration works (in linear bandits)
par: Abeille, Marc, et autres
Publié: (2025)

Sharpness-diversity tradeoff: improving flat ensembles with SharpBalance
par: Lu, Haiquan, et autres
Publié: (2024)

Ordering-based Conditions for Global Convergence of Policy Gradient Methods
par: Mei, Jincheng, et autres
Publié: (2025)

Stochastic Gradient Succeeds for Bandits
par: Mei, Jincheng, et autres
Publié: (2024)

Self-Concordant Perturbations for Linear Bandits
par: Lévy, Lucas, et autres
Publié: (2025)

LACONIC: Length-Aware Constrained Reinforcement Learning for LLM
par: Liu, Chang, et autres
Publié: (2026)

Optimistic Actor-Critic with Parametric Policies for Linear Markov Decision Processes
par: Lin, Max Qiushi, et autres
Publié: (2026)

Non-stationary Bandit Convex Optimization: A Comprehensive Study
par: Liu, Xiaoqi, et autres
Publié: (2025)

Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
par: Mei, Jincheng, et autres
Publié: (2025)

A conversion theorem and minimax optimality for continuum contextual bandits
par: Akhavan, Arya, et autres
Publié: (2024)

Frontier LLMs Still Struggle with Simple Reasoning Tasks
par: Malek, Alan, et autres
Publié: (2025)

Switching the Loss Reduces the Cost in Batch (Offline) Reinforcement Learning
par: Ayoub, Alex, et autres
Publié: (2024)

Bernstein-type dimension-free concentration for self-normalised martingales
par: Akhavan, Arya, et autres
Publié: (2025)

Rethinking the Foundations for Continual Reinforcement Learning
par: Elelimy, Esraa, et autres
Publié: (2025)

Rethinking the Global Convergence of Softmax Policy Gradient with Linear Function Approximation
par: Lin, Max Qiushi, et autres
Publié: (2025)

Scalable Machine Learning Algorithms using Path Signatures
par: Tóth, Csaba
Publié: (2025)

Sharp concentration of uniform generalization errors in binary linear classification
par: Nakakita, Shogo
Publié: (2025)

Discovery and inference beyond linearity by integrating Bayesian regression, tree ensembles and Shapley values
par: Spadaccini, Giorgio, et autres
Publié: (2025)

DA-MoE: Towards Dynamic Expert Allocation for Mixture-of-Experts Models
par: Aghdam, Maryam Akhavan, et autres
Publié: (2024)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
par: Matsumoto, Namiko, et autres
Publié: (2025)

What is to be gained by ensemble models in analysis of spectroscopic data?
par: Domijan, Katarina
Publié: (2024)