skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Machine learning and polymer self-consistent field theory in two spatial dimensions
A computational framework that leverages data from self-consistent field theory simulations with deep learning to accelerate the exploration of parameter space for block copolymers is presented. This is a substantial two-dimensional extension of the framework introduced in the work of Xuan et al. [J. Comput. Phys. 443, 110519 (2021)]. Several innovations and improvements are proposed. (1) A Sobolev space-trained, convolutional neural network is employed to handle the exponential dimension increase of the discretized, local average monomer density fields and to strongly enforce both spatial translation and rotation invariance of the predicted, field-theoretic intensive Hamiltonian. (2) A generative adversarial network (GAN) is introduced to efficiently and accurately predict saddle point, local average monomer density fields without resorting to gradient descent methods that employ the training set. This GAN approach yields important savings of both memory and computational cost. (3) The proposed machine learning framework is successfully applied to 2D cell size optimization as a clear illustration of its broad potential to accelerate the exploration of parameter space for discovering polymer nanostructures. Extensions to three-dimensional phase discovery appear to be feasible.  more » « less
Award ID(s):
2104255
PAR ID:
10516154
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
American Institute of Physics
Date Published:
Journal Name:
The Journal of Chemical Physics
Volume:
158
Issue:
14
ISSN:
0021-9606
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Density estimation is one of the fundamental problems in both statistics and machine learning. In this study, we propose Roundtrip, a computational framework for general-purpose density estimation based on deep generative neural networks. Roundtrip retains the generative power of deep generative models, such as generative adversarial networks (GANs) while it also provides estimates of density values, thus supporting both data generation and density estimation. Unlike previous neural density estimators that put stringent conditions on the transformation from the latent space to the data space, Roundtrip enables the use of much more general mappings where target density is modeled by learning a manifold induced from a base density (e.g., Gaussian distribution). Roundtrip provides a statistical framework for GAN models where an explicit evaluation of density values is feasible. In numerical experiments, Roundtrip exceeds state-of-the-art performance in a diverse range of density estimation tasks. 
    more » « less
  2. Thanks to the power of representation learning, neural contextual bandit algorithms demonstrate remarkable performance improvement against their classical counterparts. But because their exploration has to be performed in the entire neural network parameter space to obtain nearly optimal regret, the resulting computational cost is prohibitively high. We perturb the rewards when updating the neural network to eliminate the need of explicit exploration and the corresponding computational overhead. We prove that a O(d\sqrt{T}) regret upper bound is still achievable under standard regularity conditions, where $$T$$ is the number of rounds of interactions and $$\tilde{d}$$ is the effective dimension of a neural tangent kernel matrix. Extensive comparisons with several benchmark contextual bandit algorithms, including two recent neural contextual bandit models, demonstrate the effectiveness and computational efficiency of our proposed neural bandit algorithm. 
    more » « less
  3. ABSTRACT In therapeutic focused ultrasound (FUS), such as thermal ablation and hyperthermia, effective acousto‐thermal manipulation requires precise targeting of complex geometries, sound wave propagation through irregular structures, and selective focusing at specific depths. Acoustic holographic lenses (AHLs) provide a distinctive capability to shape acoustic fields into precise, complex, and multifocal FUS‐thermal patterns. Acknowledging the under‐explored potential of AHLs in shaping ultrasound‐induced heating patterns, this study introduces a roadmap for acousto‐thermal modeling in the design of AHLs. Three primary modeling approaches are studied and contrasted using four distinct shape groups for the imposed target field. They include pressure‐based time reversal (TR) (basic (BSC‐TR) and iterative (ITER‐TR)), temperature‐based (inverse heat transfer optimization (IHTO‐TR)), and machine learning (ML)‐based (generative adversarial network (GaN) and GaN with feature (Feat‐GAN)) methods. Novel metrics, including image quality, thermal efficiency, thermal control, and computational time, are introduced, providing each method's strengths and weaknesses. The importance of evaluating target pattern complexity, thermal and pressure requirements, and computational resources is highlighted. As a further step, two case studies: (1) transcranial FUS and (2) liver hyperthermia, demonstrate the practical use of acoustic holography in therapeutic settings. This paper offers a practical reference for selecting modeling approaches based on therapeutic goals and modeling requirements. Alongside established methods like BSC‐TR and ITER‐TR, new techniques IHTO‐TR, GaN, and Feat‐GaN are introduced. BSC‐TR serves as a baseline, while ITER‐TR enables refinement based on target shape characteristics. IHTO‐TR supports thermal control, GaN offers rapid solutions under fixed conditions, and Feat‐GaN provides adaptability across varying application settings. 
    more » « less
  4. Generative Adversarial Network (GAN) has emerged as one of the most promising semi-supervised learning methods where two neural nets train themselves in a competitive environment. In this paper, as far as we know, we are the first to present a statistically trained Ternarized Generative Adversarial Network (TGAN) with fully ternarized weights (i.e. -1,0,+1) to massively reduce the need for computation and storage resources in the conventional GAN structures. In the proposed TGAN, the computationally expensive convolution operations (i.e. Multiplication and Accumulation) in both generator and discriminator's forward path are converted into hardware-friendly Addition/Subtraction operations. Accordingly, we propose a Processing-in-Memory accelerator for TGAN called (PIM-TGAN) based on Spin-Orbit Torque Magnetic Random Access Memory (SOT-MRAM) computational sub-arrays to efficiently accelerate the training process of GAN within non-volatile memory. In addition, we propose a parallelism technique to further enhance the training efficiency of TGAN. Our device-to-architecture co-simulation results show that, with almost the same inception score to the baseline GAN with floating point number weights on different data-sets, the proposed PIM-TGAN can obtain ~25.6× better energy-efficiency and 22× speedup compared to GPU platform averagely, and, 9.2× better energy-efficiency and 5.4× speedup over the best processing-in-ReRAM accelerators. 
    more » « less
  5. Deep neural networks (DNNs) demonstrates significant advantages in improving ranking performance in retrieval tasks. Driven by the recent developments in optimization and generalization of DNNs, learning a neural ranking model online from its interactions with users becomes possible. However, the required exploration for model learning has to be performed in the entire neural network parameter space, which is prohibitively expensive and limits the application of such online solutions in practice. In this work, we propose an efficient exploration strategy for online interactive neural ranker learning based on bootstrapping. Our solution is based on an ensemble of ranking models trained with perturbed user click feedback. The proposed method eliminates explicit confidence set construction and the associated computational overhead, which enables the online neural rankers training to be efficiently executed in practice with theoretical guarantees. Extensive comparisons with an array of state-of-the-art OL2R algorithms on two public learning to rank benchmark datasets demonstrate the effectiveness and computational efficiency of our proposed neural OL2R solution. 
    more » « less