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

IEEE International Conference on data Mining (ICDM)

作者： Kangzheng Liu Feng Zhao Guandong Xu Shiqing Wu Natural Language Processing and Knowledge Graph Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Temporal knowledge graph (TKG) forecasting is widely used in various fields due to its ability to infer future events based on historical information. Modeling the internal structures and chronological dependencies of historical subgraph sequences has been proven effective. Nevertheless, on the one hand, the TKG forecasting process generally suffers from a lack of sufficient sample data due to historical resource limitations; thus, most works focus on continuously mining the patterns of historical sequences while ignoring the semantically-rich background information provided by external knowledge, especially when historical query-related information is scarce. On the other hand, when merely serializing the given subgraph sequence to mimic its temporal evolution process, only the chronological dependencies between the subgraphs can be considered, thus ignoring the evolution of time information. Hence, a method that integrates internal and external knowledge to enhance the representations of entities is urgently needed. To this end, we propose a novel TKG forecasting method, namely, the internal and external evolution-enhanced framework (IE-Evo). For the former issue, we design an external evolution encoder and use a pre-trained language model (PLM) to provide powerful external knowledge semantics for TKG forecasting. To address the latter concern, we propose an internal evolution encoder that explicitly embeds the time information while modeling the aggregation and evolution processes of the observed sequential structural information. IE-Evo has been evaluated on four public benchmark datasets, showcasing its significant improvements across multiple evaluation metrics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Online training through time for spiking neural networks 22

Online training through time for spiking neural networks

引用

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

作者： Mingqing Xiao Qingyan Meng Zongpeng Zhang Di He Zhouchen Lin Key Lab. of Machine Perception (MoE) School of Intelligence Science and Technology Peking University The Chinese University of Hong Kong Shenzhen and Shenzhen Research Institute of Big Data Center for Data Science Academy for Advanced Interdisciplinary Studies Peking University Key Lab. of Machine Perception (MoE) School of Intelligence Science and Technology Peking University and Institute for Artificial Intelligence Peking University and Peng Cheng Laboratory China

ISBN: (纸本)9781713871088

Spiking neural networks (SNNs) are promising brain-inspired energy-efficient models. Recent progress in training methods has enabled successful deep SNNs on large-scale tasks with low latency. Particularly, backpropagation through time (BPTT) with surrogate gradients (SG) is popularly used to enable models to achieve high performance in a very small number of time steps. However, it is at the cost of large memory consumption for training, lack of theoretical clarity for optimization, and inconsistency with the online property of biological learning rules and rules on neuromorphic hardware. Other works connect the spike representations of SNNs with equivalent artificial neural network formulation and train SNNs by gradients from equivalent mappings to ensure descent directions. But they fail to achieve low latency and are also not online. In this work, we propose online training through time (OTTT) for SNNs, which is derived from BPTT to enable forward-in-time learning by tracking presynaptic activities and leveraging instantaneous loss and gradients. Meanwhile, we theoretically analyze and prove that the gradients of OTTT can provide a similar descent direction for optimization as gradients from equivalent mapping between spike representations under both feedforward and recurrent conditions. OTTT only requires constant training memory costs agnostic to time steps, avoiding the significant memory costs of BPTT for GPU training. Furthermore, the update rule of OTTT is in the form of three-factor Hebbian learning, which could pave a path for online on-chip learning. With OTTT, it is the first time that the two mainstream supervised SNN training methods, BPTT with SG and spike representation-based training, are connected, and meanwhile it is in a biologically plausible form. Experiments on CIFAR-10, CIFAR-100, ImageNet, and CIFAR10-DVS demonstrate the superior performance of our method on large-scale static and neuromorphic datasets in a small number of time steps.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep treatment-adaptive network for causal inference

Deep treatment-adaptive network for causal inference

引用

