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

Strong quantum nonlocality without entanglement in multipartite quantum systems

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yuan, Pei Tian, Guojing Sun, Xiaoming CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

In this paper, we generalize the concept of strong quantum nonlocality from two aspects. Firstly in Cd ⊗ Cd ⊗ Cd quantum system, we present a construction of strongly nonlocal quantum states containing 6(d−1)2 orthogonal product states, which is one order of magnitude less than the number of basis states d3. Secondly, we give the explicit form of strongly nonlocal orthogonal product basis in C3 ⊗ C3 ⊗ C3 ⊗ C3 quantum system, where four is the largest known number of subsystems in which there exists strong quantum nonlocality up to now. Both the two results positively answer the open problems in [Halder, et al., PRL, 122, 040403 (2019)], that is, there do exist and even smaller number of quantum states can demonstrate strong quantum nonlocality without entanglement. Copyright © 2020, The Authors. All rights reserved.

关键词： Quantum communication

Event-aware Video Corpus Moment Retrieval

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hou, Danyang Pang, Liang Shen, Huawei Cheng, Xueqi CAS Key Laboratory of AI Security Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

Video Corpus Moment Retrieval (VCMR) is a practical video retrieval task focused on identifying a specific moment within a vast corpus of untrimmed videos using the natural language query. Existing methods for VCMR typically rely on frame-aware video retrieval, calculating similarities between the query and video frames to rank videos based on maximum frame similarity. However, this approach overlooks the semantic structure embedded within the information between frames, namely, the event, a crucial element for human comprehension of videos. Motivated by this, we propose EventFormer, a model that explicitly utilizes events within videos as fundamental units for video retrieval. The model extracts event representations through event reasoning and hierarchical event encoding. The event reasoning module groups consecutive and visually similar frame representations into events, while the hierarchical event encoding encodes information at both the frame and event levels. We also introduce anchor multi-head self-attenion to encourage Transformer to capture the relevance of adjacent content in the video. The training of EventFormer is conducted by two-branch contrastive learning and dual optimization for two sub-tasks of VCMR. Extensive experiments on TVR, ANetCaps, and DiDeMo benchmarks show the effectiveness and efficiency of EventFormer in VCMR, achieving new state-of-the-art results. Additionally, the effectiveness of EventFormer is also validated on partially relevant video retrieval task. © 2024, CC BY.

关键词： Semantics

Dynamic MCMC sampling

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Feng, Weiming He, Kun Sun, Xiaoming Yin, Yitong State Key Laboratory for Novel Software Technology Nanjing University CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

The Markov chain Monte Carlo (MCMC) methods are the primary tools for sampling from Gibbs distributions arising by various graphical models, e.g. Markov random fields (MRF). Traditional MCMC sampling algorithms are focused on a classic static setting, where the input is fixed. In this paper we study the problem of sampling from a MRF when the graphical model itself is changing dynamically with time. The problem is well motivated by the growing volume and velocity of data in today's applications of the MCMC methods. For the two major MCMC approaches, respectively for the approximate and perfect sampling, namely, the Gibbs sampling and the coupling from the past (CFTP), we give dynamic versions for the respective MCMC sampling algorithms. On MRF with n variables and bounded maximum degrees, these dynamic sampling algorithms can maintain approximate samples within 1/Poly(n) total variation errors, or perfect samples, while the MRF is dynamically changing. Furthermore, the dynamic sampling algorithms are efficient with O(n) space cost, and O(log2 n) incremental time cost upon each local update to the input MRF, as long as certain decay conditions are satisfied in each step by natural couplings of the corresponding single-site chains. These decay conditions were well known in the literature of couplings for rapid mixing of Markov chains, and now for the first time, are used to imply efficient dynamic sampling algorithms. Consequently, we have efficient dynamic (approximate or perfect) sampling algorithms with O(n) space cost and O (log2 n) incremental time cost, for the following models when the maximum degree is bounded: generalMRF satisfying the Dobrushin-Shlosman condition (for approximate sampling);Ising model with temperature β where e-2|β| > 1 - 2 β+1 (for both approximate and perfect samplings);hardcore model with fugacity λ 2λ (for approximate sampling);or q > 2Δ2 + 3Δ (for perfect sampling). These results show that the coupling of single-site Markov chains that

