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

41st International Conference on Machine Learning, ICML 2024

作者： Jiang, Jun-Peng Ye, Han-Jia Wang, Leye Yang, Yang Jiang, Yuan Zhan, De-Chuan School of Artificial Intelligence Nanjing University Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China Ministry of Education & School of Computer Science Peking University Beijing China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

Transferring knowledge across diverse data modalities is receiving increasing attention in machine learning. This paper tackles the task of leveraging expert-derived, yet expensive, tabular data to enhance image-based predictions when tabular data is unavailable during inference. The primary challenges stem from the inherent complexity of accurately mapping diverse tabular data to visual contexts, coupled with the necessity to devise distinct strategies for numerical and categorical tabular attributes. We propose CHannel tAbulaR alignment with optiMal tranSport (CHARMS), which establishes an alignment between image channels and tabular attributes, enabling selective knowledge transfer that is pertinent to visual features. Specifically, CHARMS measures similarity distributions across modalities to effectively differentiate and transfer relevant tabular features, with a focus on morphological characteristics, enhancing the capabilities of visual classifiers. By maximizing the mutual information between image channels and tabular features, knowledge from both numerical and categorical tabular attributes are extracted. Experimental results demonstrate that CHARMS not only enhances the performance of image classifiers but also improves their interpretability by effectively utilizing tabular knowledge. Copyright 2024 by the author(s)

关键词： Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond 41

Efficient Algorithms for Empirical Group Distributionally Ro...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Yu, Dingzhi Cai, Yunuo Jiang, Wei Zhang, Lijun National Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Data Science Fudan University Shanghai China Guangzhou China

In this paper, we investigate the empirical counterpart of Group Distributionally Robust Optimization (GDRO), which aims to minimize the maximal empirical risk across m distinct groups. We formulate empirical GDRO as a two-level finite-sum convex-concave minimax optimization problem and develop an algorithm called ALEG to benefit from its special structure. ALEG is a double-looped stochastic primal-dual algorithm that incorporates variance reduction techniques into a modified mirror prox routine. To exploit the two-level finite-sum structure, we propose a simple group sampling strategy to construct the stochastic gradient with a smaller Lipschitz constant and then perform variance reduction for all groups. Theoretical analysis shows that ALEG achieves Ε-accuracy within a computation complexity of (equation presented), where n¯ is the average number of samples among m groups. Notably, our approach outperforms the state-of-the-art method by a factor of √m. Based on ALEG, we further develop a two-stage optimization algorithm called ALEM to deal with the empirical Minimax Excess Risk Optimization (MERO) problem. The computation complexity of ALEM nearly matches that of ALEG, surpassing the rates of existing methods. Copyright 2024 by the author(s)

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Federated Learning Using Dynamic Update and Adaptive Pruning with Momentum on Shared Server Data

引用

ACM Transactions on Intelligent Systems and technology 2024年第6期15卷 1-28页

作者： Liu, Ji Jia, Juncheng Zhang, Hong Yun, Yuhui Wang, Leye Zhou, Yang Dai, Huaiyu Dou, Dejing Hithink RoyalFlush Information Network Co. Ltd. Hangzhou China School of Computer Science and Technology Soochow University Suzhou China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China Baidu Research Beijing China Key Lab of High Confidence Software Technologies Ministry of Education and Software Institute Peking University Beijing China Department of Computer Science and Software Engineering Auburn University AuburnAL United States Department of Electrical and Computer Engineering North Carolina State University RaleighNC United States Bedi Cloud and School of Computer Science Fudan University Beijing China

