Online learning of quadratic manifolds from streaming data for nonlinear dimensionality reduction and nonlinear model reduction

This work introduces an online greedy method for constructing quadratic manifolds from streaming data, designed to enable in situ analysis of numerical simulation data on the Petabyte scale. Unlike traditional batch methods, which require all data to be available upfront and take multiple passes over the data, the proposed online greedy method incrementally updates quadratic manifolds in one pass as data points are received, eliminating the need for expensive disk input/output operations as well as storing and loading data points once they have been processed. A range of numerical examples demonstrate that the online greedy method learns accurate quadratic manifold embeddings while being capable of processing data that far exceed common disk input/output capabilities and volumes as well as main-memory sizes.

Authors

Institutions

Publication Details

Journal
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
Published
2025-05-01
DOI
https://doi.org/10.1098/rspa.2024.0670
Citations
3
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
3.97

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online learning of quadratic manifolds from streaming data for nonlinear dimensionality reduction and nonlinear model reduction

Paul Schwerdtner, Aleksandra Pachalieva, Benjamin Peherstorfer, Daniel O’Malley et al.
3 citations
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
Model Reduction and Neural Networks
3.97
article

Online learning of quadratic manifolds from streaming data for nonlinear dimensionality reduction and nonlinear model reduction

Paul Schwerdtner, Aleksandra Pachalieva, Benjamin Peherstorfer, Daniel O’Malley, Julie Bessac, Prakash Mohan
article en
3 citations

Abstract

This work introduces an online greedy method for constructing quadratic manifolds from streaming data, designed to enable in situ analysis of numerical simulation data on the Petabyte scale. Unlike traditional batch methods, which require all data to be available upfront and take multiple passes over the data, the proposed online greedy method incrementally updates quadratic manifolds in one pass as data points are received, eliminating the need for expensive disk input/output operations as well as storing and loading data points once they have been processed. A range of numerical examples demonstrate that the online greedy method learns accurate quadratic manifold embeddings while being capable of processing data that far exceed common disk input/output capabilities and volumes as well as main-memory sizes.

Proceedings of the Royal Society A Mathematical Physical and Engineering SciencesVol. 481(2314)
Los Alamos National Laboratory (US), New York University (US)
Office of Science, National Renewable Energy Laboratory
Openalex Percentile: Top 7%
Model Reduction and Neural Networks
3.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.