Semi-autoregressive hierarchical text generation method based on discrete flow matching diffusion algorithm
By decomposing the text sequence into multiple large blocks for parallel generation, combining the hierarchical block structure and discrete stream matching method, the efficiency and quality trade-off problem of language models in long text generation is solved, and efficient and flexible text generation is achieved.
Patent Information
- Application Number
- CN202510745664.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-05
- Publication Date
- 2025-09-26
AI Technical Summary
Existing language models face a trade-off between efficiency and quality in long text generation. Autoregressive models have slow generation speed, diffusion models face challenges in fixed-length generation limitations and perplexity, and block diffusion methods cannot fully utilize semantic hierarchical relationships.
A semi-autoregressive hierarchical text generation method based on the discrete stream matching diffusion algorithm is adopted to decompose the text sequence into multiple large blocks, with autoregressive generation between blocks and parallel generation within blocks. Combined with the hierarchical block structure, the distribution between and within blocks is learned through the discrete stream matching method, a multi-level block tree structure is constructed, and the parallelism is adaptively adjusted.
It significantly improves the efficiency of long text generation and maintains low perplexity. It is suitable for various application scenarios that require efficient text generation. It supports flexible pre-generation strategies, can provide fast preview when computing resources are limited, and maintain high quality while generating in parallel.