arXiv:2411. 09816v5 Announce Type: replace Abstract: Large neural networks achieve state-of-the-art performance on many tasks, yet their sheer size hinders deployment on resource-constrained devices.
arXiv:2509. 25136v3 Announce Type: replace Abstract: Activation-aware low-rank factorization techniques yield strong compression results but are generally confined to linear layers, while existing whitening-based theory typically makes an implicit full-rank assumption on activations.
The paper introduces GaugeLasso, a method that applies symmetric group‑lasso penalties to transformer channels during training, enabling entire tensor slices to be zeroed out while maintaining dense tensors for GPU efficiency. By calibrating channel penalties based on inference utility per compute, the network self‑organizes into depth‑dependent structural profiles that can be dramatically smaller than the original architecture, achieving up to 255‑fold compression on a polynomial division task and outperforming hand‑designed baselines on language modeling and autoencoding benchmarks. The approach also accelerates training and reveals over‑provisioned axes that guide subsequent design iterations.
To reduce deployment cost and retraining overhead, adapting pretrained learned image compression (LIC) models to downstream machine vision tasks has attracted growing attention. However, existing meth...
CrossMambaTuning is a new framework that adapts pretrained learned image compression models to machine vision tasks with minimal retraining. It combines State Space Models with cross‑layer interaction, featuring a Mamba adapter that uses task‑specific prompts and multi‑scale branching, and a Scale‑Invariant Cross‑Layer Adapter (SICA) that shares parameters across scales to reduce redundancy. Experiments show that this approach achieves state‑of‑the‑art performance while cutting parameter overhead by 72% compared to existing methods.
arXiv:2608. 10837v1 Announce Type: cross Abstract: The strong performance of foundation models for tabular tasks comes at substantial inference costs.
arXiv:2609.23733v1 Announce Type: new Abstract: Feed-forward visual geometry models such as the Visual Geometry Grounded Transformer (VGGT) have recently enabled direct 3D reconstruction from multi-v...
arXiv:2609.15975v1 Announce Type: cross Abstract: Transformer representations evolve through learned additive transformations that either preserve their current direction or redirect it. We study thi...
arXiv:2608. 02064v1 Announce Type: new Abstract: Feed-forward networks (FFNs) account for a large fraction of Transformer parameters, yet their hidden width is usually constant across depth.
arXiv:2605. 30836v2 Announce Type: replace Abstract: Recent SVD based compression methods for large language models like SVD LLM and Basis Sharing can be unified under one optimization problem.
arXiv:2606. 26538v1 Announce Type: cross Abstract: Deep Transformers are composed of uniformly stacked residual blocks, yet their deepest layers often add little value.
The paper introduces a novel compression framework for image-to-shape Diffusion Transformers (DiTs) that significantly reduces model size while preserving geometric fidelity. By exploiting the non-uniform importance of 3D DiT layers, the authors combine structured pruning, adaptive quantization, and targeted fine‑tuning into a vitality‑guided approach. The method achieves up to a 66% reduction in model size across state‑of‑the‑art image‑to‑3D models without compromising synthesis quality, offering a plug‑and‑play solution for efficient 3D shape generation.