Looped Transformers reuse a shared block across recurrent depths, making autoregressive decoding expensive because every generated token requires many sequential recurrent passes. Self-speculative decoders reduce this cost by drafting at an early depth and verifying at full depth, but typically bind draft computation t...
Guang-Hao Li, Zi-Han Su, Hao Yu et al.· 0 citations
WeVisDoc is presented, a two-stage data-centric framework for robust end-to-end document parsing that broadens semantic, structural, and appearance coverage through heterogeneous data and structure-preserving degradation synthesis and guides targeted data construction and reallocation of the target-token budget.
Hao Yu, Kang Liu, Lin-Nan Zhao et al.· 0 citations
PaDoc is proposed, a layout-grounded parser that treats the predicted layout as a branching structure over a shared page representation that is the fastest end-to-end parser at five concurrency levels and is the fastest end-to-end parser at five concurrency levels.
Hao Yu, Jia-Bo Zhan, Kang Liu et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.