检索结果-内蒙古大学图书馆

MONGE-AMPÈRE FLOW FOR GENERATIVE MODELING

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhang, Linfeng Weinan, E. Wang, Lei Program in Applied and Computational Mathematics Princeton University United States Department of Mathematics and Program in Applied and Computational Mathematics Princeton University United States Center for Data Science Peking University Beijing Institute of Big Data Research Beijing100871 China Institute of Physics Chinese Academy of Sciences Beijing100190 China

We present a deep generative model, named Monge-Ampère flow, which builds on continuous-time gradient flow arising from the Monge-Ampère equation in optimal transport theory. The generative map from the latent space to the data space follows a dynamical system, where a learnable potential function guides a compressible fluid to flow towards the target density distribution. Training of the model amounts to solving an optimal control problem. The Monge-Ampère flow has tractable likelihoods and supports efficient sampling and inference. One can easily impose symmetry constraints in the generative model by designing suitable scalar potential functions. We apply the approach to unsupervised density estimation of the MNIST dataset and variational calculation of the two-dimensional Ising model at the critical point. This approach brings insights and techniques from Monge-Ampère equation, optimal transport, and fluid dynamics into reversible flow-based generative models. Copyright © 2018, The Authors. All rights reserved.

关键词： Statistical mechanics

Adaptive coupling of a deep neural network potential to a classical force field

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhang, Linfeng Wang, Han Weinan, E. Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Huayuan Road 6 Beijing100088 China Department of Mathematics and Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Center for Data Science and Beijing International Center for Mathematical Research Peking University China Beijing Institute of Big Data Research Beijing100871 China

An adaptive modeling method (AMM) that couples a deep neural network potential and a classical force field is introduced to address the accuracy-efficiency dilemma faced by the molecular simulation community. The AMM simulated system is decomposed into three types of regions. The first type captures the important phenomena in the system and requires high accuracy, for which we use the Deep Potential Molecular Dynamics (DeePMD) model in this work. The DeePMD model is trained to accurately reproduce the statistical properties of the ab initio molecular dynamics. The second type does not require high accuracy and a classical force field is used to describe it in an efficient way. The third type is used for a smooth transition between the first and the second types of regions. By using a force interpolation scheme and imposing a thermodynamics force in the transition region, we make the DeePMD region embedded in the AMM simulated system as if it were embedded in a system that is fully described by the accurate potential. A representative example of the liquid water system is used to show the feasibility and promise of this method. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

Convergence acceleration of ensemble Kalman inversion in nonlinear settings

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Chada, Neil K. Tong, Xin T. Applied Mathematics and Computational Science Program King Abdullah University of Science and Technology Thuwal23955 Saudi Arabia Department of Mathematics National University of Singapore 119077 Singapore

Many data-science problems can be formulated as an inverse problem, where the parameters are estimated by minimizing a proper loss function. When complicated black-box models are involved, derivative-free optimization tools are often needed. The ensemble Kalman filter (EnKF) is a particle-based derivative-free Bayesian algorithm originally designed for data assimilation. Recently, it has been applied to inverse problems for computational efficiency. The resulting algorithm, known as ensemble Kalman inversion (EKI), involves running an ensemble of particles with EnKF update rules so they can converge to a minimizer. In this article, we investigate EKI convergence in general nonlinear settings. To improve convergence speed and stability, we consider applying EKI with non-constant step-sizes and covariance inflation. We prove that EKI can hit critical points with finite steps in non-convex settings. We further prove that EKI converges to the global minimizer polynomially fast if the loss function is strongly convex. We verify the analysis presented with numerical experiments on two inverse problems. Copyright © 2019, The Authors. All rights reserved.

关键词： Inverse problems

A Mathematical Model for Linguistic Universals

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Weinan, E. Zhou, Yajun Department of Mathematics & Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Beijing Institute of Big Data Research Beijing100871 China

Inspired by chemical kinetics and neurobiology, we propose a mathematical theory for pattern recurrence in text documents, applicable to a wide variety of languages. We present a Markov model at the discourse level for Steven Pinker’s "mentalese", or chains of mental states that transcend the spoken/written forms. Such (potentially) universal temporal structures of textual patterns lead us to a language-independent semantic representation, or a translationally-invariant word embedding, thereby forming the common ground for both comprehensibility within a given language and translatability between different languages. Applying our model to documents of moderate lengths, without relying on external knowledge bases, we reconcile Noam Chomsky’s "poverty of stimulus" paradox with statistical learning of natural languages. Copyright © 2019, The Authors. All rights reserved.

关键词： Markov processes

Reed-Muller Codes Polarize

学校读者我要写书评

暂无评论

Reed-Muller Codes Polarize

Annual IEEE Symposium on Foundations of Computer Science

作者： Emmanuel Abbe Min Ye Mathematics Institute and the School of Computer and Communication Sciences at EPFL Switzerland Program in Applied and Computational Mathematics in Princeton University USA Department of Electrical Engineering Princeton University USA

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are generated by the same matrix G_m= [1/1 0/1] ^⊗m but using different subset of rows. RM codes select simply rows having largest weights. Polar codes select instead rows having the largest conditional mutual information proceeding top to down in G_m; while this is a more elaborate and channel-dependent rule, the top-to-down ordering allows Arikan to show that the conditional mutual information polarizes, and this gives directly a capacity-achieving code on any symmetric channel. RM codes are yet to be proved to have such a property, despite the recent success for the erasure channel. In this paper, we connect RM codes to polarization theory. We show that proceeding in the RM code ordering, i.e., not top-to-down but from the lightest to the heaviest rows in G_m, the conditional mutual information again polarizes. We further demonstrate that it does so faster than for polar codes. This implies that G_m contains another code, different than the polar code and called here the twin-RM code, that is provably capacity-achieving on any symmetric channel. This gives in particular a necessary condition for RM codes to achieve capacity on symmetric channels. It further gives a sufficient condition if the rows with largest conditional mutual information correspond to the heaviest rows, i.e., if the twin-RM code is the RM code. We demonstrate here that the two codes are at least similar and give further evidence that they are indeed the same.

