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

Consensus dynamics and coherence in hierarchical small-world networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liao, Yunhua Maama, Mohamed Aziz-Alaoui, M.A. Department of Mathematics Hunan University of Technology and Business Hunan Changsha410205 China Key Laboratory of Hunan Province for Statistical Learning and Intelligent Computation Hunan Changsha410205 China Applied Mathematics and Computational Science Program KAUST Thuwal23955-6900 Saudi Arabia Normandie Univ UNIHAVRE LMAH FR-CNRS-3335 ISCN Le Havre76600 France

The hierarchical small-world network is a real-world network. It models well the benefit transmission web of the pyramid selling in China and many other countries. In this paper, by applying the spectral graph theory, we study three important aspects of the consensus problem in the hierarchical small-world network: convergence speed, communication time-delay robustness, and network coherence. Firstly, we explicitly determine the Laplacian eigenvalues of the hierarchical small-world network by making use of its treelike structure. Secondly, we find that the consensus algorithm on the hierarchical small-world network converges faster than that on some well-studied sparse networks, but is less robust to time delay. The closed-form of the first-order and the second-order network coherence are also derived. Our result shows that the hierarchical small-world network has an optimal structure of noisy consensus dynamics. Therefore, we provide a positive answer to two open questions of Yi et al. Finally, we argue that some network structure characteristics, such as large maximum degree, small average path length, and large vertex and edge connectivity, are responsible for the strong robustness with respect to external perturbations. Copyright © 2023, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

PERMUTATION INVARIANT REPRESENTATIONS with APPLICATIONS to GRAPH DEEP LEARNING

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Balan, Radu Haghani, Naveed Singh, Maneesh Department of Mathematics University of Maryland College ParkMD20742 United States Applied Mathematics and Statistics and Scientific Computation Program University of Maryland College ParkMD20742 United States Verisk Analytics Jersey CityNJ07310 United States

This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is invariant to node relabeling. Two embedding schemes are introduced, one based on sorting and the other based on algebras of multivariate polynomials. While both embeddings exhibit a computational complexity exponential in problem size, the sorting based embedding is globally bi-Lipschitz and admits a low dimensional target space. Additionally, an almost everywhere injective scheme can be implemented with minimal redundancy and low computational cost. In turn, this proves that almost any classifier can be implemented with an arbitrary small loss of performance. Numerical experiments are carried out on two data sets, a chemical compound data set (QM9) and a proteins data set (PROTEINS FULL).MSC Codes 05C62, 20C32, 68R12 © 2022, CC BY.

关键词： Embeddings

An L2 Analysis of Reinforcement Learning in High Dimensions with Kernel and Neural Network Approximation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Long, Jihao Han, Jiequn Weinan, E. Program of Applied and Computational Mathematics Princeton University United States Department of Mathematics Princeton University United States Center for Computational Mathematics Flatiron Institute School of Mathematical Sciences Peking University

Reinforcement learning (RL) algorithms based on high-dimensional function approximation have achieved tremendous empirical success in large-scale problems with an enormous number of states. However, most analysis of such algorithms gives rise to error bounds that involve either the number of states or the number of features. This paper considers the situation where the function approximation is made either using the kernel method or the two-layer neural network model, in the context of a fitted Q-iteration algorithm with explicit regularization. We establish an Õ(H3|A|1/4 n- 1/4) bound for the optimal policy with Hn samples, where H is the length of each episode and |A| is the size of action space. Our analysis hinges on analyzing the L2 error of the approximated Q-function using n data points. Even though this result still requires a finite-sized action space, the error bound is independent of the dimensionality of the state space. Copyright © 2021, The Authors. All rights reserved.

关键词： Error analysis

Unbiased Estimation using Underdamped Langevin Dynamics

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Ruzayqat, Hamza Chada, Neil K. Jasra, Ajay Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia

