activity
20112026
most citedDegenerate Feedback Loops in Recommender Systems

153 citations · 1.2k across the 73 of their papers we have counts for

collaborators

78 papers

cs.LG2026

Refined Detection for Gumbel Watermarking

Tor Lattimore

We propose a simple detection mechanism for the Gumbel watermarking scheme proposed by Aaronson (2022). The new mechanism is proven to be near-optimal in a problem-dependent sense…

cs.LG2026

A Lyapunov Analysis of Softmax Policy Gradient for Stochastic Bandits

Tor Lattimore

We adapt the analysis of policy gradient for continuous time -armed stochastic bandits by Lattimore (2026) to the standard discrete time setup. As in continuous time, we prove t…

stat.ML2026

A Diffusion Analysis of Policy Gradient for Stochastic Bandits

Tor Lattimore

We study a continuous-time diffusion approximation of policy gradient for -armed stochastic bandits. We prove that with a learning rate the regret is $O(k \l…

cs.AI2025

Beyond Statistical Learning: Exact Learning Is Essential for General Intelligence

András György, Tor Lattimore, Nevena Lazić +1

Sound deductive reasoning -- the ability to derive new knowledge from existing facts and rules -- is an indisputably desirable aspect of general intelligence. Despite the major adv…

math.OC2024

Online Newton Method for Bandit Convex Optimisation

Hidde Fokkema, Dirk van der Hoeven, Tor Lattimore +1

We introduce a computationally efficient algorithm for zeroth-order bandit convex optimisation and prove that in the adversarial setting its regret is at most $d^{3.5} \sqrt{n} \ma…

math.OC2024★ 2 cited

Bandit Convex Optimisation

Tor Lattimore

Bandit convex optimisation is a fundamental framework for studying zeroth-order convex optimisation. This book covers the many tools used for this problem, including cutting plane…