关键词： Learning algorithms

Link Prediction on n-ary relational data based on relatedness evaluation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Guan, Saiping Jin, Xiaolong Guo, Jiafeng Wang, Yuanzhuo Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100864 China

With the overwhelming popularity of Knowledge Graphs (KGs), researchers have poured attention to link prediction to fill in missing facts for a long time. However, they mainly focus on link prediction on binary relational data, where facts are usually represented as triples in the form of (head entity, relation, tail entity). In practice, n-ary relational facts are also ubiquitous. When encountering such facts, existing studies usually decompose them into triples by introducing a multitude of auxiliary virtual entities and additional triples. These conversions result in the complexity of carrying out link prediction on n-ary relational data. It has even proven that they may cause loss of structure information. To overcome these problems, in this paper, we represent each n-ary relational fact as a set of its role and role-value pairs. We then propose a method called NaLP to conduct link prediction on n-ary relational data, which explicitly models the relatedness of all the role and role-value pairs in an n-ary relational fact. We further extend NaLP by introducing type constraints of roles and role-values without any external type-specific supervision, and proposing a more reasonable negative sampling mechanism. Experimental results validate the effectiveness and merits of the proposed methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Knowledge graph

UGCLink: User Identity Linkage by Modeling User Generated Contents with Knowledge Distillation

学校读者我要写书评

暂无评论

UGCLink: User Identity Linkage by Modeling User Generated Co...

IEEE International Conference on Big data

作者： Hao Gao Yongqing Wang Jiangli Shao Huawei Shen Xueqi Cheng Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781665445993

User identity linkage aims to link users with the same identities across different social networks. Recently, re- searchers model the similarities of users’ behaviors such as Point of Interests(PoIs) or User Generated Contents(UGCs) to predict the identities of users. However, it is non-trivial to solve the problem due to the following challenges: 1) PoIs are always sparse in the non-location-based social platforms, and it is impractical to measure the similarities of users solely with PoIs; 2) The similarities of hierarchical are hierarchical from the view of word, phrase, and sentence. How to model the hierarchical structure remains a key challenge; 3) The unreliable semantics of words. Two different words may refer to the same physical appearance of users, indicating that users are with the same *** tackle the above problems, we propose UGCLink, a knowledge distillation framework that models UGCs to predict user identities. Two main components are included in the framework, where the student network aims to model the similarities of UGCs and the teacher network guides the student network to learn better word embeddings that reveal the physical appearance of users. Besides, the teacher network, a document classification model that classifies UGCs into the categories of PoIs, is trained to guide the word embedding learning process in the student network to circumvent the unreliable semantic problem. We demonstrate that our proposed method outperforms the state- of-the-art methods by more than 11% in terms of AUC score.

关键词： Couplings Social networking (online) Conferences Semantics User-generated content Predictive models Big data

Augmentation-Aware Self-Supervision for data-Efficient GAN Training

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hou, Liang Cao, Qi Yuan, Yige Zhao, Songtao Ma, Chongyang Pan, Siyuan Wan, Pengfei Wang, Zhongyuan Shen, Huawei Cheng, Xueqi CAS Key Laboratory of AI Safety and Security Institute of Computing Technology Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Kuaishou Technology China

Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting. Previously proposed differentiable augmentation demonstrates improved data efficiency of training GANs. However, the augmentation implicitly introduces undesired invariance to augmentation for the discriminator since it ignores the change of semantics in the label space caused by data transformation, which may limit the representation learning ability of the discriminator and ultimately affect the generative modeling performance of the generator. To mitigate the negative impact of invariance while inheriting the benefits of data augmentation, we propose a novel augmentation-aware self-supervised discriminator that predicts the augmentation parameter of the augmented data. Particularly, the prediction targets of real data and generated data are required to be distinguished since they are different during training. We further encourage the generator to adversarially learn from the self-supervised discriminator by generating augmentation-predictable real and not fake data. This formulation connects the learning objective of the generator and the arithmetic − harmonic mean divergence under certain assumptions. We compare our method with state-of-the-art (SOTA) methods using the class-conditional BigGAN and unconditional StyleGAN2 architectures on data-limited CIFAR-10, CIFAR-100, FFHQ, LSUN-Cat, and five low-shot datasets. Experimental results demonstrate significant improvements of our method over SOTA methods in training data-efficient GANs. Copyright © 2022, The Authors. All rights reserved.

