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

41st International Conference on Machine Learning, ICML 2024

作者： Wang, Deng-Bao Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing China Key Lab. of Computer Network and Information Integration Southeast University MOE China

Although deep neural networks have achieved remarkable success, they often exhibit a significant deficiency in reliable uncertainty calibration. This paper focus on model calibratability, which assesses how amenable a model is to be well recalibrated post-hoc. We find that the widely used weight decay regularizer detrimentally affects model calibratability, subsequently leading to a decline in final calibration performance after post-hoc calibration. To identify the underlying causes leading to poor calibratability, we delve into the calibratability of intermediate features across the hidden layers. We observe a U-shaped trend in the calibratability of intermediate features from the bottom to the top layers, which indicates that over-compression of the top representation layers significantly hinders model calibratability. Based on the observations, this paper introduces a weak classifier hypothesis, i.e., given a weak classification head that has not been over-trained, the representation module can be better learned to produce more calibratable features. Consequently, we propose a progressively layer-peeled training (PLP) method to exploit this hypothesis, thereby enhancing model calibratability. Our comparative experiments show the effectiveness of our method, which improves model calibration and also yields competitive predictive performance. Copyright 2024 by the author(s)

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Calibration bottleneck: over-compressed representations are less calibratable 24

Calibration bottleneck: over-compressed representations are ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Deng-Bao Wang Min-Ling Zhang School of Computer Science and Engineering Southeast University Nanjing China and Key Lab. of Computer Network and Information Integration (Southeast University) MOE China

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Meta-Hierarchical Active Inference Reinforcement Learning Approach for QoS-Driven Resource Allocation in Dynamic Clouds

A Novel Meta-Hierarchical Active Inference Reinforcement Lea...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Xian, Peijie He, Ying Yu, F. Richard Du, Jianbo Shenzhen Univ. College of Computer Science and Software Engineering Shenzhen China Xi'an Univ. of Posts & Telecomm. Shaanxi Key Lab. of Information Comm. Network and Security Shaanxi Xi'an China Carleton Univ. School of Information Technology OttawaON Canada

ISBN: (纸本)9798350351255

The cloud computing environment is highly dynamic due to a variety of external factors such as seasonal changes, market trends, and social events. In this case, tenant behavior patterns exhibit significant variability. Therefore, the cloud computing resource allocation model must continuously adapt to these changes. To this end, we propose an adaptive algorithm for dynamic cloud resource allocation based on meta-hierarchical active inference reinforcement learning (MHAIRL). The algorithm combines active inference with meta-hierarchical reinforcement learning. It improves the overall performance of the algorithm, as well as quickly adapts to environmental changes, and improves the generalization performance. In addition, we design a novel polling scheduling framework combined with long short-term memory (LSTM) network. The framework ensures scheduling fairness and flexibility while greatly reducing the state and action space dimensions of the agent. Extensive simulation results show that our method outperforms baseline algorithms in quality of service (QoS) metrics and significantly improves system performance in highly dynamic cloud resource allocation. © 2024 IEEE.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

Bridging the Gap: Learning Pace Synchronization for Open-World Semi-Supervised Learning

arXiv

引用

arXiv 2023年

作者： Ye, Bo Gan, Kai Wei, Tong Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing211189 China Key Lab. of Computer Network and Information Integration Southeast University MoE China

In open-world semi-supervised learning, a machine learning model is tasked with uncovering novel categories from unlab.led data while maintaining performance on seen categories from lab.led data. The central challenge is the substantial learning gap between seen and novel categories, as the model learns the former faster due to accurate supervisory information. Moreover, capturing the semantics of unlab.led novel category samples is also challenging due to the missing lab.l information. To address the above issues, we introduce 1) the adaptive synchronizing marginal loss which imposes class-specific negative margins to alleviate the model bias towards seen classes, and 2) the pseudo-lab.l contrastive clustering which exploits pseudo-lab.ls predicted by the model to group unlab.led data from the same category together in the output space. Extensive experiments on benchmark datasets demonstrate that previous approaches may significantly hinder novel class learning, whereas our method strikingly balances the learning pace between seen and novel classes, achieving a remarkable 3% average accuracy increase on the ImageNet dataset. Importantly, we find that fine-tuning the self-supervised pre-trained model significantly boosts the performance, which is overlooked in prior literature. Our code is availab.e at https://***/yebo0216best/LPS-main. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Lightening Fine-grained Access Control Scheme Supporting Full Policy Hiding in Cloud Storage 29

