Skip to content

Author

Hao-Chen Wang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

RegFM: an interpretable context-aware foundation model for human transcriptional regulation

Transcriptional regulation is governed by interactions between cis-regulatory elements (CREs) and trans-acting regulators in a context-specific manner. Although DNA and single-cell foundation models have enabled modeling regulatory biology at scale, most represent either sequence or cellular state alone, limiting their ability to capture context-dependent gene regulation. Here we present RegFM, a context-aware foundation model for human transcriptional regulation. RegFM treats transcriptional regulation as a dialogue between cis-regulatory sequences (e.g., CREs) and trans-acting regulators (e.g., transcription factors (TFs) and chromatin regulators (CRs)) by coupling long-range CRE representations with TFs and CRs activity. Trained on large-scale ENCODE and CELLxGENE transcriptomic profiles, RegFM learns gene-centered regulatory representations that generalize across unseen cellular contexts. In a wide range of tasks, including gene expression prediction, cis-regulatory element annotation, bivalent promoter and dosage-sensitivity classification, and perturbation-response prediction, RegFM consistently improves over existing methods. RegFM emerges as a scalable and interpretable framework for modeling human transcriptional regulation and provides insights into context-dependent gene regulatory programs.

Zijing Gao, Yining Sun, Hao-Chen Wang et al. · 0 citations
#machine learning Preprint Sep 2026

Code-to-Harness: Distilling Black-Box Optimizers from Self-Play

Can an agent learn a numerical search strategy through executable practice and then transfer that strategy as text? We study low-budget black-box optimization, where unaided language models remain well below strong classical optimizers. During development, an agent repeatedly writes and evaluates optimizer programs. It then distills the resulting program and practice record once into a 197-word primary Harness A, which is frozen before evaluation. Harness A reduces Gemini Flash regret by 48\% in an independent $N=30$ study ($p<.001$), enters the GP-BO performance range on the practice family, and lowers mean regret on all three held-out BBOB landscapes. The same text improves every tested Gemini executor and transfers to Claude Sonnet, reducing regret by 43\% and 49\% ($p\leq.005$). An independent end-to-end replication produces Harness B, a different program and text at the same performance tier. The same framework also attains the lowest regret on a sealed YouTube reward-tuning production benchmark. Executable practice is thus a viable way to discover a search policy, and language a portable medium for deploying it.

Yi Wu, Zheng Ren, Zhi-Yu Hu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.