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

arXiv 2023年

作者： Zeng, Jinzhe Zhang, Duo Lu, Denghui Mo, Pinghui Li, Zeyu Chen, Yixiao Rynik, Marián Huang, Li'ang Li, Ziyao Shi, Shaochen Wang, Yingze Ye, Haotian Tuo, Ping Yang, Jiabin Ding, Ye Li, Yifan Tisi, Davide Zeng, Qiyu Bao, Han Xia, Yu Huang, Jiameng Muraoka, Koki Wang, Yibo Chang, Junhan Yuan, Fengbo Bore, Sigbjørn Løland Cai, Chun Lin, Yinnian Wang, Bo Xu, Jiayan Zhu, Jia-Xin Luo, Chenxing Zhang, Yuzhi Goodall, Rhys E.A. Liang, Wenshuo Singh, Anurag Kumar Yao, Sikai Zhang, Jingchao Wentzcovitch, Renata Han, Jiequn Liu, Jie Jia, Weile York, Darrin M. Weinan, E. Car, Roberto Zhang, Linfeng Wang, Han Laboratory for Biomolecular Simulation Research Institute for Quantitative Biomedicine Department of Chemistry and Chemical Biology Rutgers University PiscatawayNJ08854 United States AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China HEDPS CAPT College of Engineering Peking University Beijing100871 China College of Electrical and Information Engineering Hunan University Changsha China Yuanpei College Peking University Beijing100871 China Program in Applied and Computational Mathematics Princeton University PrincetonNJ08540 United States Department of Experimental Physics Comenius University Mlynská Dolina F2 Bratislava842 48 Slovakia Center for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University Beijing100084 China Center for Data Science Peking University Beijing100871 China ByteDance Research Zhonghang Plaza No. 43 North 3rd Ring West Road Haidian District Beijing China College of Chemistry and Molecular Engineering Peking University Beijing100871 China Baidu Inc. Beijing China Key Laboratory of Structural Biology of Zhejiang Province School of Life Sciences Westlake University Zhejiang Hangzhou China Westlake AI Therapeutics Lab Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Hangzhou China Department of Chemistry Princeton University PrincetonNJ08544 United States SISSA Scuola Internazionale Superiore di Studi Avanzati Trieste34136 Italy Laboratory of Computational Science and Modeling Institute of Materials École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland Department of Physics National University of Defense Technology Hunan Changsha410073 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Electronics Engineerin

DeePMD-kit is a powerful open-source software package that facilitates molecular dynamics simulations using machine learning potentials (MLP) known as Deep Potential (DP) models. This package, which was released in 2017, has been widely used in the fields of physics, chemistry, biology, and material science for studying atomistic systems. The current version of DeePMD-kit offers numerous advanced features such as DeepPot-SE, attention-based and hybrid descriptors, the ability to fit tensile properties, type embedding, model deviation, Deep Potential - Range Correction (DPRc), Deep Potential Long Range (DPLR), GPU support for customized operators, model compression, non-von Neumann molecular dynamics (NVNMD), and improved usability, including documentation, compiled binary packages, graphical user interfaces (GUI), and application programming interfaces (API). This article presents an overview of the current major version of the DeePMD-kit package, highlighting its features and technical details. Additionally, the article benchmarks the accuracy and efficiency of different models and discusses ongoing developments. © 2023, CC BY-NC-ND.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Parameter inference with non-linear galaxy clustering: accounting for theoretical uncertainties

arXiv

引用

arXiv 2021年

作者： Knabenhans, Mischa Brinckmann, Thejs Stadel, Joachim Schneider, Aurel Teyssier, Romain Institute for Computational Science University of Zurich Winterthurerstrasse 190 Zurich8057 Switzerland Dipartimento di Fisica Scienze della Terra Universitá degli Studi di Ferrara via Giuseppe Saragat 1 Ferrara44122 Italy Sezione di Ferrara Via Giuseppe Saragat 1 Ferrara44122 Italy C.N. Yang Institute for Theoretical Physics Department of Physics & Astronomy Stony Brook University Stony BrookNY11794 United States Department of Astrophysical Sciences Princeton University 4 Ivy Lane PrincetonNJ08544 United States The Program in Applied and Computational Mathematics Princeton University Fine Hall Washington Road PrincetonNJ08544-1000 United States

