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

12th International Conference on Learning Representations, ICLR 2024

作者： Saberi, Amir Hossein Movasaghinia, Mohammad Hosein Najafi, Amir Motahari, Seyed Abolfazl Heidari, Alireza Khalaj, Babak H. Department of Electrical Engineering Department of Computer Engineering Sharif Center for Information Systems and Data Science Iran Sharif Institute for Convergence Science & Technology Sharif University of Technology Tehran Iran

We propose a novel framework for incorporating unlabeled data into semi-supervised classification problems, where scenarios involving the minimization of either i) adversarially robust or ii) non-robust loss functions have been considered. Notably, we allow the unlabeled samples to deviate slightly (in total variation sense) from the in-domain distribution. The core idea behind our framework is to combine Distributionally Robust Optimization (DRO) with self-supervised training. As a result, we also leverage efficient polynomial-time algorithms for the training stage. From a theoretical standpoint, we apply our framework on the classification problem of a mixture of two Gaussians in Rd, where in addition to the m independent and labeled samples from the true distribution, a set of n (usually with n m) out of domain and unlabeled samples are given as well. Using only the labeled data, it is known that the generalization error can be bounded by ∝ (d/m)1/2. However, using our method on both isotropic and non-isotropic Gaussian mixture models, one can derive a new set of analytically explicit and non-asymptotic bounds which show substantial improvement on the generalization error compared to ERM. Our results underscore two significant insights: 1) out-of-domain samples, even when unlabeled, can be harnessed to narrow the generalization gap, provided that the true data distribution adheres to a form of the "cluster assumption", and 2) the semi-supervised learning paradigm can be regarded as a special case of our framework when there are no distributional shifts. We validate our claims through experiments conducted on a variety of synthetic and real-world datasets. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

A Novel Metaverse-as-a-Service Architecture from an Operator View

A Novel Metaverse-as-a-Service Architecture from an Operator...

引用

2023 IEEE International Conference on Metaverse Computing, Networking and Applications, MetaCom 2023

作者： Ahsani, Vesal Rahimi, Ali Letafati, Mehdi Khalaj, Babak Hossein Sharif University of Technology Department of Electrical Engineering and Sharif Center for Information Systems and Data Science Tehran Iran

ISBN: (纸本)9798350333336

In this research paper, the authors present a comprehensive overview of three key elements of Metaverse-as-a-service (MaaS) platforms: privacy and security, edge computing, and blockchain technology. The study begins by examining security concerns for wireless access to the Metaverse. It then delves into privacy and security issues within the Metaverse from data-centric, learning-centric, and human-centric perspectives. The authors propose novel and less-explored methods to aid mobile network operators and Metaverse service providers in creating secure and private MaaS platforms across various layers of the Metaverse, from access to social interactions. The article also explores the potential of edge computing to enhance various aspects of the Metaverse and the challenges associated with its implementation. Furthermore, the study examines the 10 main challenges of MaaS platforms and how blockchain technology can address them. Finally, the authors present future visions and recommendations, such as content-centric security and zero-trust Metaverse, as well as unresolved challenges in blockchain technology to provide insights for network designers in the Metaverse era. © 2023 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Gradual Domain Adaptation via Manifold-Constrained Distributionally Robust Optimization 38

Gradual Domain Adaptation via Manifold-Constrained Distribut...

引用

38th Conference on Neural information Processing systems, NeurIPS 2024

作者： Saberi, Amirhossein Najafi, Amir Behjati, Amin Emrani, Ala Zolfi, Yasaman Shadrooy, Mahdi Motahari, Abolfazl Khalaj, Babak H. Department of Electrical Engineering Sharif University of Technology Tehran Iran Department of Computer Engineering Sharif University of Technology Tehran Iran Sharif Center for Information Systems and Data Science Sharif University of Technology Tehran Iran

The aim of this paper is to address the challenge of gradual domain adaptation within a class of manifold-constrained data distributions. In particular, we consider a sequence of T ≥ 2 data distributions P1, ..., PT undergoing a gradual shift, where each pair of consecutive measures Pi, Pi+1 are close to each other in Wasserstein distance. We have a supervised dataset of size n sampled from P0, while for the subsequent distributions in the sequence, only unlabeled i.i.d. samples are available. Moreover, we assume that all distributions exhibit a known favorable attribute, such as (but not limited to) having intra-class soft/hard margins. In this context, we propose a methodology rooted in Distributionally Robust Optimization (DRO) with an adaptive Wasserstein radius. We theoretically show that this method guarantees the classification error across all Pis can be suitably bounded. Our bounds rely on a newly introduced compatibility measure, which fully characterizes the error propagation dynamics along the sequence. Specifically, for inadequately constrained distributions, the error can exponentially escalate as we progress through the gradual shifts. Conversely, for appropriately constrained distributions, the error can be demonstrated to be linear or even entirely eradicated. We have substantiated our theoretical findings through several experimental results. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fundamental Limits of Distributed Covariance Matrix Estimation Under Communication Constraints 41

