The paper introduces MemMTL, a multi‑task dense prediction framework that uses a compact task state derived from global visual context and refines it via a learnable prototype memory. This refined state informs task‑conditioned expert logits, which are combined with token‑level logits and routed through a sparse top‑k selection over a shared local expert bank. A task‑agnostic residual bank offers a common adaptation path, and both paths are added to the backbone feature before task‑specific prediction. The authors outline an evaluation protocol on NYUD‑v2 and PASCAL‑Context using SAM 3 and ViT‑L backbones to assess predictive quality, computational cost, and the contributions of task‑state conditioning, prototype retrieval, and sparse routing.
arXiv:2606.15765v2 Announce Type: replace Abstract: Vision foundation models (VFMs) exhibit complementary strengths shaped by their pretraining objectives. Yet prevailing methods for multi-task dense...
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:2607. 16012v1 Announce Type: cross Abstract: Multi-Task Learning (MTL) in robotics perception systems supports comprehensive 3D spatial scene understanding by integrating semantic segmentation and depth estimation.
VisionWeave introduces elastic visual representation weaving, a native capability for multimodal large language models that learns where and at what granularity to encode visual information. The method combines a gated spatial pooler for coarse representations with a granularity router that allocates content‑adaptive token usage, trained end‑to‑end on large‑scale data. Experiments on Qwen3.5‑4B and Qwen3.8‑27B show that VisionWeave can save 43.0% of tokens while preserving 98.9% of performance across eight benchmarks, and delivers significant throughput gains and latency reductions when deployed on the SGLang serving engine.
arXiv:2609.37250v1 Announce Type: cross Abstract: World-action models (WAMs) couple future visual-state prediction with action generation. By adapting video generators or image-editing models pretrai...
arXiv:2605.12491v2 Announce Type: replace Abstract: Vision Transformers (ViTs) learn rich visual-semantic representations through all-to-all self-attention among patch tokens. However, this design im...
arXiv:2606. 01503v1 Announce Type: cross Abstract: Unified vision-language models (VLMs) integrate visual understanding and visual generation within a single autoregressive backbone, but their joint training is computationally expensive and largely overlooked from an efficiency perspective.
OrionMoE-v1.0 is a compact tabular foundation model that uses a dual‑axis Transformer and a sparse mixture‑of‑experts architecture to perform in‑context learning on labeled support tables. It selectively activates experts along the feature axis, guided by both individual feature representations and overall dataset context, enabling adaptive computation across diverse tabular problems. Pretrained on synthetic classification tasks, it achieves competitive performance on multiple benchmarks, especially on small‑context, high‑dimensional, and class‑imbalanced datasets.
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...
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.
arXiv:2607.01630v2 Announce Type: replace Abstract: Dynamic expansion methods for class-incremental learning (CIL) protect task-specific knowledge by growing dedicated tokens or subnetworks, yet our...
The paper introduces Gated Token Recurrence (GTR), a softmax‑free recurrent vision backbone that replaces global softmax attention with gated linear attention, alternating scan directions, and enhanced SwiGLU blocks. GTR is distilled from a DINOv3 teacher using only final‑layer patch‑token alignment, and achieves strong performance on COCO object detection (58.9 box AP) with very low latency (1.908 ms on an RTX 4090). The backbone also transfers to multiple dense prediction tasks and runs efficiently on edge hardware via a specialized CUDA operator and TensorRT deployment.