Search

Recommender systems have been successfully applied in many applications. Nonetheless, recent studies demonstrate that recommender systems are vulnerable to membership inference attacks (MIAs), leading to the leakage of users' membership privacy. However, existing MIAs relying on shadow training suffer a large performance drop when the attacker lacks knowledge of the training data distribution and the model architecture of the target recommender system. To better understand the privacy risks of recommender systems, we propose shadow-free MIAs that directly leverage a user's recommendations for membership inference. Without shadow training, the proposed attack can conduct MIAs efficiently and effectively under a practice scenario where the attacker is given only black-box access to the target recommender system. The proposed attack leverages an intuition that the recommender system personalizes a user's recommendations if his historical interactions are used by it. Thus, an attacker can infer membership privacy by determining whether the recommendations are more similar to the interactions or the general popular items. We conduct extensive experiments on benchmark datasets across various recommender systems. Remarkably, our attack achieves far better attack accuracy with low false positive rates than baselines while with a much lower computational cost., Comment: This paper has been accepted by IJCAI-24

The study of the mechanism of exchange bias phenomena and the achievement of its efficient control are of great importance, as it promotes the revelation of unique exchange interactions and the development of exotic applications. However, it is challenging due to the elusive interface between magnetic phases. In this study, we report an unprecedented exchange bias phenomenon observed in ultrathin uncompensated antiferromagnetic MnBi$_2$Te$_4$. The magnitude and direction of the exchange field can be intentionally controlled by designing a magnetic field sweep protocol without a field cooling process. The combined experimental and theoretical simulation results indicate that the spin-flip process assisted by the ubiquitous defect-induced pinning domain sites with varying inner exchange interactions might give rise to the emergence and robustness of this peculiar exchange bias. The temperature and thickness dependence of the exchange bias phenomena are systematically investigated for further study and exploitation of its unique properties. This mechanism hold promise for highly tunable exchange bias in prevalent magnetic systems by engineering the properties of domain structures, and also offers promising avenues for the design of spintronic devices combing its topology based on MnBi$_2$Te$_4$., Comment: 8 pages, 4 figures

Pricing is an important issue in mobile edge computing. How to appropriately determine the bid of end user (EU) is an incentive factor for edge cloud (EC) to offer service. In this letter, we propose an equilibrium pricing scheme based on the all-pay auction model in end-to-end collaboration environment, wherein all EUs can acquire the service at a lower price than the own value of the required resource. In addition, we propose a set allocation algorithm to divide all the bidders into different sets according to the price, and the EUs in each set get the service, which averts the case of getting no service due to the low price. Extensive simulation results demonstrate that the proposed scheme can effectively maximize the total profit of the edge offloading system, and guarantee all EUs can access the service.

This article demonstrates a new kind of programmable logic for the representation of an integer that can be used for the programmable Josephson voltage standard. It can enable the numbers of junctions in most bits to be variable integer values, which is different from normal binary logic or ternary logic. Consequently, missing junctions due to superconducting short circuits can be tolerated under this logic. This logic can also have nearly the same segmentation efficiency as ternary logic. The completeness of the sequences using this logic is proven by the recursive method in mathematics in this paper. After that, a new algorithm for the representation of integers is presented according to the proven process, and an analysis of the number of fault-tolerant junctions for each bit is provided. Although the first and second bits are not tolerant to missing junctions, bits beyond these can tolerate one to hundreds of missing junctions. Due to the non-fixed multiples between the bits of the sequence, this logic is called non-integer-multiple logic. Finally, the design and fabrication of a 3 V programmable Josephson junction array using this logic are described, and the measurements and analysis of the characteristic parameters are presented.

Large Language Models (LLMs) have demonstrated exceptional capabilities across various natural language processing tasks. Yet, many of these advanced LLMs are tailored for broad, general-purpose applications. In this technical report, we introduce AcademicGPT, designed specifically to empower academic research. AcademicGPT is a continual training model derived from LLaMA2-70B. Our training corpus mainly consists of academic papers, thesis, content from some academic domain, high-quality Chinese data and others. While it may not be extensive in data scale, AcademicGPT marks our initial venture into a domain-specific GPT tailored for research area. We evaluate AcademicGPT on several established public benchmarks such as MMLU and CEval, as well as on some specialized academic benchmarks like PubMedQA, SCIEval, and our newly-created ComputerScienceQA, to demonstrate its ability from general knowledge ability, to Chinese ability, and to academic ability. Building upon AcademicGPT's foundation model, we also developed several applications catered to the academic area, including General Academic Question Answering, AI-assisted Paper Reading, Paper Review, and AI-assisted Title and Abstract Generation., Comment: Technical Report. arXiv admin note: text overlap with arXiv:2310.12081, arXiv:2310.10053 by other authors

