skip to main content

Explore Research Products in the NSF-PAR

Title: Some Recent Advances in Energetic Variational Approaches
In this paper, we summarize some recent advances related to the energetic variational approach (EnVarA), a general variational framework of building thermodynamically consistent models for complex fluids, by some examples. Particular focus will be placed on how to model systems involving chemo-mechanical couplings and non-isothermal effects.  more » « less
Award ID(s):
1950868 2118181
NSF-PAR ID:
10330686
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Entropy
Volume:
24
Issue:
5
ISSN:
1099-4300
Page Range / eLocation ID:
721
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; ; ( , Journal of Atmospheric and Oceanic Technology)
    null (Ed.)
    Abstract Observation system simulation experiments are used to evaluate different dual-Doppler analysis (DDA) methods for retrieving vertical velocity w at grid spacings on the order of 100 m within a simulated tornadic supercell. Variational approaches with and without a vertical vorticity equation constraint are tested, along with a typical (traditional) method involving vertical integration of the mass conservation equation. The analyses employ emulated radar data from dual-Doppler placements 15, 30, and 45 km east of the mesocyclone, with volume scan intervals ranging from 10 to 150 s. The effect of near-surface data loss is examined by denying observations below 1 km in some of the analyses. At the longer radar ranges and when no data denial is imposed, the “traditional” method produces results similar to those of the variational method and is much less expensive to implement. However, at close range and/or with data denial, the variational method is much more accurate, confirming results from previous studies. The vorticity constraint shows the potential to improve the variational analysis substantially, reducing errors in the w retrieval by up to 30% for rapid-scan observations (≤30 s) at close range when the local vorticity tendency is estimated using spatially variable advection correction. However, the vorticity constraint also degrades the analysis for longer scan intervals, and the impact diminishes with increased range. Furthermore, analyses using 30-s data also frequently outperform analyses using 10-s data, suggesting a limit to the benefit of increasing the radar scan rate for variational DDA employing the vorticity constraint. 
    more » « less
  2. ; ; ; ; ; ( , Fluids)
    In this paper, we discuss some well-known experimental observations on self-organization in dissipative systems. The examples range from pure fluid flow, pattern selection in fluid–solid systems to chemical-reaction-induced flocking and aggregation in fluid systems. In each case, self-organization can be seen to be a function of a persistent internal gradient. One goal of this article is to hint at a common theory to explain such phenomena, which often takes the form of the extremum of some thermodynamic quantity, for instance the rate of entropy production. Such variational theories are not new; they have been in existence for decades and gained popularity through the Nobel Prize-winning work of theorists such as Lars Onsager and Ilya Prigogine. The arguments have evolved since then to include systems of higher complexity and for nonlinear systems, though a comprehensive theory remains elusive. The overall attempt is to bring out examples from physics, chemistry, engineering, and biology that reveal deep connections between variational principles in physics and biological, or living systems. There is sufficient evidence to at least raise suspicion that there exists an organization principle common to both living and non-living systems, which deserves deep attention. 
    more » « less
  3. ; ; ( , Proceedings of Machine Learning Research)
    Jaeger, Manfred ; Nielsen, Thomas Dyhre (Ed.)
    Almost all of the work in graphical models for game theory has mirrored previous work in probabilistic graphical models. Our work considers the opposite direction: Taking advantage of advances in equilibrium computation for probabilistic inference. In particular, we present formulations of inference problems in Markov random fields (MRFs) as computation of equilibria in a certain class of game-theoretic graphical models. While some previous work explores this direction, we still lack a more precise connection between variational probabilistic inference in MRFs and correlated equilibria. This paper sharpens the connection, which helps us exploit relatively more recent theoretical and empirical results from the literature on algorithmic and computational game theory on the tractable, polynomial-time computation of exact or approximate correlated equilibria in graphical games with arbitrary, loopy graph structure. Our work discusses how to design new algorithms with equally tractable guarantees for the computation of approximate variational inference in MRFs. In addition, inspired by a previously stated game-theoretic view of tree-reweighted message-passing techniques for belief inference as a zero-sum game, we propose a different, general-sum potential game to design approximate fictitious-play techniques. Empirical evaluations on synthetic experiments and on an application to soft de-noising on real-world image datasets illustrate the performance of our proposed approach and shed some light on the conditions under which the resulting belief inference algorithms may be most effective relative to standard state-of-the-art methods. 
    more » « less
  4. ; ; ; ; ( , New Journal of Physics)
    Abstract

    We introduce a new statistical and variational approach to the phase estimation algorithm (PEA). Unlike the traditional and iterative PEAs which return only an eigenphase estimate, the proposed method can determine any unknown eigenstate–eigenphase pair from a given unitary matrix utilizing a simplified version of the hardware intended for the iterative PEA (IPEA). This is achieved by treating the probabilistic output of an IPEA-like circuit as an eigenstate–eigenphase proximity metric, using this metric to estimate the proximity of the input state and input phase to the nearest eigenstate–eigenphase pair and approaching this pair via a variational process on the input state and phase. This method may search over the entire computational space, or can efficiently search for eigenphases (eigenstates) within some specified range (directions), allowing those with some prior knowledge of their system to search for particular solutions. We show the simulation results of the method with the Qiskit package on the IBM Q platform and on a local computer.

     
    more » « less
  5. ; ; ( , Proceedings of the AAAI Conference on Artificial Intelligence)
    A key advance in learning generative models is the use of amortized inference distributions that are jointly trained with the models. We find that existing training objectives for variational autoencoders can lead to inaccurate amortized inference distributions and, in some cases, improving the objective provably degrades the inference quality. In addition, it has been observed that variational autoencoders tend to ignore the latent variables when combined with a decoding distribution that is too flexible. We again identify the cause in existing training criteria and propose a new class of objectives (Info-VAE) that mitigate these problems. We show that our model can significantly improve the quality of the variational posterior and can make effective use of the latent features regardless of the flexibility of the decoding distribution. Through extensive qualitative and quantitative analyses, we demonstrate that our models outperform competing approaches on multiple performance metrics 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email