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

Local number fluctuations in hyperuniform and nonhyperuniform systems: Higher-order moments and distribution functions

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Torquato, Salvatore Kim, Jaeuk Klatt, Michael A. Department of Physics Princeton University PrincetonNJ08544 United States Department of Chemistry Princeton Institute for the Science and Technology of Materials Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

The local number variance σ2(R) associated with a spherical sampling window of radius R enables a classification of many-particle systems in d-dimensional Euclidean space Rd according to the degree to which large-scale density fluctuations are suppressed, resulting in a demarcation between hyperuniform and nonhyperuniform phyla. To more completely characterize density fluctuations, we carry out an extensive study of higher-order moments or cumulants, including the skewness γ1(R), excess kurtosis γ2(R) and the corresponding probability distribution function P[N(R)] of a large family of models across the first three space dimensions, including both hyperuniform and nonhyperuniform systems with varying degrees of short- and long-range order. To carry out this comprehensive program, we derive new theoretical results that apply to general point processes and conduct high-precision numerical studies. Specifically, we derive explicit closed-form integral expressions for γ1(R) and γ2(R) that encode structural information up to three-body and four-body correlation functions, respectively. We also derive rigorous bounds on γ1(R), γ2(R) and P[N(R)] for general point processes and corresponding exact results for general packings of identical spheres. High-quality simulation data for γ1(R), γ2(R) and P[N(R)] are generated for each model. We also ascertain the proximity of P[N(R)] to the normal distribution via a novel Gaussian "distance" metric l2(R). Among all models, the convergence to a central limit theorem (CLT) is generally fastest for the disordered hyperuniform processes such that γ1(R) ∼ l2(R) ∼ R-(d+1)/2 and γ2(R) ∼ R-(d+1) for large R. The convergence to a CLT is slower for standard nonhyperuniform models and slowest for the "antihyperuniform" model studied here. We prove that one-dimensional hyperuniform systems of class I or any d-dimensional lattice cannot obey a CLT. Remarkably, we discovered that the gamma distribution provides a good approximation to P[N(R)] for

关键词： Higher order statistics

Cloaking the underlying long-range order of randomly perturbed lattices

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Klatt, Michael Andreas Kim, Jaeuk Torquato, Salvatore Department of Physics Princeton University PrincetonNJ08544 United States Department of Chemistry Princeton Institute for the Science and Technology of Materials Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

Random, uncorrelated displacements of particles on a lattice preserve the hyperuniformity of the original lattice, that is, normalized density fluctuations vanish in the limit of infinite wavelengths. In addition to a diffuse contribution, the scattering intensity from the the resulting point pattern typically inherits the Bragg peaks (long-range order) of the original lattice. Here we demonstrate how these Bragg peaks can be hidden in the effective diffraction pattern of independent and identically distributed perturbations. All Bragg peaks vanish if and only if the sum of all probability densities of the positions of the shifted lattice points is a constant at all positions. The underlying long-range order is then ‘cloaked’ in the sense that it cannot be reconstructed from the pair correlation function alone. On the one hand, density fluctuations increase monotonically with the strength of perturbations a, as measured by the hyperuniformity order metric Λ. On the other hand, the disappearance and reemergence of long-range order, depending on whether the system is cloaked or not as the perturbation strength increases, is manifestly captured by the τ order metric. Therefore, while the perturbation strength a may seem to be a natural choice for an order metric of perturbed lattices, the τ order metric is a superior choice. It is noteworthy that cloaked perturbed lattices allow one to easily simulate very large samples (with at least 106 particles) of disordered hyperuniform point patterns without Bragg peaks. Copyright © 2020, The Authors. All rights reserved.

关键词：

computational Methods for Single-Particle Cryo-EM

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Singer, Amit Sigworth, Fred J. Department of Mathematics and Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Departments of Cellular and Molecular Physiology Biomedical Engineering and Molecular Biophysics and Biochemistry Yale University New HavenCT06520 United States

Single-particle electron cryomicroscopy (cryo-EM) is an increasingly popular technique for elucidating the three-dimensional structure of proteins and other biologically significant complexes at near-atomic resolution. It is an imaging method that does not require crystallization and can capture molecules in their native states. In single-particle cryo-EM, the three-dimensional molecular structure needs to be determined from many noisy two-dimensional tomographic projections of individual molecules, whose orientations and positions are unknown. The high level of noise and the unknown pose parameters are two key elements that make reconstruction a challenging computational problem. Even more challenging is the inference of structural variability and flexible motions when the individual molecules being imaged are in different conformational states. This review discusses computational methods for structure determination by single-particle cryo-EM and their guiding principles from statistical inference, machine learning, and signal processing that also play a significant role in many other data science applications. Copyright © 2020, The Authors. All rights reserved.