The paradigm of vertical federated learning (VFL), where institutions collaboratively train machine learning models via combining each other's local feature or label information, has achieved great success in applications to financial risk management (FRM). The surging developments of graph representation learning (GRL) have opened up new opportunities for FRM applications under FL via efficiently utilizing the graph-structured data generated from underlying transaction networks. Meanwhile, transaction information is often considered highly sensitive. To prevent data leakage during training, it is critical to develop FL protocols with formal privacy guarantees. In this paper, we present an end-to-end GRL framework in the VFL setting called VESPER, which is built upon a general privatization scheme termed perturbed message passing (PMP) that allows the privatization of many popular graph neural architectures.Based on PMP, we discuss the strengths and weaknesses of specific design choices of concrete graph neural architectures and provide solutions and improvements for both dense and sparse graphs. Extensive empirical evaluations over both public datasets and an industry dataset demonstrate that VESPER is capable of training high-performance GNN models over both sparse and dense graphs under reasonable privacy budgets.

In recent years, the maturation of emerging technologies such as Virtual Reality, Digital twins, and Blockchain has accelerated the realization of the metaverse. As a virtual world independent of the real world, the metaverse will provide users with a variety of virtual activities that bring great convenience to society. In addition, the metaverse can facilitate digital twins, which offers transformative possibilities for the industry. Thus, the metaverse has attracted the attention of the industry, and a huge amount of capital is about to be invested. However, the development of the metaverse is still in its infancy and little research has been undertaken so far. We describe the development of the metaverse. Next, we introduce the architecture of the socially beneficial metaverse (SB-Metaverse) and we focus on the technologies that support the operation of SB-Metaverse. In addition, we also present the applications of SB-Metaverse. Finally, we discuss several challenges faced by SB-Metaverse which must be addressed in the future., Comment: 28 pages, 6 figures, 3 tables

The manipulation of two-dimensional (2D) magnetic order is of significant importance to facilitate future 2D magnets for low-power and high-speed spintronic devices. Van der Waals stacking engineering makes promises for controllable magnetism via interlayer magnetic coupling. However, directly examining the stacking order changes accompanying magnetic order transitions at the atomic scale and preparing device-ready 2D magnets with controllable magnetic orders remain elusive. Here, we demonstrate effective control of interlayer stacking in exfoliated CrBr$_3$ via thermally assisted strain engineering. The stable interlayer ferromagnetic (FM), antiferromagnetic (AFM), and FM-AFM coexistent ground states confirmed by the magnetic circular dichroism measurements are realized. Combined with the first-principles calculations, the atomically-resolved imaging technique reveals the correlation between magnetic order and interlay stacking order in the CrBr$_3$ flakes unambiguously. A tunable exchange bias effect is obtained in the mixed phase of FM and AFM states. This work will introduce new magnetic properties by controlling the stacking order, and sequence of 2D magnets, providing ample opportunities for their application in spintronic devices., Comment: 7 pages, 4 figures

Optimal power flow (OPF) is a fundamental tool for analyzing the characteristics of bipolar DC distribution network (DCDN). However, existing OPF models face challenges in reflecting the power distribution and exchange of bipolar DCDN directly since its decision variables are voltage and current. This paper addresses this issue by establishing a convex OPF model that can be used for the planning and operation of bipolar DCDN. First, the power flow characteristics of bipolar DCDN are revealed through power injection-based equations, upon which the original OPF model is established. Next, the original OPF model undergoes a transformation into a convex OPF model based on second-order cone programming (SOCP) through variable substitution, secondorder cone relaxation, McCormick relaxation, and first-order Taylor expansion, respectively. Finally, the sequence bound tightening algorithm (STBA) is employed to tighten the boundaries of McCormick envelopes in each iteration to ensure the exactness of the convex OPF model. The effectiveness of this novel OPF model for bipolar DCDN is verified through two case studies, i.e., capacity configuration of distributed generation (DG) and operation optimization of bipolar DCDN., Comment: 10 pages, 13 figures, under review in IEEE transactions on power systems

