Searcharxiv⌕ Search

arXiv subjects

Fei Sun

Publications and source records attributed to Fei Sun.

At least 109 records · Page 6Linked to original sources

The Splitting of Chiral and Deconfinement Phase Transitions induced by Rotation

The chiral and deconfinement phase transitions under rotation have been simultaneously investigated in the Polyakov-Nambu-Jona-Lasinio (PNJL) model. An interesting observation has been found that the chiral phase transition is catalyzed and the deconfinement phase transition is decelerated by rotation, therefore a chiral symmetric but confined phase is induced by rotation, which indicates that chiral dynamics and gluon dynamics can be split by rotation.

hep-ph↗

The rotation effect on the thermodynamics of the QCD matter

In this study, we investigate the impact of rotation on the thermodynamic characteristics of QCD matter using the three-flavor NJL model. We examine the temperature, quark chemical potential, and angular velocity dependencies of key thermodynamic quantities, such as the trace anomaly, specific heat, speed of sound, angular momentum, and moment of inertia. As the main finding of our analysis, we observe that the speed of sound exhibits a nonmonotonic behavior as the angular velocity changes.

hep-ph↗

Adversarial Camouflage for Node Injection Attack on Graphs

Node injection attacks on Graph Neural Networks (GNNs) have received increasing attention recently, due to their ability to degrade GNN performance with high attack success rates. However, our study indicates that these attacks often fail in practical scenarios, since defense/detection methods can easily identify and remove the injected nodes. To address this, we devote to camouflage node injection attack, making injected nodes appear normal and imperceptible to defense/detection methods. Unfortunately, the non-Euclidean structure of graph data and the lack of intuitive prior present great challenges to the formalization, implementation, and evaluation of camouflage. In this paper, we first propose and define camouflage as distribution similarity between ego networks of injected nodes and normal nodes. Then for implementation, we propose an adversarial CAmouflage framework for Node injection Attack, namely CANA, to improve attack performance under defense/detection methods in practical scenarios. A novel camouflage metric is further designed under the guide of distribution similarity. Extensive experiments demonstrate that CANA can significantly improve the attack performance under defense/detection methods with higher camouflage or imperceptibility. This work urges us to raise awareness of the security vulnerabilities of GNNs in practical applications.

cs.LG↗

A Large Language Model Enhanced Conversational Recommender System

Conversational recommender systems (CRSs) aim to recommend high-quality items to users through a dialogue interface. It usually contains multiple sub-tasks, such as user preference elicitation, recommendation, explanation, and item information search. To develop effective CRSs, there are some challenges: 1) how to properly manage sub-tasks; 2) how to effectively solve different sub-tasks; and 3) how to correctly generate responses that interact with users. Recently, Large Language Models (LLMs) have exhibited an unprecedented ability to reason and generate, presenting a new opportunity to develop more powerful CRSs. In this work, we propose a new LLM-based CRS, referred to as LLMCRS, to address the above challenges. For sub-task management, we leverage the reasoning ability of LLM to effectively manage sub-task. For sub-task solving, we collaborate LLM with expert models of different sub-tasks to achieve the enhanced performance. For response generation, we utilize the generation ability of LLM as a language interface to better interact with users. Specifically, LLMCRS divides the workflow into four stages: sub-task detection, model matching, sub-task execution, and response generation. LLMCRS also designs schema-based instruction, demonstration-based instruction, dynamic sub-task and model matching, and summary-based generation to instruct LLM to generate desired results in the workflow. Finally, to adapt LLM to conversational recommendations, we also propose to fine-tune LLM with reinforcement learning from CRSs performance feedback, referred to as RLPF. Experimental results on benchmark datasets show that LLMCRS with RLPF outperforms the existing methods.

cs.IR↗

Second order add/drop filter with a single ring resonator

