Adapting U-Net for linear elastic stress estimation in polycrystal Zr microstructures

• URL: http://arxiv.org/abs/2303.08541v1
• Date: Wed, 15 Mar 2023 11:36:27 GMT
• Title: Adapting U-Net for linear elastic stress estimation in polycrystal Zr microstructures
• Abstract summary: A variant of the U-Net convolutional neural network architecture is proposed to estimate linear elastic compatibility stresses in a-Zr (hcp) polycrystalline grain structures. Network performance is not correlated with grain structure regularity or texture, showing generalisation of the network beyond the training set to arbitrary Zr crystal structures.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: A variant of the U-Net convolutional neural network architecture is proposed to estimate linear elastic compatibility stresses in a-Zr (hcp) polycrystalline grain structures. Training data was generated using VGrain software with a regularity alpha of 0.73 and uniform random orientation for the grain structures and ABAQUS to evaluate the stress welds using the finite element method. The initial dataset contains 200 samples with 20 held from training for validation. The network gives speedups of around 200x to 6000x using a CPU or GPU, with signifcant memory savings, compared to finite element analysis with a modest reduction in accuracy of up to 10%. Network performance is not correlated with grain structure regularity or texture, showing generalisation of the network beyond the training set to arbitrary Zr crystal structures. Performance when trained with 200 and 400 samples was measured, finding an improvement in accuracy of approximately 10% when the size of the dataset was doubled.

Related papers

• LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometry [1.2109519547057517]
  LILA scores neuron importance via the Kolmogorov--Smirnov (KS) distance between empirical singular value distributions of the full and neuron-ablated feed-forward network (FFN) weight matrix.<n>Without any fine-tuning, LILA surpasses PruneNet by 1.57pp in zero-shot accuracy on LLaMA-2-7B at 25% sparsity, and outperforms WikiText-2-d SliceGPT by up to 6.0pp across all sparsity levels.
  arXiv  Detail & Related papers  (2026-09-10T07:09:09Z)
• Signal-to-Noise Ratio and Sample Size Govern Representational Alignment in Neural Networks [48.553902624178995]
  We train an ensemble of networks on regression and classification tasks using training sets by independent realizations of a noise process.<n>We show that the signal-to-noise ratio (SNR) and the training sample size influence the alignment.<n>Across linear and nonlinear networks, regression and classification tasks, and both synthetic and real-world data, we consistently observe that alignment varies monotonically with SNR.
  arXiv  Detail & Related papers  (2026-05-26T12:58:48Z)
• Machine Learning Models to Identify Promising Nested Antiresonance Nodeless Fiber Designs [0.0]
  We propose a machine learning framework designed to identify high-performance nested antiresonance nodeless fibers (NANFs)<n>We show that small data sets are sufficient for stable, high-accuracy performance prediction, enabling the exploration of design spaces as large as $14e6$ cases.
  arXiv  Detail & Related papers  (2026-03-02T14:13:59Z)
• DispFormer: A Pretrained Transformer Incorporating Physical Constraints for Dispersion Curve Inversion [56.64622091009756]
  This study introduces DispFormer, a transformer-based neural network for $v_s$ profile inversion from Rayleigh-wave phase and group dispersion curves.<n>DispFormer processes dispersion data independently at each period, allowing it to handle varying lengths without requiring network modifications or strict alignment between training and testing datasets.
  arXiv  Detail & Related papers  (2025-01-08T09:08:24Z)
• Advanced Displacement Magnitude Prediction in Multi-Material Architected Lattice Structure Beams Using Physics Informed Neural Network Architecture [0.0]
  This paper proposes an innovative method for predicting deformation in architected lattice structures. It combines Physics-Informed Neural Networks (PINNs) with finite element analysis.
  arXiv  Detail & Related papers  (2024-12-31T00:15:58Z)
