mlsanityData to 7 Oct 2026

Process-Tensor Tomography of SGD: Measuring Non-Markovian Memory via Back-Flow of Distinguishability

arXiv 2601.16563 ↗First posted 23 Jan 2026cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

This work proposes neural training as a process tensor: a multi-time map that takes a sequence of controllable instruments (batch choices, augmentations, optimizer micro-steps) and returns an observable of the trained model. Building on this operational lens, we introduce a simple, model-agnostic witness of training memory based on back-flow of distinguishability. In a controlled two-step protocol, we compare outcome distributions after one intervention versus two; the increase DeltaBF = D2 - D1>0 (with D∈TV, JS, H measured on softmax predictions over a fixed probe set) certifies non-Markovianity. We observe consistent positive back-flow with tight bootstrap confidence intervals, amplification under higher momentum, larger batch overlap, and more micro-steps, and collapse under a causal break (resetting optimizer state), directly attributing the effect to optimizer/data-state memory. The witness is robust across TV/JS/Hellinger, inexpensive to compute, and requires no architectural changes. We position this as a measurement contribution: a principled diagnostic and empirical evidence that practical SGD deviates from the Markov idealization. An exploratory case study illustrates how the micro-level signal can inform curriculum orderings. "Data order matters" turns into a testable operator with confidence bounds, our framework offers a common stage to compare optimizers, curricula, and schedules through their induced training memory.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 29 references that are in the map. First posted on arXiv 23 Jan 2026.

Builds on

16 of 29 references.

References · 16

  1. 2020Extracting Training Data from Large Language Modelscited by 2,144
  2. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  3. 2019Similarity of Neural Network Representations Revisitedcited by 1,695
  4. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  5. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 847
  6. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
  7. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  8. 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
  9. 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
  10. 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
  11. 2015Why Random Reshuffling Beats Stochastic Gradient Descentcited by 78
  12. 2020Closing the convergence gap of SGD without replacementcited by 56
4 more
  1. 2023Stochastic Gradient Descent under Markovian Sampling Schemescited by 37
  2. 2022Adapting to Mixing Time in Stochastic Optimization with Markovian Datacited by 35
  3. 2023Leave-one-out Distinguishability in Machine Learningcited by 20
  4. 2020Finite-Time Analysis of Stochastic Gradient Descent under Markov Randomnesscited by 18

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.