关键词： Generative adversarial networks

Adaptive information seeking for open-domain question answering

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhu, Yunchang Pang, Liang Lan, Yanyan Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Institute for AI Industry Research Tsinghua University

Information seeking is an essential step for open-domain question answering to efficiently gather evidence from a large corpus. Recently, iterative approaches have been proven to be effective for complex questions, by recursively retrieving new evidence at each step. However, almost all existing iterative approaches use predefined strategies, either applying the same retrieval function multiple times or fixing the order of different retrieval functions, which cannot fulfill the diverse requirements of various questions. In this paper, we propose a novel adaptive information-seeking strategy for open-domain question answering, namely AISO. Specifically, the whole retrieval and answer process is modeled as a partially observed Markov decision process, where three types of retrieval operations (e.g., BM25, DPR, and hyperlink) and one answer operation are defined as actions. According to the learned policy, AISO could adaptively select a proper retrieval action to seek the missing evidence at each step, based on the collected evidence and the reformulated query, or directly output the answer when the evidence set is sufficient for the question. Experiments on SQuAD Open and HotpotQA fullwiki, which serve as single-hop and multi-hop open-domain QA benchmarks, show that AISO outperforms all baseline methods with predefined strategies in terms of both retrieval and answer evaluations. © 2021, CC BY.

关键词： Hypertext systems

MatchZoo: A Learning, Practicing, and Developing System for Neural Text Matching

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Guo, Jiafeng Fan, Yixing Ji, Xiang Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Beijing Institute of Technology University Beijing China

Text matching is the core problem in many natural language processing (NLP) tasks, such as information retrieval, question answering, and conversation. Recently, deep leaning technology has been widely adopted for text matching, making neural text matching a new and active research domain. With a large number of neural matching models emerging rapidly, it becomes more and more difficult for researchers, especially those newcomers, to learn and understand these new models. Moreover, it is usually difficult to try these models due to the tedious data pre-processing, complicated parameter configuration, and massive optimization tricks, not to mention the unavailability of public codes sometimes. Finally, for researchers who want to develop new models, it is also not an easy task to implement a neural text matching model from scratch, and to compare with a bunch of existing models. In this paper, therefore, we present a novel system, namely MatchZoo, to facilitate the learning, practicing and designing of neural text matching models. The system consists of a powerful matching library and a user-friendly and interactive studio, which can help researchers: 1) to learn state-of-the-art neural text matching models systematically, 2) to train, test and apply these models with simple configurable steps;and 3) to develop their own models with rich APIs and assistance. Copyright © 2019, The Authors. All rights reserved.

关键词： Natural language processing systems

A Novel Configurable High-precision and Low-cost Circuit Design of Sigmoid and Tanh Activation Function

学校读者我要写书评

暂无评论

A Novel Configurable High-precision and Low-cost Circuit Des...

2021 IEEE International Conference on Integrated Circuits, Technologies and Applications, ICTA 2021

作者： Liu, Feng Zhang, Bowen Chen, Gang Gong, Guoliang Lu, Huaxiang Li, Wenchang Chinese Academy of Sciences Institute of Semiconductors Beijing100083 China University of Chinese Academy of Sciences Beijing100089 China Center for Excellence in Brain Science and Intelligence Technology CAS Shanghai200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing100083 China

ISBN: (纸本)9781665417471

This paper proposes a configurable Sigmoid and Tanh activation function circuit design by second-order approximation and deviation compensation. The proposed circuit is synthesized in TSMC 180nm technology within a 7218 um2 area at 500MHz, it is also deployed on Xilinx ZC706 FPGA by 158 LUTs and 46 FFs at 333MHz. It achieves almost 4.68× better precision and 20.2% less area than previous works. The experimental results show that our method has almost no accuracy loss on LSTM Chinese speech recognition tasks and the YOLOv3 image recognition post-processing task. © 2021 IEEE.

关键词： Chemical activation