We show theoretically and experimentally how a flat-top second-order response can be achieved with a self-coupled single add-drop ring resonator based on two couplers with different splitting ratios. The resulting device is a 1x1 filter, reflecting light back in the input waveguide at resonating wavelengths in the passbands, and transmitting light in the output waveguide at all other non-resonating wavelengths. Different implementations of the filter have been designed and fabricated on a micron-scale silicon photonics platform. They are based on compact Euler bends - either U-bends or L-bends - and Multi-Mode Interferometers as splitters for the ring resonators. Different finesse values have been achieved by using either 50:50 MMIs in conjunction with 85:15 MMIs or 85:15 MMIs in conjunction with 95:05 double MMIs. Unlike ordinary lowest order directional couplers, the MMIs couple most of the power in the cross-port which make them particularly suitable for the topology of the self-coupled ring, which would otherwise require a waveguide crossing. Experimental results are presented, showing good agreement with simulations. The proposed devices can find applications as wavelength-selective reflectors for relatively broad-band lasers or used as 2x2 add-drop filters when two exact replicas of the device are placed on the arms of a Mach-Zehnder interferometer.

physics.optics↗

Tapered MMI splitters with unconstrained splitting ratio on a thick SOI platform

We have systematically studied multimode interferometer (MMI) splitters made from multiple tapered sections. The goal is to create a library of robust and low-loss splitters covering all splitting ratios (SR) for our silicon photonics platform based on 3 $μ$m thick waveguides. The starting point is always a non-tapered canonical MMI either with general symmetry (canonical SRs 50:50, 100:0, and reciprocal ratios), with mirror symmetric restricted symmetry (canonical SRs 85:15, 50:50, 100:0, and reciprocal ratios), and with point-symmetric restricted symmetry (canonical SRs 72:28 and 28:72). Splitters of these three types are then divided into one to four subsections of equal length, leading to 12 possible different configurations. In each of these subsections, the width is first linearly tapered either up or down and then tapered back to its starting value ensuring mirror symmetry. For all twelve configurations, we carried out an extensive campaign of numerical simulations. For each given width change, we scanned the splitter length and calculated the power in the fundamental mode at the output as well as its relative phase. We then selected the designs with sufficiently low loss and mapped their SR as a function of either the change in width change or length, therefore creating systematic maps for the design of MMI splitters with any SR. Eventually, we selected and fabricated a subset of designs with SRs ranging from 5:95 to 95:5 in steps of 5% and validated their operation through optical measurements.

physics.optics↗

Simultaneously realizing thermal and electromagnetic cloaking by multi-physical null medium

Simultaneously manipulating multiple physical fields plays an important role in the increasingly complex integrated systems, aerospace equipment, biochemical productions, etc. For on-chip systems with high integration level (e.g., electronic/photonic chips and radio-frequency/microwave circuits), where both electromagnetic information/energy transporting and heat dissipation/recovery need to be considered, the precise and efficient control of the propagation of electromagnetic waves and heat fluxes simultaneously is particularly important. In this study, we propose a graphical designing method based on thermal-electromagnetic null medium to simultaneously control the propagation of electromagnetic waves and thermal fields according to the pre-designed paths. A thermal-electromagnetic cloak, which can create a cloaking effect on both electromagnetic waves and thermal fields simultaneously, is designed by thermal-electromagnetic surface transformation and verified by both numerical simulations and experimental measurements. The thermal-electromagnetic surface transformation proposed in this study provides a new methodology for simultaneous controlling on electromagnetic and temperature fields, which can be used to realize a series of novel thermal-electromagnetic devices such as thermal-electromagnetic shifter, splitter, bender, multiplexer and mode converter. The designed thermal-electromagnetic cloak opens up new ways to create a concealed region where any object within it does not create any disturbance to the external electromagnetic waves and temperature fields simultaneously, which may have significant applications in improving thermal-electromagnetic compatibility problem, protecting of thermal-electromagnetic sensitive components, and improving efficiency of energy usage for complex on-chip systems.

physics.app-ph↗

MILAN: Masked Image Pretraining on Language Assisted Representation

