San Jose, California, United States
Interested in theoretical computer science.
Investigated the relationship between the learnability of a signal with its “Fourier Ratio,” the ratio between the L^1 and L^2 norms of its Fourier transform Proved that signals with low Fourier Ratio allow approximation via low-degree trigonometric polynomials, have low algorithmic rate-distortion and VC dimension, and display additive structure in high valued sets Wrote Python simulations to numerically estimate constants in Bourgain- and Talagrand-type inequalities
Mathematics research with Professor Alex Iosevich
Design & Analysis of Efficient Algorithms Held recitation sessions and graded homeworks and exams covering topics including greedy algorithms, linear programming, dynamic programming, graph algorithms, divide and conquer algorithms, and P vs NP
Investigated the theory behind homomorphic encryption techniques (primarily CKKS) to evaluate feasibility for implementation and optimization on Esperanto hardware Studied approximate k-nearest neighbor algorithms for use in retrieval augmented generation
Implemented switch transformers on Vicuna by modifying the Llama architecture to add a Mixture of Experts (MoE) layer Analyzed RoBERTa parameter and activation distributions to investigate opportunities for quantization Led troubleshooting efforts after an AWS EC2 crash and found creative solutions to storage issues
Utilized parallel processing to significantly improve runtime of OCR data processing script Completed dataset which previously took 3 months in 23 hours