Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 36

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Sensing with shallow recurrent decoder networks

Williams, Jan P., Zahn, Olivia, Kutz, J. Nathan·2024·Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Abstract

Sensing is a universal task in science and engineering. Downstream tasks from sensing include inferring full-state estimates of a system (system identification), control decisions and forecasting. We propose a shallow recurrent decoder (SHRED) neural network structure for sensing, which incorporates (i) a recurrent neural network to learn a latent representation of the temporal dynamics of the sensors and (ii) a shallow decoder that learns a mapping between this latent representation and the high-dimensional state space. SHRED enables accurate reconstructions with far fewer sensors, outperforms existing techniques when more measurements are available and is more robust to random sensor placements. In the example cases explored, complex spatio-temporal dynamics are characterized by exceedingly limited sensors that can be randomly placed with minimal loss of performance.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1098/rspa.2024.0054

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 6 references

Research works printed but not linked: 47

  1. 10.1109/MCS.2018.2810460 · DOI · Paper page
  2. 10.1098/rspa.2020.0097 · DOI · Paper page
  3. 10.2514/1.J057108 · DOI
  4. 10.1103/PhysRevFluids.4.103907 · DOI · Paper page
  5. 10.1029/2018MS001472 · DOI · Paper page
  6. Gilpin W . 2020 Deep reconstruction of strange attractors from time series. In Advances in neural information processing systems (eds H Larochelle , M Ranzato , R Hadsell , MF Balcan , H Lin ), pp. 204–216, vol. 33. See https://proceedings.neurips.cc/paper_files/paper/2020/file/021bbc7ee20b71134d53e20206bd6feb-Paper.pdf.
  7. 10.1016/j.chaos.2021.111612 · DOI
  8. 10.1103/PhysRevE.107.034215 · DOI
  9. Kutz JN . 2013 Data-driven modeling & scientific computation: methods for complex systems & big data, 1st edn. Oxford, UK: Oxford University Press.
  10. 10.1017/9781108380690 · DOI · Paper page
  11. 10.1364/JOSAA.12.001657 · DOI · Paper page
  12. 10.1137/15M1019271 · DOI · Paper page
  13. 10.1016/j.crma.2004.08.006 · DOI · Paper page
  14. 10.1137/090766498 · DOI · Paper page
  15. 10.1017/dce.2021.5 · DOI
  16. 10.1117/12.2631951 · doi:10.1117/12.2631951
  17. Williams J , Zahn O , Kutz JN . 2022 Data-driven sensor placement with shallow decoder networks. arXiv (doi:10.48550/arXiv.2202.05330) · arXiv · doi:10.48550/arxiv.2202.05330
  18. 10.1017/CBO9780511804441 · DOI · Paper page
  19. 10.1109/TSP.2008.2007095 · DOI · Paper page
  20. 10.1016/0167-7152(84)90020-8 · doi:10.1016/0167-7152(84)90020-8
  21. Krause A , Singh A , Guestrin C . 2008 Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9 , 235–284.
  22. 10.1214/aoms/1177728069 · DOI · Paper page
  23. 10.1162/0899766053723032 · DOI
  24. 10.1109/JSEN.2020.2997298 · DOI
  25. Clark E , Brunton SL , Kutz JN . 2021 Multi-fidelity sensor selection: greedy algorithms to place cheap and expensive sensors with cost constraints. IEEE Sens. J. 21 , 1–1. (doi:10.1109/JSEN.2020.3013094) · DOI
  26. 10.1109/JSEN.2018.2887044 · DOI
  27. 10.1137/17M1162366 · doi:10.1137/17m1162366
  28. 10.1080/14685240802376389 · DOI · Paper page
  29. 10.1175/1520-0442(2002)015<1609:AIISAS>2.0.CO;2 · DOI · Paper page
  30. 10.1029/2001JD000807 · DOI · Paper page
  31. Kasai J , Pappas N , Peng H , Cross J , Smith NA . 2021 Deep encoder, shallow decoder: reevaluating non-autoregressive machine translation. arXiv (doi:10.48550/arXiv.2006.10369) · DOI
  32. Chung J , Gulcehre C , Cho K , Bengio Y . 2014 Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv (doi:10.48550/arXiv.1412.3555) · DOI · Paper page
  33. 10.1007/978-3-642-35289-8_36 · DOI · Paper page
  34. Vaswani A , Shazeer N , Parmar N , Uszkoreit J , Jones L , Gomez AN , Kaiser L , Polosukhin I . 2023 Attention is is all you need. arXiv (doi:10.48550/arXiv.1706.03762) · DOI · Paper page
  35. Folland GB . 1995 Introduction to partial differential equations. vol. 102. Princeton, NJ: Princeton University Press.
  36. Ebers MR , Williams JP , Steele KM , Kutz JN . 2023 Leveraging arbitrary mobile sensor trajectories with shallow recurrent decoder networks for full-state reconstruction. arXiv (doi:10.1109/ACCESS.2024.3423679) · DOI
  37. Rumelhart DE , McClelland JL . 1987 Learning internal representations by error propagation. In Parallel distributed processing: explorations in the microstructure of cognition: foundations, pp. 318–362. Cambridge, MA: MIT Press. (doi:10.7551/mitpress/4943.003.0128) · DOI
  38. 10.1016/j.procir.2021.03.088 · DOI · Paper page
  39. 10.5194/gmd-12-1525-2019 · doi:10.5194/gmd-12-1525-2019
  40. 10.1016/j.cma.2020.112990 · DOI
  41. Abarbanel H . 2012 Analysis of observed chaotic data. New York, NY: Springer Science & Business Media.
  42. 10.1038/s41467-017-00030-8 · DOI · Paper page
  43. 10.1137/17M1125236 · DOI · Paper page
  44. 10.1098/rsfs.2018.0083 · DOI
  45. 10.1063/5.0010886 · DOI
  46. 10.1137/18M1216572 · DOI · Paper page
  47. 10.1098/rspa.2023.0422 · DOI

Metadata

Authors
Williams, J. P., Zahn, O., & Kutz, J. N.
Venue
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Published
2024-09
Volume
480
Issue
2298
ISSN
  • 1364-5021
  • 1471-2946
Cited by
36
References
6
Language
en
Licence
Funders
  • Directorate for Computer and Information Science and Engineering
  • Air Force Office of Scientific Research

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Sensing with shallow recurrent decoder networks. https://app.cochat.ai/papers/10.1098/rspa.2024.0054
The paper
Williams, J. P., Zahn, O., & Kutz, J. N. (2024). Sensing with shallow recurrent decoder networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. https://doi.org/10.1098/rspa.2024.0054

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.