ZeroHour

Search: “MiniMax”

4 stories

Nunchux AI Introduces VC-Attention: A Training-Free Low-Bit Attention Kernel That Speeds Up Video Diffusion Transformers

Nunchux AI introduces VC-Attention, a training-free low-bit attention kernel that speeds up video diffusion transformers up to 3.58x.

Nunchux AI unveiled VC-Attention, a training-free attention kernel for video Diffusion Transformers combining V-Smooth (k-means value-token grouping with block-mean residual quantization) and ExpCast-FP8 (single multiply-add softmax exponentiation). Benchmarks on Wan2.2-T2V-A14B, LongCat-Video, HunyuanVideo-1.5, and MiniMax-H3 show 1.59x attention speedup on B200 at 8-bit and 3.58x on RTX 5090 at 4-bit, with end-to-end gains up to 1.70x. It beats SageAttention2 by 2.3 dB PSNR on Wan2.2 at 8-bit and SageAttention3 by up to 3.6 dB at 4-bit. No public kernel release yet; a proprietary extension runs in Nunchux's stack.

MarkTechPost · 1h agoAI research

StepAudio 3 Music Technical Report

StepAudio 3 Music introduces long-form text-controlled music generation using ABC-notation planning and flow-matching diffusion, ranking near the top music arena.

StepAudio 3 Music generates long-form, text-controlled music using a 50-Hz single-codebook tokenizer with 65,536 entries and a flow-matching diffusion Transformer over VAE latents. A Mixture-of-Experts autoregressive model first plans an arrangement in ABC notation (ABC-CoT) before predicting music tokens. With DPO fine-tuning, it tops AudioBox content and production quality scores and reaches Quality Elo 1105 on the Artificial Analysis Music Arena, behind Suno V5.5 and Mureka. Generation covers songs, accompaniment from dry vocals, and cover synthesis up to 5 minutes 30 seconds at 48-kHz output.

Hugging Face daily papers · 6d agoAI research

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

Theory paper derives nearly tight Rademacher complexity bounds for sparsely activated one-hidden-layer ReLU networks.

Building on Awasthi et al. (COLT 2024), the authors bound statistical complexity for networks where each input activates at most k of s hidden units. A support-preserving cover and normalized chaining argument remove the explicit dimension factor, with matching lower bounds up to logarithms. They also derive agnostic minimax excess-risk bounds of order min{1, sqrt(s/(km))} for a normalized bounded loss and show bias bounds comparable to WR restore worst-case rates even on domains where sparsity holds globally.

arXiv cs.AI / cs.LG / cs.CL · 8d agoAI research

Latest open artifacts (#24): Motif-3, GLM-5.3, Hy4-preview and open model licenses

Interconnects surveys new open models—Motif-3, GLM-5.3, Hy4-preview—while analyzing a licensing split: Western labs opening up, Chinese frontier labs getting restrictive.

The roundup covers Motif-3 (MIT license, strong scores for its size), GLM-5.3 (switched from MIT to a custom license with a $10 billion revenue threshold and undefined 'affiliates' clause requiring Z.AI security review), and Tencent's Hy4-preview (competent but prone to overthinking). It also notes dots3-note-prev from RedNote/Xiaohongshu (won IMO 2026 with a perfect score), Qwen3.8-Flash-Next (125B-A6B with GDN and Qwen Sparse Attention), NVIDIA Nemotron-3.5-Lightning-30B-A3B-BF16, and Ling-3.0-flash. The core theme: Google and Meta adopted Apache 2.0 while Chinese frontier labs (Zhipu, Kimi K3, MiniMax M3) adopted restrictive commercial licenses.

Interconnects · 8d agoAI research