collaborators

7 papers

stat.ML2026

Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces

Hamish Flynn, Joe Watson, Ingmar Posner +1

We analyze the Bayesian regret of the Gaussian process posterior sampling reinforcement learning (GP-PSRL) algorithm. Posterior sampling is a heuristic for decision-making under un…

stat.ML2026

Relative Information Gain and Gaussian Process Regression

Hamish Flynn

The sample complexity of estimating or maximising an unknown function in a reproducing kernel Hilbert space is known to be linked to both the effective dimension and the informatio…

stat.ML2026

Sparse Nonparametric Contextual Bandits

Hamish Flynn, Julia Olkhovskaya, Paul Rognon-Vael

We study the benefits of sparsity in nonparametric contextual bandit problems, in which the set of candidate features is countably or uncountably infinite. Our contribution is two-…

cs.LG2025

Sparse Optimistic Information Directed Sampling

Ludovic Schwartz, Hamish Flynn, Gergely Neu

Many high-dimensional online decision-making problems can be modeled as stochastic sparse linear bandits. Most existing algorithms are designed to achieve optimal worst-case regret…

stat.ML2025

Linear Bandits with Non-i.i.d. Noise

Baptiste Abélès, Eugenio Clerico, Hamish Flynn +1

We study the linear stochastic bandit problem, relaxing the standard i.i.d. assumption on the observation noise. As an alternative to this restrictive assumption, we allow the nois…

math.ST2025

Confidence Sequences for Generalized Linear Models via Regret Analysis

Eugenio Clerico, Hamish Flynn, Wojciech Kotłowski +1

We develop a methodology for constructing confidence sets for parameters of statistical models via a reduction to sequential prediction. Our key observation is that for any general…