An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations

• URL: http://arxiv.org/abs/2105.13797v1
• Date: Wed, 17 Mar 2021 01:38:02 GMT
• Title: An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations
• Authors: Guangye Chen, Luis Chac\'on, Truong B. Nguyen
• Abstract summary: We propose an unsupervised machine-learning checkpoint-restart (CR) lossy algorithm for particle-in-cell (PIC) algorithms using Gaussian mixtures (GM) The algorithm features a particle compression stage and a particle reconstruction stage, where a continuum particle distribution function is constructed and resampled, respectively. We demonstrate the algorithm using a recently developed exactly energy- and charge-conserving PIC algorithm on physical problems of interest, with compression factors $gtrsim75$ with no appreciable impact on the quality of the restarted dynamics.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an unsupervised machine-learning checkpoint-restart (CR) lossy algorithm for particle-in-cell (PIC) algorithms using Gaussian mixtures (GM). The algorithm features a particle compression stage and a particle reconstruction stage, where a continuum particle distribution function is constructed and resampled, respectively. To guarantee fidelity of the CR process, we ensure the exact preservation of charge, momentum, and energy for both compression and reconstruction stages, everywhere on the mesh. We also ensure the preservation of Gauss' law after particle reconstruction. As a result, the GM CR algorithm is shown to provide a clean, conservative restart capability while potentially affording orders of magnitude savings in input/output requirements. We demonstrate the algorithm using a recently developed exactly energy- and charge-conserving PIC algorithm on physical problems of interest, with compression factors $\gtrsim75$ with no appreciable impact on the quality of the restarted dynamics.

Related papers

• DGTR: Distributed Gaussian Turbo-Reconstruction for Sparse-View Vast Scenes [81.56206845824572]
  Novel-view synthesis (NVS) approaches play a critical role in vast scene reconstruction. Few-shot methods often struggle with poor reconstruction quality in vast environments. This paper presents DGTR, a novel distributed framework for efficient Gaussian reconstruction for sparse-view vast scenes.
  arXiv  Detail & Related papers  (2024-11-19T07:51:44Z)
• Efficient Dataset Distillation Using Random Feature Approximation [109.07737733329019]
  We propose a novel algorithm that uses a random feature approximation (RFA) of the Neural Network Gaussian Process (NNGP) kernel. Our algorithm provides at least a 100-fold speedup over KIP and can run on a single GPU. Our new method, termed an RFA Distillation (RFAD), performs competitively with KIP and other dataset condensation algorithms in accuracy over a range of large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-21T15:56:13Z)
• End-to-end multi-particle reconstruction in high occupancy imaging calorimeters with graph neural networks [18.347013421412793]
  We present an end-to-end reconstruction algorithm to build particle candidates from detector hits in granular calorimeters. The algorithm exploits a distance-weighted graph neural network, trained with object condensation, a graph segmentation technique. This work is the first-ever example of single-shot calorimetric reconstruction of $cal O(1000)$ particles in high-luminosity conditions with 200 pileup to our knowledge.
  arXiv  Detail & Related papers  (2022-04-04T17:51:43Z)
• Machine Learning for Particle Flow Reconstruction at CMS [7.527568379083754]
  We provide details on the implementation of a machine-learning based particle flow algorithm for CMS. The algorithm reconstructs stable particles based on calorimeter clusters and tracks to provide a global event reconstruction.
  arXiv  Detail & Related papers  (2022-03-01T10:11:44Z)
• A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits [118.22458816174144]
  We propose a novel robust elimination-type algorithm that runs in epochs, combines exploration with infrequent switching to select a small subset of actions, and plays each action for multiple time instants. Our algorithm, GP Robust Phased Elimination (RGP-PE), successfully balances robustness to corruptions with exploration and exploitation. We perform the first empirical study of robustness in the corrupted GP bandit setting, and show that our algorithm is robust against a variety of adversarial attacks.
  arXiv  Detail & Related papers  (2022-02-03T21:19:36Z)
• Robust Quantum Control using Hybrid Pulse Engineering [0.0]
  gradient-based optimization algorithms are limited by their sensitivity to the initial guess. Our numerical analysis confirms its superior convergence rate. We describe a general method to construct noise-resilient quantum controls by incorporating noisy fields.
  arXiv  Detail & Related papers  (2021-12-02T14:29:42Z)
• MLPF: Efficient machine-learned particle-flow reconstruction using graph neural networks [0.0]
  In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a particle-level view of the event. We introduce a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, scalable, and graph neural networks. We report the physics and computational performance of the algorithm on a Monte Carlo dataset of top quark-antiquark pairs produced in proton-proton collisions.
  arXiv  Detail & Related papers  (2021-01-21T12:47:54Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• Kullback-Leibler Divergence-Based Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation [152.609322951917]
  We come up with a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and a morphological reconstruction operation. The proposed algorithm works well and comes with better segmentation performance than other comparative algorithms.
  arXiv  Detail & Related papers  (2020-02-21T05:19:10Z)
• Residual-Sparse Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet frames [146.63177174491082]
  Fuzzy $C$-Means (FCM) algorithm incorporates a morphological reconstruction operation and a tight wavelet frame transform. We present an improved FCM algorithm by imposing an $ell_0$ regularization term on the residual between the feature set and its ideal value. Experimental results reported for synthetic, medical, and color images show that the proposed algorithm is effective and efficient, and outperforms other algorithms.
  arXiv  Detail & Related papers  (2020-02-14T10:00:03Z)

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.