Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inher...
详细信息
Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.
With the rise of artificial intelligence and cloud computing, machine-learning-as-a-service platforms,such as Google, Amazon, and IBM, have emerged to provide sophisticated tasks for cloud applications. These propriet...
详细信息
With the rise of artificial intelligence and cloud computing, machine-learning-as-a-service platforms,such as Google, Amazon, and IBM, have emerged to provide sophisticated tasks for cloud applications. These proprietary models are vulnerable to model extraction attacks due to their commercial value. In this paper, we propose a time-efficient model extraction attack framework called Swift Theft that aims to steal the functionality of cloud-based deep neural network models. We distinguish Swift Theft from the existing works with a novel distribution estimation algorithm and reference model settings, finding the most informative query samples without querying the victim model. The selected query samples can be applied to various cloud models with a one-time selection. We evaluate our proposed method through extensive experiments on three victim models and six datasets, with up to 16 models for each dataset. Compared to the existing attacks, Swift Theft increases agreement(i.e., similarity) by 8% while consuming 98% less selecting time.
Backdoor attacks pose great threats to deep neural network models. All existing backdoor attacks are designed for unstructured data(image, voice, and text), but not structured tabular data, which has wide real-world a...
详细信息
Backdoor attacks pose great threats to deep neural network models. All existing backdoor attacks are designed for unstructured data(image, voice, and text), but not structured tabular data, which has wide real-world applications, e.g., recommendation systems, fraud detection, and click-through rate prediction. To bridge this research gap, we make the first attempt to design a backdoor attack framework, named BAD-FM, for tabular data prediction models. Unlike images or voice samples composed of homogeneous pixels or signals with continuous values, tabular data samples contain well-defined heterogeneous fields that are usually sparse and discrete. Tabular data prediction models do not solely rely on deep networks but combine shallow components(e.g., factorization machine, FM) with deep components to capture sophisticated feature interactions among fields. To tailor the backdoor attack framework to tabular data models, we carefully design field selection and trigger formation algorithms to intensify the influence of the trigger on the backdoored model. We evaluate BAD-FM with extensive experiments on four datasets, i.e.,HUAWEI, Criteo, Avazu, and KDD. The results show that BAD-FM can achieve an attack success rate as high as 100%at a poisoning ratio of 0.001%, outperforming baselines adapted from existing backdoor attacks against unstructured data models. As tabular data prediction models are widely adopted in finance and commerce, our work may raise alarms on the potential risks of these models and spur future research on defenses.
Co-saliency detection within a single image is a common vision problem that has not yet been well addressed. Existing methods often used a bottom-up strategy to infer co-saliency in an image in which salient regions a...
详细信息
Co-saliency detection within a single image is a common vision problem that has not yet been well addressed. Existing methods often used a bottom-up strategy to infer co-saliency in an image in which salient regions are firstly detected using visual primitives such as color and shape and then grouped and merged into a co-saliency map. However, co-saliency is intrinsically perceived complexly with bottom-up and top-down strategies combined in human vision. To address this problem, this study proposes a novel end-toend trainable network comprising a backbone net and two branch nets. The backbone net uses ground-truth masks as top-down guidance for saliency prediction, whereas the two branch nets construct triplet proposals for regional feature mapping and clustering, which drives the network to be bottom-up sensitive to co-salient regions. We construct a new dataset of 2019 natural images with co-saliency in each image to evaluate the proposed method. Experimental results show that the proposed method achieves state-of-the-art accuracy with a running speed of 28 fps.
Over-the-air computation(AirComp)enables federated learning(FL)to rapidly aggregate local models at the central server using waveform superposition property of wireless *** this paper,a robust transmission scheme for ...
详细信息
Over-the-air computation(AirComp)enables federated learning(FL)to rapidly aggregate local models at the central server using waveform superposition property of wireless *** this paper,a robust transmission scheme for an AirCompbased FL system with imperfect channel state information(CSI)is *** model CSI uncertainty,an expectation-based error model is *** main objective is to maximize the number of selected devices that meet mean-squared error(MSE)requirements for model broadcast and model *** problem is formulated as a combinatorial optimization problem and is solved in two ***,the priority order of devices is determined by a sparsity-inducing ***,a feasibility detection scheme is used to select the maximum number of devices to guarantee that the MSE requirements are *** alternating optimization(AO)scheme is used to transform the resulting nonconvex problem into two convex *** results illustrate the effectiveness and robustness of the proposed scheme.
Numerical simulation is employed to investigate the initial state of avalanche in polydisperse particle *** and propagation processes are illustrated for pentadisperse and triadisperse particle systems,*** these proce...
详细信息
Numerical simulation is employed to investigate the initial state of avalanche in polydisperse particle *** and propagation processes are illustrated for pentadisperse and triadisperse particle systems,*** these processes,particles involved in the avalanche grow slowly in the early stage and explosively in the later stage,which is clearly different from the continuous and steady growth trend in the monodisperse *** examining the avalanche propagation,the number growth of particles involved in the avalanche and the slope of the number growth,the initial state can be divided into three stages:T1(nucleation stage),T2(propagation stage),T3(overall avalanche stage).We focus on the characteristics of the avalanche in the T2 stage,and find that propagation distances increase almost linearly in both axial and radial directions in polydisperse *** also consider the distribution characteristics of the average coordination number and average velocity for the moving *** results support that the polydisperse particle systems are more stable in the T2 stage.
This letter proposes a reliable transfer learning(RTL)method for pre-fault dynamic security assessment(DSA)in power systems to improve DSA performance in the presence of potentially related unknown *** takes individua...
详细信息
This letter proposes a reliable transfer learning(RTL)method for pre-fault dynamic security assessment(DSA)in power systems to improve DSA performance in the presence of potentially related unknown *** takes individual discrepancies into consideration and can handle unknown faults with incomplete *** experiment results demonstrate high DSA accuracy and computational efficiency of the proposed RTL *** analysis shows RTL can guarantee system performance.
Metapaths with specific complex semantics are critical to learning diverse semantic and structural information of heterogeneous networks(HNs)for most of the existing representation learning ***,any metapaths consistin...
详细信息
Metapaths with specific complex semantics are critical to learning diverse semantic and structural information of heterogeneous networks(HNs)for most of the existing representation learning ***,any metapaths consisting of multiple,simple metarelations must be driven by domain *** sensitive,expensive,and limited metapaths severely reduce the flexibility and scalability of the existing models.A metapath-free,scalable representation learning model,called Metarelation2vec,is proposed for HNs with biased joint learning of all metarelations in a bid to address this ***,a metarelation-aware,biased walk strategy is first designed to obtain better training samples by using autogenerating cooperation probabilities for all metarelations rather than using expert-given ***,grouped nodes by the type,a common and shallow skip-gram model is used to separately learn structural proximity for each node ***,grouped links by the type,a novel and shallow model is used to separately learn the semantic proximity for each link ***,supervised by the cooperation probabilities of all meta-words,the biased training samples are thrown into the shallow models to jointly learn the structural and semantic information in the HNs,ensuring the accuracy and scalability of the *** experimental results on three tasks and four open datasets demonstrate the advantages of our proposed model.
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention...
详细信息
As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.
Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least t...
详细信息
Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.
暂无评论