mlsanityData to 14 Oct 2026

T-SHRED: Symbolic Regression for Regularization and Model Discovery with Transformer Shallow Recurrent Decoders

arXiv 2506.15881 ↗First posted 18 Jun 2025cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

SHallow REcurrent Decoders (SHRED) are effective for system identification and forecasting from sparse sensor measurements. Such models are light-weight and computationally efficient, allowing them to be trained on consumer laptops. SHRED-based models rely on Recurrent Neural Networks (RNNs) and a simple Multi-Layer Perceptron (MLP) for the temporal encoding and spatial decoding respectively. Despite the relatively simple structure of SHRED, they are able to predict chaotic dynamical systems on different physical, spatial, and temporal scales directly from a sparse set of sensor measurements. In this work, we modify SHRED by leveraging transformers (T-SHRED) embedded with symbolic regression for the temporal encoding, circumventing auto-regressive long-term forecasting for physical data. This is achieved through a new sparse identification of nonlinear dynamics (SINDy) attention mechanism into T-SHRED to impose sparsity regularization on the latent space, which also allows for immediate symbolic interpretation. Symbolic regression improves model interpretability by learning and regularizing the dynamics of the latent space during training. We analyze the performance of T-SHRED on three different dynamical systems ranging from low-data to high-data regimes.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 46 of its 71 references that are in the map. First posted on arXiv 18 Jun 2025.

Builds on

46 of 71 references.

References · 46

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Scaling Laws for Neural Language Modelscited by 6,586
  3. 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
  4. 2018Neural Ordinary Differential Equationscited by 3,779
  5. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  6. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  7. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  8. 2022Are Transformers Effective for Time Series Forecasting?cited by 1,424
  9. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  10. 2021Scaling Vision Transformerscited by 999
  11. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 613
  12. 2017Deep learning for universal linear embeddings of nonlinear dynamicscited by 494
34 more
  1. 2018Tune: A Research Platform for Distributed Model Selection and Trainingcited by 395
  2. 2024xLSTM: Extended Long Short-Term Memorycited by 327
  3. 2019Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientscited by 309
  4. 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 215
  5. 2018A System for Massively Parallel Hyperparameter Tuningcited by 202
  6. 2023A mathematical perspective on Transformerscited by 164
  7. 2017Linearly-Recurrent Autoencoder Networks for Learning Dynamicscited by 145
  8. 2024The Well: a Large-Scale Collection of Diverse Physics Simulations for Machine Learningcited by 145
  9. 2020AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularitycited by 144
  10. 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 138
  11. 2021Ensemble-SINDy: Robust sparse model discovery in the low-data, high-noise limit, with active learning and controlcited by 137
  12. 2024Tiny Time Mixers (TTMs): Fast Pre-trained Models for Enhanced Zero/Few-Shot Forecasting of Multivariate Time Seriescited by 127
  13. 2019Understanding and Improving Transformer From a Multi-Particle Dynamic System Point of Viewcited by 113
  14. 2019Integration of Neural Network-Based Symbolic Regression in Deep Learning for Scientific Discoverycited by 93
  15. 2019Bayesian Symbolic Regressioncited by 78
  16. 2022Formal Algorithms for Transformerscited by 72
  17. 2023A Comprehensive Survey on Applications of Transformers for Deep Learning Taskscited by 71
  18. 2023Interpretable Machine Learning for Science with PySR and SymbolicRegression.jlcited by 54
  19. 2024Scaling Laws For Diffusion Transformerscited by 44
  20. 2025Log-Linear Attentioncited by 40
  21. 2025Learning Compositional Functions with Transformers from Easy-to-Hard Datacited by 36
  22. 2025Understanding Transformer from the Perspective of Associative Memorycited by 34
  23. 2021Bagging, optimized dynamic mode decomposition (BOP-DMD) for robust, stable forecasting with spatial and temporal uncertainty-quantificationcited by 30
  24. 2022Bayesian autoencoders for data-driven discovery of coordinates, governing equations and fundamental constantscited by 24
  25. 2025Reduced Order Modeling with Shallow Recurrent Decoder Networkscited by 24
  26. 2025Sparse identification of nonlinear dynamics and Koopman operators with Shallow Recurrent Decoder Networkscited by 20
  27. 2019Deep Learning Models for Global Coordinate Transformations that Linearize PDEscited by 17
  28. 2023Convergence of uncertainty estimates in Ensemble and Bayesian sparse model discoverycited by 15
  29. 2023Leveraging arbitrary mobile sensor trajectories with shallow recurrent decoder networks for full-state reconstructioncited by 12
  30. 2024Shallow Recurrent Decoder for Reduced Order Modeling of Plasma Dynamicscited by 8
  31. 2016High dimensional thresholded regression and shrinkage effectcited by 6
  32. 2025SyMANTIC: An Efficient Symbolic Regression Method for Interpretable and Parsimonious Model Discovery in Science and Beyondcited by 6
  33. 2025From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facilitycited by 6
  34. 2024Iterated Schr"odinger bridge approximation to Wasserstein Gradient Flowscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.