← Search

Weimin Wu

10 accepted papers

2026

Genome-Factory: A Library for Tuning, Deploying, and Interpreting Genomic Foundation Models

ICML 2026poster

We introduce Genome-Factory, the first integrated Python library for tuning, deploying, and interpreting genomic foundation models. Our core contribution is to simplify and unify the workflow for genomic model development: data collection, model tuning, inference, benchmarking, and interpretability.…

Cited by 1Source ↗Scholar ↗
2026

Sci2Pol: Evaluating and Fine-tuning LLMs on Scientific-to-Policy Brief Generation

ICLR 2026poster

We propose Sci2Pol-Bench and Sci2Pol-Corpus, the first benchmark and training dataset for evaluating and fine-tuning large language models (LLMs) on policy brief generation from a scientific paper. We build Sci2Pol-Bench on a five-stage taxonomy to mirror the human writing process: (i) Autocompleti…

Cited by 0Source ↗code ↗Scholar ↗
2025

In-Context Learning as Conditioned Associative Memory Retrieval

ICML 2025poster

We provide an exactly solvable example for interpreting In-Context Learning (ICL) with one-layer attention models as conditional retrieval of dense associative memory models. Our main contribution is to interpret ICL as memory reshaping in the modern Hopfield model from a conditional memory set (in-…

Cited by 0Source ↗PDF ↗Scholar ↗
2025

On Statistical Rates of Conditional Diffusion Transformers: Approximation, Estimation and Minimax Optimality

ICLR 2025poster

We investigate the approximation and estimation rates of conditional diffusion transformers (DiTs) with classifier-free guidance. We present a comprehensive analysis for “in-context” conditional DiTs under various common assumptions: generic and strong Hölder, linear latent (subspace), and Lipschitz…

Cited by 10Source ↗PDF ↗Scholar ↗
2024

On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)

NeurIPS 2024poster

We investigate the statistical and computational limits of latent **Di**ffusion **T**ransformers (**DiTs**) under the low-dimensional linear latent space assumption. Statistically, we study the universal approximation and sample complexity of the DiTs score function, as well as the distribution reco…

Cited by 29Source ↗PDF ↗Scholar ↗