• TENNs-PLEIADES: Building Temporal Kernels with Orthogonal Polynomials [1.1970409518725493]
  We focus on interfacing these networks with event-based data to perform online classification and detection with low latency. We experimented with three event-based benchmarks and obtained state-of-the-art results on all three by large margins with significantly smaller memory and compute costs.
  arXiv  Detail & Related papers  (2024-05-20T17:06:24Z)
• Hardware-aware Training Techniques for Improving Robustness of Ex-Situ Neural Network Transfer onto Passive TiO2 ReRAM Crossbars [0.8553766625486795]
  Training approaches that adapt techniques such as dropout, the reparametrization trick and regularization to TiO2 crossbar variabilities are proposed. For the neural network trained using the proposed hardware-aware method, 79.5% of the test set's data points can be classified with an accuracy of 95% or higher.
  arXiv  Detail & Related papers  (2023-05-29T13:55:02Z)
• Dynamic Sparse Training with Structured Sparsity [11.778353786208765]
  Dynamic Sparse Training (DST) methods achieve state-of-the-art results in sparse neural network training. We propose a sparse-to-sparse DST method, Structured RigL (SRigL), to learn a variant of fine-grained structured N:M sparsity. We demonstrate a real-world acceleration of 3.4x/2.5x on CPU for online inference and 1.7x/13.0x on GPU for inference with a batch size of 256.
  arXiv  Detail & Related papers  (2023-05-03T17:48:55Z)
• Continual Spatio-Temporal Graph Convolutional Networks [87.86552250152872]
  We reformulating the Spatio-Temporal Graph Convolutional Neural Network as a Continual Inference Network. We observe up to 109x reduction in time complexity, on- hardware accelerations of 26x, and reductions in maximum allocated memory of 52% during online inference.
  arXiv  Detail & Related papers  (2022-03-21T14:23:18Z)
• Convolutional Network Fabric Pruning With Label Noise [0.0]
  This paper presents an iterative pruning strategy for Convolutional Network Fabrics (CNF) in presence of noisy training and testing data. Because of their intrinsic structure and function, Convolutional Network Fabrics are ideal candidates for pruning.
  arXiv  Detail & Related papers  (2022-02-15T09:24:08Z)
• Compact representations of convolutional neural networks via weight pruning and quantization [63.417651529192014]
  We propose a novel storage format for convolutional neural networks (CNNs) based on source coding and leveraging both weight pruning and quantization. We achieve a reduction of space occupancy up to 0.6% on fully connected layers and 5.44% on the whole network, while performing at least as competitive as the baseline.
  arXiv  Detail & Related papers  (2021-08-28T20:39:54Z)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)
• Graph Convolutional Neural Networks for Body Force Prediction [0.0]
  A graph based data-driven model is presented to perform inference on fields defined on an unstructured mesh. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented.
  arXiv  Detail & Related papers  (2020-12-03T19:53:47Z)
• Fitting the Search Space of Weight-sharing NAS with Graph Convolutional Networks [100.14670789581811]
  We train a graph convolutional network to fit the performance of sampled sub-networks. With this strategy, we achieve a higher rank correlation coefficient in the selected set of candidates.
  arXiv  Detail & Related papers  (2020-04-17T19:12:39Z)
• Dynamic R-CNN: Towards High Quality Object Detection via Dynamic Training [70.2914594796002]
  We propose Dynamic R-CNN to adjust the label assignment criteria and the shape of regression loss function. Our method improves upon ResNet-50-FPN baseline with 1.9% AP and 5.5% AP$_90$ on the MS dataset with no extra overhead.
  arXiv  Detail & Related papers  (2020-04-13T15:20:25Z)
• Revealing the Structure of Deep Neural Networks via Convex Duality [70.15611146583068]
  We study regularized deep neural networks (DNNs) and introduce a convex analytic framework to characterize the structure of hidden layers. We show that a set of optimal hidden layer weights for a norm regularized training problem can be explicitly found as the extreme points of a convex set. We apply the same characterization to deep ReLU networks with whitened data and prove the same weight alignment holds.
  arXiv  Detail & Related papers  (2020-02-22T21:13:44Z)

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.