SearcharxivSearch

arXiv subjects

Jonghwan Park

Publications and source records attributed to Jonghwan Park.

2 recordsLinked to original sources

A recursive neural-network-based subgrid-scale model for large eddy simulation: application to homogeneous isotropic turbulence

We introduce a novel recursive process to a neural-network-based subgrid-scale (NN-based SGS) model for large eddy simulation (LES) of high Reynolds number turbulent flow. This process is designed to allow an SGS model to be applicable to a hierarchy of different grid sizes without requiring an expensive filtered direct numerical simulation (DNS) data: 1) train an NN-based SGS model with filtered DNS data at a low Reynolds number; 2) apply the trained SGS model to LES at a higher Reynolds number; 3) update this SGS model with training data augmented with filtered LES (fLES) data, accommodating coarser filter size; 4) apply the updated NN to LES at a further higher Reynolds number; 5) go back to 3) until a target (very coarse) filter size divided by the Kolmogorov length scale is reached. We also construct an NN-based SGS model using a dual NN architecture whose outputs are the SGS normal stresses for one NN and the SGS shear stresses for the other NN. The input is composed of the velocity gradient tensor and grid size. Furthermore, for the application of an NN-based SGS model trained with one flow to another flow, we modify the NN by eliminating bias and introducing leaky rectified linear unit function as an activation function. The present recursive SGS model is applied to forced homogeneous isotropic turbulence (FHIT), and successfully predicts FHIT at high Reynolds numbers. The present model trained from FHIT is also applied to decaying homogeneous isotropic turbulence, and shows an excellent prediction performance.

physics.flu-dyn

Tighter Regret Analysis and Optimization of Online Federated Learning

In federated learning (FL), it is commonly assumed that all data are placed at clients in the beginning of machine learning (ML) optimization (i.e., offline learning). However, in many real-world applications, it is expected to proceed in an online fashion. To this end, online FL (OFL) has been introduced, which aims at learning a sequence of global models from decentralized streaming data such that the so-called cumulative regret is minimized. Combining online gradient descent and model averaging, in this framework, FedOGD is constructed as the counterpart of FedSGD in FL. While it can enjoy an optimal sublinear regret, FedOGD suffers from heavy communication costs. In this paper, we present a communication-efficient method (named OFedIQ) by means of intermittent transmission (enabled by client subsampling and periodic transmission) and quantization. For the first time, we derive the regret bound that captures the impact of data-heterogeneity and the communication-efficient techniques. Through this, we efficiently optimize the parameters of OFedIQ such as sampling rate, transmission period, and quantization levels. Also, it is proved that the optimized OFedIQ can asymptotically achieve the performance of FedOGD while reducing the communication costs by 99%. Via experiments with real datasets, we demonstrate the effectiveness of the optimized OFedIQ.

cs.LG