ReLATE is a reinforcement‑learned framework that automatically discovers safe and efficient sparse encodings for tensor decomposition, eliminating the need for expert‑designed formats. It combines model‑free and model‑based learning, elastic training, rule‑driven action masking, and dynamics‑informed filtering to guarantee correct encoding with bounded execution time, even early in training. After offline training, ReLATE deploys the optimal encoding with negligible overhead and achieves up to 2× speedups over the best expert‑designed format, with a geometric‑mean speedup of 1.38–1.41× on diverse real‑world sparse tensors.
arXiv:2607. 21291v1 Announce Type: cross Abstract: Large language models (LLMs) achieve strong generation and reasoning performance, but the Transformer architecture incurs high inference cost.
arXiv:2609.38984v1 Announce Type: cross Abstract: World-action models (WAMs) leverage pretrained video models to improve generalization in robot control by jointly predicting future visual states and...
arXiv:2501. 14622v5 Announce Type: replace Abstract: Learning efficient representations for decision-making policies is a challenge in imitation learning (IL).
ExFold is a training‑free expert‑folding framework that jointly accelerates the prefill and decode phases of Mixture‑of‑Experts (MoE) models by projecting the contributions of excluded experts onto a retained expert set using calibrated scalar projectors. It treats both phases as a budgeted output‑approximation problem, achieving token‑level Top‑K folding for prefill and batch‑level expert‑pool folding for decode. Implemented as a plug‑and‑play plugin in vLLM with a lightweight CUDA kernel, ExFold delivers up to 1.41× TTFT and 2.45× TPOT speedups while preserving about 99% of the original model quality.
arXiv:2606. 20246v1 Announce Type: cross Abstract: Vision-Language-Action (VLA) models pre-trained on massive video-robot datasets have revolutionized robotic manipulation, yet their multi-billion parameter architectures impose prohibitive computational burdens during downstream fine-tuning and real-time inference.
arXiv:2608.24763v1 Announce Type: cross Abstract: Procedural video-language models must solve heterogeneous tasks from the same visual evidence, including action recognition, forecasting, and procedu...
arXiv:2606. 08962v1 Announce Type: new Abstract: World Action Models (WAMs) generalize better than standard Vision-Language-Action (VLA) policies to novel motions and environments, because a video-modeling objective lets them learn from abundant unlabeled video rather than scarce labeled robot demonstrations.
arXiv:2607. 13498v1 Announce Type: new Abstract: Learning a compact model of the world from interaction data is central to sample-efficient deep reinforcement learning.
arXiv:2608.22869v1 Announce Type: cross Abstract: While Vision-Language-Action (VLA) models have leveraged internet-scale pretraining and task-focused finetuning to achieve strong performance on long...
arXiv:2601. 21461v3 Announce Type: replace-cross Abstract: Modern sparse language models typically achieve sparsity through Mixture-of-Experts (MoE) layers, which dynamically route tokens to dense MLP "experts.
Vector Symbolic Policy Gradient (VSPG) is a discrete-action actor that encodes each action as a unit‑norm hypervector and evaluates it by similarity to the encoded state. Its policy‑gradient update reduces to advantage‑weighted hypervector bundling followed by normalization, enabling the use of standard advantage estimators. The learned action hypervectors act as fixed‑size compressed kernel memories that store advantage‑weighted expansions over visited states, allowing evidence transfer via encoder‑induced similarity and providing a robustness guarantee for greedy action selection under random bit flips.
IntBMoE introduces a block‑conditioned mixture‑of‑experts that decouples participation, execution, and materialization by combining dense expert composition with sparse block execution. Each internal layer uses a lightweight hypernetwork to merge all expert bases into a single composed expert, while a router selects only a few blocks per token, keeping compute and memory costs low. Experiments on image classification, language modeling, and sequential recommendation demonstrate consistent performance gains, and the model is deployed in AMap’s generative recommendation system, improving UVCTR by 2.4% in online A/B tests.