Algorithms · Optimization · Machine Learning Theory

Tiantian (Crystal) Zhang

I design optimization-driven algorithms for modern AI. My work asks how algebraic, probabilistic, and geometric structure can be discovered inside current learning systems and then used to build better algorithms for Transformer foundations, generative modeling, online learning, and decision-making under uncertainty.

Explore ↓

About

Frontier AI Algorithms

I am Tiantian (Crystal) Zhang. My training combines computer science, optimization, and financial engineering: I completed a B.A. in Computer Science at Columbia University, and I will begin the M.S. in Financial Engineering program at Columbia Engineering / IEOR in Fall 2026.

Tiantian (Crystal) Zhang

Algorithms, optimization, and mathematical foundations of AI

My research studies how mathematical structure can transform frontier algorithms. I am especially interested in Transformer foundations, continuous-time generative modeling, online learning, decision-focused optimization, portfolio decisions, and future work on bandit/RL algorithms under epistemic uncertainty.

Algorithms Optimization Machine learning theory Transformer foundations Generative modeling Decision-focused learning
♔

Research philosophy · updated June 30, 2026

My top-down research question is: how can mathematical structure and optimization geometry reveal the algorithms implicit in modern AI systems, and how can those insights be turned into better algorithms and better decisions?

My trajectory began with computer vision, deep learning, and generative models, then moved toward statistical learning theory, advanced algorithms, theoretical computer science, combinatorial optimization, LLMs, portfolio optimization, online learning, and decision-making under uncertainty.

I am especially (broadly)interested in LLM theory(pretrain/posttrain), previously dive deep in ML/DL theory.

Research

Three representative directions

My projects are connected by one principle: use optimization, algebra, probability, and complexity-theoretic intuition to redesign algorithms rather than only analyze them after the fact.

01

Large language models foundations

My public 2025 automata work studies how representation-theoretic structure can support Transformer simulations of richer finite automata, extending shortcut-style analysis through semidirect products, group actions, and Fourier modules.

Another ongoing LLM theory work arXiv link that combines property testing, inverse RL and representation learning together with new term MIRROR, try to mitigate continual learning under Prof. Peng Binghui's supervision.

02

Generative graphical models(learning)

Bridge Graphical Models study diffusion, flow matching, Schrödinger bridges, and field-based samplers through endpoint coupling, bridge law, Markov projection, and the Markovization gap to a broader generative graphical family see Chinese Blog, with 300+ stars.

A research agenda trying to evolve into next generation of autoregressive models and Diffusion LLM inference, speedup and sampling.

03

Online learning theory and Optimization

RIPLM studies sleeping experts through rank-induced Plackett–Luce geometry and mirror descent, aiming for rank-faithful and variance-adaptive online algorithms.

DDO studies predict-then-optimize learning through regularized FY/SPO+ geometry, smooth support moments, and compressed or geometry-controlled differentiable oracles.

Mathematics should transform algorithms, not only explain them.

I aim to turn mathematical intuition into algorithmic primitives: algebraic decompositions for Transformer computation, Markov-compression diagnostics for generative paths, rank geometry for online learning, and decision-aware surrogates for optimization pipelines.

Selected work and experience

Publications and projects

Selected projects in algorithms, optimization, machine learning theory, Transformer foundations, generative modeling, and decision-focused learning.

arXiv · 2025 · online learning theory

Rank-Induced PL Mirror Descent: A Rank-Faithful Second-Order Algorithm for Sleeping Experts

Tiantian Zhang · Technical Feedback from Prof.Daniel Hsu

A mirror-descent algorithm for sleeping experts under partial availability, using a rank-induced Plackett–Luce parameterization. The project studies how online learners can preserve rank structure while adapting to variance in sequential decision problems.

Ongoing · decision-focused optimization

Deep Decision Optimization: Regularized FY/SPO+ Surrogates and Compressed Moment Oracles

Tiantian Zhang · technical feedback from Prof. Adam Elmachtoub

An active predict-then-optimize direction that views SPO+ through Fenchel–Young/support-function geometry, then replaces hard exposed-face subgradients with smooth support moments. Current work studies compressed moment oracles, including PL, soft dynamic programming, Sinkhorn, perturbation pools, and geometry-controlled neural oracles.

Industry research · portfolio optimization

Dynamic Prediction + Decision Optimization for Portfolio Decisions

Boke Technology · manuscript in preparation

A dynamic prediction-to-decision project studying multi-horizon forecasting and downstream portfolio optimization. Current diagnostics emphasize fair comparison to simple baselines, conservative decision learning, and the gap between predictive accuracy and realized portfolio decisions.

Independent study · combinatorial optimization

Extension Complexity of the Stable-Set Polytope

Advisor: Prof. Yuri Faenza

A combinatorial optimization project studying extension-complexity lower bounds through polynomial and geometric methods over finite fields, connecting slack-matrix structure with communication-complexity style arguments.

Earlier research · robust and generative learning

Causal DRO and Rectified Flow Models

Research training with Prof. Kede Ma and Prof. Qiang Liu

Earlier projects studied causal constraints for robust generalization and rectified-flow ideas for generative learning and transport-based sampling. This work helped motivate the later Bridge Graphical Models direction.

Education

Computer science, AI, and quantitative optimization

Cross-disciplinary training in computer science, machine learning, optimization, and financial engineering.

2026–2028

Columbia University

Incoming M.S. in Financial Engineering(defer), Columbia Engineering / IEOR.

2021–2025

Columbia University

B.A. in Computer Science

Coursework

Selected graduate-level and advanced coursework

Analysis of Algorithms, Advanced Algorithms, Machine Learning Theory, Convex Optimization, Statistical Learning, Theory of Large Language Models, Combinatorial Optimization, Reinforcement Learning in LLMs, and related seminars in AI and optimization.

Honors

Selected awards and honors

Dean’s List, Computer Science Honor Society, Women in Computer Science, William Lowell Putnam Mathematical Competition 2024, and Chinese Mathematics Competition first prize with full marks in 2017.

Experience

Industry research

I am interested in prediction-to-decision systems where uncertainty, optimization, and deployment constraints must be designed together.

01

Boke Technology · Quant Researcher Intern

Portfolio optimization research on dynamic prediction + decision systems, including multi-horizon prediction models and downstream mean–variance style objectives. The related manuscript is in preparation.

02

Cantor Fitzgerald / BGC Group · ML Research Intern

Machine learning research for FX options, predictive analysis, and noisy market-data workflows.

People

Acknowledgements

I am grateful for guidance, instruction, and technical feedback from faculty, postdocs, and research collaborators. I also lead the Columbia Quant LLM Club.

R

Research guidance and technical feedback

I am grateful to Prof. Adam Elmachtoub for feedback on decision-focused optimization, Prof. Yuri Faenza for guidance on combinatorial optimization, Prof. Kede Ma for intensive research training, Prof. Qiang Liu for generative-modeling direction, and Dr. Yong Lin for discussions on LLM and reward-model questions.

T

Theory, algorithms, and community

I am grateful for Prof. Daniel Hsu’s instruction and feedback through machine learning theory, for theory and algorithms coursework at Columbia, and for research discussions in the Columbia Quant LLM Reading Group, which brings together students, researchers, and industry friends around LLM theory, post-training, reasoning, and quantitative AI.

Contact

Interested in algorithms, optimization, or mathematical foundations of AI?

I am happy to connect about research ideas, seminar conversations, and project discussions.