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

Minds, Brains, and AI

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Seitz, Jay Neurocognitive Therapeutics LLC United States

In the last year or so (and going back many decades) there has been extensive claims by major computational scientists, engineers, and others that AGI (artificial general intelligence) is 5 or 10 years away, but without a scintilla of scientific evidence, for a broad body of these claims: Computers will become conscious, have a "theory of mind," think and reason, will become more intelligent than humans, and so on. But the claims are science fiction, not science. This article reviews evidence for the following three (3) propositions using extensive body of scientific research and related sources from the cognitive and neurosciences;evolutionary evidence;linguistics;data science;comparative psychology;self-driving cars, and robotics;and the learning sciences. © 2024, CC BY-NC-SA.

关键词： computation theory

A Precision-Optimized Fixed-Point Near-Memory Digital Processing Unit for Analog In-Memory Computing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ferro, Elena Vasilopoulos, Athanasios Lammie, Corey Le Gallo, Manuel Benini, Luca Boybat, Irem Sebastian, Abu IBM Research Europe Rüschlikon8803 Switzerland IIS-ETH Zürich Zürich8092 Switzerland

Analog In-Memory Computing (AIMC) is an emerging technology for fast and energy-efficient Deep Learning (DL) inference. However, a certain amount of digital post-processing is required to deal with circuit mismatches and non-idealities associated with the memory devices. Efficient near-memory digital logic is critical to retain the high area/energy efficiency and low latency of AIMC. Existing systems adopt Floating Point 16 (FP16) arithmetic with limited parallelization capability and high latency. To overcome these limitations, we propose a Near-Memory digital Processing Unit (NMPU) based on fixed-point arithmetic. It achieves competitive accuracy and higher computing throughput than previous approaches while minimizing the area overhead. Moreover, the NMPU supports standard DL activation steps, such as ReLU and Batch Normalization. We perform a physical implementation of the NMPU design in a 14 nm CMOS technology and provide detailed performance, power, and area assessments. We validate the efficacy of the NMPU by using data from an AIMC chip and demonstrate that a simulated AIMC system with the proposed NMPU outperforms existing FP16-based implementations, providing 139 × speed-up, 7.8 × smaller area, and a competitive power consumption. Additionally, our approach achieves an inference accuracy of 86.65 %/65.06 %, with an accuracy drop of just 0.12 %/0.4 % compared to the FP16 baseline when benchmarked with ResNet9/ResNet32 networks trained on the CIFAR10/CIFAR100 datasets, respectively. © 2024, CC BY.

关键词： computation theory

Intention and Face in Dialog

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Soubki, Adil Rambow, Owen Department of Computer Science Department of Linguistics Institute for Advanced Computational Science Stony Brook University United States

The notion of face described by Brown and Levinson (1987) has been studied in great detail, but a critical aspect of the framework, that which focuses on how intentions mediate the planning of turns which impose upon face, has received far less attention. We present an analysis of three computational systems trained for classifying both intention and politeness, focusing on how the former influences the latter. In politeness theory, agents attend to the desire to have their wants appreciated (positive face), and a complementary desire to act unimpeded and maintain freedom (negative face). Similar to speech acts, utterances can perform so-called face acts which can either raise or threaten the positive or negative face of the speaker or hearer. We begin by using an existing corpus to train a model which classifies face acts, achieving a new SoTA in the process. We then observe that every face act has an underlying intention that motivates it and perform additional experiments integrating dialog act annotations to provide these intentions by proxy. Our analysis finds that dialog acts improve performance on face act detection for minority classes and points to a close relationship between aspects of face and intent. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Protocols for Quantum Weak Coin Flipping

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Arora, Atul Singh Roland, Jérémie Vlachou, Chrysoula Weis, Stephan Institute for Quantum Information and Matter Department of Computing and Mathematical Sciences California Institute of Technology PasadenaCA United States Université libre de Bruxelles Brussels Belgium Instituto de Telecomunicações Lisbon Departamento de Matemática Instituto Superior Técnico Universidade de Lisboa Lisbon Portugal Wald-Gymnasium Berlin Germany

Weak coin flipping is an important cryptographic primitive—it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constructive argument. Consequently, explicit protocols have remained elusive. In this work, we give exact constructions of related unitary operators. These, together with a new formalism, yield a family of protocols approaching perfect security thereby also simplifying Mochon’s proof of existence. We illustrate the construction of explicit weak coin flipping protocols by considering concrete examples (from the aforementioned family of protocols) that are more secure than all previously known protocols. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Enhancing Adversarial Transferability via Information Bottleneck Constraints

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Qi, Biqing Gao, Junqi Liu, Jianxing Wu, Ligang Zhou, Bowen Department of Control Science and Engineering Harbin Institute of Technology Harbin150001 China Tshinghua University Bejing China Frontis.AI Beijing China School of Mathematics Harbin Institute of Technology Harbin150001 China

From the perspective of information bottleneck (IB) theory, we propose a novel framework for performing black-box transferable adversarial attacks named IBTA, which leverages advancements in invariant features. Intuitively, diminishing the reliance of adversarial perturbations on the original data, under equivalent attack performance constraints, encourages a greater reliance on invariant features that contributes most to classification, thereby enhancing the transferability of adversarial attacks. Building on this motivation, we redefine the optimization of transferable attacks using a novel theoretical framework that centers around IB. Specifically, to overcome the challenge of unoptimizable mutual information, we propose a simple and efficient mutual information lower bound (MILB) for approximating computation. Moreover, to quantitatively evaluate mutual information, we utilize the Mutual Information Neural Estimator (MINE) to perform a thorough analysis. Our experiments on the ImageNet dataset well demonstrate the efficiency and scalability of IBTA and derived MILB. Our code is available at ***/IBTA. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Vacuum energy density from the form factor bootstrap

