Hao Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hao Zhou has a total of 107 co-authors. Here are the top co-authors by number of shared publications:
Wei-Ying Ma
Institute for AI Industry Research, Tsinghua University, Beijing, 100084, P. R. China
7 shared publications- Chenyang Huang
Dept. of Computing Science Alberta Machine Intelligence Institute (Amii) University of Alberta
4 shared publications Jingjing Liu
Generative Symbolic Intelligence Lab (GenSI) Tsinghua University
4 shared publications- Lili Mou
Dept. Computing Science & Alberta Machine Intelligence Institute (Amii) University of Alberta
4 shared publications - Osmar R. Zaiane
Department of Computing Science, University of Alberta, Edmonton, AB, Canada
4 shared publications - Jianbing Zhang
National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China
3 shared publications
Latest Publications
- Open Access
- 4 September 2025
- Published by Royal Society of Chemistry (RSC) in Digital Discovery
- Vol. 4 (10) , 2942-2953
Generative AI-powered inverse design for tailored narrowband molecular emitters
We introduce an AI-driven molecular generation framework. It leverages efficient Markov chain Monte Carlo sampling and multi-objective optimization, enabling rapid, tailored design of narrowband emitters across the desired color spectrum.
- 4 September 2025
- Published by Royal Society of Chemistry (RSC) in Digital Discovery
- Vol. 4 (10) , 2942-2953
Open AccessGenerative AI-powered inverse design for tailored narrowband molecular emitters
We introduce an AI-driven molecular generation framework. It leverages efficient Markov chain Monte Carlo sampling and multi-objective optimization, enabling rapid, tailored design of narrowband emitters across the desired color spectrum.
- Open Access
ShortListing Model: A Streamlined SimplexDiffusion for Discrete Variable Generation
Generative modeling of discrete variables is challenging yet crucial for applications in natural language processing and biological sequence design. We introduce the Shortlisting Model (SLM), a novel simplex-based diffusion model inspired by progressive candidate pruning. SLM operates on simplex centroids, reducing generation complexity and enhancing scalability. Additionally, SLM incorporates a flexible implementation of classifier-free guidance, enhancing unconditional generation performance. Extensive experiments on DNA promoter and enhancer design, protein design, character-level and large-vocabulary language modeling demonstrate the competitive performance and strong potential of SLM. Our code can be found at https://github.com/GenSI-THUAIR/SLM
Open AccessShortListing Model: A Streamlined SimplexDiffusion for Discrete Variable Generation
Generative modeling of discrete variables is challenging yet crucial for applications in natural language processing and biological sequence design. We introduce the Shortlisting Model (SLM), a novel simplex-based diffusion model inspired by progressive candidate pruning. SLM operates on simplex centroids, reducing generation complexity and enhancing scalability. Additionally, SLM incorporates a flexible implementation of classifier-free guidance, enhancing unconditional generation performance. Extensive experiments on DNA promoter and enhancer design, protein design, character-level and large-vocabulary language modeling demonstrate the competitive performance and strong potential of SLM. Our code can be found at https://github.com/GenSI-THUAIR/SLM
- Open Access
Seed Diffusion: A Large-Scale Diffusion Language Model with High-Speed Inference
We present Seed Diffusion Preview, a large-scale language model based on discrete-state diffusion, offering remarkably fast inference speed. Thanks to non-sequential, parallel generation, discrete diffusion models provide a notable speedup to mitigate the inherent latency of token-by-token decoding, as demonstrated recently (e.g., Mercury Coder, Gemini Diffusion). Seed Diffusion Preview achieves an inference speed of 2,146 token/s over H20 GPUs while maintaining competitive performance across a sweep of standard code evaluation benchmarks, significantly faster than contemporary Mercury and Gemini Diffusion, establishing new state of the art on the speed-quality Pareto frontier for code models.
Open AccessSeed Diffusion: A Large-Scale Diffusion Language Model with High-Speed Inference
We present Seed Diffusion Preview, a large-scale language model based on discrete-state diffusion, offering remarkably fast inference speed. Thanks to non-sequential, parallel generation, discrete diffusion models provide a notable speedup to mitigate the inherent latency of token-by-token decoding, as demonstrated recently (e.g., Mercury Coder, Gemini Diffusion). Seed Diffusion Preview achieves an inference speed of 2,146 token/s over H20 GPUs while maintaining competitive performance across a sweep of standard code evaluation benchmarks, significantly faster than contemporary Mercury and Gemini Diffusion, establishing new state of the art on the speed-quality Pareto frontier for code models.
- Open Access
MemAgent: Reshaping Long-Context LLM with Multi-Conv RL-based Memory Agent
Despite improvements by length extrapolation, efficient attention and memory modules, handling infinitely long documents with linear complexity without performance degradation during extrapolation remains the ultimate challenge in long-text processing. We directly optimize for long-text tasks in an end-to-end fashion and introduce a novel agent workflow, MemAgent, which reads text in segments and updates the memory using an overwrite strategy. We extend the DAPO algorithm to facilitate training via independent-context multi-conversation generation. MemAgent has demonstrated superb long-context capabilities, being able to extrapolate from an 8K context trained on 32K text to a 3.5M QA task with performance loss < 5% and achieves 95%+ in 512K RULER test.
Open AccessMemAgent: Reshaping Long-Context LLM with Multi-Conv RL-based Memory Agent
Despite improvements by length extrapolation, efficient attention and memory modules, handling infinitely long documents with linear complexity without performance degradation during extrapolation remains the ultimate challenge in long-text processing. We directly optimize for long-text tasks in an end-to-end fashion and introduce a novel agent workflow, MemAgent, which reads text in segments and updates the memory using an overwrite strategy. We extend the DAPO algorithm to facilitate training via independent-context multi-conversation generation. MemAgent has demonstrated superb long-context capabilities, being able to extrapolate from an 8K context trained on 32K text to a 3.5M QA task with performance loss < 5% and achieves 95%+ in 512K RULER test.
- Open Access
Multilingual Non-Autoregressive Machine Translation without Knowledge Distillation
Multilingual neural machine translation (MNMT) aims at using one single model for multiple translation directions. Recent work applies non-autoregressive Transformers to improve the efficiency of MNMT, but requires expensive knowledge distillation (KD) processes. To this end, we propose an M-DAT approach to non-autoregressive multilingual machine translation. Our system leverages the recent advance of the directed acyclic Transformer (DAT), which does not require KD. We further propose a pivot back-translation (PivotBT) approach to improve the generalization to unseen translation directions. Experiments show that our M-DAT achieves state-of-the-art performance in non-autoregressive MNMT.
Open AccessMultilingual Non-Autoregressive Machine Translation without Knowledge Distillation
Multilingual neural machine translation (MNMT) aims at using one single model for multiple translation directions. Recent work applies non-autoregressive Transformers to improve the efficiency of MNMT, but requires expensive knowledge distillation (KD) processes. To this end, we propose an M-DAT approach to non-autoregressive multilingual machine translation. Our system leverages the recent advance of the directed acyclic Transformer (DAT), which does not require KD. We further propose a pivot back-translation (PivotBT) approach to improve the generalization to unseen translation directions. Experiments show that our M-DAT achieves state-of-the-art performance in non-autoregressive MNMT.
- Open Access
A Decoding Algorithm for Length-Control Summarization Based on Directed Acyclic Transformers
Length-control summarization aims to condense long texts into a short one within a certain length limit. Previous approaches often use autoregressive (AR) models and treat the length requirement as a soft constraint, which may not always be satisfied. In this study, we propose a novel length-control decoding algorithm based on the Directed Acyclic Transformer (DAT). Our approach allows for multiple plausible sequence fragments and predicts a \emph{path} to connect them. In addition, we propose a Sequence Maximum a Posteriori (SeqMAP) decoding algorithm that marginalizes different possible paths and finds the most probable summary satisfying the length budget. Our algorithm is based on beam search, which further facilitates a reranker for performance improvement. Experimental results on the Gigaword and DUC2004 datasets demonstrate our state-of-the-art performance for length-control summarization.
Open AccessA Decoding Algorithm for Length-Control Summarization Based on Directed Acyclic Transformers
Length-control summarization aims to condense long texts into a short one within a certain length limit. Previous approaches often use autoregressive (AR) models and treat the length requirement as a soft constraint, which may not always be satisfied. In this study, we propose a novel length-control decoding algorithm based on the Directed Acyclic Transformer (DAT). Our approach allows for multiple plausible sequence fragments and predicts a \emph{path} to connect them. In addition, we propose a Sequence Maximum a Posteriori (SeqMAP) decoding algorithm that marginalizes different possible paths and finds the most probable summary satisfying the length budget. Our algorithm is based on beam search, which further facilitates a reranker for performance improvement. Experimental results on the Gigaword and DUC2004 datasets demonstrate our state-of-the-art performance for length-control summarization.
- Open Access
A Periodic Bayesian Flow for Material Generation
Generative modeling of crystal data distribution is an important yet challenging task due to the unique periodic physical symmetry of crystals. Diffusion-based methods have shown early promise in modeling crystal distribution. More recently, Bayesian Flow Networks were introduced to aggregate noisy latent variables, resulting in a variance-reduced parameter space that has been shown to be advantageous for modeling Euclidean data distributions with structural constraints (Song et al., 2023). Inspired by this, we seek to unlock its potential for modeling variables located in non-Euclidean manifolds e.g. those within crystal structures, by overcoming challenging theoretical issues. We introduce CrysBFN, a novel crystal generation method by proposing a periodic Bayesian flow, which essentially differs from the original Gaussian-based BFN by exhibiting non-monotonic entropy dynamics. To successfully realize the concept of periodic Bayesian flow, CrysBFN integrates a new entropy conditioning mechanism and empirically demonstrates its significance compared to time-conditioning. Extensive experiments over both crystal ab initio generation and crystal structure prediction tasks demonstrate the superiority of CrysBFN, which consistently achieves new state-of-the-art on all benchmarks. Surprisingly, we found that CrysBFN enjoys a significant improvement in sampling efficiency, e.g., ~100x speedup 10 v.s. 2000 steps network forwards) compared with previous diffusion-based methods on MP-20 dataset. Code is available at https://github.com/wu-han-lin/CrysBFN.
Open AccessA Periodic Bayesian Flow for Material Generation
Generative modeling of crystal data distribution is an important yet challenging task due to the unique periodic physical symmetry of crystals. Diffusion-based methods have shown early promise in modeling crystal distribution. More recently, Bayesian Flow Networks were introduced to aggregate noisy latent variables, resulting in a variance-reduced parameter space that has been shown to be advantageous for modeling Euclidean data distributions with structural constraints (Song et al., 2023). Inspired by this, we seek to unlock its potential for modeling variables located in non-Euclidean manifolds e.g. those within crystal structures, by overcoming challenging theoretical issues. We introduce CrysBFN, a novel crystal generation method by proposing a periodic Bayesian flow, which essentially differs from the original Gaussian-based BFN by exhibiting non-monotonic entropy dynamics. To successfully realize the concept of periodic Bayesian flow, CrysBFN integrates a new entropy conditioning mechanism and empirically demonstrates its significance compared to time-conditioning. Extensive experiments over both crystal ab initio generation and crystal structure prediction tasks demonstrate the superiority of CrysBFN, which consistently achieves new state-of-the-art on all benchmarks. Surprisingly, we found that CrysBFN enjoys a significant improvement in sampling efficiency, e.g., ~100x speedup 10 v.s. 2000 steps network forwards) compared with previous diffusion-based methods on MP-20 dataset. Code is available at https://github.com/wu-han-lin/CrysBFN.
- Top Cited PapersOpen Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 8876-8892
Vision-Language Models Can Self-Improve Reasoning via Reflection
Kanzhi Cheng, Li YanTao, Fangzhi Xu, Jianbing Zhang, Hao Zhou, Yang Liu. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 8876-8892
Top Cited PapersOpen AccessVision-Language Models Can Self-Improve Reasoning via Reflection
Kanzhi Cheng, Li YanTao, Fangzhi Xu, Jianbing Zhang, Hao Zhou, Yang Liu. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025.
- Open Access
AI-Driven Accelerated Discovery of Intercalation-type Cathode Materials for Magnesium Batteries
Magnesium-ion batteries hold promise as future energy storage solution, yet current Mg cathodes are challenged by low voltage and specific capacity. Herein, we present an AI-driven workflow for discovering high-performance Mg cathode materials. Utilizing the common characteristics of various ionic intercalation-type electrodes, we design and train a Crystal Graph Convolutional Neural Network model that can accurately predicts electrode voltages for various ions with mean absolute errors (MAE) between 0.25 and 0.33 V. By deploying the trained model to stable Mg compounds from Materials Project and GNoME AI dataset, we identify 160 high voltage structures out of 15,308 candidates with voltages above 3.0 V and volumetric capacity over 800 Ah/L. We further train a precise NequIP model to facilitate accurate and rapid simulations of Mg ionic conductivity. From the 160 high voltage structures, the machine learning molecular dynamics simulations have selected 23 cathode materials with both high energy density and high ionic conductivity. This AI-driven workflow dramatically boosts the efficiency and precision of material discovery for multivalent ion batteries, paving the way for advanced Mg battery development.
Open AccessAI-Driven Accelerated Discovery of Intercalation-type Cathode Materials for Magnesium Batteries
Magnesium-ion batteries hold promise as future energy storage solution, yet current Mg cathodes are challenged by low voltage and specific capacity. Herein, we present an AI-driven workflow for discovering high-performance Mg cathode materials. Utilizing the common characteristics of various ionic intercalation-type electrodes, we design and train a Crystal Graph Convolutional Neural Network model that can accurately predicts electrode voltages for various ions with mean absolute errors (MAE) between 0.25 and 0.33 V. By deploying the trained model to stable Mg compounds from Materials Project and GNoME AI dataset, we identify 160 high voltage structures out of 15,308 candidates with voltages above 3.0 V and volumetric capacity over 800 Ah/L. We further train a precise NequIP model to facilitate accurate and rapid simulations of Mg ionic conductivity. From the 160 high voltage structures, the machine learning molecular dynamics simulations have selected 23 cathode materials with both high energy density and high ionic conductivity. This AI-driven workflow dramatically boosts the efficiency and precision of material discovery for multivalent ion batteries, paving the way for advanced Mg battery development.
- Open Access
- 27 November 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Generative AI-Powered Inverse Design for TailoredNarrowband Molecular Emitters
In organic displays, developing molecules that produce a broad color gamut with exceptional color purity is of critical importance. AI-assisted molecular screening can expedite the design process of emission molecules. However, the efficiency of current methodologies is constrained by their limited candidate pools and poor hit rates. Here we present MEMOS, a cutting-edge molecular generation framework that, through Markov molecular sampling techniques, facilitates the targeted inverse design of molecules across a nearly boundless chemical space, tailored to emit the narrow spectral bands associated with desired colors. Notably, by employing a self-improving iterative process, MEMOS achieves an impressive hit rate of up to 80%. Our method showcases the pioneering capability to rapidly navigate through millions of molecular possibilities, efficiently pinpointing thousands of high-potential candidates within a 24-hour period. This breakthrough accelerates the design of novel organic luminescent materials, setting the stage for the advancement of the next generation of high-quality organic displays.
- 27 November 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessGenerative AI-Powered Inverse Design for TailoredNarrowband Molecular Emitters
In organic displays, developing molecules that produce a broad color gamut with exceptional color purity is of critical importance. AI-assisted molecular screening can expedite the design process of emission molecules. However, the efficiency of current methodologies is constrained by their limited candidate pools and poor hit rates. Here we present MEMOS, a cutting-edge molecular generation framework that, through Markov molecular sampling techniques, facilitates the targeted inverse design of molecules across a nearly boundless chemical space, tailored to emit the narrow spectral bands associated with desired colors. Notably, by employing a self-improving iterative process, MEMOS achieves an impressive hit rate of up to 80%. Our method showcases the pioneering capability to rapidly navigate through millions of molecular possibilities, efficiently pinpointing thousands of high-potential candidates within a 24-hour period. This breakthrough accelerates the design of novel organic luminescent materials, setting the stage for the advancement of the next generation of high-quality organic displays.