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

arXiv 2024年

作者： Guan, Ji Feng, Yuan Turrini, Andrea Ying, Mingsheng Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Beijing100190 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Institute of Intelligent Software Guangzhou511458 China The Centre for Quantum Software and Information University of Technology SydneyNSW2007 Australia

Model-checking techniques have been extended to analyze quantum programs and communication protocols represented as quantum Markov chains, an extension of classical Markov chains. To specify qualitative temporal properties, a subspace-based quantum temporal logic is used, which is built on Birkhoff–von Neumann atomic propositions. These propositions determine whether a quantum state is within a subspace of the entire state space. In this paper, we propose the measurement-based linear-time temporal logic MLTL to check quantitative properties. MLTL builds upon classical linear-time temporal logic (LTL) but introduces quantum atomic propositions that reason about the probability distribution after measuring a quantum state. To facilitate verification, we extend the symbolic dynamics-based techniques for stochastic matrices described by Agrawal et al. (JACM 2015) to handle more general quantum linear operators (super-operators) through eigenvalue analysis. This extension enables the development of an efficient algorithm for approximately model checking a quantum Markov chain against an MLTL formula. To demonstrate the utility of our model-checking algorithm, we use it to simultaneously verify linear-time properties of both quantum and classical random walks. Through this verification, we confirm the previously established advantages discovered by Ambainis et al. (STOC 2001) of quantum walks over classical random walks and discover new phenomena unique to quantum walks. © 2024, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Hybrid Variational Autoencoder for Collaborative Filtering 25

Hybrid Variational Autoencoder for Collaborative Filtering

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Liu, Jinxin Xiao, Yingyuan Zhu, Ke Zheng, Wenguang Hsu, Ching-Hsien Tianjin University of Technology Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin China Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Asia University Department of Computer Science and Information Engineering Taichung Taiwan

ISBN: (纸本)9781665405270

In recent years, Variational AutoEncoder (VAE) based methods have made many important achievements in the field of collaborative filtering recommendation system. VAE is a kind of Bayesian model which combines latent variable model with variational inference, but its optimization is often troubled by posterior collapse. By comparing the optimization process of VAE and ordinary autoencoder, we observe that the mismatch between poorly optimized encoder and decoder with too strong characterization capabilities makes it difficult to learn the mapping from the data manifold to the parameterized graph. Since the learning of a posteriori network corresponds to the encoder, we think that the problem of a posteriori collapse can be alleviated by balancing the encoder and decoder better. Therefore, we proposed Hy-VAE, which combines conventional VAE with deterministic autoencoder, and has the advantages of both VAE and deterministic autoencoder. Experiments on three real-world recommendation data sets show that our method alleviates the posterior crash problem in VAE and improves the recommendation performance. © 2022 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Experience report:investigating bug fixes in machine learning frameworks/libraries

引用

Frontiers of computer science 2021年第6期15卷 43-58页

作者： Xiaobing SUN Tianchi ZHOU Rongcun WANG Yucong DUAN Lili BO Jianming CHANG School of Information Engineering Yangzhou UniversityYangzhou 225100China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Jiangsu Engineering Research Center of Knowledge Management and Intelligent Service Yangzhou University Yangzhou 225127China School of Computer Science and Technology China University of Mining and TechnologyXuzhou 221116China School of Computer Science and Cyberspace Security Hainan UniversityHaikou 570228China

Machine learning(ML)techniques and algorithms have been successfully and widely used in various areas including software engineering *** other software projects,bugs are also common in ML projects and *** order to more deeply understand the features related to bug fixing in ML projects,we conduct an empirical study with 939 bugs from five ML projects by manually examining the bug categories,fixing patterns,fixing scale,fixing duration,and types of *** results show that(1)there are commonly seven types of bugs in ML programs;(2)twelve fixing patterns are typically used to fix the bugs in ML programs;(3)68.80%of the patches belong to micro-scale-fix and small-scale-fix;(4)66.77%of the bugs in ML programs can be fixed within one month;(5)45.90%of the bug fixes belong to corrective activity from the perspective of software ***,we perform a questionnaire survey and send them to developers or users of ML projects to validate the results in our empirical *** results of our empirical study are basically consistent with the feedback from *** findings from the empirical study provide useful guidance and insights for developers and users to effectively detect and fix bugs in MLprojects.

关键词： bug fixing machine learning project empirical study questionnaire survey

来源：评论

学校读者我要写书评

暂无评论

Explaining Model Overfitting in CNNs via GMM Clustering

arXiv

引用

arXiv 2024年

作者： Dou, Hui Mu, Xinyu Yi, Mengjun Han, Feng Zhao, Jian Shen, Furao State Key Laboratory for Novel Software Technology China Department of Computer Science and Technology Nanjing University Nanjing210023 China School of Electronic Science and Engineering Nanjing University Nanjing210023 China School of Artificial Intelligence Nanjing University Nanjing210023 China

