A Generalized Framework for Microstructural Optimization using Neural Networks

• URL: http://arxiv.org/abs/2207.06512v1
• Date: Wed, 13 Jul 2022 20:19:16 GMT
• Title: A Generalized Framework for Microstructural Optimization using Neural Networks
• Abstract summary: We propose a neural-network (NN) framework to solve microstructural optimization problems. The framework relies on the classic density formulation of microstructural optimization, but the density field is represented through the NN's weights and biases. The framework is illustrated through a variety of microstructural optimization problems.
• Score: 5.104113288544065
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Microstructures, i.e., architected materials, are designed today, typically, by maximizing an objective, such as bulk modulus, subject to a volume constraint. However, in many applications, it is often more appropriate to impose constraints on other physical quantities of interest. In this paper, we consider such generalized microstructural optimization problems where any of the microstructural quantities, namely, bulk, shear, Poisson ratio, or volume, can serve as the objective, while the remaining can serve as constraints. In particular, we propose here a neural-network (NN) framework to solve such problems. The framework relies on the classic density formulation of microstructural optimization, but the density field is represented through the NN's weights and biases. The main characteristics of the proposed NN framework are: (1) it supports automatic differentiation, eliminating the need for manual sensitivity derivations, (2) smoothing filters are not required due to implicit filtering, (3) the framework can be easily extended to multiple-materials, and (4) a high-resolution microstructural topology can be recovered through a simple post-processing step. The framework is illustrated through a variety of microstructural optimization problems.

Related papers

• Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity [15.786915433105868]
  We show that a broad class of feedforward neural networks learn (have finite sample complexity) in the PAC model.<n>Our results reposition finite-sample PAC learnability as a baseline rather than a differentiator.
  arXiv  Detail & Related papers  (2026-05-08T01:26:25Z)
• Spectral Normalization and Voigt-Reuss net: A universal approach to microstructure-property forecasting with physical guarantees [0.0]
  A crucial step in the design process is the rapid evaluation of effective mechanical, thermal, or, in general, elasticity properties. The classical simulation-based approach, which uses, e.g., finite elements and FFT-based solvers, can require substantial computational resources. We propose a novel spectral normalization scheme that a priori enforces these bounds.
  arXiv  Detail & Related papers  (2025-04-01T12:21:57Z)
• Geometric Neural Process Fields [58.77241763774756]
  Geometric Neural Process Fields (G-NPF) is a probabilistic framework for neural radiance fields that explicitly captures uncertainty. Building on these bases, we design a hierarchical latent variable model, allowing G-NPF to integrate structural information across multiple spatial levels. Experiments on novel-view synthesis for 3D scenes, as well as 2D image and 1D signal regression, demonstrate the effectiveness of our method.
  arXiv  Detail & Related papers  (2025-02-04T14:17:18Z)
• Searching for Efficient Linear Layers over a Continuous Space of Structured Matrices [88.33936714942996]
  We present a unifying framework that enables searching among all linear operators expressible via an Einstein summation. We show that differences in the compute-optimal scaling laws are mostly governed by a small number of variables. We find that Mixture-of-Experts (MoE) learns an MoE in every single linear layer of the model, including the projection in the attention blocks.
  arXiv  Detail & Related papers  (2024-10-03T00:44:50Z)
• NITO: Neural Implicit Fields for Resolution-free Topology Optimization [7.338114424386579]
  Topology optimization is a critical task in engineering design, where the goal is to optimally distribute material in a given space. We introduce Neural Implicit Topology Optimization (NITO), a novel approach to accelerate topology optimization problems using deep learning. NITO synthesizes structures with up to seven times better structural efficiency compared to SOTA diffusion models.
  arXiv  Detail & Related papers  (2024-02-07T18:27:29Z)
• Neural Fields with Hard Constraints of Arbitrary Differential Order [61.49418682745144]
  We develop a series of approaches for enforcing hard constraints on neural fields. The constraints can be specified as a linear operator applied to the neural field and its derivatives. Our approaches are demonstrated in a wide range of real-world applications.
  arXiv  Detail & Related papers  (2023-06-15T08:33:52Z)
• FluTO: Graded Multiscale Fluid Topology Optimization using Neural Networks [5.104113288544065]
  We propose a graded multiscale topology optimization (GMTO) for designing fluid-flow devices. GMTO significantly reduces the computation while retaining many of the benefits of multi-scale topology optimization (MTO)
  arXiv  Detail & Related papers  (2022-09-16T20:52:21Z)
• Three-dimensional microstructure generation using generative adversarial neural networks in the context of continuum micromechanics [77.34726150561087]
  This work proposes a generative adversarial network tailored towards three-dimensional microstructure generation. The lightweight algorithm is able to learn the underlying properties of the material from a single microCT-scan without the need of explicit descriptors.
  arXiv  Detail & Related papers  (2022-05-31T13:26:51Z)
• GM-TOuNN: Graded Multiscale Topology Optimization using Neural Networks [5.104113288544065]
  We propose a graded multiscale topology optimization using neural-network (GM-TOuNN) framework. The proposed framework is illustrated through several examples.
  arXiv  Detail & Related papers  (2022-04-14T00:34:28Z)
• 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)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• When Residual Learning Meets Dense Aggregation: Rethinking the Aggregation of Deep Neural Networks [57.0502745301132]
  We propose Micro-Dense Nets, a novel architecture with global residual learning and local micro-dense aggregations. Our micro-dense block can be integrated with neural architecture search based models to boost their performance.
  arXiv  Detail & Related papers  (2020-04-19T08:34:52Z)

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.