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

Semantic and syntactic enhanced aspect sentiment triplet extraction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Chen, Zhexue Huang, Hong Liu, Bang Shi, Xuanhua Jin, Hai National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Huazhong University of Science and Technology China RALI & Mila University of Montreal

Aspect Sentiment Triplet Extraction (ASTE) aims to extract triplets from sentences, where each triplet includes an entity, its associated sentiment, and the opinion span explaining the reason for the sentiment. Most existing research addresses this problem in a multi-stage pipeline manner, which neglects the mutual information between such three elements and has the problem of error propagation. In this paper, we propose a Semantic and Syntactic Enhanced aspect Sentiment triplet Extraction model (S3E2) to fully exploit the syntactic and semantic relationships between the triplet elements and jointly extract them. Specifically, we design a Graph-Sequence duel representation and modeling paradigm for the task of ASTE: we represent the semantic and syntactic relationships between word pairs in a sentence by graph and encode it by Graph Neural Networks (GNNs), as well as modeling the original sentence by LSTM to preserve the sequential information. Under this setting, we further apply a more efficient inference strategy for the extraction of triplets. Extensive evaluations on four benchmark datasets show that S3E2 significantly outperforms existing approaches, which proves our S3E2’s superiority and flexibility in an end-to-end fashion. Copyright © 2021, The Authors. All rights reserved.

关键词： Extraction

Towards open-world text-guided face image generation and manipulation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Xia, Weihao Yang, Yujiu Xue, Jing-Hao Wu, Baoyuan Tsinghua Shenzhen International Graduate School Tsinghua University China Department of Statistical Science University College London United Kingdom School of Data Science Chinese University of Hongkong Shenzhen China and Secure Computing Lab of Big Data Shenzhen Research Institute of Big Data Shenzhen China

—The existing text-guided image synthesis methods can only produce limited quality results with at most 2562 resolution and the textual instructions are constrained in a small Corpus. In this work, we propose a unified framework for both face image generation and manipulation that produces diverse and high-quality images with an unprecedented resolution at 10242 from multimodal inputs. More importantly, our method supports open-world scenarios, including both image and text, without any re-training, fine-tuning, or post-processing. To be specific, we propose a brand new paradigm of text-guided image generation and manipulation based on the superior characteristics of a pretrained GAN model. Our proposed paradigm includes two novel strategies. The first strategy is to train a text encoder to obtain latent codes that align with the hierarchically semantic of the aforementioned pretrained GAN model. The second strategy is to directly optimize the latent codes in the latent space of the pretrained GAN model with guidance from a pretrained language model. The latent codes can be randomly sampled from a prior distribution or inverted from a given image, which provides inherent supports for both image generation and manipulation from multi-modal inputs, such as sketches or semantic labels, with textual guidance. To facilitate text-guided multi-modal synthesis, we propose the MULTI-MODAL CELEBA-HQ, a large-scale dataset consisting of real face images and corresponding semantic segmentation map, sketch, and textual descriptions. Extensive experiments on the introduced dataset demonstrate the superior performance of our proposed method. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

On path integration of grid cells: group representation and isotropic scaling 21

学校读者我要写书评

暂无评论

On path integration of grid cells: group representation and ...

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Ruiqi Gao Jianwen Xie Xue-Xin Wei Song-Chun Zhu Ying Nian Wu Department of Statistics UCLA Cognitive Computing Lab Baidu Research Department of Neuroscience UT Austin Department of Statistics UCLA and Department of Computer Science UCLA and Beijing Institute for General Artificial Intelligence (BIGAI)

ISBN: (纸本)9781713845393

Understanding how grid cells perform path integration calculations remains a fundamental problem. In this paper, we conduct theoretical analysis of a general representation model of path integration by grid cells, where the 2D self-position is encoded as a higher dimensional vector, and the 2D self-motion is represented by a general transformation of the vector. We identify two conditions on the transformation. One is a group representation condition that is necessary for path integration. The other is an isotropic scaling condition that ensures locally conformal embedding, so that the error in the vector representation translates conformally to the error in the 2D self-position. Then we investigate the simplest transformation, i.e., the linear transformation, uncover its explicit algebraic and geometric structure as matrix Lie group of rotation, and explore the connection between the isotropic scaling condition and a special class of hexagon grid patterns. Finally, with our optimization-based approach, we manage to learn hexagon grid patterns that share similar properties of the grid cells in the rodent brain. The learned model is capable of accurate long distance path integration.

关键词：

