Emmeran Johnson

collaborators

2 papers

cs.LG2025

On the necessity of adaptive regularisation:Optimal anytime online learning on $ℓ_{p}$ -balls

Emmeran Johnson, David MartÃnez-Rubio, Ciara Pike-Burke +1

We study online convex optimization on $ℓ_{p}$ -balls in $R^{d}$ for $p > 2$ . While always sub-linear, the optimal regret exhibits a shift between the high-dimensional setti…

cs.LG2025

Stochastic Shortest Path with Sparse Adversarial Costs

Emmeran Johnson, Alberto Rumi, Ciara Pike-Burke +1

We study the adversarial Stochastic Shortest Path (SSP) problem with sparse costs under full-information feedback. In the known transition setting, existing bounds based on Online…

On the necessity of adaptive regularisation:Optimal anytime online learning on ℓp​-balls

Stochastic Shortest Path with Sparse Adversarial Costs

On the necessity of adaptive regularisation:Optimal anytime online learning on $ℓ_{p}$ -balls