mlsanityData to 7 Oct 2026

Fiber Fingerprints of Hidden Learning-State Dynamics

arXiv 2608.15976 ↗First posted 17 Aug 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

A learning system can occupy execution states that are indistinguishable under every declared present-behavior readout yet respond differently to future training. We formalize this through fiber fingerprints: controlled future-learning response laws restricted to present-behavior equivalence classes. Prefix-compatible finite probes induce a predictive quotient functor, a Nerode-type minimal recursively sufficient representation, and a canonical set-level predictive fiber without assuming smoothness, reversibility, finite rank, or a manifold. Under an explicit finite-dimensional Hilbert realization, response decomposes into visible, visible-mode-reuse, and irreducible-new sectors; a history-reachability bridge retains only distinctions generated by natural training histories. Conditional mechanism results then identify a graph-Hodge chronology decomposition, a regular switching class with root-mean-square scale √pη3/2 and finite-scale corrections, and an exact Adam moment section whose immediate adaptive field is constant while common future gradients can reveal hidden moment differences. Frozen Transformer--LoRA--AdamW studies with Qwen2.5-7B and Mistral-7B-v0.3 support a local action backbone, longer-horizon first-return non-closure, and fresh visible-relative completion with output-range reuse and a low-rank irreducible sector. Stronger claims remain bounded by preregistered negative or mixed results: re-anchored transport is unresolved above its measurement floor; the strict finite-grid Hodge--3/2 conjunction is unmet despite prospective contraction; Qwen accessibility is not established in the frozen raw moment chart; and Mistral revelation is future-context dependent rather than bank invariant. Within these support-, scale-, metric-, and context-resolved boundaries, present behavior is not a sufficient statistic for declared future learning.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 15 of its 34 references that are in the map. First posted on arXiv 17 Aug 2026.

Builds on

15 of 34 references.

References · 15

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  3. 2024Qwen2.5 Technical Reportcited by 4,713
  4. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  5. 2023Mistral 7Bcited by 3,065
  6. 2025Commute Your Domains: Trajectory Optimality Criterion for Multi-Domain Learningcited by 9
  7. 2026The Geometry of Sequential Learning: Lie-Bracket Prediction of Transfer Ordercited by 8
  8. 2026Path-conditioned training: a principled way to rescale ReLU neural networkscited by 6
  9. 2026Optimizer Memory Makes Shuffle Order a First-Order Source of Fine-Tuning Noisecited by 6
  10. 2026Predicting Plasticity in Deep Continual Learning: A Theoretical Perspectivecited by 4
  11. 2026First-Order Predictable but Pairwise Fragile: Local Task Adaptation in Trained Transformerscited by 3
  12. 2026DynaMiCS: Fine-tuning LLMs with Performance Constraints using Dynamic Mixturescited by 2
3 more
  1. 2026Learning reveals invisible structure in low-rank RNNscited by 1
  2. 2026Re-Evaluating Continual Learning with Few-Shot Adaptationcited by 1
  3. 2026Hidden Gauge Controls Feature Specialization in ReLU Networkscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.