关键词： Molecules

Generation and structural characterization of Debye random media

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Ma, Zheng Torquato, Salvatore Department of Physics Princeton University PrincetonNJ08544 United States Department of Chemistry Department of Physics Princeton Institute for the Science and Technology of Materials Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

In their seminal paper on scattering by an inhomogeneous solid, Debye and coworkers proposed a simple exponentially decaying function for the two-point correlation function of an idealized class of two-phase random media. Such Debye random media, which have been shown to be realizable, are singularly distinct from all other models of two-phase media in that they are entirely defined by their one- and two-point correlation functions. To our knowledge, there has been no determination of other microstructural descriptors of Debye random media. In this paper, we generate Debye random media in two dimensions using an accelerated Yeong-Torquato construction algorithm. We then ascertain microstructural descriptors of the constructed media, including their surface correlation functions, pore-size distributions, lineal-path function, and chord-length probability density function. Accurate semi-analytic and empirical formulas for these descriptors are devised. We compare our results for Debye random media to those of other popular models (overlapping disks and equilibrium hard disks), and find that the former model possesses a wider spectrum of hole sizes, including a substantial fraction of large holes. Our algorithm can be applied to generate other models defined by their two-point correlation functions, and their other microstructural descriptors can be determined and analyzed by the procedures laid out here. Copyright © 2020, The Authors. All rights reserved.

关键词： Random processes

Multi-target detection with an arbitrary spacing distribution

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lan, Ti-Yen Bendory, Tamir Boumal, Nicolas Singer, Amit Program in Applied and Computational Mathematics Mathematics Department Princeton University PrincetonNJ08544 United States

Motivated by the structure reconstruction problem in cryo-electron microscopy, we consider the multi-target detection model, where multiple copies of a target signal occur at unknown locations in a long measurement, further corrupted by additive Gaussian noise. At low noise levels, one can easily detect the signal occurrences and estimate the signal by averaging. However, in the presence of high noise, which is the focus of this paper, detection is impossible. Here, we propose two approaches—autocorrelation analysis and an approximate expectation maximization algorithm—to reconstruct the signal without the need to detect signal occurrences in the measurement. In particular, our methods apply to an arbitrary spacing distribution of signal occurrences. We demonstrate reconstructions with synthetic data and empirically show that the sample complexity of both methods scales as SNR−3 in the low SNR regime. Copyright © 2019, The Authors. All rights reserved.

关键词： Convolution

End-To-End Quantum Machine Learning Implemented with Controlled Quantum Dynamics

学校读者我要写书评

暂无评论

Physical Review applied 2020年第6期14卷 064020-064020页

作者： Re-Bing Wu Xi Cao Pinchen Xie Yu-xi Liu Department of Automation Tsinghua University Beijing 100084 China Beijing National Research Center for Information Science and Technology Beijing 100084 China Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA Institute of Microelectronics Tsinghua University Beijing 100084 China

To achieve quantum machine learning on imperfect noisy intermediate-scale quantum (NISQ) processors, the entire physical implementation should include as few as possible hand-designed modules with only a few ad hoc parameters to be determined. This work presents such a hardware-friendly end-to-end quantum-machine-learning scheme that can be implemented with imperfect NISQ processors. The proposal transforms the machine-learning task to the optimization of controlled quantum dynamics, in which the learning model is parameterized by experimentally tunable control variables. Our design also enables automated feature selection by encoding the raw input to quantum states through agent control variables. Comparing with the gate-based parameterized quantum circuits, the proposed end-to-end quantum-learning model is easy to implement as there are only a few ad hoc parameters to be determined. Numerical simulations on the benchmarking MNIST (Mixed National Institute of Standards and Technology) dataset of handwritten digits demonstrate that the model can achieve high performance using only 3–5 qubits without downsizing the dataset, which shows great potential for accomplishing large-scale real-world learning tasks on NISQ processors.