作者： Li, Qian Wang, Zhichao Liu, Shaowu Li, Gang Xu, Guandong School of Electrical Engineering Computing and Mathematical Sciences Curtin University Perth Australia School of Electrical Engineering and Telecommunications University of New South Wales Sydney Australia Data Science and Machine Intelligence Lab School of Computer Science University of Technology Sydney Sydney Australia Centre for Cyber Security Research and Innovation Deakin University GeelongVIC3216 Australia

Causal inference is capable of estimating the treatment effect (i.e., the causal effect of treatment on the outcome) to benefit the decision making in various domains. One fundamental challenge in this research is that the treatment assignment bias in observational data. To increase the validity of observational studies on causal inference, representation-based methods as the state-of-the-art have demonstrated the superior performance of treatment effect estimation. Most representation-based methods assume all observed covariates are pre-treatment (i.e., not affected by the treatment) and learn a balanced representation from these observed covariates for estimating treatment effect. Unfortunately, this assumption is often too strict a requirement in practice, as some covariates are changed by doing an intervention on treatment (i.e., post-treatment). By contrast, the balanced representation learned from unchanged covariates thus biases the treatment effect estimation. In light of this, we propose a deep treatment-adaptive architecture (DTANet) that can address the post-treatment covariates and provide a unbiased treatment effect estimation. Generally speaking, the contributions of this work are threefold. First, our theoretical results guarantee DTANet can identify treatment effect from observations. Second, we introduce a novel regularization of orthogonality projection to ensure that the learned confounding representation is invariant and not being contaminated by the treatment, meanwhile mediate variable representation is informative and discriminative for predicting the outcome. Finally, we build on the optimal transport and learn a treatment-invariant representation for the unobserved confounders to alleviate the confounding bias. © 2022, The Author(s).

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Reinforced Path Reasoning for Counterfactual Explainable Recommendation

arXiv

引用

arXiv 2022年

作者： Wang, Xiangmeng Li, Qian Yu, Dianer Xu, Guandong Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia School of Elec Eng Comp and Math Sci Curtin University Perth Australia

Counterfactual explanations interpret the recommendation mechanism via exploring how minimal alterations on items or users affect the recommendation decisions. Existing counterfactual explainable approaches face huge search space and their explanations are either action-based (e.g., user click) or aspect-based (i.e., item description). We believe item attribute-based explanations are more intuitive and persuadable for users since they explain by fine-grained item demographic features (e.g., brand). Moreover, counterfactual explanation could enhance recommendations by filtering out negative items. In this work, we propose a novel Counterfactual Explainable Recommendation (CERec) to generate item attribute-based counterfactual explanations meanwhile to boost recommendation performance. Our CERec optimizes an explanation policy upon uniformly searching candidate counterfactuals within a reinforcement learning environment. We reduce the huge search space with an adaptive path sampler by using rich context information of a given knowledge graph. We also deploy the explanation policy to a recommendation model to enhance the recommendation. Extensive explainability and recommendation evaluations demonstrate CERec’s ability to provide explanations consistent with user preferences and maintain improved recommendations. We release our code at https://***/Chrystalii/CERec. © 2022, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Group RandAugment: Video Augmentation for Action Recognition 5

Group RandAugment: Video Augmentation for Action Recognition

引用

5th International Conference on data science and Information Technology, DSIT 2022

作者： An, Fengmin Zhang, Bingbing Wang, Zhenwei Dong, Wei Zhang, Jianxin School of Computer Science and Engineering Dalian Minzu University Dalian China Institute of Machine Intelligence and Bio-computing Dalian Minzu University Dalian China SEAC Key Lab of Big Data Applied Technology Dalian Minzu University Dalian China School of Information and Communication Engineering Dalian University of Technology Dalian China

ISBN: (数字)9781665498685

ISBN: (纸本)9781665498685

