No Free Lunch in Flow Surrogates under Time-Varying Boundary Conditions: A Two-Regime Study

• URL: http://arxiv.org/abs/2607.23667v1
• Date: Sun, 26 Jul 2026 14:02:46 GMT
• Title: No Free Lunch in Flow Surrogates under Time-Varying Boundary Conditions: A Two-Regime Study
• Abstract summary: Flow surrogate validated on a simple regime is often taken as evidence that the approach will carry to a richer one.<n>We test this assumption on two transient flows under time-varying boundary conditions emulating the process startup.
• Score: 0.48127184936824546
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A flow surrogate validated on a simple regime is often taken as evidence that the approach will carry to a richer one. We test this assumption on two transient flows under time-varying boundary conditions emulating the process startup: the three-dimensional slurry film in chemical-mechanical planarisation (CMP), a core semiconductor-manufacturing process, and the two-dimensional Karman vortex street (KVS) behind a cylinder. Eight surrogate models are compared on one shared evaluation pipeline, differing in whether they learn the full field or a latent representation, and whether they predict trajectories in one shot or step by step. No single architecture wins both regimes. On the film, a one-shot full-field model reconstructs the process-relevant cumulative wall shear stress to 3.2% relative error. On the wake, a latent autoregressive DeepONet retains 96% of the shedding power that direct and one-shot models damp to almost zero. The deciding axis is the treatment of time. The self-sustained wake requires the phase memory that autoregressive feedback provides, while the boundary-driven film rewards a direct map. Pointwise RMSE picks the wrong model in both regimes, so the evaluation scores five physical questions instead, the field, its structure, invented motion, amplitude, and timing. The trained surrogates answer queries $10^3$ to $10^4$ times faster than the finite-element solver, but the offline cost of the training simulations means they pay off from the first query beyond the training set for CMP and the third for the KVS. The choice of surrogate should follow the dynamical character of the target flow, and its validation should use failure-mode-resolved metrics, since neither the winning architecture nor its validation transfers.

Related papers

• Source Distribution Estimation by Posterior Averaging [0.0]
  Simulation-based science often requires a distribution over simulator parameters whose push-forward reproduces a set of real observations.<n>Existing methods fit the source against a likelihood surrogate trained once from a fixed proposal prior.<n>We propose an E-step trains an amortized posterior on fresh simulations from the current source estimate, and an M-step refits the source to the average of that posterior over the observed data.
  arXiv  Detail & Related papers  (2026-09-02T14:01:54Z)
• Knowing When to Ask for Help: Bayesian Self-Escalation in Hierarchical LLM Agents [0.0]
  Current agent systems decide delegation before reasoning begins.<n>We study a third regime: an agent that recognises, during its own reasoning, that it is unlikely to succeed.
  arXiv  Detail & Related papers  (2026-08-25T05:35:07Z)
• When Does Learning to Stop Help? A Cost-Aware Study of Early Exits in Reasoning Models [4.8190992438931035]
  LearnStop is a hidden-state-free logistic stopper over prefix-observable features.<n>A trajectory decomposition predicts the regime: learning pays where answers oscillate and correctness evidence is spread.<n>Cost accounting sharpens the picture further -- the same policy that saves 32% of tokens under KV-cache forking costs 121% extra under black-box repeated prefilling.
  arXiv  Detail & Related papers  (2026-06-29T19:33:42Z)
• Causal Forcing++: Scalable Few-Step Autoregressive Diffusion Distillation for Real-Time Interactive Video Generation [50.55853275866995]
  Real-time interactive video generation requires low-latency, streaming, and controllable rollout.<n>In this paper, we study a more aggressive setting: frame-wise autoregression with only 1--2 sampling steps.<n>We propose textbfCausal Forcing++, a principled and scalable pipeline.
  arXiv  Detail & Related papers  (2026-05-14T17:46:36Z)
