Searcharxiv⌕ Search

arXiv subjects

Wei Guo

Publications and source records attributed to Wei Guo.

At least 199 records · Page 11Linked to original sources
arXiv2023

APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation

The sequential recommendation system has been widely studied for its promising effectiveness in capturing dynamic preferences buried in users' sequential behaviors. Despite the considerable achievements, existing methods usually focus on intra-sequence modeling while overlooking exploiting global collaborative information by inter-sequence modeling, resulting in inferior recommendation performance. Therefore, previous works attempt to tackle this problem with a global collaborative item graph constructed by pre-defined rules. However, these methods neglect two crucial properties when capturing global collaborative information, i.e., adaptiveness and personalization, yielding sub-optimal user representations. To this end, we propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR), that incorporates adaptive and personalized global collaborative information into sequential recommendation systems. Specifically, we first learn an adaptive global graph among all items and capture global collaborative information with it in a self-supervised fashion, whose computational burden can be further alleviated by the proposed SVD-based accelerator. Furthermore, based on the graph, we propose to extract and utilize personalized item correlations in the form of relative positional encoding, which is a highly compatible manner of personalizing the utilization of global collaborative information. Finally, the entire framework is optimized in a multi-task learning paradigm, thus each part of APGL4SR can be mutually reinforced. As a generic framework, APGL4SR can outperform other baselines with significant margins. The code is available at https://github.com/Graph-Team/APGL4SR.

cs.IR↗
arXiv2023

Boiling peak heat flux for steady inhomogeneous heat transfer in superfluid $^4$He

Superfluid helium-4 (He II) is a widely adopted coolant in scientific and engineering applications owing to its exceptional heat transfer capabilities. However, boiling can spontaneously occur on a heating surface in He II when the heat flux exceeds a threshold value $q^*$, referred to as the peak heat flux. While the parameter $q^*$ holds paramount importance in the design of He II based cooling systems, extensive research has primarily focused on its behavior in steady homogeneous heat transfer from a flat heating surface. For inhomogeneous heat transfer from curved surfaces, $q^*$ exhibits intricate dependance on parameters such as the He II bath temperature $T_b$, the immersion depth $h$, and the curvature radius $R_0$ of the heating surface. A comprehensive understanding on how $q^*$ depends on these parameters remains elusive. In this paper, we report our systematic study on $q^*$ for steady heat transfer from cylindrical and spherical heaters in He II. We compute $q^*$ for a wide range of parameter combinations $(T_b, h, R_0)$ by solving the He II two-fluid equations of motion. The generated data have allowed us to develop a robust correlation that accurately reproduces $q^*$ for all the parameter combinations we explored. Our findings, particularly the establishment of the correlation, carry valuable implications for emergent applications that involve steady inhomogeneous heat transfer in He II systems.

cond-mat.other↗
arXiv2023

Universal Detection of Backdoor Attacks via Density-based Clustering and Centroids Analysis

We propose a Universal Defence against backdoor attacks based on Clustering and Centroids Analysis (CCA-UD). The goal of the defence is to reveal whether a Deep Neural Network model is subject to a backdoor attack by inspecting the training dataset. CCA-UD first clusters the samples of the training set by means of density-based clustering. Then, it applies a novel strategy to detect the presence of poisoned clusters. The proposed strategy is based on a general misclassification behaviour observed when the features of a representative example of the analysed cluster are added to benign samples. The capability of inducing a misclassification error is a general characteristic of poisoned samples, hence the proposed defence is attack-agnostic. This marks a significant difference with respect to existing defences, that, either can defend against only some types of backdoor attacks, or are effective only when some conditions on the poisoning ratio or the kind of triggering signal used by the attacker are satisfied. Experiments carried out on several classification tasks and network architectures, considering different types of backdoor attacks (with either clean or corrupted labels), and triggering signals, including both global and local triggering signals, as well as sample-specific and source-specific triggers, reveal that the proposed method is very effective to defend against backdoor attacks in all the cases, always outperforming the state of the art techniques.

cs.CV↗
arXiv2023

A multi-fidelity machine learning based semi-Lagrangian finite volume scheme for linear transport equations and the nonlinear Vlasov-Poisson system

