Tooling24d ago
FreeMatching: HKUST and ByteDance Open-Source Dense Correspondence Matching Beyond Spatio-Temporal Priors
Dense correspondence matching serves as the bedrock for optical flow, 3D stereo reconstruction, and object tracking. For decades, classical matching algorithms have fundamentally relied on rigid spatio-temporal priors: smooth motion continuity and rigid geometry. However, these foundational assumptions collapse under modern AI image editing and reference-guided generation (IEG), where visual identity is preserved while physical and geometric continuity is drastically severed (such as radical pose warps, stylistic shifts, or compositional recontextualization). Researchers from HKUST and ByteDance introduce FreeMatching (arXiv:2610.12421, code: github.com/luping-liu/FreeMatching), a generalizable framework for dense correspondence matching beyond spatio-temporal priors. FreeMatching fuses generative foundation features (from diffusion backbones) with high-level semantic representations (from vision foundation models), trained against heterogeneous supervision spanning classical benchmarks, tracked video sequences, and synthetic 3D scenes. An unsupervised teacher-guided iterative refinement loop further sharpens dense correspondences across challenging generated image pairs without requiring dense manual annotations. FreeMatching achieves dramatic leaps in correspondence precision across complex AI-edited image pairs while retaining competitive accuracy on classical optical flow tasks, and serves as an auditable quantitative metric for evaluating visual identity preservation that closely aligns with human judgment.
Tooling24d ago
MC-Sparse: CUHK and ByteDance Unveil Meta-Cached Sparse Attention for DiTs, Accelerating Video & 3D Generation by 2.32x with Zero Quality Loss
Diffusion Transformers (DiTs) underpin frontier video generation systems and high-fidelity 3D modeling, yet self-attention computation over extreme sequence lengths introduces prohibitive inference latencies and memory bottlenecks. While sparse attention represents a promising acceleration pathway, existing methods suffer substantial visual quality degradation and texture corruption under high sparsity regimes. Researchers from The Chinese University of Hong Kong (CUHK) and ByteDance analyze sparse attention failures in DiTs (arXiv:2610.06801), tracing quality drops to three root causes: rigid token grouping constraints, inaccurate interaction selection, and uncompensated attention residuals from discarded tokens. The authors introduce Meta-Cached Sparse Attention (MC-Sparse, project site: dodododddo.github.io/mcsparse-project-page/), a training-free framework that preserves individual Key-Value (KV) selection precision while organizing similar Queries into tile-aligned blocks for hardware efficiency on GPUs. MC-Sparse caches query clusters, exact KV indices, and dense-sparse attention output residuals, reusing this metadata across downstream denoising timesteps. On Minimax-H3-Base video models, MC-Sparse delivers a 1.80x denoising speedup, and a 2.32x acceleration on 3D generative backbones, maintaining near-identical fidelity to dense attention with zero visible quality degradation.
Tooling4d ago
Benji Taylor, head of design at X and SpaceXSI, open-sources Stageshow, an agent skill for realistic faux product UI and animated demos
On Oct 31, Benji Taylor, head of design at X and SpaceXSI, released Stageshow on X: an open-source skill (MIT license) for coding agents that helps them produce faux product UI that looks real, including stills, cursor demo animations, and bento grids, delivered as ordinary React components. It installs with one command, and he says it works with Grok Build, Claude Code, Codex, Gemini, and others. The launch post drew about 4,500 likes and 6,500 bookmarks. He notes it rarely nails a demo in one shot and most still take a few rounds of feedback.
Discussion & Comments
0Sign in to join the discussion
Connect with AI developers to exchange benchmark insights.