关键词： Machine learning Noise Quantum control Quantum information architectures & platforms Artificial neural networks

Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Papamarkou, Theodore Skoularidou, Maria Palla, Konstantina Aitchison, Laurence Arbel, Julyan Dunson, David Filippone, Maurizio Fortuin, Vincent Hennig, Philipp Hernández-Lobato, José Miguel Hubin, Aliaksandr Immer, Alexander Karaletsos, Theofanis Khan, Mohammad Emtiyaz Kristiadi, Agustinus Li, Yingzhen Mandt, Stephan Nemeth, Christopher Osborne, Michael A. Rudner, Tim G.J. Rügamer, David Teh, Yee Whye Welling, Max Wilson, Andrew Gordon Zhang, Ruqi Department of Mathematics The University of Manchester Manchester United Kingdom Eric and Wendy Schmidt Center Broad Institute of MIT and Harvard Cambridge United States Spotify London United Kingdom Computational Neuroscience Unit University of Bristol Bristol United Kingdom Centre Inria de l'Université Grenoble Alpes Grenoble France Department of Statistical Science Duke University United States Statistics Program KAUST Saudi Arabia Helmholtz AI Munich Germany Department of Computer Science Technical University of Munich Munich Germany Munich Center for Machine Learning Munich Germany Tübingen AI Center University of Tübingen Tübingen Germany Department of Engineering University of Cambridge Cambridge United Kingdom Department of Mathematics University of Oslo Oslo Norway Bioinformatics and Applied Statistics Norwegian University of Life Sciences Ås Norway Department of Computer Science ETH Zurich Switzerland Chan Zuckerberg Initiative CA United States Center for Advanced Intelligence Project RIKEN Tokyo Japan Vector Institute Toronto Canada Department of Computing Imperial College London London United Kingdom Department of Computer Science UC Irvine Irvine United States Department of Mathematics and Statistics Lancaster University Lancaster United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Center for Data Science New York University New York United States Department of Statistics LMU Munich Munich Germany DeepMind London United Kingdom Department of Statistics University of Oxford Oxford United Kingdom Informatics Institute University of Amsterdam Amsterdam Netherlands Courant Institute of Mathematical Sciences Center for Data Science Computer Science Department New York University New York United States Department of Computer Science Purdue University West Lafayette United States

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential. © 2024, CC BY-NC-ND.

关键词： Large datasets

An optimal algorithm for strict circular seriation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Armstrong, Santiago Guzmán, Cristóbal Long, Carlos A. Sing Institute for Mathematical and Computational Engineering Pontificia Universidad Católica de Chile Santiago Chile Anid - Millennium Science Initiative Program Millennium Nucleus Center for the Discovery of Structures in Complex Data Santiago Chile Department of Applied Mathematics University of Twente Netherlands Institute for Biological and Medical Engineering Pontificia Universidad Católica de Chile Santiago Chile

We study the problem of circular seriation, where we are given a matrix of pairwise dissimilarities between n objects, and the goal is to find a circular order of the objects in a manner that is consistent with their dissimilarity. This problem is a generalization of the classical linear seriation problem where the goal is to find a linear order, and for which optimal O(n2) algorithms are known. Our contributions can be summarized as follows. First, we introduce circular Robinson matrices as the natural class of dissimilarity matrices for the circular seriation problem. Second, for the case of strict circular Robinson dissimilarity matrices we provide an optimal O(n2) algorithm for the circular seriation problem. Finally, we propose a statistical model to analyze the well-posedness of the circular seriation problem for large n. In particular, we establish O(log(n)/n) rates on the distance between any circular ordering found by solving the circular seriation problem to the underlying order of the model, in the Kendall-tau *** Codes 68R01, 05C85, 05C50, 05C25, 65C20 Copyright © 2021, The Authors. All rights reserved.

关键词： Trees (mathematics)

Hyperuniformity order metric of Barlow packings

学校读者我要写书评

暂无评论

Physical Review E 2019年第2期99卷 022111-022111页

作者： T. M. Middlemas F. H. Stillinger S. Torquato Department of Chemistry Department of Physics Princeton Institute for the Science and Technology of Materials and Program in Applied and Computational Mathematics Princeton University New Jersey 08544 USA

The concept of hyperuniformity has been a useful tool in the study of density fluctuations at large length scales in systems ranging across the natural and mathematical sciences. One can rank a large class of hyperuniform systems by their ability to suppress long-range density fluctuations through the use of a hyperuniformity order metric Λ¯. We apply this order metric to the Barlow packings, which are the infinitely degenerate densest packings of identical rigid spheres that are distinguished by their stacking geometries and include the commonly known fcc lattice and hcp crystal. The “stealthy stacking” theorem implies that these packings are all stealthy hyperuniform, a strong type of hyperuniformity, which involves the suppression of scattering up to a wave vector K. We describe the geometry of three classes of Barlow packings, two disordered classes and small-period packings. In addition, we compute a lower bound on K for all Barlow packings. We compute Λ¯ for the aforementioned three classes of Barlow packings and find that, to a very good approximation, it is linear in the fraction of fcc-like clusters, taking values between those of least-ordered hcp and most-ordered fcc. This implies that the value of Λ¯ of all Barlow packings is primarily controlled by the local cluster geometry. These results highlight the special nature of anisotropic stacking disorder, which provides impetus for future research on the development of anisotropic order metrics and hyperuniformity properties.

关键词： Classical statistical mechanics