Convolutional Neural Networks (CNNs) have demonstrated remarkable prowess in the field of computer vision. However, their opaque decision-making processes pose significant challenges for practical applications. In this study, we provide quantitative metrics for assessing CNN filters by clustering the feature maps corresponding to individual filters in the model via Gaussian Mixture Model (GMM). By analyzing the clustering results, we screen out some anomaly filters associated with outlier samples. We further analyze the relationship between the anomaly filters and model overfitting, proposing three hypotheses. This method is universally applicable across diverse CNN architectures without modifications, as evidenced by its successful application to models like AlexNet and LeNet-5. We present three meticulously designed experiments demonstrating our hypotheses from the perspectives of model behavior, dataset characteristics, and filter impacts. Through this work, we offer a novel perspective for evaluating the CNN performance and gain new insights into the operational behavior of model overfitting. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimizing Class Distribution in Memory for Multi-Label Online Continual Learning

arXiv

引用

arXiv 2022年

作者： Liang, Yan-Shuo Li, Wu-Jun The National Key Laboratory for Novel Software Technology Collaborative Innovation Center of Novel Software Technology and Industrialization Department of Computer Science and Technology Nanjing University Nanjing210023 China

Online continual learning, especially when task identities and task boundaries are unavailable, is a challenging continual learning setting. One representative kind of methods for online continual learning is replay-based methods, in which a replay buffer called memory is maintained to keep a small part of past samples for overcoming catastrophic forgetting. When tackling with online continual learning, most existing replay-based methods focus on single-label problems in which each sample in the data stream has only one label. But multi-label problems may also happen in the online continual learning setting in which each sample may have more than one label. In the online setting with multi-label samples, the class distribution in data stream is typically highly imbalanced, and it is challenging to control class distribution in memory since changing the number of samples belonging to one class may affect the number of samples belonging to other classes. But class distribution in memory is critical for replay-based memory to get good performance, especially when the class distribution in data stream is highly imbalanced. In this paper, we propose a simple but effective method, called optimizing class distribution in memory (OCDM), for multi-label online continual learning. OCDM formulates the memory update mechanism as an optimization problem and updates the memory by solving this problem. Experiments on two widely used multi-label datasets show that OCDM can control the class distribution in memory well and can outperform other state-of-the-art methods. © 2022, CC0.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

LEARNING WITH LOGICAL CONSTRAINTS BUT WITHOUT SHORTCUT SATISFACTION

arXiv

引用

arXiv 2024年

作者： Li, Zenan Liu, Zehua Yao, Yuan Xu, Jingwei Chen, Taolue Ma, Xiaoxing Lü, Jian State Key Lab of Novel Software Technology Nanjing University China Department of Mathematics The University of Hong Kong Hong Kong Department of Computer Science Birkbeck University of London United Kingdom

Recent studies have explored the integration of logical knowledge into deep learning via encoding logical constraints as an additional loss function. However, existing approaches tend to vacuously satisfy logical constraints through shortcuts, failing to fully exploit the knowledge. In this paper, we present a new framework for learning with logical constraints. Specifically, we address the shortcut satisfaction issue by introducing dual variables for logical connectives, encoding how the constraint is satisfied. We further propose a variational framework where the encoded logical constraint is expressed as a distributional loss that is compatible with the model’s original training loss. The theoretical analysis shows that the proposed approach bears salient properties, and the experimental evaluations demonstrate its superior performance in both model generalizability and constraint satisfaction. © 2024, CC BY.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Coordination of networking and computing: toward new information infrastructure and new services mode

引用

Frontiers of Information technology & Electronic Engineering 2024年第5期25卷 629-632页

作者： Xiaoyun WANG Tao SUN Yong CUI Rajkumar BUYYA Deke GUO Qun HUANG Hassnaa MOUSTAFA Chen TIAN Shangguang WANG China Mobile Communications Corporation Beijing 100032China China Mobile Research Institute Beijing 100053China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China CLOUDS Lab School of Computing and Information SystemsUniversity of MelbourneMelbourneVIC 3010Australia National Key Laboratory of Information Systems Engineering National University of Defense TechnologyChangsha 410073China School of Computer Science Peking UniversityBeijing 100871China Intel Corporation Santa ClaraCA 95054USA State Key Laboratory for Novel Sofiware Technology Nanjing UniversityNanjing 210023China State Key Laboratory of Networking and Switching Technology Bejing University of Posts and TelecommunicationsBeijing 100876China

Computing,serving as the cornerstone of information processing,plays a pivotal role in the digital service ***"network"and"computing,"responsible for information transmission and processing respectively,traditionally belong to different stakeholders and have evolved ***,the recent trend toward the coordination and integration of computing and networks has garnered significant attention from both industry and *** such as"computility network"and"computing force network"have emerged,and the International Telecommunication Union-Telecommunication Standardization(ITU-T)has initiated efforts to develop standards for the coordination of networking and computing(CNC),focusing on the architecture and framework.