Fundamental Limits of Distributed Covariance Matrix Estimati...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Rahmani, Mohammad Reza Yassaee, Mohammad Hossein Maddah-Ali, Mohammad Ali Aref, Mohammad Reza Department of Electrical Engineering Sharif University of Technology Tehran Iran Sharif Center for Information Systems and Data Science Sharif Institute for Convergence Science & Technology Tehran Iran Department of Electrical and Computer Engineering University of Minnesota Minneapolis United States

Estimating high-dimensional covariance matrices is crucial in various domains. This work considers a scenario where two collaborating agents access disjoint dimensions of m samples from a high-dimensional random vector, and they can only communicate a limited number of bits to a central server, which wants to accurately approximate the covariance matrix. We analyze the fundamental trade-off between communication cost, number of samples, and estimation accuracy. We prove a lower bound on the error achievable by any estimator, highlighting the impact of dimensions, number of samples, and communication budget. Furthermore, we present an algorithm that achieves this lower bound up to a logarithmic factor, demonstrating its near-optimality in practical settings. Copyright 2024 by the author(s)

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

A State-Migration Particle Swarm Optimizer for Adaptive Latent Factor Analysis of High-Dimensional and Incomplete data

引用

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2220-2235页

作者： Jiufang Chen Kechen Liu Xin Luo Ye Yuan Khaled Sedraoui Yusuf Al-Turki MengChu Zhou IEEE the College of Computer Science and Technology Chongqing University of Posts and Telecommunications the Department of Computer Science Columbia University the College of Computer and Information Science Southwest University the Department of Electrical and Computer Engineering Faculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Center of Research Excellence in Renewable Energy and Power Systems the Department of Electrical and Computer EngineeringFaculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Department of Electrical and Computer Engineering New Jersey Institute of Technology

High-dimensional and incomplete(HDI) matrices are primarily generated in all kinds of big-data-related practical applications. A latent factor analysis(LFA) model is capable of conducting efficient representation learning to an HDI matrix,whose hyper-parameter adaptation can be implemented through a particle swarm optimizer(PSO) to meet scalable ***, conventional PSO is limited by its premature issues,which leads to the accuracy loss of a resultant LFA model. To address this thorny issue, this study merges the information of each particle's state migration into its evolution process following the principle of a generalized momentum method for improving its search ability, thereby building a state-migration particle swarm optimizer(SPSO), whose theoretical convergence is rigorously proved in this study. It is then incorporated into an LFA model for implementing efficient hyper-parameter adaptation without accuracy loss. Experiments on six HDI matrices indicate that an SPSO-incorporated LFA model outperforms state-of-the-art LFA models in terms of prediction accuracy for missing data of an HDI matrix with competitive computational ***, SPSO's use ensures efficient and reliable hyper-parameter adaptation in an LFA model, thus ensuring practicality and accurate representation learning for HDI matrices.

关键词： data science generalized momentum high-dimensional and incomplete(HDI)data hyper-parameter adaptation latent factor analysis(LFA) particle swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

Gradual domain adaptation via manifold-constrained distributionally robust optimization 24

Gradual domain adaptation via manifold-constrained distribut...

引用

Proceedings of the 38th International Conference on Neural information Processing systems

作者： Amirhossein Saberi Amir Najafi Amin Behjati Ala Emrani Yasaman Zolfi Mahdi Shadrooy Abolfazl Motahari Babak H. Khalaj Department of Electrical Engineering and Sharif Center for Information Systems and Data Science Sharif University of Technology Tehran Iran Department of Computer Engineering Sharif University of Technology Tehran Iran

ISBN: (纸本)9798331314385

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Based Side-Channel Attack Detection for Mobile Devices Security in 5G Networks

引用

清华大学学报自然科学版（英文版） 2025年第3期30卷 1012-1026页