Despite achieving remarkable performance, Federated Learning (FL) encounters two important problems, i.e., low training efficiency and limited computational resources. In this article, we propose a new FL framework, i.e., FedDUMAP, with three original contributions, to leverage the shared insensitive data on the server in addition to the distributed data in edge devices so as to efficiently train a global model. First, we propose a simple dynamic server update algorithm, which takes advantage of the shared insensitive data on the server while dynamically adjusting the update steps on the server in order to speed up the convergence and improve the accuracy. Second, we propose an adaptive optimization method with the dynamic server update algorithm to exploit the global momentum on the server and each local device for superior accuracy. Third, we develop a layer-adaptive model pruning method to carry out specific pruning operations, which is adapted to the diverse features of each layer so as to attain an excellent tradeoff between effectiveness and efficiency. Our proposed FL model, FedDUMAP, combines the three original techniques and has a significantly better performance compared with baseline approaches in terms of efficiency (up to 16.9 times faster), accuracy (up to 20.4% higher), and computational cost (up to 62.6% smaller). © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

User story clustering in agile development:a framework and an empirical study

引用

Frontiers of computer science 2023年第6期17卷 43-59页

作者： Bo YANG Xiuyin MA Chunhui WANG Haoran GUO Huai LIU Zhi JIN School of Information Science and Technology Beijing Forestry UniversityBeijing 100083China Engineering Research Center for Forestry Oriented Intelligent Information Processing National Forestry and Grassland AdministrationBeijing 100083China School of Information Science and Technology North China University of TechnologyBeijing 100144China College of Computer Science and Technology Inner Mongolia Normal UniversityHohhot 010020China Department of Computer Science and Software Engineering Swinburne University of TechnologyHawthorn VIC 3122Australia Key Laboratory of High Confidence Software Technologies(Peking University) Ministry of EducationBeijing 100871China Institute of Software School of Computer SciencePeking UniversityBeijing 100871China

Agile development aims at rapidly developing software while embracing the continuous evolution of user requirements along the whole development *** stories are the primary means of requirements collection and elicitation in the agile development.A project can involve a large amount of user stories,which should be clustered into different groups based on their functionality’s similarity for systematic requirements analysis,effective mapping to developed features,and efficient ***,the current user story clustering is mainly conducted in a manual manner,which is time-consuming and subjective to human *** this paper,we propose a novel approach for clustering the user stories automatically on the basis of natural language ***,the sentence patterns of each component in a user story are first analysed and determined such that the critical structure in the representative tasks can be automatically extracted based on the user story *** similarity of user stories is calculated,which can be used to generate the connected graph as the basis of automatic user story *** evaluate the approach based on thirteen datasets,compared against ten baseline *** results show that our clustering approach has higher accuracy,recall rate and F1-score than these *** is demonstrated that the proposed approach can significantly improve the efficacy of user story clustering and thus enhance the overall performance of agile *** study also highlights promising research directions for more accurate requirements elicitation.

关键词： user story agile development user story mapping clustering

来源：评论

学校读者我要写书评

暂无评论

Discrete Geometric Coded Data Layout for Large-scale Object Storage Systems 21

Discrete Geometric Coded Data Layout for Large-scale Object ...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Tian, Yi Xu, Guangping Yang, Hongzhang Ni, Yue Cao, JiaXin Yang, Lei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Novel Software Technology Tianjin Key Laboratory of Intelligence Computing Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Information Technology Co. Ltd. China

ISBN: (纸本)9798350329223

Regenerating codes are new network codes proposed to reduce the data required for fault repair, which can improve the recovery efficiency of faulty nodes in data storage systems. However, unlike Reed-Solomon code, which repairs at the granularity of bytes, regenerating codes require data stored in large chunks but leads to severe read amplification, which reads out excess data when degraded read objects and increases degraded read time. That reflects a mutual constraint between improving recovery efficiency and degraded read performance, as manifested in the amplification of data reads, a vital issue considered in this *** solve this problem, we propose a new type of data layout - discrete geometric, which splits the object into a series of geometric sequences of data blocks. They are placed discretely into corresponding containers on the disks at different nodes, with containers of the same size made into a strip for encoding. The discrete characteristic ensures lower repair costs for degraded reads. The geometric characteristic ensures the repair performance of regenerating codes by large blocks, and read amplification can be mitigated through small blocks. To reduce IOPS for discrete geometric, we propose Discrete Geometric-Locally Regenerating Codes (DG-LRCs), guaranteeing lower degraded read latency while improving recovery *** results show that the degraded read time of DG-LRCs compared to regenerating codes combined with geometric partitioning is 22.56% lower at 2Gbpsand 60.56% lower at 4Gbps, and the recovery performance is 7.04 times better than that of RS code. © 2023 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