data augmentation, as a critical strategy in deep learning, well improves the sample diversity for network training, leading to the obvious improvement of model generalization ability. Besides, automatic data augmentation, while sparking in image tasks, has attracted too little attention in video recognition task. Therefore, this work explores a novel group random augmentation (GRA) that automatically augments video data for recognition. GRA first collects 21 augmentation transformations to enrich the sample diversity, and then divides these transformations into four groups (i.e., pixel-transform, rigidtransform, erasing-transform, environment-transform) to reduce the excessive regularization caused by similar augmentation. To reduce the computational cost of finding the optimal setting, GRA adopts the combination form to select the optimal situation. For frames in the same video clip, GRA uses synchronous GRA. Additionally, the proposed GRA can be integrated into any existing video frameworks. To prove the effectiveness of GRA, we conduct experiments on two commonly used video action recognition benchmarks (Something-Something V1 & V2) and three typical frameworks (TSM, GSM, and TEA), whose results demonstrate GRA can improve performance in all cases without adding additional computational cost. © 2022 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Syntax-enhanced pre-trained model 59

Syntax-enhanced pre-trained model

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Xu, Zenan Guo, Daya Tang, Duyu Su, Qinliang Shou, Linjun Gong, Ming Zhong, Wanjun Quan, Xiaojun Jiang, Daxin Duan, Nan School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Microsoft Research Asia Beijing China Microsoft Search Technology Center Asia Beijing China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (纸本)9781954085527

We study the problem of leveraging the syntactic structure of text to enhance pre-trained models such as BERT and RoBERTa. Existing methods utilize syntax of text either in the pre-training stage or in the fine-tuning stage, so that they suffer from discrepancy between the two stages. Such a problem would lead to the necessity of having human-annotated syntactic information, which limits the application of existing methods to broader scenarios. To address this, we present a model that utilizes the syntax of text in both pre-training and fine-tuning stages. Our model is based on Transformer with a syntax-aware attention layer that considers the dependency tree of the text. We further introduce a new pre-training task of predicting the syntactic distance among tokens in the dependency tree. We evaluate the model on three downstream tasks, including relation classification, entity typing, and question answering. Results show that our model achieves state-of-the-art performance on six public benchmark datasets. We have two major findings. First, we demonstrate that infusing automatically produced syntax of text improves pre-trained models. Second, global syntactic distances among tokens bring larger performance gains compared to local head relations between contiguous tokens. © 2021 Association for Computational Linguistics

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

FSTR: Funds Skewness Aware Transaction Routing for Payment Channel Networks

FSTR: Funds Skewness Aware Transaction Routing for Payment C...

引用

International Conference on Dependable Systems and Networks (DSN)

作者： Siyi Lin Jingjing Zhang Weigang Wu School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Lab. of Big Data Analysis and Processing China MoE Key Lab. of Machine Intelligence and Advanced Computing China

ISBN: (数字)9781728158099

ISBN: (纸本)9781728158105

Payment channel is an effective and popular technique to improve the scalability and throughput of blockchains by transferring transactions from on-chain to off-chain. Multiple payment channels can constitute a payment network and realize transaction execution via multi-hop paths. How to find a feasible and efficient transaction path, i.e., transaction routing, is a key issue in payment channel networks, and different solutions have been proposed. However, the problem of funds skewness, which may cause routing failures, has been largely ignored in existing routing algorithms. In this work, we design FSTR, a routing algorithm that attempts to route transactions using a funds skewness based path selection scheme so as to reduce funds skewness and increase transaction success probability. To evaluate the performance of FSTR, we conduct experiments using the real-world dataset of Ripple. The experiment results show that FSTR outperforms existing routing algorithms, in terms of success ratio, delay, and overhead.

关键词： Routing Delays Throughput Scalability Spread spectrum communication Mice

来源：评论

学校读者我要写书评

暂无评论

Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad Hoc Networks

Software Defined Networking Based On-Demand Routing Protocol...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Baihong Dong Weigang Wu Zhiwei Yang Junjie Li School of Data and Computer Science Sun Yat-Sen University Guangdong Key Lab. of Big Data Analysis and Processing Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou

ISBN: (纸本)9781509056972