In this work we consider the unbiased estimation of expectations w.r.t. probability measures that have non-negative Lebesgue density, and which are known point-wise up-to a normalizing constant. We focus upon developing an unbiased method via the underdamped Langevin dynamics, which has proven to be popular of late due to applications in statistics and machine learning. Specifically in continuous-time, the dynamics can be constructed so that as the time goes to infinity they admit the probability of interest as a stationary measure. In many cases, time-discretized versions of the underdamped Langevin dynamics are used in practice which are run only with a fixed number of iterations. We develop a novel scheme based upon doubly randomized estimation as in [17, 19], which requires access only to time-discretized versions of the dynamics. The proposed scheme aims to remove the dicretization bias and the bias resulting from running the dynamics for a finite number of iterations. We prove, under standard assumptions, that our estimator is of finite variance and either has finite expected cost, or has finite cost with a high probability. To illustrate our theoretical findings we provide numerical experiments which verify our theory, which include challenging examples from Bayesian statistics and statistical *** Codes 60J22, 65C05, 65C40, 82C31, 62G08, 35Q56 © 2022, CC BY.

关键词： Dynamics

On Theory of Names to be Used in Semantics of References in Functional and Object-Oriented Languages 23

学校读者我要写书评

暂无评论

On Theory of Names to be Used in Semantics of References in ...

23rd Conference on Scientific Services and Internet, SSI 2021

作者： Adamovich, Alexei I. Klimov, Andrei V. Ailamazyan Program Systems Institute of RAS 4a Peter I str. Pereslavl-Zalessky152021 Russia Keldysh Institute of Applied Mathematics of RAS 4 Miusskaya sq. Moscow125047 Russia

The long-standing problem of adequate formalization of local names in mathematical formulas and semantics of references in object-oriented languages taken on their own without objects, is discussed. Reasons why the existing approaches cannot be considered suitable solutions, are explained. An introduction is given to the relatively recent works on the theories of names and references of the group lead by Andrew Pitts. The concept of referential transparency, in which contextual equivalence is used instead of the usual equality of values, is analyzed. It is the main property, which these theories are based upon: such modified referential transparency is preserved when a purely functional language is extended with names and references as data. An outline of a constructive denotational semantics of the extended functional language is given. It is argued that the modified referential transparency, along with many other valuable properties, can be also preserved for mutable objects that change to a limited extent. This leads to a model of computation between functional and object-oriented ones, allowing for a deterministic parallel implementation. © 2021 Copyright for this paper by its authors.

关键词： Computation theory

Gaussian Process Port-Hamiltonian Systems: Bayesian Learning with Physics Prior

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Beckers, Thomas Seidman, Jacob Perdikaris, Paris Pappas, George J. Department of Electrical and Systems Engineering University of Pennsylvania PhiladelphiaPA19104 United States graduate program in Applied Mathematics and Computational Science University of Pennsylvania PhiladelphiaPA19104 United States Department of Mechanical Engineering and Applied Mechanics University of Pennsylvania PhiladelphiaPA19104 United States

Data-driven approaches achieve remarkable results for the modeling of complex dynamics based on collected data. However, these models often neglect basic physical principles which determine the behavior of any real-world system. This omission is unfavorable in two ways: The models are not as data-efficient as they could be by incorporating physical prior knowledge, and the model itself might not be physically correct. We propose Gaussian Process Port-Hamiltonian systems (GP-PHS) as a physics-informed Bayesian learning approach with uncertainty quantification. The Bayesian nature of GP-PHS uses collected data to form a distribution over all possible Hamiltonians instead of a single point estimate. Due to the underlying physics model, a GP-PHS generates passive systems with respect to designated inputs and outputs. Further, the proposed approach preserves the compositional nature of Port-Hamiltonian systems. © 2023, CC BY-NC-ND.

关键词： Hamiltonians