We implement EuclidEmulator (version 1), an emulator for the non-linear correction of the matter power spectrum, into the Markov chain Monte Carlo (MCMC) forecasting code MontePython. We compare the performance of HALOFIT, HMCode, and EuclidEmulator1, both at the level of power spectrum prediction and at the level of posterior probability distributions of the cosmological parameters, for different cosmological models and different galaxy power spectrum wave number cutoffs. We confirm that the choice of the power spectrum predictor has a non-negligible effect on the computed sensitivities when doing cosmological parameter forecasting, even for a conservative wave number cut-off of 0.2 ℎMpc−1. We find that EuclidEmulator1 is on average up to 17% more sensitive to the cosmological parameters than the other two codes, with the most significant improvements being for the Hubble parameter of up to 42% and the equation of state of dark energy of up to 26%, depending on the case. In addition, we point out that the choice of the power spectrum predictor contributes to the risk of computing a significantly biased mean cosmology when doing parameter estimations. For the four tested scenarios we find biases, averaged over the cosmological parameters, of between 0.5 and 2σ (from below 1σ up to 6σ for individual parameters). This paper provides a proof of concept that this risk can be mitigated by taking a well-tailored theoretical uncertainty into account as this allows to reduce the bias by a factor of 2 to 5, depending on the case under consideration, while keeping posterior credibility contours small: the standard deviations are amplified by a factor of ≤ 1.4 in all cases. © 2021, CC BY-NC-SA.

关键词： Power spectrum

来源：评论

学校读者我要写书评

暂无评论

Position: Bayesian deep learning is needed in the age of large-scale AI 24

Position: Bayesian deep learning is needed in the age of lar...

引用

Proceedings of the 41st International Conference on Machine Learning

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ON THE MOTION OF CURVED DISLOCATIONS IN THREE DIMENSIONS: SIMPLIFIED LINEARIZED ELASTICITY

arXiv

引用

arXiv 2020年

作者： Fonseca, Irene Ginster, Janusz Wojtowytsch, Stephan Department of Mathematical Sciences Carnegie-Mellon University 5000 Forbes Avenue PittsburghPA15213 United States Institut für Mathematik Humboldt-Universität zu Berlin Rudower Chaussee 25 Berlin12489 Germany Program in Applied and Computational Mathematics Princeton University 205 Fine Hall PrincetonNJ08544 United States

It is shown that in core-radius cutoff regularized simplified elasticity (where the elastic energy depends quadratically on the full displacement gradient rather than its symmetrized version), the force on a dislocation curve by the negative gradient of the elastic energy asymptotically approaches the mean curvature of the curve as the cutoff radius converges to zero. Rigorous error bounds in Hölder spaces are provided. As an application, convergence of dislocations moving by the gradient flow of the elastic energy to dislocations moving by the gradient flow of the arclength functional, when the motion law is given by an H1-type dissipation, and convergence to curve shortening flow in co-dimension 2 for the usual L2-dissipation is established. In the second scenario, existence and regularity are assumed while the H1-gradient flow is treated in full generality (for short time). The methods developed here are a blueprint for the more physical setting of linearized isotropic *** Codes 35K93, 35Q74, 74N05 Copyright © 2020, The Authors. All rights reserved.

关键词： Elasticity

来源：评论

学校读者我要写书评

暂无评论

The replicator dynamics for multilevel selection in evolutionary games

arXiv

引用

arXiv 2018年

作者： Cooney, Daniel B. Program in Applied and Computational Mathematics Princeton University

