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

Speaking the Language of Your Listener: Audience-Aware Adaptation via Plug-and-Play theory of Mind

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Takmaz, Ece Brandizzi, Nicolo Giulianelli, Mario Pezzelle, Sandro Fernández, Raquel University of Amsterdam Netherlands Sapienza University of Rome Italy

Dialogue participants may have varying levels of knowledge about the topic under discussion. In such cases, it is essential for speakers to adapt their utterances by taking their audience into account. Yet, it is an open question how such adaptation can be modelled in computational agents. In this paper, we model a visually grounded referential game between a knowledgeable speaker and a listener with more limited visual and linguistic experience. Inspired by psycholinguistic theories, we endow our speaker with the ability to adapt its referring expressions via a simulation module that monitors the effectiveness of planned utterances from the listener’s perspective. We propose an adaptation mechanism building on plug-and-play approaches to controlled language generation, where utterance generation is steered on the fly by the simulator without finetuning the speaker’s underlying language model. Our results and analyses show that our approach is effective: the speaker’s utterances become closer to the listener’s domain of expertise, which leads to higher communicative success. Copyright © 2023, The Authors. All rights reserved.

关键词： computation theory

The strength of a simplex is the key to a continuous isometry classification of Euclidean clouds of unlabelled points

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Kurlin, Vitaliy Computer Science department University of Liverpool United Kingdom

This paper solves the continuous classification problem for finite clouds of unlabelled points under Euclidean isometry. The Lipschitz continuity of required invariants in a suitable metric under perturbations of points is motivated by the inevitable noise in measurements of real objects. The best solved case of this isometry classification is known as the SSS theorem in school geometry saying that any triangle up to congruence (isometry in the plane) has a continuous complete invariant of three side lengths. However, there is no easy extension of the SSS theorem even to four points in the plane partially due to a 4-parameter family of 4-point clouds that have the same six pairwise distances. The computational time of most past metrics that are invariant under isometry was exponential in the size of the input. The final obstacle was the discontinuity of previous invariants at singular configurations, for example, when a triangle degenerates to a straight line. All the challenges above are now resolved by the Simplexwise Centred Distributions that combine inter-point distances of a given cloud with the new strength of a simplex that finally guarantees the Lipschitz continuity. The computational times of new invariants and metrics are polynomial in the number of points for a fixed Euclidean *** Codes 51N20, 51K05, 51F20, 51F30, 68U05 © 2023, CC BY-NC-ND.

关键词： computation theory

Qubits on programmable geometries with a trapped-ion quantum processor

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Qiming Shi, Yue Zhang, Jiehang Department of Physics University of California BerkeleyCA United States Department of Physics Princeton University PrincetonNJ United States School of Physical Sciences University of Science and Technology of China Hefei230026 China Shanghai Research Center for Quantum Science CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Shanghai201315 China Hefei National Laboratory University of Science and Technology of China Hefei230088 China

Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body systems, the entanglement structure can change if the constituents are connected differently, leading to altered bounds for correlation growth and difficulties for classical computers to simulate large systems. While a universal quantum computer can perform digital simulations, an analog-digital hybrid quantum processor offers advantages such as parallelism. Here, we engineer a class of high-dimensional Ising interactions using a linear one-dimensional (1D) ion chain with up to 8 qubits through stroboscopic sequences of commuting Hamiltonians. In addition, we extend this method to non-commuting circuits and demonstrate the quantum XY and Heisenberg models using Floquet periodic drives with tunable symmetries. The realization of higher dimensional spin models offers new opportunities ranging from studying topological phases of matter or quantum spin glasses to future fault-tolerant quantum computation. © 2023, CC BY.

关键词： computation theory

Equilibria of Fully Decentralized Learning in Networked Systems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Yan Cui, Wenqi Zhang, Baosen Cortés, Jorge Department of Electrical and Computer Engineering University of Washington SeattleWA98195 United States Department of Mechanical and Aerospace Engineering University of California San DiegoCA92093 United States

Existing settings of decentralized learning either require players to have full information or the system to have certain special structure that may be hard to check and hinder their applicability to practical systems. To overcome this, we identify a structure that is simple to check for linear dynamical system, where each player learns in a fully decentralized fashion to minimize its cost. We first establish the existence of pure strategy Nash equilibria in the resulting noncooperative game. We then conjecture that the Nash equilibrium is unique provided that the system satisfies an additional requirement on its structure. We also introduce a decentralized mechanism based on projected gradient descent to have agents learn the Nash equilibrium. Simulations on a 5-player game validate our results. © 2023, CC BY.

关键词： computation theory

