arXiv:2607. 18845v1 Announce Type: cross Abstract: For decades, ABR has kept two kinds of intelligence apart.
arXiv:2609.24379v1 Announce Type: cross Abstract: Mechanistic interpretability of vision transformers seeks to decompose model computation into human-readable units, but learned representations entan...
arXiv:2606. 21337v2 Announce Type: replace Abstract: Raw multimodal streams are abundant but noisy, redundant, and unaligned with any particular training objective.
arXiv:2606. 30512v1 Announce Type: cross Abstract: Why overparameterised deep networks generalise so remarkably well remains one of the most stubborn open questions in machine learning theory.
Mechanistic interpretability of vision transformers seeks to decompose model computation into human-readable units, but learned representations entangle many concepts in each neuron. Feature superposi...
The paper investigates a spatial-concentration bias in Evolvable-Substrate HyperNEAT (ES‑HyperNEAT) when applied to MNIST, where evolved networks focus on a central cluster of input pixels. By partitioning the input image into 13 non‑overlapping spatial segments and evolving a separate expert network for each, the authors achieve a 43% mean accuracy—an 106% relative improvement over the baseline—without relying on data‑driven weighting. The study also introduces a receptive‑field diagnostic to detect silent input‑coverage collapse and a spatial‑partitioning remedy to restore full image coverage.
arXiv:2607. 18433v1 Announce Type: cross Abstract: Intelligence appears under different names in different fields: as data compression in statistics and machine learning, as universal computation in dynamical systems, and as adaptive behavior in agents.
DriftNeRF introduces a regularizer that addresses cross‑ray density disagreement in Neural Radiance Fields, a defect that causes poor performance when only a few views are available. By aggregating densities from nearby points on other rays into a stop‑gradient consensus target, DriftNeRF penalizes unsupported disagreement while preserving agreed boundaries. The method improves 3‑view PSNR by 0.42–0.65 dB on NeRF‑Synthetic, DTU, and LLFF datasets and remains competitive with sparse‑view Gaussian pipelines without requiring additional geometry or preprocessing.
arXiv:2603. 27044v3 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) is widely recognized as sample-inefficient, a limitation attributable in part to the high dimensionality and substantial functional redundancy inherent to the policy parameter space.
Deep networks trained on noisy labels simultaneously generalize on clean data and memorize flipped labels. These are usually conflated as pressures on one capacity. We present Topo^2, a measurement fr...
The paper presents a certified rule that determines whether unseen data should be incorporated into a pretrained model’s context or its weights, based on an exact law for their information value. This law quantifies the code length saved on held‑out queries as the expected bits stored about the query, adjusted by a prior repair and decoding loss, and applies to any model, architecture, dataset, or task. The authors demonstrate that the rule’s ceilings correctly certify choices across diverse models—including transformers, TabPFN, occupancy networks, and stereo networks—and that an anytime‑valid test can reliably select the better approach (e.g., TabPFN over XGBoost or GPT‑2’s cache over fine‑tuning) with controlled error rates.
WAM-Cache is a training‑free framework that reuses layerwise key‑value (KV) representations from a pretrained video Diffusion Transformer (DiT) across control chunks, recomputing only a sparse set of refreshed tokens. By selecting refresh tokens based on the action expert’s cross‑attention, visual latent surprise, and a strict age bound, it reduces DiT prefill FLOPs by 32‑42% on datasets such as RoboTwin 2.0 and LIBERO while maintaining action accuracy within 0.7‑1.8 percentage points of the dense baseline in simulation and 2.5 points on a real robot.
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.