We consider a stochastic model for evolution of group-structured populations in which interactions between group members correspond to the Prisoner’s Dilemma or the Hawk-Dove game. Selection operates at two organization levels: individuals compete with peer group members based on individual payoff, while groups also compete with other groups based on average payoff of group members. In the Prisoner’s Dilemma, this creates a tension between the two levels of selection, as defectors are favored at the individual level, whereas groups with at least some cooperators outperform groups of defectors at the between-group level. In the limit of infinite group size and infinite number of groups, we derive a non-local PDE that describes the probability distribution of group compositions in the population. For special families of payoff matrices, we characterize the long-time behavior of solutions of our equation, finding a threshold intensity of between-group selection required to sustain density steady-states and the survival of cooperation. When all-cooperator groups are most fit, the average and most abundant group compositions at steady-state range from featuring all-defector groups when individual-level selection dominates to featuring all-cooperator groups when group-level selection dominates. When the most fit groups have a mix of cooperators and defectors, then the average and most abundant group compositions always feature a smaller fraction of cooperators than required for the optimal mix, even in the limit where group-level selection is infinitely stronger than individual-level selection. In such cases, the conflict between the two levels of selection cannot be decoupled, and cooperation cannot be sustained at all in the case where between-group competition favors an even mix of cooperators and *** Codes 92D25, 91A22, 35F20 Copyright © 2018, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Deep learning of accurate force field of Ferroelectric HfO$_2$

arXiv

引用

arXiv 2020年

作者： Wu, Jing Zhang, Yuzhi Zhang, Linfeng Liu, Shi Fudan University Shanghai200433 China School of Science Westlake University HangzhouZhejiang310024 China Institute of Natural Sciences Westlake Institute for Advanced Study HangzhouZhejiang310024 China Yuanpei College Peking University Beijing100871 China Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

The discovery of ferroelectricity in HfO2-based thin films opens up new opportunities for using this silicon-compatible ferroelectric to realize low-power logic circuits and high-density non-volatile memories. The functional performances of ferroelectrics are intimately related to their dynamic responses to external stimuli such as electric fields at finite temperatures. Molecular dynamics is an ideal technique for investigating dynamical processes on large length and time scales, though its applications to new materials is often hindered by the limited availability and accuracy of classical force fields. Here we present a deep neural network-based interatomic force field of HfO2 learned from ab initio data using a concurrent learning procedure. The model potential is able to predict structural properties such as elastic constants, equation of states, phonon dispersion relationships, and phase transition barriers of various hafnia polymorphs with accuracy comparable with density functional theory calculations. The validity of this model potential is further confirmed by the reproduction of experimental sequences of temperature-driven ferroelectric-paraelectric phase transitions of HfO2 with isobaric-isothermal ensemble molecular dynamics simulations. We suggest a general approach to extend the model potential of HfO2 to related material systems including dopants and defects. Copyright © 2020, The Authors. All rights reserved.

关键词： Ferroelectricity

来源：评论

学校读者我要写书评

暂无评论

Image recovery from rotational and translational invariants

arXiv

引用

arXiv 2019年

作者： Marshall, Nicholas F. Lan, Ti-Yen Bendory, Tamir Singer, Amit Department of Mathematics Princeton University PrincetonNJ United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ United States School of Electrical Engineering Tel Aviv University Tel Aviv Israel

We introduce a framework for recovering an image from its rotationally and translationally invariant features based on autocorrelation analysis. This work is an instance of the multi-target detection statistical model, which is mainly used to study the mathematical and computational properties of single-particle reconstruction using cryo-electron microscopy (cryo-EM) at low signal-to-noise ratios. We demonstrate with synthetic numerical experiments that an image can be reconstructed from rotationally and translationally invariant features and show that the reconstruction is robust to noise. These results constitute an important step towards the goal of structure determination of small biomolecules using cryo-EM. Copyright © 2019, The Authors. All rights reserved.

关键词： Electron microscopes

来源：评论

学校读者我要写书评

暂无评论

mathematics for cryo-electron microscopy

arXiv

引用

arXiv 2018年

作者： Singer, Amit Department of Mathematics Program in Applied and Computational Mathematics Princeton University

Single-particle cryo-electron microscopy (cryo-EM) has recently joined X-ray crystallography and NMR spectroscopy as a high-resolution structural method for biological macromolecules. Cryo-EM was selected by Nature Methods as Method of the Year 2015, large scale investments in cryo-EM facilities are being made all over the world, and the Nobel Prize in Chemistry 2017 was awarded to Jacques Dubochet, Joachim Frank and Richard Henderson "for developing cryo-electron microscopy for the high-resolution structure determination of biomolecules in solution". This paper focuses on the mathematical principles underlying existing algorithms for structure determination using single particle cryo-EM.92C55, 68U10, 44A12, 62H12, 33C55, 90C22 Copyright © 2018, The Authors. All rights reserved.