Machine-learning (ML) based discretization has been developed to simulate complex partial differential equations (PDEs) with tremendous success across various fields. These learned PDE solvers can effectively resolve the underlying solution structures of interest and achieve a level of accuracy which often requires an order-of-magnitude finer grid for a conventional numerical method using polynomial-based approximations. In a previous work in [13], we introduced a learned finite volume discretization that further incorporates the semi-Lagrangian (SL) mechanism, enabling larger CFL numbers for stability. However, the efficiency and effectiveness of such methodology heavily rely on the availability of abundant high-resolution training data, which can be prohibitively expensive to obtain. To address this challenge, in this paper, we propose a novel multi-fidelity ML-based SL method for transport equations. This method leverages a combination of a small amount of high-fidelity data and sufficient but cheaper low-fidelity data. The approach is designed based on a composite convolutional neural network architecture that explore the inherent correlation between high-fidelity and low-fidelity data. The proposed method demonstrates the capability to achieve a reasonable level of accuracy, particularly in scenarios where a single-fidelity model fails to generalize effectively. We further extend the method to the nonlinear Vlasov-Poisson system by employing high order Runge-Kutta exponential integrators. A collection of numerical tests are provided to validate the efficiency and accuracy of the proposed method.

math.NA↗
arXiv2023

Flexible and Robust Counterfactual Explanations with Minimal Satisfiable Perturbations

Counterfactual explanations (CFEs) exemplify how to minimally modify a feature vector to achieve a different prediction for an instance. CFEs can enhance informational fairness and trustworthiness, and provide suggestions for users who receive adverse predictions. However, recent research has shown that multiple CFEs can be offered for the same instance or instances with slight differences. Multiple CFEs provide flexible choices and cover diverse desiderata for user selection. However, individual fairness and model reliability will be damaged if unstable CFEs with different costs are returned. Existing methods fail to exploit flexibility and address the concerns of non-robustness simultaneously. To address these issues, we propose a conceptually simple yet effective solution named Counterfactual Explanations with Minimal Satisfiable Perturbations (CEMSP). Specifically, CEMSP constrains changing values of abnormal features with the help of their semantically meaningful normal ranges. For efficiency, we model the problem as a Boolean satisfiability problem to modify as few features as possible. Additionally, CEMSP is a general framework and can easily accommodate more practical requirements, e.g., casualty and actionability. Compared to existing methods, we conduct comprehensive experiments on both synthetic and real-world datasets to demonstrate that our method provides more robust explanations while preserving flexibility.

cs.LG↗
arXiv2023

Adaptive Multi-Modalities Fusion in Sequential Recommendation Systems

In sequential recommendation, multi-modal information (e.g., text or image) can provide a more comprehensive view of an item's profile. The optimal stage (early or late) to fuse modality features into item representations is still debated. We propose a graph-based approach (named MMSR) to fuse modality features in an adaptive order, enabling each modality to prioritize either its inherent sequential nature or its interplay with other modalities. MMSR represents each user's history as a graph, where the modality features of each item in a user's history sequence are denoted by cross-linked nodes. The edges between homogeneous nodes represent intra-modality sequential relationships, and the ones between heterogeneous nodes represent inter-modality interdependence relationships. During graph propagation, MMSR incorporates dual attention, differentiating homogeneous and heterogeneous neighbors. To adaptively assign nodes with distinct fusion orders, MMSR allows each node's representation to be asynchronously updated through an update gate. In scenarios where modalities exhibit stronger sequential relationships, the update gate prioritizes updates among homogeneous nodes. Conversely, when the interdependent relationships between modalities are more pronounced, the update gate prioritizes updates among heterogeneous nodes. Consequently, MMSR establishes a fusion order that spans a spectrum from early to late modality fusion. In experiments across six datasets, MMSR consistently outperforms state-of-the-art models, and our graph propagation methods surpass other graph neural networks. Additionally, MMSR naturally manages missing modalities.

cs.IR↗
arXiv2023

Time-aligned Exposure-enhanced Model for Click-Through Rate Prediction

