Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Reece Shuttleworth

dblp:322/3849 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-6387-8780ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Efficient and distributed learning · 26% Learning paradigms · 26% Language models and text generation · 23%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computing education · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.912025
LoRA vs Full Fine-tuning: An Illusion of Equivalence · NeurIPS 2025
Machine learning › Learning paradigms
continual learning
0.912025
LoRA vs Full Fine-tuning: An Illusion of Equivalence · NeurIPS 2025
Natural language and speech › Language models and text generation
large language model fine-tuning
0.912025
LoRA vs Full Fine-tuning: An Illusion of Equivalence · NeurIPS 2025
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation
0.912025
LoRA vs Full Fine-tuning: An Illusion of Equivalence · NeurIPS 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.912025
LoRA vs Full Fine-tuning: An Illusion of Equivalence · NeurIPS 2025
Natural language and speech › Question answering and dialogue systems › question generation
educational question generation
0.712023
From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams · KDD 2023
Natural language and speech › Language models and text generation
large language model
0.712023
From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams · KDD 2023
Natural language and speech › Question answering and dialogue systems
question generation
0.712023
A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level · AAAI 2023
Computing education
automated assessment
0.712023
From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams · KDD 2023
Computing education › AI education
machine learning education
0.212023
From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams · KDD 2023

Methods — techniques the papers use, named apart from their topics

zero-shot learning · 1.3foundation model · 1.3few-shot learning · 1.3chain-of-thought prompting · 1.3spectral analysis · 0.9singular value decomposition · 0.9causal intervention · 0.9
YearPublicationVenuePosition
2025 LoRA vs Full Fine-tuning: An Illusion of Equivalence
abstract
Fine-tuning is a crucial paradigm for adapting pre-trained large language models to downstream tasks. Recently, methods like Low-Rank Adaptation (LoRA) have been shown to effectively fine-tune LLMs with an extreme reduction in trainable parameters. But, \emph{are their learned solutions really equivalent?} We study how LoRA and full-finetuning change pre-trained models by analyzing the model's weight matrices through the lens of their spectral properties. We find that LoRA and full fine-tuning yield weight matrices whose singular value decompositions exhibit very different structure: weight matrices trained with LoRA have new, high-ranking singular vectors, which we call \emph{intruder dimensions}, while those trained with full fine-tuning do not. Further, we extend the finding that LoRA forgets less than full fine-tuning and find its forgetting is vastly localized to the intruder dimension -- by causally intervening on the intruder dimensions by changing their associated singular values post-fine-tuning, we show that they cause forgetting. Moreover, scaling them down significantly improves modeling of the pre-training distribution with a minimal drop in downstream task performance. Given this, we should expect accumulating intruder dimensions to be harmful and lead to more forgetting. This will be amplified during continual learning because of sequentially fine-tuning, and we show that LoRA models do accumulate intruder dimensions here tend to perform worse in this setting, emphasizing the practicality of our findings.
Reece Shuttleworth, Jacob Andreas, Antonio Torralba 0001, Pratyusha Sharma
NeurIPS1
2023 A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level
abstract
We present a new dataset for learning to solve, explain, and generate university-level STEM questions from 27 courses across a dozen departments in seven universities. We scale up previous approaches to questions from courses in the departments of Mechanical Engineering, Materials Science and Engineering, Chemistry, Electrical Engineering, Computer Science, Physics, Earth Atmospheric and Planetary Sciences, Economics, Mathematics, Biological Engineering, Data Systems, and Society, and Statistics. We visualize similarities and differences between questions across courses. We demonstrate that a large foundation model is able to generate questions that are as appropriate and at the same difficulty level as human-written questions.
Iddo Drori, Sarah J. Zhang, Zad Chin, Reece Shuttleworth, Albert Lu, Linda Chen, Bereket Birbo, Michele He, Pedro Lantigua, Sunny Tran, Gregory Hunter, Newman Cheng, Roman Wang, Yann Hicke, Saisamrit Surbehera, Arvind Raghavan, Alexander E. Siemenn, Nikhil Singh 0003, Jayson Lynch, Avi Shporer, Nakul Verma, Tonio Buonassisi, Armando Solar-Lezama
AAAI4
2023 From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams
abstract
A final exam in machine learning at a top institution such as MIT, Harvard, or Cornell typically takes faculty days to write, and students hours to solve. We demonstrate that large language models pass machine learning finals at a human level on finals available online and automatically generate new human-quality final exam questions in seconds. Previous work has developed program synthesis and few-shot learning methods to solve university-level problem set questions in mathematics and STEM courses. In this work, we develop and compare methods that solve final exams, which differ from problem sets in several ways: the questions are longer, have multiple parts, are more complicated, and span a broader set of topics. We curate a dataset and benchmark of questions from machine learning final exams available online and code for answering these questions and generating new questions. We show how to generate new questions from other questions and course notes. For reproducibility and future research on this final exam benchmark, we use automatic checkers for multiple-choice, numeric, and questions with expression answers. A student survey comparing the quality, appropriateness, and difficulty of machine-generated questions with human-written questions shows that across multiple aspects, machine-generated questions are indistinguishable from human-generated questions and are suitable for final exams. We perform ablation studies comparing zero-shot learning with few-shot learning and chain-of-thought prompting using GPT-3, OPT, Codex, and ChatGPT across machine learning topics and find that few-shot learning methods perform best. We highlight the transformative potential of language models to streamline the writing and solution of large-scale assessments, significantly reducing the workload from human days to mere machine seconds. Our results suggest that rather than banning large language models such as ChatGPT in class, instructors should teach students to harness them by asking students meta-questions about correctness, completeness, and originality of the responses generated, encouraging critical thinking in academic studies.
Iddo Drori, Sarah J. Zhang, Reece Shuttleworth, Sarah Zhang, Keith Tyser, Zad Chin, Pedro Lantigua, Saisamrit Surbehera, Gregory Hunter, Derek Austin, Leonard Tang, Yann Hicke, Sage Simhon, Sathwik Karnik, Darnell Granberry, Madeleine Udell
KDD3