作者： Amjed A.Ahmed Mohammad Kamrul Hasan Ali Alqahtani Shayla Islam Bishwajeet Pandey Leila Rzayeva Huda Saleh Abbas Azana Hafizah Mohd Aman Nayef Alqahtani Center for Cyber Security Faculty of Information Science and TechnologyUniversiti Kebangsaan MalaysiaBangi 43600Malaysia Imam Alkadhim University College Department of Computer Techniques EngineeringBaghdad 10066Iraq Center for Cyber Security Faculty of Information Science and TechnologyUniversiti Kebangsaan MalaysiaBangi 43600Malaysia Department of Networks and Communications Engineering College of Computer Science and Information SystemsNajran UniversityNajran 61441Saudi Arabia Institute of Computer Science and Digital Innovation UCSI UniversityKuala Lumpur 56000Malaysia Department of Intelligent Systems and Cyber Security Astana IT UniversityAstana 20000Kazakstan Department of Computer Science College of Computer Science and EngineeringTaibah UniversityMadinah 42353Saudi Arabia Department of Electrical Engineering College of EngineeringKing Faisal UniversityAl-Hofuf 31982Saudi Arabia

Mobile devices within Fifth Generation(5G)networks,typically equipped with Android systems,serve as a bridge to connect digital gadgets such as global positioning system,mobile devices,and wireless routers,which are vital in facilitating end-user communication ***,the security of Android systems has been challenged by the sensitive data involved,leading to vulnerabilities in mobile devices used in 5G *** vulnerabilities expose mobile devices to cyber-attacks,primarily resulting from security ***-permission apps in Android can exploit these channels to access sensitive information,including user identities,login credentials,and geolocation *** such attack leverages"zero-permission"sensors like accelerometers and gyroscopes,enabling attackers to gather information about the smartphone's *** underscores the importance of fortifying mobile devices against potential future *** research focuses on a new recurrent neural network prediction model,which has proved highly effective for detecting side-channel attacks in mobile devices in 5G *** conducted state-of-the-art comparative studies to validate our experimental *** results demonstrate that even a small amount of training data can accurately recognize 37.5％of previously unseen user-typed ***,our tap detection mechanism achieves a 92％accuracy rate,a crucial factor for text *** findings have significant practical implications,as they reinforce mobile device security in 5G networks,enhancing user privacy,and data protection.

关键词： Fifth Generation(5G)networks smartphone information leakage Side-Channel Attack(SCA) deep learning

来源：评论

学校读者我要写书评

暂无评论

A Novel Metaverse-as-a-Service Architecture from an Operator View

A Novel Metaverse-as-a-Service Architecture from an Operator...

引用

Metaverse Computing, Networking and Applications (MetaCom), IEEE International Conference on

作者： Vesal Ahsani Ali Rahimi Mehdi Letafati Babak Hossein Khalaj Department of Electrical Engineering and Sharif Center for Information Systems and Data Science Sharif University of Technology Tehran Iran

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fundamental limits of distributed covariance matrix estimation under communication constraints 24

Fundamental limits of distributed covariance matrix estimati...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Mohammad Reza Rahmani Mohammad Hossein Yassaee Mohammad Ali Maddah-Ali Mohammad Reza Aref Department of Electrical Engineering Sharif University of Technology Tehran Iran Department of Electrical Engineering Sharif University of Technology Tehran Iran and Sharif Center for Information Systems and Data Science Sharif Institute for Convergence Science & Technology Tehran Iran Department of Electrical and Computer Engineering University of Minnesota Minneapolis

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mutual information oriented deep skill chaining for multi‐agent reinforcement learning

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 1014-1030页

作者： Zaipeng Xie Cheng Ji Chentai Qiao WenZhan Song Zewen Li Yufeng Zhang Yujing Zhang Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai UniversityNanjingChina College of Computer and Information Hohai UniversityNanjingChina Center for Cyber‐Physical Systems University of GeorgiaAthensGeorgiaUSA Information Networking Institute Carnegie Mellon UniversityPittsburghPennsylvaniaUSA Department of Electrical and Systems Engineering University of PennsylvaniaPhiladelphiaPennsylvaniaUSA

Multi‐agent reinforcement learning relies on reward signals to guide the policy networks of individual ***,in high‐dimensional continuous spaces,the non‐stationary environment can provide outdated experiences that hinder convergence,resulting in ineffective training performance for multi‐agent *** tackle this issue,a novel reinforcement learning scheme,Mutual information Oriented Deep Skill Chaining(MioDSC),is proposed that generates an optimised cooperative policy by incorporating intrinsic rewards based on mutual information to improve exploration *** rewards encourage agents to diversify their learning process by engaging in actions that increase the mutual information between their actions and the environment *** addition,MioDSC can generate cooperative policies using the options framework,allowing agents to learn and reuse complex action sequences and accelerating the convergence speed of multi‐agent *** was evaluated in the multi‐agent particle environment and the StarCraft multi‐agent challenge at varying difficulty *** experimental results demonstrate that MioDSC outperforms state‐of‐the‐art methods and is robust across various multi‐agent system tasks with high stability.

关键词： artificial intelligence techniques decision making intelligent multi‐agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：