Self-attention based transformer models have been dominating many computer vision tasks in the past few years. Their superb model qualities heavily depend on the excessively large labeled image datasets. In order to reduce the reliance on large labeled datasets, reconstruction based masked autoencoders are gaining popularity, which learn high quality transferable representations from unlabeled images. For the same purpose, recent weakly supervised image pretraining methods explore language supervision from text captions accompanying the images. In this work, we propose masked image pretraining on language assisted representation, dubbed as MILAN. Instead of predicting raw pixels or low level features, our pretraining objective is to reconstruct the image features with substantial semantic signals that are obtained using caption supervision. Moreover, to accommodate our reconstruction target, we propose a more effective prompting decoder architecture and a semantic aware mask sampling mechanism, which further advance the transfer performance of the pretrained model. Experimental results demonstrate that MILAN delivers higher accuracy than the previous works. When the masked autoencoder is pretrained and finetuned on ImageNet-1K dataset with an input resolution of 224x224, MILAN achieves a top-1 accuracy of 85.4% on ViT-Base, surpassing previous state-of-the-arts by 1%. In the downstream semantic segmentation task, MILAN achieves 52.7 mIoU using ViT-Base on ADE20K dataset, outperforming previous masked pretraining results by 4 points.

cs.CV↗

Tripling energy storage density through order-disorder transition induced polar nanoregions in PbZrO3 thin films by ion implantation

Dielectric capacitors are widely used in pulsed power electronic devices due to their ultrahigh power densities and extremely fast charge/discharge speed. To achieve enhanced energy storage density, both maximum polarization (Pmax) and breakdown strength (Eb) need to be improved simultaneously. However, these two key parameters are inversely correlated. In this study, order-disorder transition induced polar nanoregions (PNRs) have been achieved in PbZrO3 thin films by making use of the low-energy ion implantation, enabling us overcome the trade-off between high polarizability and breakdown strength, which leads to the tripling of the energy storage density from 20.5 J/cm3 to 62.3 J/cm3 as well as the great enhancement of breakdown strength. This approach could be extended to other dielectric oxides to improve the energy storage performance, providing a new pathway for tailoring the oxide functionalities.

cond-mat.mtrl-sci↗

Active thermal metasurfaces for remote heating/cooling by mimicking negative thermal conductivity

Remote temperature control can be obtained by a long-focus thermal lens that can focus heat fluxes into a spot far away from the back surface of the lens and create a virtual thermal source/sink in the background material, around which the temperature field distribution can be remotely controlled by changing the parameters of the thermal lens. However, due to the lack of negative thermal conductivity, the existing thermal lenses have extremely short focal lengths and cannot be used to remotely control the temperature field around the virtual thermal source/sink. In this study, we theoretically propose a general approach to equivalently realize negative thermal conductivity by elaborately distributed active thermal metasurface (ATMS), then use the proposed ATMS to implement a novel thermal lens with long focal length designed by transformation thermodynamics, and experimentally verify the performance of the designed long-focus thermal lens with measured focal length f=19.8mm for remote heating/cooling. The proposed method expands the scope of the thermal conductivity and open up new ways to realize unprecedented thermal effects with effective negative thermal conductivity, such as "thermal surface plasmon polaritons", thermal superlens, thermal tunneling effect, and thermal invisible gateway.

physics.gen-ph↗

LegoNet: A Fast and Exact Unlearning Architecture

Machine unlearning aims to erase the impact of specific training samples upon deleted requests from a trained model. Re-training the model on the retained data after deletion is an effective but not efficient way due to the huge number of model parameters and re-training samples. To speed up, a natural way is to reduce such parameters and samples. However, such a strategy typically leads to a loss in model performance, which poses the challenge that increasing the unlearning efficiency while maintaining acceptable performance. In this paper, we present a novel network, namely \textit{LegoNet}, which adopts the framework of ``fixed encoder + multiple adapters''. We fix the encoder~(\ie the backbone for representation learning) of LegoNet to reduce the parameters that need to be re-trained during unlearning. Since the encoder occupies a major part of the model parameters, the unlearning efficiency is significantly improved. However, fixing the encoder empirically leads to a significant performance drop. To compensate for the performance loss, we adopt the ensemble of multiple adapters, which are independent sub-models adopted to infer the prediction by the encoding~(\ie the output of the encoder). Furthermore, we design an activation mechanism for the adapters to further trade off unlearning efficiency against model performance. This mechanism guarantees that each sample can only impact very few adapters, so during unlearning, parameters and samples that need to be re-trained are both reduced. The empirical experiments verify that LegoNet accomplishes fast and exact unlearning while maintaining acceptable performance, synthetically outperforming unlearning baselines.

