arXiv subjects

Shubham Kavane

Publications and source records attributed to Shubham Kavane.

3 recordsLinked to original sources

arXiv2026

A Validated LBM Dataset and Pipeline for Surrogate Modeling of Turbulent 3D Obstructed Channel Flows

Evaluating neural operators for 3D turbulent flow requires validated datasets with physical benchmarks. We present a reproducible pipeline generating training data for 3D channel flows around generated geometries at Re=1,000-10,000. Our lattice Boltzmann solver with cumulant collision operators is rigorously verified against experimental measurements (Strouhal number, drag coefficients, turbulent fluctuations) with comprehensive grid convergence studies at resolution 1024x512x512. Building upon an established framework, this validated pipeline enables standardized surrogate model comparison. We outline planned systematic evaluation of Fourier Neural Operator and U-Net variants on forecasting, super-resolution, and error correction tasks, using physics-informed metrics to assess turbulent energy cascade representation. Future work will compare computational efficiency between numerical solvers and neural surrogates, exploring practical application. We seek community feedback on our validation approach, planned benchmark methodology, and evaluation priorities for neural operators in turbulent flows.

cs.LG↗

arXiv2025

ChannelFlow-Tools: A Configuration-Driven Pipeline for Generating Machine-Learning-Ready Datasets of 3D Obstructed Channel Flows

Data-driven surrogate models are increasingly used in computational fluid dynamics, and their reliability depends on the quality of the training data. These models are typically trained on fixed, pre-generated datasets. Systematic surrogate studies require controlled data generation, in which datasets can be regenerated, adapted, or extended to match specific research requirements. We introduce ChannelFlow-Tools, an open-source, configuration-driven pipeline for generating ML-ready datasets of three-dimensional obstructed channel flows. The pipeline integrates procedural obstacle geometry generation across six shape families, signed-distance-field (SDF) voxelisation, lattice-Boltzmann simulation, and packaging into ML-ready tensors. The workflow is driven by configuration files, with byte-identical reproducibility verified for the geometry-generation stage. The pipeline is evaluated through a full-corpus mesh-integrity audit, analytical and corpus-level validation of the SDF representation, canonical sphere-flow benchmarks for the solver, and a per-scene data-integrity audit. To demonstrate that the pipeline produces physically consistent and directly usable training data, three surrogate models (3D U-Net, FNO, and U-FNO) are trained on a sample dataset of 450 simulations spanning $Re_c \approx 1000$-$10{,}000$, generated entirely through the pipeline. The models learn the geometry-to-flow mapping and show physically interpretable behaviour on shape-family and Reynolds-number out-of-distribution splits, confirming direct downstream usability. ChannelFlow-Tools thus provides shared, auditable infrastructure for controlled benchmarking of geometry-aware CFD surrogates.

cs.GR↗

arXiv2023

Dynamically Weighted Federated k-Means

Federated clustering, an integral aspect of federated machine learning, enables multiple data sources to collaboratively cluster their data, maintaining decentralization and preserving privacy. In this paper, we introduce a novel federated clustering algorithm named Dynamically Weighted Federated k-means (DWF k-means) based on Lloyd's method for k-means clustering, to address the challenges associated with distributed data sources and heterogeneous data. Our proposed algorithm combines the benefits of traditional clustering techniques with the privacy and scalability benefits offered by federated learning. The algorithm facilitates collaborative clustering among multiple data owners, allowing them to cluster their local data collectively while exchanging minimal information with the central coordinator. The algorithm optimizes the clustering process by adaptively aggregating cluster assignments and centroids from each data source, thereby learning a global clustering solution that reflects the collective knowledge of the entire federated network. We address the issue of empty clusters, which commonly arises in the context of federated clustering. We conduct experiments on multiple datasets and data distribution settings to evaluate the performance of our algorithm in terms of clustering score, accuracy, and v-measure. The results demonstrate that our approach can match the performance of the centralized classical k-means baseline, and outperform existing federated clustering methods like k-FED in realistic scenarios.

cs.LG↗