Research

My research interests are in the field of Operations Research, specifically applying optimization techniques to machine learning models to solve difficult computational problems. I have always preferred and valued a multi-disciplinary approach; I think research which extends across disciplines can bridge the gaps in our understanding, help us see the bigger picture, and ultimately drive innovation.

Press & talks

6 projects

Blitz: Accelerating the Diffusion Modules of AlphaFold3 and Boltz-2

October 2026

Venue
Molecular Machine Learning Conference (MoML), MIT, October 2026
Links

AlphaFold 3 and Boltz-2 spend about 200 denoising steps turning noisy coordinates into a molecular structure. With Blitz, we bring that down to eight by training the model to make a series of shorter updates. We also adjust the noise schedule and allow for optional physical steering for Boltz-2. Across our evaluations, Blitz broadly matches the teachers’ structural accuracy, and AF3-Blitz improves on its teacher on several accuracy measures.

Stable Continuous-Time Consistency Distillation: An Empirical Study with a Multistep Extension

September 2026

Venue
Transactions on Machine Learning Research, 2026
NeurIPS 2026, Reproducibility Track, Sydney (presentation)
With
Prof. Soundar R. Kumara, Gretta D. Kellogg, Prof. William KM Lai
Links

We brought Heek et al.’s multistep consistency distillation algorithm to continuous-time consistency models in the TrigFlow formulation. We call this adaptation MS-sCD and use it to generate images through a small number of learned updates. Instead of learning a single mapping from noise to a clean image, the model learns shorter mappings across segments of the diffusion trajectory. The figure below illustrates this with one segment on the left and three on the right. We evaluated two-, four-, and eight-step generation on CIFAR-10 and ImageNet-64. Alongside this, we conducted an independent reproduction study of sCM, trained the teacher models from scratch, and documented the implementation details. We have made the code and all teacher and student model weights openly available.

M = 1: a consistency map takes points along a probability-flow ODE trajectory to its data endpointM = 3: a segment-conditioned consistency model maps trajectory points to the lower boundary of each of three segments
Consistency mappings along a probability-flow ODE trajectory (green). Left: for M = 1, the consistency map (red) maps trajectory points to the data endpoint at t = 0. Right: for M = 3, the noise interval is partitioned into three segments, and the segment-conditioned model maps points within each segment to its lower boundary.

Moment Matching Distillation for Diffusion Models

March 2026

Links

The goal of this project was to provide an open source implementation of the Moment Matching framework by Salimans et al. to distill image diffusion models. Unlike consistency distillation, this is fundamentally a distribution matching problem, allowing the student to match a higher performing stochastic teacher. The core objective is to ensure the conditional expectation of clean data given a noisy observation remains identical between the true data and the distilled model. We use an alternating optimization setup where an auxiliary denoising model estimates this exact expectation, denoted as Eg[x~∣zs]\mathbb{E}_{g}[\tilde{\mathbf{x}} \mid \mathbf{z}_s], where gg is the generator distribution, x~\tilde{\mathbf{x}} is the generated data, and zs\mathbf{z}_s is the noisy observation at step ss. By matching these moments, our 8 step distilled model reaches an FID of 1.4. Training code, checkpoints, and the full implementation are on GitHub.

Protein Structure Prediction for High Throughput Computing

September 2025

Venue
Preprint, 2025
With
Prof. William Lai
Links

This project addresses the deployment and computational hurdles of modern biomolecular prediction and design models like AlphaFold 3, Boltz 2, Chai 1, and RFdiffusion. To make these tools more accessible, we developed optimized open source Singularity containers for both x86 and ARM architectures. Because multiple sequence alignment generation is highly resource intensive, we also built OmniFold. This platform runs these models simultaneously, recycles alignments across algorithms to save compute, and automatically generates a unified quality control report. All containers and code are publicly available to help researchers bypass infrastructure bottlenecks. A preprint is available here, and the OmniFold code is on GitHub.

AlphaFold Accessibility: Resource-Optimized Open-Source Application for Protein Structure Prediction

March 2025

Venue
Global Open OnDemand Conference, Harvard University, March 2025
With
Prof. William Lai, Matt Hansen
Links

Developed an optimized open-source implementation of AlphaFold 2 & 3 in joint work with Prof. William Lai at the Epigenomics Facility at Cornell University that addresses a fundamental challenge in computational structural biology: resource inefficiency. The AlphaFold workflow has roughly 75% of runtime consumed by CPU-intensive multiple sequence alignment (MSA) generation, with GPU resources only required for the final structure prediction phase. Our solution separates these phases within a single Open OnDemand (OOD) instance. This work was presented at the Global Open OnDemand Conference at Harvard University in March 2025. Our work has been adopted by several major HPCs in the United States and around the world. The code is available here.

Unsupervised Embeddings, Networks, and LLM's for hypothesis generation

December 2024

Venue
M.Sc. thesis, Penn State
With
Prof. Soundar Kumara, Prof. Peter Butler

This project is part of my M.Sc thesis under the supervision of Prof. Soundar Kumara and Prof. Peter Butler at Penn State. It aims to extract insights from biomedical literature by generating word embeddings to create weighted word networks. Due to the advances in large language models, biomedical named entity recognition has become much more reliable. Hence, depending on the research question, we use keywords to extract relevant information from these embedding models while carefully selecting the data sources for training. When limiting our models to literature published before a specific year, we discovered mentions of entities in our network that were not officially recognized until later, providing new avenues for the research questions we are investigating.