Improving Generative Model-based Unfolding with Schrödinger Bridges

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Diefenbacher, Sascha Liu, Guan-Horng Mikuni, Vinicius Nachman, Benjamin Nie, Weili Physics Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Autonomous Control and Decision Systems Laboratory Georgia Institute of Technology AtlantaGA30332 United States National Energy Research Scientific Computing Center Berkeley Lab BerkeleyCA94720 United States Berkeley Institute for Data Science University of California BerkeleyCA94720 United States Machine Learning Research Group NVIDIA Research United States

Machine learning-based unfolding has enabled unbinned and high-dimensional differential cross section measurements. Two main approaches have emerged in this research area: one based on discriminative models and one based on generative models. The main advantage of discriminative models is that they learn a small correction to a starting simulation while generative models scale better to regions of phase space with little data. We propose to use Schrödinger Bridges and diffusion models to create SBUnfold, an unfolding approach that combines the strengths of both discriminative and generative models. The key feature of SBUnfold is that its generative model maps one set of events into another without having to go through a known probability density as is the case for normalizing flows and standard diffusion models. We show that SBUnfold achieves excellent performance compared to state of the art methods on a synthetic Z+jets dataset. © 2023, CC BY.

关键词： Phase space methods

CONVERGENCE ANALYSIS OF A BLOCK PRECONDITIONED STEEPEST DESCENT EIGENSOLVER WITH IMPLICIT DEFLATION

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhou, Ming Bai, Zhaojun Cai, Yunfeng Neymeyr, Klaus Universität Rostock Institut für Mathematik Ulmenstraße 69 Rostock18055 Germany Department of Computer Science Department of Mathematics University of California DavisCA95616 United States Cognitive Computing Lab Baidu Research No. 10 Xibeiwang East Road Beijing100193 China

Gradient-type iterative methods for solving Hermitian eigenvalue problems can be accelerated by using preconditioning and deflation techniques. A preconditioned steepest descent iteration with implicit deflation (PSD-id) is one of such methods. The convergence behavior of the PSD-id is recently investigated based on the pioneering work of Samokish on the preconditioned steepest descent method (PSD). The resulting non-asymptotic estimates indicate a superlinear convergence of the PSD-id under strong assumptions on the initial guess. The present paper utilizes an alternative convergence analysis of the PSD by Neymeyr under much weaker assumptions. We embed Neymeyr’s approach into the analysis of the PSD-id using a restricted formulation of the PSD-id. More importantly, we extend the new convergence analysis of the PSD-id to a practically preferred block version of the PSD-id, or BPSD-id, and show the cluster robustness of the BPSD-id. Numerical examples are provided to validate the theoretical *** Codes 65F15, 65N12, 65N25 © 2022, CC BY-NC-ND.

关键词： Steepest descent method

ScalabFS: A scalable BFS accelerator on HBM-enhanced FPGAs

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Kexin Liu, Chenhao Shao, Zhiyuan Wang, Zeke Wu, Minkang Chen, Jiajie Liao, Xiaofei Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan30074 China Collaborative Innovation Center of Artificial Intelligence Zhejiang University China

High Bandwidth Memory (HBM) provides massive aggregated memory bandwidth by exposing multiple memory channels to the processing units. To achieve high performance, an accelerator built on top of an FPGA configured with HBM (i.e., FPGA-HBM platform) needs to scale its performance according to the available memory channels. In this paper, we propose an accelerator for BFS (Breadth-First Search) algorithm, named as ScalabFS, that builds multiple processing elements to sufficiently exploit the high bandwidth of HBM to improve efficiency. We implement the prototype system of ScalabFS and conduct BFS in both real-world and synthetic scale-free graphs on Xilinx Alveo U280 FPGA card real hardware. The experimental results show that ScalabFS scales its performance almost linearly according to the available memory pseudo channels (PCs) from the HBM2 subsystem of U280. By fully using the 32 PCs and building 64 processing elements (PEs) on U280, ScalabFS achieves a performance up to 19.7 GTEPS (Giga Traversed Edges Per Second). When conducting BFS in sparse real-world graphs, ScalabFS achieves equivalent GTEPS to Gunrock running on the state-of-art Nvidia V100 GPU that features 64-PC HBM2 (twice memory bandwidth than U280). Copyright © 2021, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

CKG: Dynamic Representation Based on Context and Knowledge Graph

学校读者我要写书评

暂无评论

CKG: Dynamic Representation Based on Context and Knowledge G...

International Conference on Pattern Recognition

作者： Xunzhu Tang Tiezhu Sun Rujie Zhu Shi Wang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Momenta Suzhou China University of Central Florida Orlando FL USA Institute of Computing Technology Chinese Academy beijing China