eSROP Attack: Leveraging Signal Handler to Implement Turing-Complete Attack Under CFI Defense 1

引用

18th EAI International Conference on Security and Privacy in Communication Networks, SecureComm 2022

作者： Zhang, Tianning Cai, Miao Zhang, Diming Huang, Hao Department of Computer Science and Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China School of Computer and Information Hohai University Nanjing China College of Computer Engineering Jiangsu University of Science and Technology Nanjing China

ISBN: (数字)9783031255380

ISBN: (纸本)9783031255373

Signal Return Oriented Programming (SROP) is a dangerous code reuse attack method. Recently, defense techniques have been proposed to defeat SROP attacks. In this paper, we leverage the signal nesting mechanism provided by current operating systems and propose a new variant of SROP attack called enhanced SROP (eSROP) attack. eSROP provides the ability of invoking arbitrary system calls, simulating Turing-complete computation, and even bypassing the fine-grained label-based CFI defense, without modifying the return address and instruction register in the signal frame. Because the signal returns to the interrupted instruction, the shadow stack defense can hardly detect our attack. Signal has strong flexibility which can interrupt the normal control flow. We leverage such flexibility to design a new code reuse attack. To evaluate eSROP, we perform two exploits on two real-world programs, namely Proftpd and Wu-ftpd. In our attacks, adversaries can invoke arbitrary system calls and obtain a root shell. Both attacks succeed within 10 min under strict system defense such as data execution prevention, address space layout randomization, and coarse-grained control flow integrity. © 2023, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

RENN: A Rule Embedding Enhanced Neural Network Framework for Temporal Knowledge Graph Completion 30

RENN: A Rule Embedding Enhanced Neural Network Framework for...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zong, Linlin Xie, Zhenrong Ma, Chi Liu, Xinyue Zhang, Xianchao Xu, Bo Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology China School of Computer Science and Technology Dalian University of Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China

ISBN: (纸本)9782493814104

Existing approaches encompass deep neural network-based methods for temporal knowledge graph embedding and rule-based logical symbolic reasoning. However, the former may not adequately account for structural dependencies between ***, the latter methods relies heavily on strict logical rule reasoning and lacks robustness in the face of fuzzy or noisy data. In response to these challenges, we present RENN, a groundbreaking framework that enhances temporal knowledge graph completion through rule embedding. RENN employs a three-step approach. First, it utilizes temporary random walk to extract temporal logic rules. Then, it pre-trains by learning embeddings for each logical rule and its associated relations, thereby enhancing the likelihood of existing quadruples and logical rules. Finally, it incorporates the embeddings of logical rules into the deep neural network. Our methodology has been validated through experiments conducted on various temporal knowledge graph models and datasets, consistently demonstrating its effectiveness and potential in improving temporal knowledge graph completion. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Towards Effective Bug Reproduction for Mobile Applications 10

Towards Effective Bug Reproduction for Mobile Applications

引用

10th International Conference on Dependable Systems and Their Applications, DSA 2023

作者： Li, Xin Yu, Shengcheng Sun, Lifan Liu, Yuexiao Fang, Chunrong Nanjing University State Key Laboratory for Novel Software Technology China Shenzhen Research Institute of Nanjing University China

ISBN: (纸本)9798350304770