• AnyFlow: Any-Step Video Diffusion Model with On-Policy Flow Map Distillation [70.80207977907908]
  We introduce AnyFlow, the first any-step video diffusion distillation framework based on flow maps.<n>We show that AnyFlow achieves performance matches or surpasses consistency-based counterparts in the few-step regime.
  arXiv  Detail & Related papers  (2026-05-13T16:06:34Z)
• FlowS: One-Step Motion Prediction via Local Transport Conditioning [3.883772843505009]
  Local transport conditioning makes one-step generative motion prediction practical for safety-critical autonomy.<n>FlowS achieves state-of-the-art Soft mAP (0.4804) and mAP (0.4703) with ensemble at 75, calibrated with single-step inference.
  arXiv  Detail & Related papers  (2026-04-28T19:06:06Z)
• SOAR: Self-Correction for Optimal Alignment and Refinement in Diffusion Models [48.335262141752715]
  Post-training pipeline for diffusion models has two stages: supervised fine-tuning (SFT) on curated data and reinforcement learning (RL) with reward models.<n>We propose SOAR (Self-Correction for Optimal Alignment and Refinement), a bias-correction post-training method that fills this gap.<n>It is on-policy, reward-free, and provides dense per-time supervision with no credit-assignment problem.
  arXiv  Detail & Related papers  (2026-04-14T11:45:15Z)
• Dual-End Consistency Model [41.982957134224904]
  Slow iterative sampling is a major bottleneck for the practical deployment of diffusion and flow-based generative models.<n>We propose a Dual-End Consistency Model (DE-CM) that selects vital sub-trajectory clusters to achieve stable and effective training.<n>Our method achieves a state-of-the-art FID score of 1.70 in one-step generation on the ImageNet 256x256 dataset, outperforming existing CM-based one-step approaches.
  arXiv  Detail & Related papers  (2026-02-11T11:51:01Z)
• FlowConsist: Make Your Flow Consistent with Real Trajectory [99.22869983378062]
  We argue that current fast-flow training paradigms suffer from two fundamental issues.<n> conditional velocities constructed from randomly paired noise-data samples introduce systematic trajectory drift.<n>We propose FlowConsist, a training framework designed to enforce trajectory consistency in fast flows.
  arXiv  Detail & Related papers  (2026-02-06T03:24:23Z)
• Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism [19.7914286780195]
  We introduce textscDouble (Double Retrieval Speculative Parallelism)<n>We enable the draft model to execute iterative retrieval speculations to break the theoretical speedup limits.<n>Experiments demonstrate state-of-the-art speedup of $textbf5.3times$ on LLaMA3.3-70B and $textbf2.8times$ on Qwen3-32B.
  arXiv  Detail & Related papers  (2026-01-09T04:35:21Z)
• SCoT: Unifying Consistency Models and Rectified Flows via Straight-Consistent Trajectories [31.60548236936739]
  We propose a Straight Consistent Trajectory(SCoT) model for pre-trained diffusion models.<n>SCoT enjoys the benefits of both approaches for fast sampling, producing trajectories with consistent and straight properties simultaneously.
  arXiv  Detail & Related papers  (2025-02-24T08:57:19Z)
• Simulation-free Schr\"odinger bridges via score and flow matching [89.4231207928885]
  We present simulation-free score and flow matching ([SF]$2$M) Our method generalizes both the score-matching loss used in the training of diffusion models and the recently proposed flow matching loss used in the training of continuous flows. Notably, [SF]$2$M is the first method to accurately model cell dynamics in high dimensions and can recover known gene regulatory networks simulated data.
  arXiv  Detail & Related papers  (2023-07-07T15:42:35Z)
• Posterior Coreset Construction with Kernelized Stein Discrepancy for Model-Based Reinforcement Learning [78.30395044401321]
  We develop a novel model-based approach to reinforcement learning (MBRL) It relaxes the assumptions on the target transition model to belong to a generic family of mixture models. It can achieve up-to 50 percent reduction in wall clock time in some continuous control environments.
  arXiv  Detail & Related papers  (2022-06-02T17:27:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.