Click-Through Rate (CTR) prediction, crucial in applications like recommender systems and online advertising, involves ranking items based on the likelihood of user clicks. User behavior sequence modeling has marked progress in CTR prediction, which extracts users' latent interests from their historical behavior sequences to facilitate accurate CTR prediction. Recent research explores using implicit feedback sequences, like unclicked records, to extract diverse user interests. However, these methods encounter key challenges: 1) temporal misalignment due to disparate sequence time ranges and 2) the lack of fine-grained interaction among feedback sequences. To address these challenges, we propose a novel framework called TEM4CTR, which ensures temporal alignment among sequences while leveraging auxiliary feedback information to enhance click behavior at the item level through a representation projection mechanism. Moreover, this projection-based information transfer module can effectively alleviate the negative impact of irrelevant or even potentially detrimental components of the auxiliary feedback information on the learning process of click behavior. Comprehensive experiments on public and industrial datasets confirm the superiority and effectiveness of TEM4CTR, showcasing the significance of temporal alignment in multi-feedback modeling.

cs.IR↗
arXiv2023

MAP: A Model-agnostic Pretraining Framework for Click-through Rate Prediction

With the widespread application of personalized online services, click-through rate (CTR) prediction has received more and more attention and research. The most prominent features of CTR prediction are its multi-field categorical data format, and vast and daily-growing data volume. The large capacity of neural models helps digest such massive amounts of data under the supervised learning paradigm, yet they fail to utilize the substantial data to its full potential, since the 1-bit click signal is not sufficient to guide the model to learn capable representations of features and instances. The self-supervised learning paradigm provides a more promising pretrain-finetune solution to better exploit the large amount of user click logs, and learn more generalized and effective representations. However, self-supervised learning for CTR prediction is still an open question, since current works on this line are only preliminary and rudimentary. To this end, we propose a Model-agnostic pretraining (MAP) framework that applies feature corruption and recovery on multi-field categorical data, and more specifically, we derive two practical algorithms: masked feature prediction (MFP) and replaced feature detection (RFD). MFP digs into feature interactions within each instance through masking and predicting a small portion of input features, and introduces noise contrastive estimation (NCE) to handle large feature spaces. RFD further turns MFP into a binary classification mode through replacing and detecting changes in input features, making it even simpler and more effective for CTR pretraining. Our extensive experiments on two real-world large-scale datasets (i.e., Avazu, Criteo) demonstrate the advantages of these two methods on several strong backbones (e.g., DCNv2, DeepFM), and achieve new state-of-the-art performance in terms of both effectiveness and efficiency for CTR prediction.

cs.IR↗
arXiv2023

ATWM: Defense against adversarial malware based on adversarial training

Deep learning technology has made great achievements in the field of image. In order to defend against malware attacks, researchers have proposed many Windows malware detection models based on deep learning. However, deep learning models are vulnerable to adversarial example attacks. Malware can generate adversarial malware with the same malicious function to attack the malware detection model and evade detection of the model. Currently, many adversarial defense studies have been proposed, but existing adversarial defense studies are based on image sample and cannot be directly applied to malware sample. Therefore, this paper proposes an adversarial malware defense method based on adversarial training. This method uses preprocessing to defend simple adversarial examples to reduce the difficulty of adversarial training. Moreover, this method improves the adversarial defense capability of the model through adversarial training. We experimented with three attack methods in two sets of datasets, and the results show that the method in this paper can improve the adversarial defense capability of the model without reducing the accuracy of the model.

cs.CR↗
arXiv2023

Nano-Subsidence Assisted Precise Integration of Patterned Two-Dimensional Materials for High-Performance Photodetector Arrays

The spatially precise integration of arrays of micro-patterned two-dimensional (2D) crystals onto three-dimensionally structured Si/SiO$_2$ substrates represents an attractive strategy towards the low-cost system-on-chip integration of extended functions in silicon microelectronics. However, the reliable integration of the arrays of 2D materials on non-flat surfaces has thus far proved extremely challenging due to their poor adhesion to underlying substrates as ruled by weak van der Waals interactions. Here we report on a novel fabrication method based on nano-subsidence which enables the precise and reliable integration of the micro-patterned 2D materials/silicon photodiode arrays exhibiting high uniformity. Our devices display peak sensitivity as high as 0.35 A/W and external quantum efficiency (EQE) of ca. 90%, outperforming most commercial photodiodes. The nano-subsidence technique opens a viable path to on-chip integrate 2D crystals onto silicon for beyond-silicon microelectronics.

physics.app-ph↗
arXiv2023

Heat and mass transfer during a sudden loss of vacuum in a liquid helium cooled tube -- Part IV: Freeze range