A Lightening Fine-grained Access Control Scheme Supporting F...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Shi, Jiaoli Hu, Chao Yao, Shimao Mei, Zhuolin Wu, Bin Li, Hui Jiujiang Univ. School of Computer and Big Data Jiujiang China Jiangxi Univ. of Finance and Economics School of Software IoT Engineering Nanchang China Jiujiang Key Lab. of Network and Information Security Jiujiang China Jiujiang University School of Computer and Big Data Jiujiang China Peking University School of Elec. and Comp. Engineering Shenzhen China

ISBN: (纸本)9798350330717

Efficiency, security, and flexibility are difficult to balance in a full policy hiding CP-ABE scheme. This paper creatively converts the privacy matching problem of access policy and a user's private key to the privacy three-party set computation problem. Then the new privacy set computation problem is resolved by a message driven key generation method. Additionally, the ROBDD (Reduced Ordered Binary Decision Diagrams) is utilized to rich access structure expression and convert access policies into feasible path sets. Each feasible path is composed of attributes and these attributes are bound to the ciphertext using CP-ABE. Based on the innovative ideas mentioned above, we present a Lighten Fine-grained Access Control scheme supporting Full Policy Hidden (LFAC-FPH) that integrates data confidentiality protection, access policy rich expression but complete hiding, fine-grained access control, and lightweight terminal computing. Our scheme has three advantages: 1) High Efficiency. The proposed scheme can achieve fast privacy matching of access policies during user decryption. 2) Full Policy Hiding. The access policy bound by an owner on the ciphertext does not leak any information. Moreover, a user cannot know attributes they do not own. 3) High Flexibility. The decryption process does not require online from owners or KGC, and system attributes can be added at any time. © 2023 IEEE.

关键词： CP-ABE full policy hiding lighten computation Private-Preserving

来源：评论

学校读者我要写书评

暂无评论

Exploiting Conjugate lab.l Information for Multi-Instance Partial-lab.l Learning

arXiv

引用

arXiv 2024年

作者： Tang, Wei Zhang, Weijia Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Lab. of Computer Network and Information Integration Southeast University MoE China School of Information and Physical Sciences The University of Newcastle NSW2308 Australia

Multi-instance partial-lab.l learning (MIPL) addresses scenarios where each training sample is represented as a multi-instance bag associated with a candidate lab.l set containing one true lab.l and several false positives. Existing MIPL algorithms have primarily focused on mapping multi-instance bags to candidate lab.l sets for disambiguation, disregarding the intrinsic properties of the lab.l space and the supervised information provided by non-candidate lab.l sets. In this paper, we propose an algorithm named ELIMIPL, i.e., Exploiting conjugate lab.l Information for Multi-Instance Partial-lab.l learning, which exploits the conjugate lab.l information to improve the disambiguation performance. To achieve this, we extract the lab.l information embedded in both candidate and non-candidate lab.l sets, incorporating the intrinsic properties of the lab.l space. Experimental results obtained from benchmark and real-world datasets demonstrate the superiority of the proposed ELIMIPL over existing MIPL algorithms and other well-established partial-lab.l learning algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software Module Clustering Using the Hierarchical Clustering Combination Method 7

Software Module Clustering Using the Hierarchical Clustering...

引用

7th International Conference on Cloud Computing and Big Data Analytics, ICCCBDA 2022

作者： Xia, Hong Zhang, Yongkang Chen, Yanping Zhang, Hengshan Wang, Zhongmin Wang, Fengwei School of Computer Science and Technology Xi'An Univ. of P. and Telecom. Shaanxi Key Lab. of Network Data Analysis and Intelligent Processing Xi'an China Xi'An University of Posts and Telecommunications School of Computer Science and Technology Xi'an China ZTECorporation Shenzhen China

ISBN: (纸本)9781665487115

The scale of software applications has increased dramatically. Hierarchical clustering is a good method for modular recovery of software architecture. Because the different evaluation criteria of software types and clustering results, a single hierarchical clustering algorithm cannot integrate the number of clusters, arbitrary decision-making, recovery quality and other indicators on different evaluation standards, there is no comprehensive clustering algorithm selection method. We propose a hierarchical clustering combination algorithm and use principal component analysis to combine the results of multiple hierarchical clusters, the combined result retain the basic information of each clustering algorithm as much as possible. The experimental results show that compared with the single software hierarchical clustering method and other combined methods, the result of our method is closer to expert decomposition, and it has good performance on a variety of indicators. © 2022 IEEE.