Recently, neural language representation models pre-trained on large corpus can capture rich co-occurrence information and be fine-tuned in downstream tasks to improve the performance. As a result, they have achieved state-of-the-art results in a large range of language tasks. However, there exists other valuable semantic information such as similar, opposite, or other possible meanings in external knowledge graphs (KGs). We argue that entities in KGs could be used to enhance the correct semantic meaning of language sentences. In this paper, we propose a new method CKG: Dynamic Representation Based on Context and Knowledge Graph. On the one side, CKG can extract rich semantic information of large corpus. On the other side, it can make full use of inside information such as co-occurrence in large corpus and outside information such as similar entities in KGs. We conduct extensive experiments on a wide range of tasks, including QQP, MRPC, SST-5, SQuAD, CoNLL 2003, and SNLI. The experiment results show that CKG achieves SOTA 89.2 on SQuAD compared with SAN (84.4), ELMo (85.8), and BERTBase (88.5).

关键词： Semantics data mining Task analysis Context modeling

Bill-EVR: An Embodied Virtual Reality Framework for Reward-and-Error-Based Motor Rehab-Learning

学校读者我要写书评

暂无评论

Bill-EVR: An Embodied Virtual Reality Framework for Reward-a...

IEEE International Conference on Rehabilitation Robotics (ICORR)

作者： Federico Nardi Shlomi Haar A.Aldo Faisal UKRI Centre for Doctoral Training in AI for Healthcare Imperial College London London United Kingdom Dept. of Computing & Dept. of Bioengineering Brain & Behaviour Lab Imperial College London London United Kingdom Care Research & Technology centre UK Dementia Research Institute Department of Brain Sciences Imperial College London London United Kingdom Chair in Digital Health & Data Science University of Bayreuth Bayreuth Germany

VR rehabilitation is an established field by now, however, it often refers to computer screen-based interactive rehabilitation activities. In recent years, there was an increased use of VR-headsets, which can provide an immersive virtual environment for real-world tasks, but they are lacking any physical interaction with the task objects and any proprioceptive feedback. Here, we focus on Embodied Virtual Reality (EVR), an emerging field where not only the visual input via VR-headset but also the haptic feedback is physically correct. This happens because subjects interact with physical objects that are veridically aligned in Virtual Reality. This technology lets us manipulate motor performance and motor learning through visual feedback perturbations. Bill-EVR is a framework that allows interventions in the performance of real-world tasks, such as playing pool billiard, engaging end-users in motivating life-like situations to trigger motor (re)learning - subjects see in VR and handle the real-world cue stick, the pool table and shoot physical balls. Specifically, we developed our platform to isolate and evaluate different mechanisms of motor learning to investigate its two main components, error-based and reward-based motor adaptation. This understanding can provide insights for improvements in neurorehabilitation: indeed, reward-based mechanisms are putatively impaired by degradation of the dopaminergic system, such as in Parkinson's disease, while error-based mechanisms are essential for recovering from stroke-induced movement errors. Due to its fully customisable features, our EVR framework can be used to facilitate the improvement of several conditions, providing a valid extension of VR-based implementations and constituting a motor learning tool that can be completely tailored to the individual needs of patients.

关键词：

Moto: Enhancing Embedding with Multiple Joint Factors for Chinese Text Classification

学校读者我要写书评

暂无评论

Moto: Enhancing Embedding with Multiple Joint Factors for Ch...

International Conference on Pattern Recognition

作者： Xunzhu Tang Rujie Zhu Tiezhu Sun Shi Wang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China University of Central Florida Orlando FL USA Momenta Suzhou China Institute of Computing Technology Chinese Academy beijing China

Recently, language representation techniques have achieved great performances in text classification. However, most existing representation models are specifically designed for English materials, which may fail in Chinese because of the huge difference between these two languages. Actually, few existing methods for Chinese text classification process texts at a single level. However, as a special kind of hieroglyphics, radicals of Chinese characters are good semantic carriers. In addition, Pinyin codes carry the semantic of tones, and Wubi reflects the stroke structure information, etc. Unfortunately, previous researches neglected to find an effective way to distill the useful parts of these four factors and to fuse them. In our works, we propose a novel model called Moto: Enhancing Embedding with Multiple Joint Factors. Specifically, we design an attention mechanism to distill the useful parts by fusing the four-level information above more effectively. We conduct extensive experiments on four popular tasks. The empirical results show that our Moto achieves SOTA 0.8316 (F₁-score, 2.11% improvement) on Chinese news titles, 96.38 (1.24% improvement) on Fudan Corpus and 0.9633 (3.26% improvement) on THUCNews.

关键词： Fuses Text categorization Semantics Pattern recognition Task analysis