The paper introduces the Intersection Euler Characteristic Profile, a topological metric for measuring class overlap in neural representations, and provides exact permutation and sign‑flip tests to assess disentanglement across layers. Using this statistic, the authors analyze 111 networks and 52,650 measurements, finding that disentanglement is depth‑graded, occurs early, and is influenced by training choices such as augmentation and weight decay. The study also demonstrates that the unnormalized mass of the profile predicts test accuracy, while the dimensionless quotient does not outperform simple linear probes.
By Sushovan Majhi
arXiv:2608.29702v1 Announce Type: new
Abstract: A token-embedding table holds a hub of short rows near its origin, and we show that this cluster biases what nearest-neighbor intrinsic-dimension (ID)...
By Alexandre Quemy
arXiv:2601. 09173v5 Announce Type: replace Abstract: Representational similarity analysis and related methods compare the internal geometries of neural networks, but they measure only alignment between spaces, leaving a blind spot -- whether a representation's structure is reliably recoverable, not merely similar.
By Prashant C. Raju
Approximate machine unlearning seeks to remove the influence of a forget set from a trained model without full retraining. Existing gradient-based methods require data-dependent hyperparameter search,...
arXiv:2605.06240v2 Announce Type: replace-cross
Abstract: Forward-Forward (FF) training lets each layer learn from a local goodness criterion. In cumulative-goodness variants, later layers can inheri...
By Amirhossein Yousefiramandi
The paper introduces Unmerge, an efficient machine unlearning algorithm that treats unlearning as the inverse of task arithmetic. By representing the forget component as a low‑rank basis at each layer, Unmerge optimizes three goals—matching the merged vector, suppressing leakage, and bounding correction size—to limit forget leakage and retain damage. Experiments on ResNet‑50, ViT‑S/16, and Llama‑3.2‑3B show significant performance gains over existing methods while maintaining privacy and feature‑distribution fidelity.
By Haoran Tang, Andrew Tan, Rajiv Khanna
arXiv:2607.18451v3 Announce Type: replace
Abstract: A foundation encoder is pretrained once on a large image corpus and then reused with its weights frozen. Each new task is solved by training a smal...
By Soroosh Tayebi Arasteh, Sven Nebelung, Daniel Truhn
The paper investigates how input encodings constrain the set of contrasts a predictor can reproduce, even when no individual contrast is forced to zero. By computing the attainable contrast space from an encoder’s equivalence classes and a fixed contrast design—without using labels, loss, or a fitted model—the authors derive an empirical error floor for any unrestricted decoder on those classes. Experiments on a 140‑rectangle siRNA interaction panel show that a graph neural network’s training‑only feature mask reduces the rank of interaction contrasts from 140 to 72, creating a floor of 0.009980 (14.6% of the fitted model’s interaction squared error). Removing the mask eliminates the floor but only marginally improves MSE, while restoring chemistry columns recovers full rank. A separate RNA‑splicing predictor with an injective encoding achieves full rank and a zero floor, illustrating that the encoding itself, not the model, limits recoverable contrast space.
By Zahra Khodagholi, Niloofar Yousefi
arXiv:2608. 11661v1 Announce Type: cross Abstract: A multiplicative dual-encoder network computes a real-valued output for a pair of inputs as the inner product of their separate encodings.
By Zijian Zhao, Sen Li
arXiv:2606. 06342v1 Announce Type: cross Abstract: Topological Data Analysis (TDA) offers a principled, intrinsic lens for comparing neural representations.
By Yan Wang, Tianyang Hu
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...
By Gautam Ranka, Shubham Santosh Pandere, Aiden Dsouza
arXiv:2607. 17962v1 Announce Type: cross Abstract: TabPFN is a transformer-based foundation model for tabular prediction that performs inference without task-specific training by conditioning on a support set and query inputs.
By James Hu, Mahdi Ghelichi