arXiv · 2026 · LLM preference optimization
DDO-RM for LLM Preference Optimization: A Minimal Held-Out Benchmark against DPO
Tiantian Zhang, Jierui Zuo, Micheal Chen
A reward-guided decision-distribution approach for LLM preference optimization. The public benchmark is
deliberately narrow and preliminary: it compares DDO-RM with DPO on a held-out preference split and frames
scaling to larger candidate sets and stronger model families as the next step.
arXiv · 2025 · online learning theory
Rank-Induced PL Mirror Descent: A Rank-Faithful Second-Order Algorithm for Sleeping Experts
Tiantian Zhang
A rank-faithful mirror descent algorithm for sleeping experts under partial availability, using a
rank-induced Plackett–Luce parameterization. This project grew from a Machine Learning Theory course
project; I am grateful for Prof. Daniel Hsu’s instruction and feedback on the problem area.
Ongoing · decision-focused optimization
Deep Decision Optimization for Predict-then-Optimize
With Prof. Adam Elmachtoub
An active DDO direction comparing decision-aware training updates with SPO/SPO+ style baselines on
downstream optimization benchmarks.
Placeholder · internship research
Dynamic Prediction + Decision Optimization for Portfolio Decisions
Boke Technology · manuscript in preparation
Placeholder for the dynamic prediction-to-decision project from the Boke Technology internship. The planned
wording keeps it as an unpublished manuscript and leaves the arXiv / paper link empty until it is public.
Independent study · discrete 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.
manuscript in preparation
Earlier research · robust and generative learning
Causal DRO and Rectified Flow Models
Advisor: 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.