On Time Uniform Wong-Zakai Approximation Theorems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Del Moral, Pierre Hu, Shulan Jasra, Ajay Ruzayqat, Hamza Wang, Xinyu Institut de Mathematiques de Bordeaux Bordeaux33405 France School of Statistics and Mathematics Zhongnan University of Economics and Law China Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Wenlan School of Business Zhongnan University of Economics and Law China

We consider the long time behavior of Wong-Zakai approximations of stochastic differential equations. These piecewise smooth diffusion approximations are of great importance in many areas, such as those with ordinary differential equations associated to random smooth fluctuations;e.g. robust filtering problems. In many examples, the mean error estimate bounds that have been derived in the literature can grow exponentially with respect to the time horizon. We show in a simple example that indeed mean error estimates do explode exponentially in the time parameter, i.e. in that case a Wong-Zakai approximation is only useful for extremely short time intervals. Under spectral conditions, we present some quantitative time-uniform convergence theorems, i.e. time-uniform mean error bounds, yielding what seems to be the first results of this type for Wong-Zakai diffusion *** Codes 60H35(Primary), 65C30(Secondary) Copyright © 2023, The Authors. All rights reserved.

关键词： Brownian movement

An Assessment of the Supremizer and Aggregation Methods of Stabilization for Reduced-Order Models

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Davie, Kayla D. Elman, Howard C. Applied Mathematics & Statistics Scientific Computation Program University of Maryland College ParkMD20742 United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

MSC Codes 65N22, 65K10, 65F45We explore the features of two methods of stabilization, aggregation and supremizer methods, for reduced-order modeling of parametrized optimal control problems. In both methods, the reduced basis spaces are augmented to guarantee stability. For the aggregation method, the reduced basis approximation spaces for the state and adjoint variables are augmented in such a way that the spaces are identical. For the supremizer method, the reduced basis approximation space for the state-control product space is augmented with the solutions of a supremizer equation. We implement both of these methods for solving several parametrized control problems and assess their performance. Results indicate that the number of reduced basis vectors needed to approximate the solution space to some tolerance with the supremizer method is much larger, possibly double, that for aggregation. There are also some cases where the supremizer method fails to produce a converged solution. We present results to compare the accuracy, efficiency, and computational costs associated with both methods of stabilization which suggest that stabilization by aggregation is a superior stabilization method for control problems. © 2023, CC BY.

关键词： Stabilization

Ab Initio Generalized Langevin Equation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Xie, Pinchen Car, Roberto Weinan, E. Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Chemistry Department of Physics Program in Applied and Computational Mathematics Princeton Institute for the Science and Technology of Materials Princeton University PrincetonNJ08544 United States AI for Science Institute Beijing China Center for Machine Learning Research School of Mathematical Sciences Peking University Beijing China

We introduce a machine learning-based approach called ab initio generalized Langevin equation (AIGLE) to model the dynamics of slow collective variables in materials and molecules. In this scheme, the parameters are learned from atomistic simulations based on ab initio quantum mechanical models. Force field, memory kernel, and noise generator are constructed in the context of the Mori-Zwanzig formalism, under the constraint of the fluctuation-dissipation theorem. Combined with deep potential molecular dynamics and electronic density functional theory, this approach opens the way to multi-scale modeling in a variety of situations. Here, we demonstrate this capability with a study of two mesoscale processes in crystalline lead titanate, namely the field-driven dynamics of a planar ferroelectric domain wall, and the dynamics of an extensive lattice of coarse-grained electric dipoles. In the first case, AIGLE extends the reach of ab initio simulations to a regime of noise-driven motions not accessible to molecular dynamics. In the second case, AIGLE deals with an extensive set of collective variables by adopting a local approximation for the memory kernel and retaining only short-range noise correlations. The scheme is computationally more efficient than molecular dynamics by several orders of magnitude, and mimics the microscopic dynamics at low frequencies where it reproduces accurately the dominant far-infrared absorption frequency. © 2022, CC BY.

关键词： Molecular dynamics