← Back to all development cases
This case was judged by an anonymized AI reviewer and has not been independently reviewed by people; inspect the draft, cards, and both outputs to assess it.
AutocompleteAbout the same108 / 280 · beu-7e0795756ca9a98c

Physics-conforming Latent Twins

Mathematics · 2606.15053v2

FLOWING EVIDENCE BENCHMARK

How do we compare writing with and without cards?

At the same writing position, the same model produces one first result with cards and one without. All 280 pairs enter the overall anonymized review, which assesses whether a decision not to continue fits the draft.

Overall: 138 with-card wins, 26 ties, 107 no-card wins, 5 pairs where neither was usable, and 4 inconclusive judgments. Both sides wrote text in 218 pairs; 48 had a deliberate stop and 14 included an invalid output.

SAME DRAFT · WITH OR WITHOUT CARDS

01 · FIXED WRITING POSITION

MANUSCRIPT

Same writing position ▌

Matched autocomplete at the same draft position

02 · TWO MATCHED VERSIONS

SHARED BY BOTH

Draft, writing task, and generation model

A · With cards

Relevant literature cards supplied

B · Without cards

No literature cards supplied

Generation model

Same model and version

A → first output

B → first output

Anonymized AI judge

First outputs are anonymized as X and Y

Continuation review: accuracy, fit to the writing task and usability
Returns: X preferred / tie / Y preferred / both unusable

Review again with the answer order swapped

HOW DOES BLIND JUDGING WORK?

① Anonymize both outputs
The AI judge sees the same draft and both first outputs without knowing which received cards.

② Compare and swap order
The judge applies task-specific criteria in X/Y and then Y/X order.

③ Review disagreements
A third pass resolves disagreements. Incomplete reviews remain in the denominator.

How are positions and cards selected?

We selected 40 writing positions in each of seven fields, for 280 comparisons. The position and relevant literature cards were set before each comparison, so both versions began from the same draft.

The main result retains every frozen position, including places where cards might not add a useful next move. This avoids selecting cases based on their outputs, but 49% describes the whole cohort, not a win rate where evidence clearly had an opportunity to help. This cohort did not record that opportunity label for each position before generation, so those two groups cannot yet be separated reliably.

CARD USE · 140/280

Reported card use in continuations with text

The model reports whether a card affected its continuation. In 140 of 280 tests it produced continuation text and reported card use. The previous count of 150 included 10 cases without continuation text and has been corrected.

COMPARISON · 70 / 7 / 30

Which written version was better?

Of the 107 reported-use cases where both versions produced text, the blinded AI judge preferred the with-card version 70 times, found 7 about the same, and preferred the without-card version 30 times.

How are the two table percentages calculated?

ADOPTION COVERAGE

140reported use with text
÷
280all positions
=
50%

WITH-CARD VERSION PREFERRED

70with cards better
÷
107comparable tests
=
65%

The percentages use different groups: 50% counts continuations with text reporting card use among all 280 tests; 65% covers the 107 such cases with text on both sides. The generating model reports card use, while an anonymized AI judge compares writing quality.

Card use is self-reported by the generator. The anonymized AI judge sees the draft and source snippets, so source-aware preference remains possible; there was no independent human review. The overall result describes these 280 frozen positions, not a win probability for any writing task.

Manuscript writing position

Text excerpt · not a PDF page

Research manuscript · excerpt

Physics-conforming Latent Twins

Introduction / related work

foundationalfor scientific computing: it shows that efficient surrogates are possible when the dominant dynamical degrees of freedom can be identified. A second line of work is based on the Koopman viewpoint. Instead of reducing the state directly, Koopman methods lift the dynamics to a space of observables in which nonlinear evolution can be represented linearly, at leastformallyKoopman(1931);Mezić(2005).Dynamicmodedecompositionanditsvariantsprovidepracticalfinite- dimensionalapproximationsofthisideafromdataandmayevenaddconservationlaws,Schmid(2010);Kutz,Brunton, BruntonandProctor(2016);Baddoo,Herrmann,McKeon,NathanKutzandBrunton(2023).Morerecently,Koopman autoencodersuseneuralnetworkstolearncoordinatesinwhichthelatentevolutionisapproximatelylinearLusch,Kutz andBrunton(2018);Takeishi,KawaharaandYairi(2017).Thesemethodshavemovedthefieldforwardbyconnecting representation learning with interpretable linear latent dynamics, but they are typically organized around evolution in learned coordinates rather than around physics-conforming solution operators. A third related direction is sparse model discovery and system identification, most prominently the sparse identification of nonlinear

