Researcher profile

Wenbiao Zhao

Wenbiao Zhao contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 13 - UnverifiedVerification L1Unclaimed author
2works
0followers
2topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

2 published item(s)

preprint2026arXiv

Pyramid Forcing: Head-Aware Pyramid KV Cache Policy for High-Quality Long Video Generation

Autoregressive video generation enables streaming and open-ended long video synthesis, but still suffers from long-term degradation caused by accumulated errors. Existing KVCache strategies usually apply unified historical-frame retention, implicitly assuming homogeneous historical dependencies across attention heads. We revisit historical-frame attention and reveal three distinct head types: Anchor Heads require broad long-range context, Wave Heads exhibit periodic temporal dependencies, and Veil Heads focus on initial and adjacent frames. Based on this finding, we propose Pyramid Forcing, a head-aware pyramidal KVCache framework that identifies head types offline, assigns behavior-specific cache policies, and supports heterogeneous cache lengths via efficient ragged-cache attention. Experiments on Self Forcing and Causal Forcing show that Pyramid Forcing consistently improves long-horizon generation quality on VBench-Long, increasing the 60-second Self Forcing score from 77.87 to 81.21 while enhancing motion dynamics, visual fidelity, and semantic consistency. Project: https://if-lab-pku.github.io/Pyramid-Forcing/.

preprint2020arXiv

Detecting multiple change points: a PULSE criterion

The research described herewith investigates detecting change points of means and of variances in a sequence of observations. The number of change points can be divergent at certain rate as the sample size goes to infinity. We define a MOSUM-based objective function for this purpose. Unlike all existing MOSUM-based methods, the novel objective function exhibits an useful ``PULSE" pattern near change points in the sense: at the population level, the value at any change point plus 2 times of the segment length of the moving average attains a local minimum tending to zero following by a local maximum going to infinity. This feature provides an efficient way to simultaneously identify all change points at the sample level. In theory, the number of change points can be consistently estimated and the locations can also be consistently estimated in a certain sense. Further, because of its visualization nature, in practice, the locations can be relatively more easily identified by plots than existing methods in the literature. The method can also handle the case in which the signals of some change points are very weak in the sense that those changes go to zero. Further, the computational cost is very inexpensive. The numerical studies we conduct validate its good performance.