Laryn Qi

I am an MS student in EECS at UC Berkeley advised by Narges Norouzi and John DeNero. I do research in building LLM-based AI tools for CS education with the Algorithms & Computing for Education (ACE) and Berkeley AI Research (BAIR) labs. Prior, I received my Bachelors in CS and Music at UC Berkeley. You can find my coursework here.

Office Hours:

profile photo

laryn [at] eecs [dot] berkeley [dot] edu
Resume  /  LinkedIn  /  GitHub

A Knowledge-Component-Based Methodology for Evaluating AI Assistants
Laryn Qi, J.D. Zamfirescu-Pereira, Taehan Kim, Bjoern Hartmann, John DeNero, Narges Norouzi


61A-Bot: AI homework assistance in CS1 is fast and cheap -- but is it helpful?
J.D. Zamfirescu-Pereira, Laryn Qi, Bjoern Hartmann, John DeNero, Narges Norouzi


Developing and Evaluating LLM Assistants in Introductory Computer Science
Laryn Qi
Masters Thesis, 2024


Conversational Programming with LLM-Powered Interactive Support in an Introductory Computer Science Course
J.D. Zamfirescu-Pereira, Laryn Qi, Bjoern Hartmann, John DeNero, Narges Norouzi
NeurIPS Workshop on Generative AI for Education (GAIED), 2023


Reward Modeling from GPT4-Vision Preferences
Bryce Wong, Jonathan Lu, Laryn Qi
CS 285, Fall 2023

This project aims to replicate the behavior of OpenAI and Deepmind's Deep Reinforcement Learning from Human Preferences using preferences elicited from GPT4-V instead of humans. The code and architecture of the project are based on Matthew Rahtz's implementation of the original paper, simplified for our purposes and translated into PyTorch.

[paper | code]

Randomized Graph Algorithms
Laryn Qi
Personal, Summer 2023

Implementations of various popular randomized graph algorithms. Topics and problems covered include  Cover Time,  Min Cut,  Stopping Time,  Approximate Max Cut,  and  Approximate Independent Set.


Cuts on Graphs: Applications and Variations
Josh Jones, Brandon Tran, Laryn Qi
CS 270, Spring 2023

We present a survey on state-of-the-art cut algorithms. Topics and problems covered include  Fair Cuts,  Minimum Balanced Cut,  and  Sparsest Cut.

eecs CS 61A: The Structure and Interpretation of Computer Programs
Lecturer: Summer 2022
     • Sample lecture slides
     • Sample exam
     • Course evaluations
Head TA: Fall 2023, Spring 2023, Fall 2022, Spring 2022
     • Sample discussion slides
     • TA evaluations
TA: Fall 2021, Summer 2020
     • Teaching website
Tutor: Summer 2023, Summer 2021, Spring 2021, Fall 2020
Academic Intern: Spring 2020
eecs CS106A – Code in Place: Programming Methodologies
Section Leader: Spring 2021, Spring 2020
Awards & Honors

[Spring 2023] Outstanding Graduate Student Instructor (OGSI) Award.

[Spring 2021] Upsilon Pi Epsilon (UPE). International CS Honor Society. Top third of Berkeley CS majors.

[Spring 2020] CS 61A Outstanding Academic Intern. Awarded to top 9 out of over 130 Academic Interns for exemplary teaching.

Work Experience

Amazon, Threat Intelligence
Software Development Engineer Intern, Summer 2021


UC Berkeley CS Faculty Interview Committee: 2022, 2023

Campus Organizations

Project Manager, Software Developer

Computer Science Mentors
Intro CS & Data Structures Mentor

Extended Reality @ Berkeley
VR DeCal Facilitator

AFX Tech
Project Lead, Software Developer

University Wind Ensemble

University Chorus
Tenor, Bass

University Symphony Orchestra


CS 61A Sp24 Private Tutoring


Course Map

Old Homepage

Teaching Site


Last updated June 13, 2024.