↓ Next paragraph was generated here

The highlighted text is near the writing position. This is a layout of the evaluation input, not a PDF screenshot.

A matched comparison at the same writing positionOverall AI review: About the same

Both arms use the same model, task and manuscript context. Only the retrieved passages differ. The first recorded output from each arm is shown below.

Read overall AI review rationale

This rationale combines reviews with different display orders.

Order-swapped judges disagreed. Pass 1: Both outputs correctly identify 'sparse identification of nonlinear dynamics (SINDy)' as the completion, fitting the academic context of sparse model discovery. Both preserve the argument and avoid unsupported specifics. Output B is slightly better: (1) 'dynamics' more precisely matches the established acronym SINDy than 'dynamical systems' in A; (2) 'measured trajectories' is more specific and accurate to SINDy's data-driven nature than the vaguer 'data' in A; (3) 'recovers' better captures SINDy's goal of equation discovery than 'identifies,' which is already used in the preceding clause ('sparse model discovery'). These differences are minor but B shows tighter terminological precision and lexical variety. Pass 2: Both outputs correctly identify and complete the SINDy acronym, fitting the draft's progression from Koopman methods to sparse model discovery. Both are accurate and well-scoped. However, Output B is preferable for two reasons: (1) 'dynamical systems' is the correct expansion of the 'Dy' in SINDy (Sparse Identification of Nonlinear Dynamical Systems), whereas 'dynamics' in Output A mismatches the standard acronym; (2) 'identifies governing equations from data' is slightly more precise than 'recovers governing equations from measured trajectories'—the SINDy framework works with data broadly, not exclusively 'measured trajectories,' and 'identifies' better matches the paper's own framing ('sparse identification'). Output B requires no repair; Output A's 'dynamics' would need correction to match the established terminology.

Evidence

Same model and position · retrieved passages supplied · first output

dynamics (SINDy) framework, which recovers governing equations from measured trajectories by selecting a parsimonious set of candidate terms.

Passages supplied to the Evidence version

Card 1 · $\textit{FastSVD-ML-ROM}$: A Reduced-Order Modeling Framework based on Machine Learning for Real-Time Applications

Digital twins have emerged as a key technology for optimizing the performance of engineering products and systems. High-fidelity numerical simulations constitute the backbone of engineering design, providing an accurate insight into the performance of complex systems. However, large-scale, dynamic,…

Read full passage excerpt

Digital twins have emerged as a key technology for optimizing the performance of engineering products and systems. High-fidelity numerical simulations constitute the backbone of engineering design, providing an accurate insight into the performance of complex systems. However, large-scale, dynamic, non-linear models require significant computational resources and are prohibitive for real-time digital twin applications. To this end, reduced order models (ROMs) are employed, to approximate the high-fidelity solutions while accurately capturing the dominant aspects of the physical behavior. The present work proposes a new machine learning (ML) platform for the development of ROMs, to handle large-scale numerical problems dealing with transient nonlinear partial differential equations. Our framework, mentioned as $\textit{FastSVD-ML-ROM}$, utilizes $\textit{(i)}$ a singular value decomposition (SVD) update methodology, to compute a linear subspace of the multi-fidelity solutions during the …

Card 2 · Physics-informed Reduced Order Modeling of Time-dependent PDEs via Differentiable Solvers

Reduced-order modeling (ROM) of time-dependent and parameterized differential equations aims to accelerate the simulation of complex high-dimensional systems by learning a compact latent manifold representation that captures the characteristics of the solution fields and their time-dependent dynamic…

Read full passage excerpt

Reduced-order modeling (ROM) of time-dependent and parameterized differential equations aims to accelerate the simulation of complex high-dimensional systems by learning a compact latent manifold representation that captures the characteristics of the solution fields and their time-dependent dynamics. Although high-fidelity numerical solvers generate the training datasets, they have thus far been excluded from the training process, causing the learned latent dynamics to drift away from the discretized governing physics. This mismatch often limits generalization and forecasting capabilities. In this work, we propose Physics-informed ROM ($Φ$-ROM) by incorporating differentiable PDE solvers into the training procedure. Specifically, the latent space dynamics and its dependence on PDE parameters are shaped directly by the governing physics encoded in the solver, ensuring a strong correspondence between the full and reduced systems. Our model outperforms state-of-the-art data-driven ROMs a …