关键词： Cloud computing Software architecture Clustering methods Software algorithms Decision making Clustering algorithms Big Data

来源：评论

学校读者我要写书评

暂无评论

Attention Is Not What You Need: Revisiting Multi-Instance Learning for Whole Slide Image Classification

arXiv

引用

arXiv 2024年

作者： Liu, Xin Zhang, Weijia Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Lab. of Computer Network and Information Integration Southeast University Ministry of Education China School of Information and Physical Sciences The University of Newcastle NSW2308 Australia

Although attention-based multi-instance learning algorithms have achieved impressive performances on slide-level whole slide image (WSI) classification tasks, they are prone to mistakenly focus on irrelevant patterns such as staining conditions and tissue morphology, leading to incorrect patch-level predictions and unreliable interpretability. Moreover, these attention-based MIL algorithms tend to focus on salient instances and struggle to recognize hard-to-classify instances. In this paper, we first demonstrate that attention-based WSI classification methods do not adhere to the standard MIL assumptions. From the standard MIL assumptions, we propose a surprisingly simple yet effective instance-based MIL method for WSI classification (FocusMIL) based on max-pooling and forward amortized variational inference. We argue that synergizing the standard MIL assumption with variational inference encourages the model to focus on tumour morphology instead of spurious correlations. Our experimental evaluations show that FocusMIL significantly outperforms the baselines in patch-level classification tasks on the Camelyon16 and TCGA-NSCLC benchmarks. Visualization results show that our method also achieves better classification boundaries for identifying hard instances and mitigates the effect of spurious correlations between bags and lab.ls. Copyright © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Data-consistent Unsupervised Diffusion Model for Metal Artifact Reduction

Data-consistent Unsupervised Diffusion Model for Metal Artif...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Tong, Zhan Wu, Zhan Yang, Yang Mao, Weilong Wang, Shijie Li, Yinsheng Chen, Yang Southeast University Laboratory of Image Science and Technology Nanjing210096 China Southeast University Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing210096 China Chinese Academy of Sciences Research Center for Medical Artificial Intelligence Shenzhen Institutes of Advanced Technology Shenzhen518055 China School of Computer Science and Engineering Key Lab. of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing The Laboratory of Image Science and Technology Nanjing210096 China

ISBN: (纸本)9798350337488

Computed Tomography (CT) is an imaging technique widely used in clinical diagnosis. However, high-attenuation metallic implants result in the obstruction of low-energy Xrays and further lead to metal artifacts in the reconstructed CT images. Deep supervised model-based metal artifact reduction(MAR) approaches are limited in clinical applications due to the difficulty in obtaining paired artifact-affected and artifactfree data. Furthermore, these model-based methods lack the consideration of data consistency in the sinogram-domain to perform exact metal trace inpainting. To address these challenges, we propose a Data-consistent unsupErVised diffusiOn model for meTal artifact rEDuction, called DEVOTED-Net. First, DEVOTED-Net leverages prior knowledge to guide the conditional diffusion model for fine-grained metal trace inpainting. Second, an unsupervised MAR framework is designed in the reverse process for the unknown metal traces restoration in the sinogram domain. Third, to further enhance the sinogram-domain data consistency, physics-based consistency constraint loss including conjugateray consistency loss and accumulation-ray consistency loss is designed. Extensive experiments are carried out to verify the performance of our algorithm on the publicly availab.e dataset and clinical experimental dataset. This efficient, accurate, and reliable MAR approach holds great potential in clinics. © 2023 IEEE.

关键词： computed tomography deep unsupervised learning denoising diffusion probabilistic model Metal artifact reduction physics-based consistency constraint

来源：评论

学校读者我要写书评

暂无评论

A Novel Meta-Hierarchical Active Inference Reinforcement Learning Approach for QoS-Driven Resource Allocation in Dynamic Clouds

A Novel Meta-Hierarchical Active Inference Reinforcement Lea...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Peijie Xian Ying He F. Richard Yu Jianbo Du College of Computer Science and Software Engineering Shenzhen Univ. Shenzhen China Shaanxi Key Lab. of Information Comm. Network and Security Xi’an Univ. of Posts & Telecomm. Xi’an China School of Information Technology Carleton Univ. Ottawa Canada

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

关键词： Cloud computing Adaptation models Heuristic algorithms Computational modeling Quality of service Reinforcement learning Dynamic scheduling Inference algorithms Resource management Long short term memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：