Thomas Rupf (@th_rupf) profile picture

Master's student @ ETH interested in ML, RL, and Robotics.

Zurich
Joined July 2025
Photo by Thomas Rupf (@th_rupf)Photo by Thomas Rupf (@th_rupf)Photo by Thomas Rupf (@th_rupf)Photo by Thomas Rupf (@th_rupf)Photo by Thomas Rupf (@th_rupf)
If you're at ICLR🇧🇷 come check out OpTI-BFM at poster P4-4504 tomorrow morning or as an oral at 4:03pm in the Amphitheater.
Excited to share that our paper "Optimistic Task Inference for Behavior Foundation Models" was accepted for ICLR 2026. BFMs are great at zero-shot RL, but task inference requires a dataset with reward labels. Our method OpTI-BFM offers an online alternative. (1/5)
1
4
16
1,008
Thomas Rupf retweeted
Which representations are meaningful for control? We're presenting TD-JEPA as an oral at ICLR🇧🇷: a zero-shot reinforcement learning algorithm using self-prediction (JEPA) to learn representations that are predictive of long-term, policy-dependent behavior. It works pretty well!🧵
1
32
1
207
14,786
Excited to share that our paper "Optimistic Task Inference for Behavior Foundation Models" was accepted for ICLR 2026. BFMs are great at zero-shot RL, but task inference requires a dataset with reward labels. Our method OpTI-BFM offers an online alternative. (1/5)
1
5
2
12
2,221
OpTI-BFM bares similarities with LinUCB for Bandits which we use to prove sublinear regret in episodic settings under mild assumptions. Because it's online, OpTI-BFM can also adapt to time-varying (non-stationary) rewards by decaying the weight on older observations. (4/5)
1
1
93
Last week I presented our last work: 🐝“Epistemically-guided forward backward exploration (FBEE)”🐝 at the @RL_Conference TLDR: Active learning for unsupervised RL
2
9
1
50
3,035
When multiple tasks need improvements, fine-tuning a generalist policy becomes tricky. How do we allocate a demonstration budget across a set of tasks of varied difficulty and familiarity? We are presenting a possible solution at ICML on Wednesday! (1/3)
1
8
17
1,399
Zero-shot imitation from just a single sparse demonstration is hard. Goal-conditioned methods tend to “greedily" move from one state to the next and lose the big picture. We're presenting an alternative approach on Tuesday at #ICML2025. (1/3)
1
7
16
1,616
Our method tackles the occupancy matching objective directly at test-time by estimating the agent's occupancy with samples from a learned world model and matching it to the expert occupancy using Optimal Transport. (2/3)
1
1
72