Card 3 · Tracking and forecasting oscillatory data streams using Koopman autoencoders and Kalman filtering

Data-driven modelling techniques provide a method for deriving models of dynamical systems directly from complicated data streams. However, tracking and forecasting such data streams poses a significant challenge to most methods, as they assume the underlying process and model does not change over t…

Read full passage excerpt

Data-driven modelling techniques provide a method for deriving models of dynamical systems directly from complicated data streams. However, tracking and forecasting such data streams poses a significant challenge to most methods, as they assume the underlying process and model does not change over time. In this paper, we apply one such data-driven method, the Koopman autoencoder (KAE), to high-dimensional oscillatory data to generate a low-dimensional latent space and model, where the system's dynamics appear linear. This allows one to accurately track and forecast systems where the underlying model may change over time. States and the model in the reduced order latent space can then be efficiently updated as new data becomes available, using data assimilation techniques such as the ensemble Kalman filter (EnKF), in a technique we call the KAE EnKF. We demonstrate that this approach is able to effectively track and forecast time-varying, nonlinear dynamical systems in synthetic example …

Card 4 · GPLaSDI: Gaussian Process-based Interpretable Latent Space Dynamics Identification through Deep Autoencoder

Numerically solving partial differential equations (PDEs) can be challenging and computationally expensive. This has led to the development of reduced-order models (ROMs) that are accurate but faster than full order models (FOMs). Recently, machine learning advances have enabled the creation of non-…

Read full passage excerpt

Numerically solving partial differential equations (PDEs) can be challenging and computationally expensive. This has led to the development of reduced-order models (ROMs) that are accurate but faster than full order models (FOMs). Recently, machine learning advances have enabled the creation of non-linear projection methods, such as Latent Space Dynamics Identification (LaSDI). LaSDI maps full-order PDE solutions to a latent space using autoencoders and learns the system of ODEs governing the latent space dynamics. By interpolating and solving the ODE system in the reduced latent space, fast and accurate ROM predictions can be made by feeding the predicted latent space dynamics into the decoder. In this paper, we introduce GPLaSDI, a novel LaSDI-based framework that relies on Gaussian process (GP) for latent space ODE interpolations. Using GPs offers two significant advantages. First, it enables the quantification of uncertainty over the ROM predictions. Second, leveraging this predict …

Card 5 · An artificial neural network framework for reduced order modeling of transient flows

This paper proposes a supervised machine learning framework for the non-intrusive model order reduction of unsteady fluid flows to provide accurate predictions of non-stationary state variables when the control parameter values vary. Our approach utilizes a training process from full-order scale dir…

Read full passage excerpt

This paper proposes a supervised machine learning framework for the non-intrusive model order reduction of unsteady fluid flows to provide accurate predictions of non-stationary state variables when the control parameter values vary. Our approach utilizes a training process from full-order scale direct numerical simulation data projected on proper orthogonal decomposition (POD) modes to achieve an artificial neural network (ANN) model with reduced memory requirements. This data-driven ANN framework allows for a nonlinear time evolution of the modal coefficients without performing a Galerkin projection. Our POD-ANN framework can thus be considered an equation-free approach for latent space dynamics evolution of nonlinear transient systems and can be applied to a wide range of physical and engineering applications. Within this framework we introduce two architectures, namely sequential network (SN) and residual network (RN), to train the trajectory of modal coefficients. We perform a sys …

Model-reported card use

The model did not report that any card materially affected this completion.

No Evidence

Same model and position · no retrieved passages · first output

dynamical systems (SINDy) framework, which identifies governing equations from data by selecting a parsimonious set of candidate terms.

Earlier card-use comparison

The earlier diagnostic compared only cases with reported card use and text on both sides; its scope differs from the overall AI review above.

This case does not have both with-card continuation text and a model-reported use record. It remains among all 280 tests but does not enter the reported-use comparison.

The passages are input material; their presence does not mean an output used them or that they support every claim. Draft and source passages are excerpted; no simulated scores or PDF appear here.