2026
Across 597,744 scored responses from nine open models at every effort setting, choosing effort per question would save 43.8% of tokens within half an accuracy point of always thinking hard.
PhD Fellow at Integreat and UiT The Arctic University of Norway. I work on test-time compute and reasoning efficiency in large language models.
Before that an MSc by Research at Oxford on an Oxford-Man Institute scholarship, a BSc at WU Vienna, and six years in quantitative finance and machine learning engineering in Zurich.
PhD ends in 2027. Open to research visits in spring 2027 and to postdoc and research roles from autumn 2027. Get in touch →
2026
Across 597,744 scored responses from nine open models at every effort setting, choosing effort per question would save 43.8% of tokens within half an accuracy point of always thinking hard.
2026
An exact decomposition of accuracy per token into answer availability, correctness and cost, over 785,541 responses on twelve benchmarks, where relative cost changes with the workload and can reverse.
arXiv (earlier version) Workshop version Explorable and BibTeX
2026
Logic puzzles whose length, intrinsic difficulty and distractor density move independently, which show task length as the dominant constraint across 22 reasoning models.
Paper (OpenReview) Interactive site Code Dataset Explorable and BibTeX
2020
The paper version of my Oxford thesis, machine learning on financial statements to forecast stock movements, in the top 0.3% of SSRN papers by downloads.