Block Diffusion Language Models (BD-LMs) support KV caching and flexible-length generation, but their native Single-Block Diffusion (SingleBD) inference leaves inter-block parallelism unused. We study Multi-Block Diffusion (MultiBD), where a running-set of consecutive blocks is refined concurrently. Existing teacher-forced BD-LMs observe only one noisy block conditioned on a clean prefix, while diffusion forcing exposes a long noisy suffix whose state distribution still differs from practical MultiBD inference. We bridge this gap with Multi-Block Diffusion Language Models (MBD-LMs), obtained by post-training BD-LMs using Multi-block Teacher Forcing (MultiTF). MultiTF trains on bounded noise-groups conditioned on clean prefixes, with heterogeneous slot-wise noise patterns that better match inference. An optimized Block Buffer further preserves prefix-cache reuse and static input shapes, translating inter-block parallelism into wall-clock acceleration. On math and code benchmarks, MBD-LLaDA2-Mini increases average Tokens Per Forward pass (TPF) from 3.47 to 6.19 while maintaining comparable accuracy (80.0% versus 81.0%). Combined with DMax, it reaches 9.34 TPF with a 1.02-point accuracy drop. Project Page: https://sjtu-deng-lab.github.io/mbd-lms

Multimodal Sentiment Analysis (MSA) is a rapidly developing field that integrates multimodal information to recognize sentiments, and existing models have made significant progress in this area. The central challenge in MSA is multimodal fusion, which is predominantly addressed by Multimodal Transformers (MulTs). Although act as the paradigm, MulTs suffer from efficiency concerns. In this work, from the perspective of efficiency optimization, we propose and prove that MulTs are hierarchical modal-wise heterogeneous graphs (HMHGs), and we introduce the graph-structured representation pattern of MulTs. Based on this pattern, we propose an Interlaced Mask (IM) mechanism to design the Graph-Structured and Interlaced-Masked Multimodal Transformer (GsiT). It is formally equivalent to MulTs which achieves an efficient weight-sharing mechanism without information disorder through IM, enabling All-Modal-In-One fusion with only 1/3 of the parameters of pure MulTs. A kernel called Decomposition is implemented to ensure avoiding additional computational overhead. Moreover, it achieves significantly higher performance than traditional MulTs. To further validate the effectiveness of GsiT itself and the HMHG concept, we integrate them into multiple state-of-the-art models and demonstrate notable performance improvements and parameter reduction on widely used MSA datasets. Experimental results also demonstrate its effectiveness on other multimodal tasks. The code is available in https://github.com/drewjin/GsiT.git.