学校读者我要写书评

暂无评论

arXiv 2024年

作者： LeClair, André Cornell University Physics Department IthacaNY14850 United States

The form-factor bootstrap is incomplete until one normalizes the zero-particle form factor. For the stress energy tensor we describe how to obtain the vacuum energy density ρvac, defined as 〈0|Tµν|0〉 = ρvac gµν, from the form-factor bootstrap. Even for integrable QFT's in D=2 spacetime dimensions, this prescription is new, although it reproduces previously known results obtained in a different and more difficult thermodynamic Bethe ansatz computation. We propose a version of this prescription in D=4 dimensions. For these even dimensions, the vacuum energy density has the universal form ρvac ∝ mD/g where g is a dimensionless interaction coupling constant which can be determined from the high energy behavior of the S-matrix. In the limit g → 0, ρvac diverges due to well understood UV divergences in free quantum field theories. If we assume the the observed Cosmological Constant originates from the vacuum energy density ρvac computed as proposed here, then this suggests there must exist a particle which does not obtain its mass from spontaneous symmetry breaking in the electro-weak sector, which we designate as the "zeron". A strong candidate for the zeron is a massive Majorana neutrino. © 2024, CC BY.

关键词： computation theory

Integrated Unitarity for Scattering Amplitudes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bargiela, Piotr Physik-Institut Universität Zürich Winterthurerstrasse 190 Zürich8057 Switzerland

We present a new method for computing multi-loop scattering amplitudes in Quantum Field theory. It extends the Generalized Unitarity method by constraining not only the integrand of the amplitude but also its full integrated form. Our approach exploits the relation between cuts and discontinuities of the amplitude. Explicitly, by the virtue of analyticity and unitarity of the S-matrix, the amplitude can be expressed in terms of lower-loop on-shell amplitudes dispersively integrated along cuts. As both cuts and discontinuities can be computed systematically in dimensional regularization, we validated our method by reproducing the four-gluon amplitude in two-loop massless Quantum Chromodynamics. Moreover, since our approach improves the performance of the calculation, we provide a new result for the four-loop four-point massless planar ladder Feynman integral. It is expressed in terms of Harmonic Polylogarithms with letters 0 and 1. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Parafermions with symmetry-protected non-Abelian statistics

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hong, Jian-Song Zhang, Su-Qi Liu, Xin Liu, Xiong-Jun International Center for Quantum Materials School of Physics Peking University Beijing100871 China Hefei National Laboratory Hefei230088 China School of Physics and Institute for Quantum Science and Engineering Huazhong University of Science and Technology Wuhan430074 China International Quantum Academy Shenzhen518048 China

Non-Abelian anyons have garnered extensive attention for obeying exotic non-Abelian statistics and potential applications to fault-tolerant quantum computation. Although the prior research has predominantly focused on non-Abelian statistics without the necessity of symmetry protection, recent progresses have shown that symmetries can play essential roles and bring about a notion of the symmetry-protected non-Abelian (SPNA) statistics. In this work, we extend the concept of SPNA statistics to strongly-correlated systems which host parafermion zero modes (PZMs). This study involves a few fundamental results proved here. First, we unveil a generic unitary symmetry mechanism that protects PZMs from local couplings. Then, with this symmetry protection, the PZMs can be categorized into two nontrivial sectors, each maintaining its own parity conservation, even though the whole system cannot be dismantled into separate subsystems due to nonlinear interactions. Finally, by leveraging the parity conservation of each sector and the general properties of the effective braiding Hamiltonian, we prove rigorously that the PZMs intrinsically obey SPNA statistics. To further confirm the results, we derive the braiding matrix at a tri-junction. In addition, we propose a physical model that accommodates a pair of PZMs protected by mirror symmetry and satisfying the generic theory. This work shows a broad spectrum of strongly-correlated systems capable of hosting fractional SPNA quasiparticles and enriches our comprehension of fundamental quantum statistics linked to the symmetries that govern the exchange dynamics. © 2024, CC0.

关键词： computation theory

High-throughput calculations of antiferromagnets hosting anomalous transport phenomena

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Nomoto, Takuya Minami, Susumu Yanagi, Yuki Suzuki, Michi-To Koretsune, Takashi Arita, Ryotaro Research Center for Advanced Science and Technology University of Tokyo Komaba 153-8904 Japan Department of Mechanical Engineering and Science Kyoto University Kyoto615-8540 Japan Liberal Arts and Sciences Toyama Prefectural University Toyama939-0398 Japan Center for Computational Materials Science Institute for Materials Research Tohoku University Sendai950-8577 Japan Center for Spintronics Research Network Graduate School of Engineering Science Osaka University Toyonaka Osaka560-8531 Japan Department of Physics Tohoku University Sendai980-8578 Japan Center for Emergent Matter Science RIKEN Wako351-0198 Japan

We develop a high-throughput computational scheme based on cluster multipole theory to identify new functional antiferromagnets. This approach is applied to 228 magnetic compounds listed in the AtomWork-Adv database, known for their elevated Néel temperatures. We conduct systematic investigations of both stable and metastable magnetic configurations of these materials. Our findings reveal that 34 of these compounds exhibit antiferromagnetic structures with zero propagation vectors and magnetic symmetries identical to conventional ferromagnets, rendering them potentially invaluable for spintronics applications. By cross-referencing our predictions with the existing MAGNDATA database and published literature, we verify the reliability of our findings for 26 out of 28 compounds with partially or fully elucidated magnetic structures in the experiments. These results not only affirm the reliability of our scheme but also point to its potential for broader applicability in the ongoing quest for the discovery of new functional magnets. © 2024, CC BY.

关键词： computation theory