Anomaly detection plays an increasingly important role in various fields for critical tasks such as intrusion detection in cybersecurity, financial risk detection, and human health monitoring. A variety of anomaly detection methods have been proposed, and a category based on the isolation forest mechanism stands out due to its simplicity, effectiveness, and efficiency, e.g., iForest is often employed as a state-of-the-art detector for real deployment. While the majority of isolation forests use the binary structure, a framework LSHiForest has demonstrated that the multi-fork isolation tree structure can lead to better detection performance. However, there is no theoretical work answering the fundamentally and practically important question on the optimal tree structure for an isolation forest with respect to the branching factor. In this paper, we establish a theory on isolation efficiency to answer the question and determine the optimal branching factor for an isolation tree. Based on the theoretical underpinning, we design a practical optimal isolation forest OptIForest incorporating clustering based learning to hash which enables more information to be learned from data for better isolation quality. The rationale of our approach relies on a better bias-variance trade-off achieved by bias reduction in OptIForest. Extensive experiments on a series of benchmarking datasets for comparative and ablation studies demonstrate that our approach can efficiently and robustly achieve better detection performance in general than the state-of-the-arts including the deep learning based methods., Comment: This paper has been accepted by International Joint Conference on Artificial Intelligence (IJCAI-23)

Anomaly detection aims to distinguish abnormal instances that deviate significantly from the majority of benign ones. As instances that appear in the real world are naturally connected and can be represented with graphs, graph neural networks become increasingly popular in tackling the anomaly detection problem. Despite the promising results, research on anomaly detection has almost exclusively focused on static graphs while the mining of anomalous patterns from dynamic graphs is rarely studied but has significant application value. In addition, anomaly detection is typically tackled from semi-supervised perspectives due to the lack of sufficient labeled data. However, most proposed methods are limited to merely exploiting labeled data, leaving a large number of unlabeled samples unexplored. In this work, we present semi-supervised anomaly detection (SAD), an end-to-end framework for anomaly detection on dynamic graphs. By a combination of a time-equipped memory bank and a pseudo-label contrastive learning module, SAD is able to fully exploit the potential of large unlabeled samples and uncover underlying anomalies on evolving graph streams. Extensive experiments on four real-world datasets demonstrate that SAD efficiently discovers anomalies from dynamic graphs and outperforms existing advanced methods even when provided with only little labeled data., Comment: Accepted to IJCAI'23. Code will be available at https://github.com/D10Andy/SAD