In a series of papers (i.e., Part I--III), we presented our systematic study on nitrogen gas propagation in an evacuated copper tube cooled by liquid helium. This research aims to gain insights into the coupled heat and mass transfer processes involved in a catastrophic vacuum loss in superconducting particle accelerator beamline tubes. Our experimental measurements on nitrogen gas propagation in both normal liquid helium (He I) and superfluid helium (He II) cooled tube revealed a nearly exponential deceleration of the gas propagation. A theoretical model that accounts for the gas dynamics, heat transfer, and condensation was also developed, and various key experimental observations were nicely reproduced in our model simulations. A particularly interesting phenomenon uncovered in our study is that the gas propagation appears to nearly stop beyond a certain distance from the location where condensation starts. We refer to this distance as the freeze range. In this paper, we present our detailed analysis of the freeze range at various inlet mass fluxes and tube diameters. We show that the results can be well described by a simple correlation. The physical mechanism underlying this useful correlation is explained. Knowing the freeze range may allow accelerator engineers to develop protocols for controlling frost-layer contamination in the beamline tubes, which should be of practical importance.

physics.acc-ph↗
arXiv2023

$SL(2,R)\times U(1)$ symmetry and quasinormal modes in the self-dual warped AdS black hole

The algebraic approach to the spectrum of quasinormal modes has been made as simple as possible for the BTZ black hole by the strategy developed in \cite{Zhang}. By working with the self-dual warped AdS black hole, we demonstrate in an explicit way that such a strategy can be well adapted to those warped AdS balck holes with the $SL(2,R)\times U(1)$ isometry. To this end, we first introduce two associated tensor fields with the quadratic Casimir of $SL(2,R)\times U(1)$ Lie algebra in the self-dual warped AdS black hole and show that they correspond essentially to the metric and volume element up to a constant prefactor, respectively. Then without appealing to any concrete coordinate system, we can further show that the solutions to the equations of motion for the scalar, vector, spinor fields all fall into the representations of the $SL(2,R)\times U(1)$ Lie algebra by a purely abstract tensor and spinor analysis. Accordingly, the corresponding spectrum of quasinormal modes for each fixed azimuthal quantum number can be derived algebraically as the infinite tower of descendants of the highest weight mode of the $SL(2,R)$ Lie subalgebra.

hep-th↗
arXiv2023

FGAM:Fast Adversarial Malware Generation Method Based on Gradient Sign

Malware detection models based on deep learning have been widely used, but recent research shows that deep learning models are vulnerable to adversarial attacks. Adversarial attacks are to deceive the deep learning model by generating adversarial samples. When adversarial attacks are performed on the malware detection model, the attacker will generate adversarial malware with the same malicious functions as the malware, and make the detection model classify it as benign software. Studying adversarial malware generation can help model designers improve the robustness of malware detection models. At present, in the work on adversarial malware generation for byte-to-image malware detection models, there are mainly problems such as large amount of injection perturbation and low generation efficiency. Therefore, this paper proposes FGAM (Fast Generate Adversarial Malware), a method for fast generating adversarial malware, which iterates perturbed bytes according to the gradient sign to enhance adversarial capability of the perturbed bytes until the adversarial malware is successfully generated. It is experimentally verified that the success rate of the adversarial malware deception model generated by FGAM is increased by about 84\% compared with existing methods.

cs.CR↗
arXiv2023

Epitaxial growth and electronic structure of Ruddlesden-Popper nickelates ($ \mathrm{La}_{n+1}\mathrm{Ni}_{n}\mathrm{O}_{3n+1}, n=1-5 $)

We report the epitaxial growth of Ruddlesden-Popper nickelates, $ \mathrm{La}_{n+1}\mathrm{Ni}_{n}\mathrm{O}_{3n+1} $, with $ n $ up to 5 by reactive molecular beam epitaxy (MBE). X-ray diffractions indicate high crystalline quality of these films and transport measurements show strong dependence on the $ n $ values. Angle-resolved photoemission spectroscopy (ARPES) reveals the electronic structure of $ \mathrm{La}_{5}\mathrm{Ni}_{4}\mathrm{O}_{13} $, showing a large hole-like pocket centered around the Brillouin zone corner with a $ (π, π) $ back-folded copy.