关键词： computing services network

来源：评论

学校读者我要写书评

暂无评论

PMC-CNN: Trajectory Prediction Method Fusing Pedestrian Motion Features

PMC-CNN: Trajectory Prediction Method Fusing Pedestrian Moti...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Xiling Cao Yan Li Hong Liu School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China Inspur (Shandong) Computer Technology Co Ltd. Jinan China

ISBN: (数字)9798350356670

ISBN: (纸本)9798350356687

Predicting how pedestrians will move is a valuable and challenging task. It can be applied to various domains, such as crowd evacuation and autonomous driving. However, in practice, scene information and pedestrian interaction make it difficult to accurately predict pedestrian trajectories. Therefore, more effective processing of information affecting pedestrian trajectories is particularly important. Extraction of pedestrian motion features is insufficient in current research in this area. To address this problem, a neural network trajectory prediction method, PMC-CNN, is proposed. This method incorporates pedestrian motion features and stores the heterogeneous information required for prediction within a knowledge graph. Furthermore, it combines this information with the proposed IN-EX pedestrian motion model, resulting in an improvement in prediction accuracy. In addition, this research applies the prediction framework to a crowd evacuation scenario to improve the efficiency of crowd evacuation. This verifies the effectiveness and practicality of our proposed model.

关键词： Pedestrians Accuracy Urban planning Neural networks Safety management Knowledge graphs Predictive models Feature extraction Real-time systems Trajectory

来源：评论

学校读者我要写书评

暂无评论

DapperFL: Domain Adaptive Federated Learning with Model Fusion Pruning for Edge Devices

arXiv

引用

arXiv 2024年

作者： Jia, Yongzhe Zhang, Xuyun Hu, Hongsheng Choo, Kim-Kwang Raymond Qi, Lianyong Xu, Xiaolong Beheshti, Amin Dou, Wanchun State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China School of Computing Macquarie University Australia School of Information and Physical Sciences University of Newcastle Australia Department of Information Systems and Cyber Security University of Texas San Antonio United States China School of Computer and Software Nanjing University of Information Science and Technology China

Federated learning (FL) has emerged as a prominent machine learning paradigm in edge computing environments, enabling edge devices to collaboratively optimize a global model without sharing their private data. However, existing FL frameworks suffer from efficacy deterioration due to the system heterogeneity inherent in edge computing, especially in the presence of domain shifts across local data. In this paper, we propose a heterogeneous FL framework DapperFL, to enhance model performance across multiple domains. In DapperFL, we introduce a dedicated Model Fusion Pruning (MFP) module to produce personalized compact local models for clients to address the system heterogeneity challenges. The MFP module prunes local models with fused knowledge obtained from both local and remaining domains, ensuring robustness to domain shifts. Additionally, we design a Domain Adaptive Regularization (DAR) module to further improve the overall performance of DapperFL. The DAR module employs regularization generated by the pruned model, aiming to learn robust representations across domains. Furthermore, we introduce a specific aggregation algorithm for aggregating heterogeneous local models with tailored architectures and weights. We implement DapperFL on a real-world FL platform with heterogeneous clients. Experimental results on benchmark datasets with multiple domains demonstrate that DapperFL outperforms several state-of-the-art FL frameworks by up to 2.28%, while significantly achieving model volume reductions ranging from 20% to 80%. Our code is available at: https://***/jyzgh/DapperFL. © 2024, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Joint Clustering and Analyze Single Cell Multi-omics Data by scMOGAN

Joint Clustering and Analyze Single Cell Multi-omics Data by...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： An, Congcong Chen, Yiwen Nie, Shanling Yang, Hai East China University of Science and Technology Department of Computer Science and Engineering Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China National University of Singapore Center for Continuing and Lifelong Education Singapore The University of Sydney Faculty of Engineering Australia

ISBN: (纸本)9798350337488

Advancements in single-cell multi-omics sequencing technologies have dramatically transformed the analysis of cellular states at single-cell resolution. Cluster analyses leveraging single-cell transcriptome and epigenome data have enabled the characterization of cellular states and the delineation of transcriptomic regulatory programs associated with cellular heterogeneity. However, the high dimensionality, sparsity, and heterogeneity inherent to multi-omics data present significant challenges to their clustering analysis. In this study, we introduced single-cell Multi-Omics Generative Adversarial Networks (scMOGAN), an unsupervised clustering model specifically tailored for single-cell transcriptome and epigenome data. scMOGAN accomplishes this by efficaciously modeling the omics data and mining potential features through neural networks, ultimately utilizing Gaussian mixture models for cell type identification. To validate and scrutinize the performance of scMOGAN, we performed analyses on two actual multi-omics datasets and one simulated dataset. The results demonstrate that scMOGAN surpasses other existing methods in terms of clustering performance, underscoring its efficacy in navigating the complexities of multi-omics data. © 2023 IEEE.

关键词： clustering generative adversarial networks single cell multi-omics data unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：