关键词： Polar codes Mutual information Channel capacity Decoding Entropy Boolean functions

Erratum to: Some Joys and Trials of Mathematical Neuroscience

学校读者我要写书评

暂无评论

Journal of Nonlinear Science 2014年第2期24卷 243-244页

作者： Holmes, Philip Department of Mechanical and Aerospace Engineering Program in Applied and Computational Mathematics Princeton University Princeton USA Princeton Neuroscience Institute Princeton University Princeton USA

Hyper-molecules: On the representation and recovery of dynamical structures, with application to flexible macro-molecular structures in cryo-EM

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lederman, Roy R. Andén, Joakim Singer, Amit Department of Statistics and Data Science Yale University New HavenCT United States Center for Computational Mathematics Flatiron Institute New YorkNY United States Department of Mathematics and Program in Applied and Computational Mathematics Princeton University PrincetonNJ United States

Cryo-electron microscopy (cryo-EM), the subject of the 2017 Nobel Prize in Chemistry, is a technology for determining the 3-D structure of macromolecules from many noisy 2-D projections of instances of these macromolecules, whose orientations and positions are unknown. The molecular structures are not rigid objects, but flexible objects involved in dynamical processes. The different conformations are exhibited by different instances of the macromolecule observed in a cryo-EM experiment, each of which is recorded as a particle image. The range of conformations and the conformation of each particle are not known a priori;one of the great promises of cryo-EM is to map this conformation space. Remarkable progress has been made in determining rigid structures from homogeneous samples of molecules in spite of the unknown orientation of each particle image and significant progress has been made in recovering a few distinct states from mixtures of rather distinct conformations, but more complex heterogeneous samples remain a major challenge. We introduce the "hyper-molecule" framework for modeling structures across different states of heterogeneous molecules, including continuums of states. The key idea behind this framework is representing heterogeneous macromolecules as high-dimensional objects, with the additional dimensions representing the conformation space. This idea is then refined to model properties such as localized heterogeneity. In addition, we introduce an algorithmic framework for recovering such maps of heterogeneous objects from experimental data using a Bayesian formulation of the problem and Markov chain Monte Carlo (MCMC) algorithms to address the computational challenges in recovering these high dimensional hyper-molecules. We demonstrate these ideas in a prototype applied to synthetic data. Copyright © 2019, The Authors. All rights reserved.

关键词： Medical imaging

Doubly-stochastic normalization of the Gaussian kernel is robust to heteroskedastic noise

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Landa, Boris Coifman, Ronald R. Kluger, Yuval Program in Applied Mathematics Yale University Interdepartmental Program in Computational Biology and Bioinformatics Yale University Department of Pathology Yale University School of Medicine

A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean space, a widespread approach is to from an affinity matrix by the Gaussian kernel with pairwise distances, and to follow with a certain normalization (e.g. the row-stochastic normalization or its symmetric variant). We demonstrate that the doubly-stochastic normalization of the Gaussian kernel with zero main diagonal (i.e. no self loops) is robust to heteroskedastic noise. That is, the doubly-stochastic normalization is advantageous in that it automatically accounts for observations with different noise variances. Specifically, we prove that in a suitable high-dimensional setting where heteroskedastic noise does not concentrate too much in any particular direction in space, the resulting (doubly-stochastic) noisy affinity matrix converges to its clean counterpart with rate m−1/2, where m is the ambient dimension. We demonstrate this result numerically, and show that in contrast, the popular row-stochastic and symmetric normalizations behave unfavourably under heteroskedastic noise. Furthermore, we provide a prototypical example of simulated single-cell RNA sequence data with strong intrinsic heteroskedasticity, where the advantage of the doubly-stochastic normalization for exploratory analysis is evident. Copyright © 2020, The Authors. All rights reserved.

关键词： Stochastic systems

Multiple time scale numerical methods for the inverted pendulum problem

学校读者我要写书评

暂无评论

Lecture Notes in computational Science and Engineering 2005年 44卷 241-261页

作者： Sharp, Richard Tsai, Yen-Hsi Engquist, Björn Program in Applied and Computational Mathematics Princeton University NJ 08544 United States Department of Mathematics University of Texas at Austin 1 University Station C1200 Austin TX 78712 United States

ISBN: (纸本)9783540253358

In this article, we study a class of numerical ODE schemes that use a time filtering strategy and operate in two time scales. The algorithms follow the framework of the heterogeneous multiscale methods (HMM) [1]. We apply the methods to compute the averaged path of the inverted pendulum under a highly oscillatory vertical forcing on the pivot. The averaged equation for related problems has been studied analytically in [9]. We prove and show numerically that the proposed methods approximate the averaged equation and thus compute the average path of the inverted pendulum.

关键词： Inverted pendulum