cs.LG↗

Studying the Impact of Data Disclosure Mechanism in Recommender Systems via Simulation

Recently, privacy issues in web services that rely on users' personal data have raised great attention. Unlike existing privacy-preserving technologies such as federated learning and differential privacy, we explore another way to mitigate users' privacy concerns, giving them control over their own data. For this goal, we propose a privacy aware recommendation framework that gives users delicate control over their personal data, including implicit behaviors, e.g., clicks and watches. In this new framework, users can proactively control which data to disclose based on the trade-off between anticipated privacy risks and potential utilities. Then we study users' privacy decision making under different data disclosure mechanisms and recommendation models, and how their data disclosure decisions affect the recommender system's performance. To avoid the high cost of real-world experiments, we apply simulations to study the effects of our proposed framework. Specifically, we propose a reinforcement learning algorithm to simulate users' decisions (with various sensitivities) under three proposed platform mechanisms on two datasets with three representative recommendation models. The simulation results show that the platform mechanisms with finer split granularity and more unrestrained disclosure strategy can bring better results for both end users and platforms than the "all or nothing" binary mechanism adopted by most real-world applications. It also shows that our proposed framework can effectively protect users' privacy since they can obtain comparable or even better results with much less disclosed data.

cs.IR↗

Elastic pion-proton and pion-pion scattering at high energies in holographic QCD

The total and differential cross sections of high energy pion-proton and pion-pion scattering are investigated in a holographic QCD model, focusing on the Regge regime in which the Pomeron exchange gives the dominant contribution to those cross sections. The Pomeron is described by the Reggeized spin-2 particle propagator, and the hadron-Pomeron couplings are given by gravitational form factors of the hadrons, which are obtained from the bottom-up AdS/QCD models. Since the parameters, which characterize the Pomeron trajectory, have been determined in a preceding study of the proton-proton scattering, the pion-proton cross sections can be expressed with a single adjustable parameter. Once this parameter is determined by the experimental data of the pion-proton total cross section, its differential cross section and the pion-pion cross sections can be calculated without any additional parameter. Although the currently available data are limited, it is found that our calculation is consistent with those. Our predictions are explicitly shown, and the present model can be tested at the future experimental facilities.

hep-ph↗

Debiasing Learning for Membership Inference Attacks Against Recommender Systems

Learned recommender systems may inadvertently leak information about their training data, leading to privacy violations. We investigate privacy threats faced by recommender systems through the lens of membership inference. In such attacks, an adversary aims to infer whether a user's data is used to train the target recommender. To achieve this, previous work has used a shadow recommender to derive training data for the attack model, and then predicts the membership by calculating difference vectors between users' historical interactions and recommended items. State-of-the-art methods face two challenging problems: (1) training data for the attack model is biased due to the gap between shadow and target recommenders, and (2) hidden states in recommenders are not observational, resulting in inaccurate estimations of difference vectors. To address the above limitations, we propose a Debiasing Learning for Membership Inference Attacks against recommender systems (DL-MIA) framework that has four main components: (1) a difference vector generator, (2) a disentangled encoder, (3) a weight estimator, and (4) an attack model. To mitigate the gap between recommenders, a variational auto-encoder (VAE) based disentangled encoder is devised to identify recommender invariant and specific features. To reduce the estimation bias, we design a weight estimator, assigning a truth-level score for each difference vector to indicate estimation accuracy. We evaluate DL-MIA against both general recommenders and sequential recommenders on three real-world datasets. Experimental results show that DL-MIA effectively alleviates training and estimation biases simultaneously, and achieves state-of-the-art attack performance.

cs.IR↗

Neural Re-ranking in Multi-stage Recommender Systems: A Review