关键词： Electron microscopes

来源：评论

学校读者我要写书评

暂无评论

Robust group synchronization via cycle-edge message passing

arXiv

引用

arXiv 2019年

作者： Lerman, Gilad Shi, Yunpeng School of Mathematics University of Minnesota 127 Vincent Hall 206 Church Street SE MinneapolisMN55455 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of group ratios and consequently solve the synchronization problem in our setting. We first explain why the group cycle consistency information is essential for effectively solving group synchronization problems. We then establish exact recovery and linear convergence guarantees for the proposed message passing procedure under a deterministic setting with adversarial corruption. These guarantees hold as long as the ratio of corrupted cycles per edge is bounded by a reasonable constant. We also establish the stability of the proposed procedure to sub-Gaussian noise. We further establish exact recovery with high probability under a common uniform corruption *** Codes 90-08, 62G35, 68Q25, 68W40, 68Q87, 93E10 Copyright © 2019, The Authors. All rights reserved.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Navigating the challenges in creating complex data systems: a development philosophy

arXiv

引用

arXiv 2022年

作者： Dittmer, Sören Roberts, Michael Gilbey, Julian Biguri, Ander Preller, Jacobus Rudd, James H.F. Aston, John A.D. Schönlieb, Carola-Bibiane Selby, Ian Breger, Anna Thorpe, Matthew Weir-McCall, Jonathan R. Gkrania-Klotsas, Effrossyni Korhonen, Anna Jefferson, Emily Langs, Georg Yang, Guang Prosch, Helmut Stanczuk, Jan Tang, Jing Babar, Judith Sánchez, Lorena Escudero Teare, Philip Patel, Mishal Wassin, Marcel Holzer, Markus Walton, Nicholas Lió, Pietro Shadbahr, Tolou Sala, Evis Department of Applied Mathematics and Theoretical Physics University of Cambridge Cambridge United Kingdom Addenbrooke’s Hospital Cambridge University Hospitals NHS Trust Cambridge United Kingdom Department of Medicine University of Cambridge Cambridge United Kingdom Department of Pure Mathematics and Mathematical Statistics University of Cambridge Cambridge United Kingdom ZeTeM University of Bremen Bremen Germany Department of Radiology University of Cambridge Cambridge United Kingdom Faculty of Mathematics University of Vienna Austria Department of Mathematics University of Manchester Manchester United Kingdom Royal Papworth Hospital Cambridge Royal Papworth Hospital NHS Foundation Trust Cambridge United Kingdom Language Technology Laboratory University of Cambridge Cambridge United Kingdom Population Health and Genomics School of Medicine University of Dundee Dundee United Kingdom Department of Biomedical Imaging and Image-guided Therapy Computational Imaging Research Lab Medical University of Vienna Vienna Austria National Heart and Lung Institute Imperial College London London United Kingdom Research Program in Systems Oncology Faculty of Medicine University of Helsinki Helsinki Finland Data Science & Artificial Intelligence AstraZeneca Cambridge United Kingdom Clinical Pharmacology & Safety Sciences AstraZeneca Cambridge United Kingdom Contextflow GmbH Vienna Austria Institute of Astronomy University of Cambridge Cambridge United Kingdom Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom

In this perspective, we argue that despite the democratization of powerful tools for data science and machine learning over the last decade, developing the code for a trustworthy and effective data science system (DSS) is getting harder. Perverse incentives and a lack of widespread software engineering (SE) skills are among many root causes we identify that naturally give rise to the current systemic crisis in reproducibility of DSSs. We analyze why SE and building large complex systems is, in general, hard. Based on these insights, we identify how SE addresses those difficulties and how we can apply and generalize SE methods to construct DSSs that are fit for purpose. We advocate two key development philosophies, namely that one should incrementally grow – not biphasically plan and build – DSSs, and one should always employ two types of feedback loops during development: one which tests the code’s correctness and another that evaluates the code’s efficacy. Copyright © 2022, The Authors. All rights reserved.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：