Bug reproduction is a critical task in software testing, as it helps developers to identify and fix bugs in the software. While some automated reproduction tools are designed to assist developers in reproducing bugs detected by automated testing tools, they are not entirely reliable. Thus, manual reproduction remains important. However, automated testing tools often generate testing results that are difficult for non-professional developers to understand, which complicates their efforts to reproduce bugs. In this paper, we propose RepAssistor, an approach that employs an interactive method to assist developers in reproducing bugs based on automated testing logs. RepAssistor is designed for reproducing bugs in mobile applications. It leverages deep learning (DL) and traditional computer vision (CV) techniques to analyze application screenshots, transforming automated testing logs into a graph representation. In this graph, edges represent test events while nodes represent application states. With this graph representation in place, RepAssistor is then able to monitor developers' actions and continuously track which node they are at in this graph in real-time. Based on this understanding, RepAssistor dynamically calculates and updates the optimal path to guide developers to reproduce bugs. This guidance is conveyed to the developers through an interactive method, enabling effective communication and assistance throughout the bug reproduction process. Our experiments demonstrate that RepAssistor improves the performance of developers in bug reproduction tasks. © 2023 IEEE.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

DivGCL: A Graph Contrastive Learning Model for Diverse Recommendation 39

DivGCL: A Graph Contrastive Learning Model for Diverse Recom...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Gong, Wenwen Geng, Yangliao Zhang, Dan Zhu, Yifan Xu, Xiaolong Xiang, Haolong Beheshti, Amin Zhang, Xuyun Qi, Lianyong School of Information and Electrical Engineering China Agricultural University China School of Computer Science & Technology Beijing Jiaotong University China Department of Computer Science and Technology Tsinghua University China School of Computer Science Beijing University of Posts and Telecommunications China School of Software Nanjing University of Information Science and Technology China School of Computing Macquarie University Australia College of Computer Science and Technology China University of Petroleum [East China China State Key Lab. for Novel Software Technology Nanjing University China

ISBN: (纸本)157735897X

Graph Contrastive Learning (GCL), as a primary paradigm of graph self-supervised learning, spurs a fruitful line of research in tackling the data sparsity issue by maximizing the consistency of user/item embeddings between different augmented views with random perturbations. However, diversity, as a crucial metric for recommendation performance and user satisfaction, has received rather little attention. In fact, there exists a challenging dilemma in balancing accuracy and diversity. To address these issues, we propose a new Graph Contrastive Learning model for Diversifying recommendations (DivGCL). Inspired by the excellence of the determinant point process (DPP), DivGCL adopts a DPP likelihood-based loss function to achieve an ideal trade-off between diversity and accuracy, optimizing it jointly with the advanced Gaussian noise-augmented GCL objective. Extensive experiments on four popular datasets demonstrate that DivGCL surpasses existing approaches in balancing accuracy and diversity, with an improvement of 23.47% at T@20 (abbreviation for trade-off metric) on ML-1M. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Reasoning with Dynamic Hypergraph Embedding 30

Temporal Knowledge Graph Reasoning with Dynamic Hypergraph E...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Liu, Xinyue Zhang, Jianan Ma, Chi Liang, Wenxin Xu, Bo Zong, Linlin Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology China School of Computer Science and Technology Dalian University of Technology China Ministry of Education China

ISBN: (纸本)9782493814104

Reasoning over the Temporal Knowledge Graph (TKG) that predicts facts in the future has received much attention. Most previous works attempt to model temporal dynamics with knowledge graphs and graph convolution networks. However, these methods lack the consideration of high-order interactions between objects in TKG, which is an important factor to predict future facts. To address this problem, we introduce dynamic hypergraph embedding for temporal knowledge graph reasoning. Specifically, we obtain high-order interactions by constructing hypergraphs based on temporal knowledge graphs at different timestamps. Besides, we integrate the differences caused by time into the hypergraph representation in order to fit TKG. Then, we adapt dynamic meta-embedding for temporal hypergraph representation that allows our model to choose the appropriate high-order interactions for downstream reasoning. Experimental results on public TKG datasets show that our method outperforms the baselines. Furthermore, the analysis part demonstrates that the proposed method brings good interpretation for the predicted results. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：