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.
The perception in most existing vision-based reinforcement learning(RL) models for robotic manipulation relies heavily on static third-person or hand-mounted first-person cameras. In scenarios with occlusions and limi...
详细信息
The perception in most existing vision-based reinforcement learning(RL) models for robotic manipulation relies heavily on static third-person or hand-mounted first-person cameras. In scenarios with occlusions and limited maneuvering space, these carefully positioned cameras often struggle to provide effective visual observations during manipulation. Taking inspiration from human capabilities, we introduce a novel RL-based dual-arm active visual-guided manipulation model(DAVMM), which simultaneously infers “eye” actions and “hand” actions for two separate robotic arms(referred to as the vision-arm and the worker-arm) based on current observations, empowering the robot with the ability to actively perceive and interact with its environment. To handle the extensive redundant observation-action space, we propose a decouplable target-centric reward paradigm to offer stable guidance for the training process. For making fine-grained manipulation action decisions, alongside a global scene image encoder, we utilize an independent encoder to extract local target texture features,enabling the simultaneous acquisition of both global and detailed local information. Additionally, we employ residual-RL and curriculum learning techniques to further enhance our model's sample efficiency and training stability. We conducted comparative experiments and analyses of DAVMM against a set of strong baselines on three occluded and narrow-space manipulation tasks. DAVMM notably improves the success rates across all manipulation tasks and showcases rapid learning capabilities.
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.
Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical...
详细信息
Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.
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.
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.
Recently, redactable blockchain has been proposed and leveraged in a wide range of real systems for its unique properties of decentralization, traceability, and transparency while ensuring controllable on-chain data r...
详细信息
Recently, redactable blockchain has been proposed and leveraged in a wide range of real systems for its unique properties of decentralization, traceability, and transparency while ensuring controllable on-chain data redaction. However, the development of redactable blockchain is now obstructed by three limitations, which are data privacy breaches, high communication overhead, and low searching efficiency, respectively. In this paper, we propose PriChain, the first efficient privacy-preserving fine-grained redactable blockchain in decentralized settings. PriChain provides data owners with rights to control who can read and redact on-chain data while maintaining downward compatibility, ensuring the one who can redact will be able to read. Specifically, inspired by the concept of multi-authority attribute-based encryption, we utilize the isomorphism of the access control tree, realizing fine-grained redaction mechanism, downward compatibility, and collusion resistance. With the newly designed structure, PriChain can realize O（n） communication and storage overhead compared to prior O（n2） schemes. Furthermore, we integrate multiple access trees into a tree-based dictionary, optimizing searching efficiency. Theoretical analysis proves that PriChain is secure against the chosen-plaintext attack and has competitive complexity. The experimental evaluations show that PriChain realizes 10× efficiency improvement of searching and 100× lower communication and storage overhead on average compared with existing schemes.
Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lac...
详细信息
Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation（AEFR） for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism（GAM） in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning（D2-CL） to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.
The distributed optimal output synchronization problem for the leaderless heterogeneous multi-agent system with a general global cost function is investigated for the first time by linear quadratic(LQ) optimal control...
详细信息
The distributed optimal output synchronization problem for the leaderless heterogeneous multi-agent system with a general global cost function is investigated for the first time by linear quadratic(LQ) optimal control theory. Conventional algorithms for heterogeneous systems are quite complex, requiring the design of a virtual reference generator and the solving of regulation *** paper presents a novel distributed asymptotically optimal controller by incorporating the design of distributed observer and feedforward controller. A general form of the distributed controller is obtained by solving an augmented algebraic Riccati equation, which is parallel to classical optimal control theory. The optimal topology is an arbitrary directed graph containing only a spanning tree. It is shown that the proposed algorithms outperform the traditional consensus methods in the convergence speed by selecting proper observer gain matrices, and eliminate the reliance on the nonzero eigenvalues of Laplacian matrix. Simulation example further demonstrates the effectiveness of the proposed scheme and a faster superlinear convergence speed than the existing algorithm.
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.
暂无评论