Laryn Qi

I am an MS student in EECS at UC Berkeley where I do research in building 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.

larynqi [at] berkeley [dot] edu
Resume  /  LinkedIn  /  GitHub

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. Also includes an incomplete implementation of the first approximation algorithm for Minimum Balanced Cut by Spielman and Teng.

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

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

[Spring 2023] Top 6.5% in CS 189 (Machine Learning) Kaggle competition (>700 students). Trained an SVM model to classify CIFAR-10 data with 56% accuracy.

[Fall 2021] Top 6% in CS 170 (Algorithms) Final Project competition (>700 students). Designed a greedy algorithm implemented with dynamic programming to approximate an NP-hard problem. Generated and tested heuristics on the cloud.

[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.

Last updated September 6, 2023.