Lewis Tunstall works on post-training at Hugging Face. His research and software contributions connect mathematical reasoning, language-model learning and tools that make complex models easier to study and use.[1][7][9]
Start with QED-Nano: Teaching a Tiny Model to Prove Hard Theorems →
Education
Links
Post-training (specific title not stated) · Hugging Face
Career
Tunstall holds a theoretical-physics PhD from the University of Adelaide. Fulbright’s 2010 record identifies his earlier physics honours degree and doctoral research, and Bern’s course archive lists him teaching machine learning for physicists in 2020. His older owned biography describes enterprise NLP, time-series and topological-data work, including giotto-tda and anomaly detection. At Hugging Face he has worked on open learning tools and coauthored Natural Language Processing with Transformers.[4][5][6][2]
Contributions
Teach a small model a repeatable proof-writing process
QED-Nano starts with supervised training on proof examples, then uses reinforcement learning with rubric-based rewards. A reasoning cache adds iterative summarize-and-refine cycles so the model can work through long proofs across steps. The coauthored study releases its four-billion-parameter model, datasets and training/evaluation pipeline. Its contribution is an open recipe for studying proof generation, with reported performance tied to the paper’s problems and scoring process.[7]
Make geometric features usable in ML pipelines
giotto-tda brings topological data analysis into a scikit-learn-compatible Python interface. Preprocessing, feature extraction and visualization can operate on several forms of data, with optimized implementations beneath the API. Its modular interface lets researchers combine geometric representations with ordinary machine-learning workflows instead of maintaining separate experimental code for every dataset. Tunstall coauthored the toolkit paper and described developing and maintaining the library.[9][2]
Tools, writing & talks
Writing, research & talks
Start here
An open proof-generation recipe combining supervised examples, rubric rewards and iterative reasoning caches.
Read the three-stage training recipe, then inspect how the reasoning cache changes a long proof attempt. Mathematical-proof and reinforcement-learning familiarity help; distinguish the paper’s scoring setup from a guarantee that every generated argument is valid.
Coauthor[7]Hugging Face's Lewis Tunstall presents recent work with CMU, ETH and Numenta on post-training small models to prove hard theorems, followed by Q&A.
Catalog workOriginal source- NLP with Transformers: SuperDataScience695superdatascience.com
A technical discussion of transformer architectures, training and open-source model development.
Guest[4]
Tools
- giotto-tda
github.comA Python toolkit connecting topological data analysis with scikit-learn-style pipelines.