As the final stage of the multi-stage recommender system (MRS), re-ranking directly affects user experience and satisfaction by rearranging the input ranking lists, and thereby plays a critical role in MRS. With the advances in deep learning, neural re-ranking has become a trending topic and been widely applied in industrial applications. This review aims at integrating re-ranking algorithms into a broader picture, and paving ways for more comprehensive solutions for future research. For this purpose, we first present a taxonomy of current methods on neural re-ranking. Then we give a description of these methods along with the historic development according to their objectives. The network structure, personalization, and complexity are also discussed and compared. Next, we provide benchmarks of the major neural re-ranking models and quantitatively analyze their re-ranking performance. Finally, the review concludes with a discussion on future prospects of this field. A list of papers discussed in this review, the benchmark datasets, our re-ranking library LibRerank, and detailed parameter settings are publicly available at https://github.com/LibRerank-Community/LibRerank.

cs.IR↗

Graph Neural Networks in Recommender Systems: A Survey

With the explosive growth of online information, recommender systems play a key role to alleviate such information overload. Due to the important application value of recommender systems, there have always been emerging works in this field. In recommender systems, the main challenge is to learn the effective user/item representations from their interactions and side information (if any). Recently, graph neural network (GNN) techniques have been widely utilized in recommender systems since most of the information in recommender systems essentially has graph structure and GNN has superiority in graph representation learning. This article aims to provide a comprehensive review of recent research efforts on GNN-based recommender systems. Specifically, we provide a taxonomy of GNN-based recommendation models according to the types of information used and recommendation tasks. Moreover, we systematically analyze the challenges of applying GNN on different types of data and discuss how existing works in this field address these challenges. Furthermore, we state new perspectives pertaining to the development of this field. We collect the representative papers along with their open-source implementations in https://github.com/wusw14/GNN-in-RS.

cs.IR↗

XDM: Improving Sequential Deep Matching with Unclicked User Behaviors for Recommender System

Deep learning-based sequential recommender systems have recently attracted increasing attention from both academia and industry. Most of industrial Embedding-Based Retrieval (EBR) system for recommendation share the similar ideas with sequential recommenders. Among them, how to comprehensively capture sequential user interest is a fundamental problem. However, most existing sequential recommendation models take as input clicked or purchased behavior sequences from user-item interactions. This leads to incomprehensive user representation and sub-optimal model performance, since they ignore the complete user behavior exposure data, i.e., items impressed yet unclicked by users. In this work, we attempt to incorporate and model those unclicked item sequences using a new learning approach in order to explore better sequential recommendation technique. An efficient triplet metric learning algorithm is proposed to appropriately learn the representation of unclicked items. Our method can be simply integrated with existing sequential recommendation models by a confidence fusion network and further gain better user representation. The offline experimental results based on real-world E-commerce data demonstrate the effectiveness and verify the importance of unclicked items in sequential recommendation. Moreover we deploy our new model (named XDM) into EBR of recommender system at Taobao, outperforming the deployed previous generation SDM.

cs.IR↗

CHEX: CHannel EXploration for CNN Model Compression

Channel pruning has been broadly recognized as an effective technique to reduce the computation and memory cost of deep convolutional neural networks. However, conventional pruning methods have limitations in that: they are restricted to pruning process only, and they require a fully pre-trained large model. Such limitations may lead to sub-optimal model quality as well as excessive memory and training cost. In this paper, we propose a novel Channel Exploration methodology, dubbed as CHEX, to rectify these problems. As opposed to pruning-only strategy, we propose to repeatedly prune and regrow the channels throughout the training process, which reduces the risk of pruning important channels prematurely. More exactly: From intra-layer's aspect, we tackle the channel pruning problem via a well known column subset selection (CSS) formulation. From inter-layer's aspect, our regrowing stages open a path for dynamically re-allocating the number of channels across all the layers under a global channel sparsity constraint. In addition, all the exploration process is done in a single training from scratch without the need of a pre-trained large model. Experimental results demonstrate that CHEX can effectively reduce the FLOPs of diverse CNN architectures on a variety of computer vision tasks, including image classification, object detection, instance segmentation, and 3D vision. For example, our compressed ResNet-50 model on ImageNet dataset achieves 76% top1 accuracy with only 25% FLOPs of the original ResNet-50 model, outperforming previous state-of-the-art channel pruning methods. The checkpoints and code are available at here .

cs.CV↗