Search arXivSearch

arXiv · 2605.23037

Open datasets and machine learning for two-phase heat transfer: a review following a spatial-temporal taxonomy

Abstract

Two-phase heat transfer underpins boiling, condensation, immersion cooling, flow boiling, energy conversion, and electronics thermal management, but its coupled interfacial physics make data reuse and model comparison difficult. This narrative review synthesizes open datasets, machine-learning methods, and reusable software for two-phase heat-transfer research, with emphasis on boiling, multimodal sensing, and thermal-management datasets. We organize the review around a spatial-plus-temporal dimensionality taxonomy, denoted S+TD, that classifies data objects by the dimensionality of the measured, simulated, or derived fields, including 0+0D point values, 0+1D time series, 1+1D profiles, 2+0D images, 2+1D videos, 3+0D/3+1D fields, and mixed multimodal records. The taxonomy is used to connect dataset types to AI tasks such as tabular regression, acoustic sequence learning, image segmentation, video analysis, inverse heat-flux reconstruction, surrogate modeling, and multimodal fusion. The review also develops a roadmap for physics-aware open data, including metadata definitions, evidence and reuse-maturity labels, benchmark splits, decoders, baseline models, and community databanks. NED3 resources are discussed as one implementation case within a broader open-data ecosystem rather than as a complete solution. The main conclusion is that progress in two-phase AI now depends as much on findable, decodable, benchmarkable, and physically interpretable data infrastructure as on model architecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christy Dunlap, Ridwan Olabiyi, Firas Al-Hindawi, Hari Pandey, Stephen Pierson, Daniel Curl, Braden Stevens, Mohammad Ishraq Hossain, Annapurna Parjuli, Chinmaya Joshi, Ashif Iquebal, Han Hu. 2026-08-17. Open datasets and machine learning for two-phase heat transfer: a review following a spatial-temporal taxonomy. https://doi.org/10.1515/tp-2026-0081

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG