• Bioinfo major, CSE minor @ UCSD
• Transit enthusiast: Did BART speed run (visited all 50 stations in 6:30)
• Cycle, Run from time to time
• 90% software (battlecode '24-'25, lab work, personal projects, Calico)
• 10% hardware (ucsd micromouse team lead)
• Research Assistant @ Hao Su Lab since Dec 2023
• Research Assistant @ Telese Lab since Dec 2024

• Agrad: Homecooked AutoGrad library (Built PyTorch from scratch)
  • basic_rl: RL from the basics written w/ Agrad
• ManiSkill: Parallelized Robotics Simulation suite
• Shakespearify: LM converting modern english to old english
• Bad Apple google calendar: Link to video
• nl_evo: Performing optimization using RL, gradient descent, and genetic algorithms on neural circuits.

(Dis)prove: Given a plane of arbitrary size and n dots that can be placed on this plane, a line of symmetry can be defined such that on each side of the line an equal number of dots rest (including colinear points). This line doesn't necessarily need to divide the plane into two, it just needs to have an equal number of dots on either side. Can it be (dis)proven that such a line that passes through at least one dot exists for every n.