Professor of Statistical Machine Learning at the University of Oxford, Head of RainML Research Lab (https://xitter.cf/t.co/uuBwQ2WdMN)

Oxford, England
Joined November 2016
Include

Only show posts containing:

Exclude

Hide posts containing:

Time range
-
Minimum likes
I'm delighted to share that I have been made a full professor at Oxford (specifically, I am now Professor of Statistical Machine Learning)
315
390
33
6,876
146,147
Tom Rainforth retweeted
1/n 🧵 Model evaluation is often bottlenecked by labelling cost. Active testing estimates a model's risk from far fewer labels, yet existing methods overlook a now-common resource: cheap predictions from powerful black-box models. We address this with PPAT.
3
7
1
25
3,966
Active testing enables label-efficient model evals but can be computationally expensive. We show how to reduce costs and scale up to LLMs. arxiv.org/abs/2508.09093 Work led by Gabrielle Berrada. Find her at EurIPS, or @janundnik and me at NeurIPS in San Diego.
3
7
2
14
7,689
Apple and Oxford just made AI 6.5x better at problem-solving. The secret: it teaches AI agents to ask perfect questions. This rockets success rates from 14% to 91%. No need for fine-tuning or retraining. It runs on current models. Here's how it works: It's a strategic loop designed for multi-turn conversations. At every step, the agent works to find the shortest path to the right answer. Hypothesize: The agent creates an internal list of all possible solutions to the problem. Score Questions: It simulates asking various questions and scores each one on "Expected Information Gain" (EIG). This number represents how much a question is mathematically likely to shrink the list of possibilities. Ask the Best Question: It asks the user only the single, highest-scoring question. Update & Repeat: Based on the answer, it filters its list of hypotheses, getting smarter with each interaction, and then begins the loop again for the next turn. Why this matters for your AI strategy: This marks a shift from building passive "oracles" to proactive, question-asking agents Business Leaders: A 6.5x multiplier on task success is a lever for efficiency. This translates to fewer failed customer interactions, faster diagnostics, and more accurate personalization, a clear ROI on smarter AI. Practitioners: This is a deployment-time framework, not a new model. You can build this agent on top of existing LLMs today. It provides a principled way to overcome common multi-turn issues like inconsistency and context loss without fine-tuning or retraining. Researchers: This paper is a victory for information theory. It proves that a full EIG calculation is superior to heuristics like predictive entropy. It sets a new standard for how to build intelligent information-seeking agents.
23
135
12
826
89,575
I have an opening for a 2-year postdoc in probabilistic machine learning and/or experimental design. The application deadline is the 3rd of September. See here for details and how to apply: tinyurl.com/rainmlpostdoc202…
11
1
51
4,336
Given models are never really perfectly specified, this is very important in practice.
176
3) it doesn't widen your model class. This is sort of the same as 1), but there also is a general principle that a combination of hypotheses is more powerful than one, and BMA will always collapse to one. There are methods of "Bayesian model combination" that do this.
2
176
1) the optimality goes away when the model is misspecified (Eg Bayesian decision trees are usually significantly inferior to random forests)
2
194
A good textbook reference point for this kind of thing (why BMA) is the Bayesian choice by Christian Robert. It naturally pops out from the decision theory with various choices of loss function like the KL based stuff you discuss. There are some good reasons not to use BMA tho
2
1
314
I have an opening for a 2.5-year postdoc position in the RainML lab as part of my ERC grant on probabilistic machine learning and intelligent data acquisition. Application deadline 10th July 2024. See here for details and to apply: tinyurl.com/rainmlpostdoc
1
21
1
56
12,418
I'm delighted to announce that from September I will officially be an Associate Professor (remaining at the Oxford stats department)
17
3
176
16,976
All credit goes to my fantastic coauthors @nmstatistics and @yeewhye
1
657
Our new #ICLR2024 paper shows how LLMs can successfully check their own change of thought reasoning without any fine-tuning or even examples, using an approach we call SelfCheck. Join me at poster 125 this afternoon to learn more Paper: openreview.net/forum?id=pTHf…
1
5
1
31
4,187
In-context learning can learn novel input-output relationships beyond what can be picked up from input context alone, but doesn't behave like conventional learning algorithm. Find out more at our ICLR poster #129 this afternoon. Paper: openreview.net/forum?id=YPIA…, led by @janundnik
2
14
1,746
Tom Rainforth retweeted
Are you at ICLR? Have you heard that In-Context Learning in LLMs does not learn label relationships? Well that's not true. Visit our poster TODAY to find out how LLMs incorporate label information. Spoiler: it's not Bayesian inference. Poster #129, May 7, 4.30 pm
1
9
35
5,637
Tom Rainforth retweeted
Tim Reichelt@TimReichelt31 May 2024
I will be presenting our work on "Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Support" at AISTATS in Valencia tomorrow (details in thread below). If you are interested in probabilistic programming, come and say hi at poster session 1!
Our new paper (arxiv.org/abs/2310.14888) shows that probabilistic programs with stochastic support are implicitly Bayesian model averages (BMA) which leads to issues if we assume our model is misspecified! w/ @TimReichelt3 and Luke Ong A thread (1/5)
1
20
1,432
We are delighted to announce an ACM-TOPML special issue on "Probabilistic Programming". Please see the attached call for papers for details
1
6
36
5,807