This paper comes up with a SDN based On-Demand Routing Protocol, SVAO, which separates data forwarding layer and network control layer, as in SDN, to enhance the data transmission efficiency within VANETs. The Roadside Service Unit plays the role of Local Controller and is in charge of selecting vehicles to forward packet within a road segment. All the vehicles state in the road. Correspondingly, a two-level design is used. Global Level is distributed and adopts a ranked query scheme to collect vehicle information and determine the road segments along which a message should be forwarded. And the Local Level is in charge of selecting forwarding vehicles in each road segment determined by the global level. We compare SVAO with popular ad-hoc network routing protocols, including OLSR, DSR, DSDV, and DB via simulations. We consider the impact of vehicle density, speed on data transmission rate and average packet delay. The simulation results show that in case of large network scales or high vehicle speed, SVAO performs better than the others.

关键词： Routing protocols Roads Routing Ad hoc networks Topology Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

A dynamic competitive swarm optimizer based-on entropy for large scale optimization

A dynamic competitive swarm optimizer based-on entropy for l...

引用

International Workshop on Advanced Computational intelligence (IWACI)

作者： Wen-Xiao Zhang Wei-Neng Chen Jun Zhang School of Data and Computer Science Sun Yat-sen University Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

In this paper, a dynamic competitive swarm optimizer (DCSO) based on population entropy is proposed. The new algorithm is derived from the competitive swarm optimizer (CSO). The new algorithm uses population entropy to make a quantitative description about the diversity of population, and to divide the population into two sub-groups dynamically. During the early stage of the execution process, to speed up convergence of the algorithm, the sub-group with better fitness will have a small size, and worse large sub-group will learn from small one. During the late stage of the execution process, to keep the diversity of the population, the sub-group with better fitness will have a large size, and small worse sub-group will learn from large group. The proposed DCSO is evaluated on CEC'08 benchmark functions on large scale global optimization. The simulation results of the example indicate that the new algorithm has better and faster convergence speed than CSO.

关键词： Sociology Statistics Entropy Optimization Convergence Heuristic algorithms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Constrained Off-policy Learning over Heterogeneous Information for Fairness-aware Recommendation

引用

ACM Transactions on Recommender Systems 2024年第4期2卷 1-27页

作者： Xiangmeng Wang Qian Li Dianer Yu Qing Li Guandong Xu Data Science and Machine Intelligence Lab University of Technology Sydney Broadway Australia School of Electrical Engineering Computing and Mathematical Sciences Curtin University Perth Australia Hong Kong Polytechnic University Hong Kong China

Fairness-aware recommendation eliminates discrimination issues to build trustworthy recommendation systems. Existing fairness-aware approaches ignore accounting for rich user and item attributes and thus cannot capture the impact of attributes on affecting recommendation fairness. These real-world attributes severely cause unfair recommendations by favoring items with popular attributes, leading to item exposure unfairness in recommendations. Moreover, existing approaches mostly mitigate unfairness for static recommendation models, e.g., collaborative filtering. Static models can not handle dynamic user interactions with the system that reflect users’ preferences shift through time. Thus, static models are limited in their ability to adapt to user behavior shifts to gain long-run user satisfaction. As user and item attributes are largely involved in modern recommenders and user interactions are naturally dynamic, it is essential to develop a novel method that eliminates unfairness caused by attributes meanwhile embrace the dynamic modeling of user behavior shifts. In this article, we propose Constrained Off-policy Learning over Heterogeneous Information for Fairness-aware Recommendation (Fair-HINpolicy), which uses recent advances in context-aware off-policy learning to produce fairness-aware recommendations with rich attributes from a Heterogeneous Information Network. In particular, we formulate the off-policy learning as a Constrained Markov Decision Process (CMDP) by dynamically constraining the fairness of item exposure at each iteration. We also design an attentive action sampling to reduce the search space for off-policy learning. Our solution adaptively receives HIN-augmented corrections for counterfactual risk minimization, and ultimately yields an effective policy that maximizes long-term user satisfaction. We extensively evaluate our method through simulations on large-scale real-world datasets, obtaining favorable results compared with state-of-the-art m

关键词： Fairness-aware Recommendation Off-policy Learning Counterfactual Risk Minimization Heterogeneous Information Network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：