COMPUTING GRÖBNER BASES AND FREE RESOLUTIONS OF OI-MODULES

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Morrow, Michael Nagel, Uwe Department of Mathematics University of Kentucky 715 Patterson Office Tower LexingtonKY40506 United States

Given a sequence of related modules Mn defined over a sequence of related polynomial rings, one may ask how to simultaneously compute a finite Gröbner basis for each Mn. Furthermore, one may ask how to simultaneously compute the module of syzygies of each Mn. In this paper we address both questions. Working in the setting of OI-modules over a Noetherian polynomial OI-algebra, we provide OI-analogues of Buchberger’s Criterion, Buchberger’s Algorithm for computing Gröbner bases, and Schreyer’s Theorem for computing syzygies. We also establish a stabilization result for Gröbner bases. © 2023, CC BY.

关键词： computation theory

Quantum Carleman Lattice Boltzmann Simulation of Fluids

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Itani, Wael Sreenivasan, Katepalli R. Succi, Sauro Tandon School of Engineering New York University New YorkNY11201 United States Courant Institute of Mathematical Sciences New York University New YorkNY10012 United States Department of Physics New York University New YorkNY10003 United States Center for Space Science New York University Abu Dhabi Saadiyat Island Abu Dhabi129188 United Arab Emirates Fondazione Istituto Italiano di Tecnologia Center for Life Nano-Neuroscience at la Sapienza Roma00161 Italy Physics Department Harvard University CambridgeMA United States

We present a pedagogical introduction to a quantum computing algorithm for the simulation of classical fluids, based on the Carleman linearization of a second-quantized version of lattice kinetic theory. Prospects and... 详细信息

关键词： computation theory

Fully Coupled Nonlinear Thermomechanical Modeling of Composites Using Mean-Field Mori-Tanaka Scheme Combined with Tfa theory

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Chatzigeorgiou, George Meraghni, Fodil Chen, Qiang Arts et Métiers Institute of Technology CNRS Université de Lorraine LEM3 UMR CNRS 7239 MetzF-57070 France

This article aims at proposing a new mean-field homogenization framework for the study of composites undergoing fully coupled thermomechanical processes. Strongly dissipative phenomena during loading in a structural component made of a composite material cause significant interplay between mechanical and thermal fields. The proposed framework attempts to address such effect by combining the Mori-Tanaka scheme and the Transformation Field Analysis (TFA) theory and by developing a multiscale framework capable of taking into account thermomechanically coupled processes. The numerical simulations performed in the examples section and validations with computations using periodic homogenization and full-structure analysis demonstrate the proposed strategy's accuracy and robustness. Thanks to the semi-analytical formalism of the micromechanics methodology, the computational time is drastically reduced compared to full-field homogenization strategy. © 2023, The Authors. All rights reserved.

关键词： computation theory

Bootstrapping Deconfined Quantum Tricriticality

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chester, Shai M. Su, Ning Jefferson Physical Laboratory Harvard University CambridgeMA02138 United States Center of Mathematical Sciences and Applications Harvard University CambridgeMA02138 United States Blackett Laboratory Imperial College Prince Consort Road LondonSW7 2AZ United Kingdom Department of Physics University of Pisa PisaI-56127 Italy

The paradigmatic example of deconfined quantum criticality is the Neel-VBS phase transition. The continuum description of this transition is the N = 2 case of the CPN−1 model, which is a field theory of N complex scalars in 3d coupled to an Abelian gauge field with SU(N)×U(1) global symmetry. Lattice studies and duality arguments suggest the global symmetry of the CP1 model is enhanced to SO(5). We perform a conformal bootstrap study of SO(5) invariant fixed points with one relevant SO(5) singlet operator, which would correspond to two relevant SU(2)×U(1) singlets, i.e. a tricritical point. We find that the bootstrap bounds are saturated by four different predictions from the large N computation of monopole operator scaling dimensions, which were recently shown to be very accurate even for small N. This suggests that the Neel-VBS phase transition is described by this bootstrap bound, which predicts that the second relevant singlet has dimension ≈ 2.36. © 2023, CC BY.

关键词： computation theory

Semiparametrically Efficient Score for the Survival Odds Ratio

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Rava, Denise Bradic, Jelena Xu, Ronghui Department of Mathematics University of California San Diego United States Department of Mathematics and Halicioglu Data Science Institute University of California San Diego United States Department of Mathematics Herbert Wertheim School of Public Health Halicioglu Data Science Institute University of California San Diego United States

We consider a general proportional odds model for survival data under binary treatment, where the functional form of the covariates is left unspecified. We derive the efficient score for the conditional survival odds ratio given the covariates using modern semiparametric theory. The efficient score may be useful in the development of doubly robust estimators, although computational challenges remain. © 2023, CC BY.

关键词： computation theory