cond-mat.supr-con↗
arXiv2023

Compressed Interaction Graph based Framework for Multi-behavior Recommendation

Multi-types of user behavior data (e.g., clicking, adding to cart, and purchasing) are recorded in most real-world recommendation scenarios, which can help to learn users' multi-faceted preferences. However, it is challenging to explore multi-behavior data due to the unbalanced data distribution and sparse target behavior, which lead to the inadequate modeling of high-order relations when treating multi-behavior data ''as features'' and gradient conflict in multitask learning when treating multi-behavior data ''as labels''. In this paper, we propose CIGF, a Compressed Interaction Graph based Framework, to overcome the above limitations. Specifically, we design a novel Compressed Interaction Graph Convolution Network (CIGCN) to model instance-level high-order relations explicitly. To alleviate the potential gradient conflict when treating multi-behavior data ''as labels'', we propose a Multi-Expert with Separate Input (MESI) network with separate input on the top of CIGCN for multi-task learning. Comprehensive experiments on three large-scale real-world datasets demonstrate the superiority of CIGF. Ablation studies and in-depth analysis further validate the effectiveness of our proposed model in capturing high-order relations and alleviating gradient conflict. The source code and datasets are available at https://github.com/MC-CV/CIGF.

cs.IR↗
arXiv2023

A holistically 3D-printed flexible millimeter-wave Doppler radar: Towards fully printed high-frequency multilayer flexible hybrid electronics systems

Flexible hybrid electronics (FHE) is an emerging technology enabled through the integration of advanced semiconductor devices and 3D printing technology. It unlocks tremendous market potential by realizing low-cost flexible circuits and systems that can be conformally integrated into various applications. However, the operating frequencies of most reported FHE systems are relatively low. It is also worth to note that reported FHE systems have been limited to relatively simple design concept (since complex systems will impose challenges in aspects such as multilayer interconnections, printing materials, and bonding layers). Here, we report a fully 3D-printed flexible four-layer millimeter-wave Doppler radar (i.e., a millimeter-wave FHE system). The sensing performance and flexibility of the 3D-printed radar are characterized and validated by general field tests and bending tests, respectively. Our results demonstrate the feasibility of developing fully 3D-printed high-frequency multilayer FHE, which can be conformally integrated into irregular surfaces (e.g., vehicle bumpers) for applications such as vehicle radars and wearable electronics.

eess.SY↗
arXiv2023

Incentive-boosted Federated Crowdsourcing

Crowdsourcing is a favorable computing paradigm for processing computer-hard tasks by harnessing human intelligence. However, generic crowdsourcing systems may lead to privacy-leakage through the sharing of worker data. To tackle this problem, we propose a novel approach, called iFedCrowd (incentive-boosted Federated Crowdsourcing), to manage the privacy and quality of crowdsourcing projects. iFedCrowd allows participants to locally process sensitive data and only upload encrypted training models, and then aggregates the model parameters to build a shared server model to protect data privacy. To motivate workers to build a high-quality global model in an efficacy way, we introduce an incentive mechanism that encourages workers to constantly collect fresh data to train accurate client models and boosts the global model training. We model the incentive-based interaction between the crowdsourcing platform and participating workers as a Stackelberg game, in which each side maximizes its own profit. We derive the Nash Equilibrium of the game to find the optimal solutions for the two sides. Experimental results confirm that iFedCrowd can complete secure crowdsourcing projects with high quality and efficiency.

cs.GT↗
arXiv2023

A Survey on User Behavior Modeling in Recommender Systems

User Behavior Modeling (UBM) plays a critical role in user interest learning, which has been extensively used in recommender systems. Crucial interactive patterns between users and items have been exploited, which brings compelling improvements in many recommendation tasks. In this paper, we attempt to provide a thorough survey of this research topic. We start by reviewing the research background of UBM. Then, we provide a systematic taxonomy of existing UBM research works, which can be categorized into four different directions including Conventional UBM, Long-Sequence UBM, Multi-Type UBM, and UBM with Side Information. Within each direction, representative models and their strengths and weaknesses are comprehensively discussed. Besides, we elaborate on the industrial practices of UBM methods with the hope of providing insights into the application value of existing UBM solutions. Finally, we summarize the survey and discuss the future prospects of this field.

cs.IR↗