In this paper, we release a largest ever medical Question Answering (QA) dataset with 26 million QA pairs. We benchmark many existing approaches in our dataset in terms of both retrieval and generation. Experimental results show that the existing models perform far lower than expected and the released dataset is still challenging in the pre-trained language model era. Moreover, we also experimentally show the benefit of the proposed dataset in many aspects: (i) trained models for other QA datasets in a zero-shot fashion; and (ii) as external knowledge for retrieval-augmented generation (RAG); and (iii) improving existing pre-trained language models by using the QA pairs as a pre-training corpus in continued training manner. We believe that this dataset will not only contribute to medical research but also facilitate both the patients and clinical doctors. See \url{https://github.com/FreedomIntelligence/Huatuo-26M}.

Radars are widely used to obtain echo information for effective prediction, such as precipitation nowcasting. In this paper, recent relevant scientific investigation and practical efforts using Deep Learning (DL) models for weather radar data analysis and pattern recognition have been reviewed; particularly, in the fields of beam blockage correction, radar echo extrapolation, and precipitation nowcast. Compared to traditional approaches, present DL methods depict better performance and convenience but suffer from stability and generalization. In addition to recent achievements, the latest advancements and existing challenges are also presented and discussed in this paper, trying to lead to reasonable potentials and trends in this highly-concerned field., Comment: This article has been accepted for publication in IEEE Systems, Man and Cybernetics Magazine

With the frequent happening of privacy leakage and the enactment of privacy laws across different countries, data owners are reluctant to directly share their raw data and labels with any other party. In reality, a lot of these raw data are stored in the graph database, especially for finance. For collaboratively building graph neural networks(GNNs), federated learning(FL) may not be an ideal choice for the vertically partitioned setting where privacy and efficiency are the main concerns. Moreover, almost all the existing federated GNNs are mainly designed for homogeneous graphs, which simplify various types of relations as the same type, thus largely limits their performance. We bridge this gap by proposing a split learning-based GNN(SplitGNN), where this model is divided into two sub-models: the local GNN model includes all the private data related computation to generate local node embeddings, whereas the global model calculates global embeddings by aggregating all the participants' local embeddings. Our SplitGNN allows the isolated heterogeneous neighborhood to be collaboratively utilized. To better capture representations, we propose a novel Heterogeneous Attention(HAT) algorithm and use both node-based and path-based attention mechanisms to learn various types of nodes and edges with multi-hop relation features. We demonstrate the effectiveness of our SplitGNN on node classification tasks for two standard public datasets and the real-world dataset. Extensive experimental results validate that our proposed SplitGNN significantly outperforms the state-of-the-art(SOTA) methods., Comment: CIKM-2022 1st FedGraph workshop

Privacy in AI remains a topic that draws attention from researchers and the general public in recent years. As one way to implement privacy-preserving AI, differentially private learning is a framework that enables AI models to use differential privacy (DP). To achieve DP in the learning process, existing algorithms typically limit the magnitude of gradients with a constant clipping, which requires carefully tuned due to its significant impact on model performance. As a solution to this issue, latest works NSGD and Auto-S innovatively propose to use normalization instead of clipping to avoid hyperparameter tuning. However, normalization-based approaches like NSGD and Auto-S rely on a monotonic weight function, which imposes excessive weight on small gradient samples and introduces extra deviation to the update. In this paper, we propose a Differentially Private Per-Sample Adaptive Clipping (DP-PSAC) algorithm based on a non-monotonic adaptive weight function, which guarantees privacy without the typical hyperparameter tuning process of using a constant clipping while significantly reducing the deviation between the update and true batch-averaged gradient. We provide a rigorous theoretical convergence analysis and show that with convergence rate at the same order, the proposed algorithm achieves a lower non-vanishing bound, which is maintained over training iterations, compared with NSGD/Auto-S. In addition, through extensive experimental evaluation, we show that DP-PSAC outperforms or matches the state-of-the-art methods on multiple main-stream vision and language tasks., Comment: To appear in AAAI 2023, Revised acknowledgments and citations

Dijkstra's algorithm is one of the most popular classic path planning algorithms, achieving optimal solutions across a wide range of challenging tasks. However, it only calculates the shortest distance from one vertex to another, which is hard to directly apply to the Dynamic Multi-Sources to Single-Destination (DMS-SD) problem. This paper proposes a modified Dijkstra algorithm to address the DMS-SD problem, where the destination can be dynamically changed. Our method deploys the concept of Adjacent Matrix from Floyd's algorithm and achieves the goal with mathematical calculations. We formally show that all-pairs shortest distance information in Floyd's algorithm is not required in our algorithm. Extensive experiments verify the scalability and optimality of the proposed method., Comment: International Conference On Human-Centered Cognitive Systems (HCCS) 2022

Natural superlattice structures $\rm{(MnBi_2Te_4)(Bi_2Te_3)}$$_n$ ($n$ = 1, 2,...), in which magnetic $\rm{MnBi_2Te_4}$ layers are separated by nonmagnetic $\rm{Bi_2Te_3}$ layers, hold band topology, magnetism and reduced interlayer coupling, providing a promising platform for the realization of exotic topological quantum states. However, their magnetism in the two-dimensional limit, which is crucial for further exploration of quantum phenomena, remains elusive. Here, complex ferromagnetic (FM)-antiferromagnetic (AFM) coexisting ground states that persist up to the 2-septuple layers (SLs) limit are observed and comprehensively investigated in $\rm{MnBi_4Te_7}$ ($n$ = 1) and $\rm{MnBi_6Te_{10}}$ ($n$ = 2). The ubiquitous Mn-Bi site mixing modifies or even changes the sign of the subtle inter-SL magnetic interactions, yielding a spatially inhomogeneous interlayer coupling. Further, a tunable exchange bias effect is observed in $\rm{(MnBi_2Te_4)(Bi_2Te_3)}$$_n$ ($n$ = 1, 2), arising from the coupling between the FM and AFM components in the ground state. Our work highlights a new approach toward the fine-tuning of magnetism and paves the way for further study of quantum phenomena in $\rm{(MnBi_2Te_4)(Bi_2Te_3)}$$_n$ ($n$ = 1, 2,...) as well as their magnetic applications., Comment: 9 pages, 4 figures