arXiv subjects

Xu Chen

Publications and source records attributed to Xu Chen.

At least 361 records · Page 20Linked to original sources

arXiv2022

Pressure-induced superconductivity in charge-density-wave compound LaTe2-xSbx (x=0 and 0.4)

Here, we have grown single crystals of LaTe2-xSbx (x=0 and 0.4) with continuously adjustable CDW. High-pressure x-ray diffraction show LaTe2 does not undergo phase transition and keep robust below 40 GPa. In-situ high-pressure electrical measurements show LaTe2-xSbx undergo semiconductor-metal-superconductivity transition at 4.6 and 2.5 GPa, respectively. With the doping of Sb, the highest Tc increases from 4.6 to 6.5 K. Theoretical calculations reveal that the CDW has been completely suppressed and the calculated Tc is about 2.97 K at 4.5 GPa, consistent with the measured value. Then, the pressure-induced superconductivity in LaTe2-xSbx can be explained in the framework of the BCS theory.

cond-mat.supr-con↗

arXiv2022

Extremely low mass ratio contact binaries -- I. the first photometric and spectroscopic investigations of ten systems

The photometric and spectroscopic investigations of ten contact binaries were presented for the first time. It is discovered that the mass ratios of all the ten targets are smaller than 0.15, they are extremely low mass ratio contact binaries. Seven of them are deep contact binaries, two are medium contact binaries, while only one is a shallow contact system. Five of them show O'Connell effect, and a dark spot on one of the two components can lead to a good fit of the asymmetric light curves. The orbital period studies of the ten binaries reveal that they all exhibit long-term period changes, six of them are increasing, while the others are shrinking. The LAMOST spectra were analyzed by the spectral subtraction method, and all the ten targets exhibit excess emissions in the H$_α$ line, indicating chromospheric activity. The evolutionary states of the two components of the ten binaries were studied, and it is found that their evolutionary states are identical to those of the other contact binaries. Based on the study of the relation between orbital angular momentum and total mass, we discovered the ten systems may be at the late evolutionary stage of a contact binary. The initial masses of the two components and the ages of them were obtained. By calculating the instability parameters, we found that the ten contact binaries are relatively stable at present.

astro-ph.SR↗

arXiv2022

Insulator-metal-superconductor transition in medium-entropy van der Waals compound MEPSe3 (ME=Fe, Mn, Cd, and In) under high pressures

MPX3 (M=metals, X=S or Se) represents a large family of van der Waals (vdW) materials featuring with P-P dimers of ~2.3 Å separation. Its electrical transport property and structure can hardly be tuned by the intentional chemical doping and ionic intercalation. Here, we employ an entropy-enhancement strategy to successfully obtain a series of medium-entropy compounds MEPSe3 (ME=Fe, Mn, Cd and In), in which the electrical and magnetic properties changed simultaneously. Lone-pair electrons of P emerge due to the dissociation of the dimers as evidenced by a 35% elongation in the P-P interatomic distance. The band gap widens from 0.1 eV to 0.7 eV by this dissociation. Under external physical pressure up to ~50 GPa, a giant collapse of up to 15% in the c-axis happens, which is in contrast to the in-plane shrinkage of their counterparts Fe/MnPSe3. It leads to the recombination of P3- with lone pair electrons into a P-P dimer and the smallest bulk modulus of 28 GPa in MPX3. The MEPSe3 transits from a spin-glass insulator to metal, and to superconductor, which is rarely observed in the MPX3. Our findings highlight the P-P dimer as an indicator to probe diverse electronic structure and the effectiveness of entropy-enhancement in materials science.

cond-mat.supr-con↗

arXiv2022

Debiased Recommendation with Neural Stratification

Debiased recommender models have recently attracted increasing attention from the academic and industry communities. Existing models are mostly based on the technique of inverse propensity score (IPS). However, in the recommendation domain, IPS can be hard to estimate given the sparse and noisy nature of the observed user-item exposure data. To alleviate this problem, in this paper, we assume that the user preference can be dominated by a small amount of latent factors, and propose to cluster the users for computing more accurate IPS via increasing the exposure densities. Basically, such method is similar with the spirit of stratification models in applied statistics. However, unlike previous heuristic stratification strategy, we learn the cluster criterion by presenting the users with low ranking embeddings, which are future shared with the user representations in the recommender model. At last, we find that our model has strong connections with the previous two types of debiased recommender models. We conduct extensive experiments based on real-world datasets to demonstrate the effectiveness of the proposed method.

cs.IR↗

arXiv2022

Cluster extent inference revisited: quantification and localization of brain activity

Cluster inference based on spatial extent thresholding is the most popular analysis method for finding activated brain areas in neuroimaging. However, the method has several well-known issues. While powerful for finding brain regions with some activation, the method as currently defined does not allow any further quantification or localization of signal. In this paper we repair this gap. We show that cluster-extent inference can be used (1.) to infer the presence of signal in anatomical regions of interest and (2.) to quantify the percentage of active voxels in any cluster or region of interest. These additional inferences come for free, i.e. they do not require any further adjustment of the alpha-level of tests, while retaining full familywise error control. We achieve this extension of the possibilities of cluster inference by an embedding of the method into a closed testing procedure, and solving the graph-theoretic k-separator problem that results from this embedding. The new method can be used in combination with random field theory or permutations. We demonstrate the usefulness of the method in a large-scale application to neuroimaging data from the Neurovault database.

stat.ME↗

arXiv2022

Neural Message Passing for Visual Relationship Detection

Visual relationship detection aims to detect the interactions between objects in an image; however, this task suffers from combinatorial explosion due to the variety of objects and interactions. Since the interactions associated with the same object are dependent, we explore the dependency of interactions to reduce the search space. We explicitly model objects and interactions by an interaction graph and then propose a message-passing-style algorithm to propagate the contextual information. We thus call the proposed method neural message passing (NMP). We further integrate language priors and spatial cues to rule out unrealistic interactions and capture spatial interactions. Experimental results on two benchmark datasets demonstrate the superiority of our proposed method. Our code is available at https://github.com/PhyllisH/NMP.

cs.CV↗

arXiv2022

Exploration of the origin of 2020 X-ray outburst in OJ 287

Research into OJ 287 has been ongoing for many years. In 2020 April-June, this source underwent the second highest X-ray outburst (second only to the 2016-2017 outburst) and the mechanism of this outburst is still under debate. In this paper, we discuss two scenarios to explore the origin of the outburst: an after-effect of a black hole-disc impact and a tidal disruption event (TDE). We present the weak correlations of the spectral index versus X-ray flux and the hardness ratio (HR) versus the soft X-ray flux during the outburst, and these features are different from the case in the quiescent state. The correlations are compared with those of the 2016-2017 outburst with the highest X-ray flux in monitoring history. Analysis of the outbursts in 2016-2017 and 2020 shows that the expected time of the X-ray outburst, based on the theory of the after-effect of the black hole-disc impact and the estimation of available data, is inconsistent with historical observations. The soft X-ray spectra, the barely temporal evolution of colour, and the evolution of the HR mean that the 2020 outburst shares similar features with the 2016-2017 outburst, which was considered as a possible candidate for a TDE. Additionally, we find that the predictions of full TDEs ($t^{-5/3}$) and partial TDEs ($t^{-9/4}$) for the soft X-ray decay light curve are well fitted. Our analysis suggests that the 2020 outburst in OJ 287 is probably related to the TDE candidate.

astro-ph.HE↗

arXiv2022

Collaboration in Participant-Centric Federated Learning: A Game-Theoretical Perspective

Federated learning (FL) is a promising distributed framework for collaborative artificial intelligence model training while protecting user privacy. A bootstrapping component that has attracted significant research attention is the design of incentive mechanism to stimulate user collaboration in FL. The majority of works adopt a broker-centric approach to help the central operator to attract participants and further obtain a well-trained model. Few works consider forging participant-centric collaboration among participants to pursue an FL model for their common interests, which induces dramatic differences in incentive mechanism design from the broker-centric FL. To coordinate the selfish and heterogeneous participants, we propose a novel analytic framework for incentivizing effective and efficient collaborations for participant-centric FL. Specifically, we respectively propose two novel game models for contribution-oblivious FL (COFL) and contribution-aware FL (CAFL), where the latter one implements a minimum contribution threshold mechanism. We further analyze the uniqueness and existence for Nash equilibrium of both COFL and CAFL games and design efficient algorithms to achieve equilibrium solutions. Extensive performance evaluations show that there exists free-riding phenomenon in COFL, which can be greatly alleviated through the adoption of CAFL model with the optimized minimum threshold.

cs.AI↗

arXiv2022

TIPS: Transaction Inclusion Protocol with Signaling in DAG-based Blockchain

Directed Acyclic Graph (DAG) is a popular approach to achieve scalability of blockchain networks. Due to its high efficiency in data communication and great scalability, DAG has been widely adopted in many applications such as Internet of Things (IoT) and Decentralized Finance (DeFi). DAG-based blockchain, nevertheless, faces the key challenge of transaction inclusion collision due to the high concurrency and the network delay. Particularly, the transaction inclusion collision in DAG-based blockchain leads to the revenue and throughput dilemmas, which would greatly degrade the system performance. In this paper, we propose "TIPS", the Transaction Inclusion Protocol with Signaling, which broadcasts a signal indicating the transactions in the block. We show that with the prompt broadcast of a signal, TIPS substantially reduces the transaction collision and thus resolves these dilemmas. Moreover, we show that TIPS can defend against both the denial-of-service and the delay-of-service attacks. We also conduct intensive experiments to demonstrate the superior performance of the proposed protocol.

cs.NI↗

arXiv2022

Explainable Legal Case Matching via Inverse Optimal Transport-based Rationale Extraction

As an essential operation of legal retrieval, legal case matching plays a central role in intelligent legal systems. This task has a high demand on the explainability of matching results because of its critical impacts on downstream applications -- the matched legal cases may provide supportive evidence for the judgments of target cases and thus influence the fairness and justice of legal decisions. Focusing on this challenging task, we propose a novel and explainable method, namely \textit{IOT-Match}, with the help of computational optimal transport, which formulates the legal case matching problem as an inverse optimal transport (IOT) problem. Different from most existing methods, which merely focus on the sentence-level semantic similarity between legal cases, our IOT-Match learns to extract rationales from paired legal cases based on both semantics and legal characteristics of their sentences. The extracted rationales are further applied to generate faithful explanations and conduct matching. Moreover, the proposed IOT-Match is robust to the alignment label insufficiency issue commonly in practical legal case matching tasks, which is suitable for both supervised and semi-supervised learning paradigms. To demonstrate the superiority of our IOT-Match method and construct a benchmark of explainable legal case matching task, we not only extend the well-known Challenge of AI in Law (CAIL) dataset but also build a new Explainable Legal cAse Matching (ELAM) dataset, which contains lots of legal cases with detailed and explainable annotations. Experiments on these two datasets show that our IOT-Match outperforms state-of-the-art methods consistently on matching prediction, rationale extraction, and explanation generation.

cs.IR↗

arXiv2022

RecBole 2.0: Towards a More Up-to-Date Recommendation Library

In order to support the study of recent advances in recommender systems, this paper presents an extended recommendation library consisting of eight packages for up-to-date topics and architectures. First of all, from a data perspective, we consider three important topics related to data issues (i.e., sparsity, bias and distribution shift), and develop five packages accordingly: meta-learning, data augmentation, debiasing, fairness and cross-domain recommendation. Furthermore, from a model perspective, we develop two benchmarking packages for Transformer-based and graph neural network (GNN)-based models, respectively. All the packages (consisting of 65 new models) are developed based on a popular recommendation framework RecBole, ensuring that both the implementation and interface are unified. For each package, we provide complete implementations from data loading, experimental setup, evaluation and algorithm implementation. This library provides a valuable resource to facilitate the up-to-date research in recommender systems. The project is released at the link: https://github.com/RUCAIBox/RecBole2.0.

cs.IR↗

arXiv2022

Analog MIMO Communication for One-shot Distributed Principal Component Analysis

A fundamental algorithm for data analytics at the edge of wireless networks is distributed principal component analysis (DPCA), which finds the most important information embedded in a distributed high-dimensional dataset by distributed computation of a reduced-dimension data subspace, called principal components (PCs). In this paper, to support one-shot DPCA in wireless systems, we propose a framework of analog MIMO transmission featuring the uncoded analog transmission of local PCs for estimating the global PCs. To cope with channel distortion and noise, two maximum-likelihood (global) PC estimators are presented corresponding to the cases with and without receive channel state information (CSI). The first design, termed coherent PC estimator, is derived by solving a Procrustes problem and reveals the form of regularized channel inversion where the regulation attempts to alleviate the effects of both receiver noise and data noise. The second one, termed blind PC estimator, is designed based on the subspace channel-rotation-invariance property and computes a centroid of received local PCs on a Grassmann manifold. Using the manifold-perturbation theory, tight bounds on the mean square subspace distance (MSSD) of both estimators are derived for performance evaluation. The results reveal simple scaling laws of MSSD concerning device population, data and channel signal-to-noise ratios (SNRs), and array sizes. More importantly, both estimators are found to have identical scaling laws, suggesting the dispensability of CSI to accelerate DPCA. Simulation results validate the derived results and demonstrate the promising latency performance of the proposed analog MIMO

cs.IT↗

arXiv2022

Depth Estimation Matters Most: Improving Per-Object Depth Estimation for Monocular 3D Detection and Tracking

Monocular image-based 3D perception has become an active research area in recent years owing to its applications in autonomous driving. Approaches to monocular 3D perception including detection and tracking, however, often yield inferior performance when compared to LiDAR-based techniques. Through systematic analysis, we identified that per-object depth estimation accuracy is a major factor bounding the performance. Motivated by this observation, we propose a multi-level fusion method that combines different representations (RGB and pseudo-LiDAR) and temporal information across multiple frames for objects (tracklets) to enhance per-object depth estimation. Our proposed fusion method achieves the state-of-the-art performance of per-object depth estimation on the Waymo Open Dataset, the KITTI detection dataset, and the KITTI MOT dataset. We further demonstrate that by simply replacing estimated depth with fusion-enhanced depth, we can achieve significant improvements in monocular 3D perception tasks, including detection and tracking.

cs.CV↗

arXiv2022

GraphAD: A Graph Neural Network for Entity-Wise Multivariate Time-Series Anomaly Detection

In recent years, the emergence and development of third-party platforms have greatly facilitated the growth of the Online to Offline (O2O) business. However, the large amount of transaction data raises new challenges for retailers, especially anomaly detection in operating conditions. Thus, platforms begin to develop intelligent business assistants with embedded anomaly detection methods to reduce the management burden on retailers. Traditional time-series anomaly detection methods capture underlying patterns from the perspectives of time and attributes, ignoring the difference between retailers in this scenario. Besides, similar transaction patterns extracted by the platforms can also provide guidance to individual retailers and enrich their available information without privacy issues. In this paper, we pose an entity-wise multivariate time-series anomaly detection problem that considers the time-series of each unique entity. To address this challenge, we propose GraphAD, a novel multivariate time-series anomaly detection model based on the graph neural network. GraphAD decomposes the Key Performance Indicator (KPI) into stable and volatility components and extracts their patterns in terms of attributes, entities and temporal perspectives via graph neural networks. We also construct a real-world entity-wise multivariate time-series dataset from the business data of Ele.me. The experimental results on this dataset show that GraphAD significantly outperforms existing anomaly detection methods.

cs.LG↗

arXiv2022

FastRE: Towards Fast Relation Extraction with Convolutional Encoder and Improved Cascade Binary Tagging Framework

Recent work for extracting relations from texts has achieved excellent performance. However, most existing methods pay less attention to the efficiency, making it still challenging to quickly extract relations from massive or streaming text data in realistic scenarios. The main efficiency bottleneck is that these methods use a Transformer-based pre-trained language model for encoding, which heavily affects the training speed and inference speed. To address this issue, we propose a fast relation extraction model (FastRE) based on convolutional encoder and improved cascade binary tagging framework. Compared to previous work, FastRE employs several innovations to improve efficiency while also keeping promising performance. Concretely, FastRE adopts a novel convolutional encoder architecture combined with dilated convolution, gated unit and residual connection, which significantly reduces the computation cost of training and inference, while maintaining the satisfactory performance. Moreover, to improve the cascade binary tagging framework, FastRE first introduces a type-relation mapping mechanism to accelerate tagging efficiency and alleviate relation redundancy, and then utilizes a position-dependent adaptive thresholding strategy to obtain higher tagging accuracy and better model generalization. Experimental results demonstrate that FastRE is well balanced between efficiency and performance, and achieves 3-10x training speed, 7-15x inference speed faster, and 1/100 parameters compared to the state-of-the-art models, while the performance is still competitive.

cs.CL↗

arXiv2022

Working memory inspired hierarchical video decomposition with transformative representations

Video decomposition is very important to extract moving foreground objects from complex backgrounds in computer vision, machine learning, and medical imaging, e.g., extracting moving contrast-filled vessels from the complex and noisy backgrounds of X-ray coronary angiography (XCA). However, the challenges caused by dynamic backgrounds, overlapping heterogeneous environments and complex noises still exist in video decomposition. To solve these problems, this study is the first to introduce a flexible visual working memory model in video decomposition tasks to provide interpretable and high-performance hierarchical deep architecture, integrating the transformative representations between sensory and control layers from the perspective of visual and cognitive neuroscience. Specifically, robust PCA unrolling networks acting as a structure-regularized sensor layer decompose XCA into sparse/low-rank structured representations to separate moving contrast-filled vessels from noisy and complex backgrounds. Then, patch recurrent convolutional LSTM networks with a backprojection module embody unstructured random representations of the control layer in working memory, recurrently projecting spatiotemporally decomposed nonlocal patches into orthogonal subspaces for heterogeneous vessel retrieval and interference suppression. This video decomposition deep architecture effectively restores the heterogeneous profiles of intensity and the geometries of moving objects against the complex background interferences. Experiments show that the proposed method significantly outperforms state-of-the-art methods in accurate moving contrast-filled vessel extraction with excellent flexibility and computational efficiency.

cs.CV↗

arXiv2022

Evolution of Superatomic-Charge-density-wave and Superconductivity under Pressure in AuTe$_2$Se$_{4/3}$

Superatomic crystal is a class of hierarchical materials composed of atomically precise clusters assembled via van der Waals or covalent-like interactions. AuTe$_2$Se$_{4/3}$, an all-inorganic superatomic superconductor exhibiting superatomic-charge-density-wave (S-CDW), provides a first platform to study the response of their collectively quantum phenomenon to the external pressure in superatomic crystals. We reveal a competition between S-CDW and superconductivity using cutting-edge measurements on thin flakes at low pressures. Prominently, the pressure modulation of S-CDW ordering is 1$\sim$2 order of magnitudes (0.1 GPa) lower than that of conventional atomic superconductors. As pressure increases to 2.5 GPa, the $T_{\mathrm{CDW}}$ is suppressed and the superconducting transition temperature ($T_{\mathrm{c}}$) is firstly enhanced, and reaches the maximum then quenches with increasing pressure. Above 7.3 GPa, a second superconducting phase emerges, and then a three-fold enhancement in the transition temperature ($T_{\mathrm{c}}$) happens. Analyses of the crystal structure and theoretical calculations suggest a pressure-mediated switch of the conduction channel from the $a$- to the $b$-axis occur, followed by a dimensional crossover of conductivity and the Fermi surface from 2D to 3D.

cond-mat.supr-con↗

arXiv2022

Robust PCA Unrolling Network for Super-resolution Vessel Extraction in X-ray Coronary Angiography

Although robust PCA has been increasingly adopted to extract vessels from X-ray coronary angiography (XCA) images, challenging problems such as inefficient vessel-sparsity modelling, noisy and dynamic background artefacts, and high computational cost still remain unsolved. Therefore, we propose a novel robust PCA unrolling network with sparse feature selection for super-resolution XCA vessel imaging. Being embedded within a patch-wise spatiotemporal super-resolution framework that is built upon a pooling layer and a convolutional long short-term memory network, the proposed network can not only gradually prune complex vessel-like artefacts and noisy backgrounds in XCA during network training but also iteratively learn and select the high-level spatiotemporal semantic information of moving contrast agents flowing in the XCA-imaged vessels. The experimental results show that the proposed method significantly outperforms state-of-the-art methods, especially in the imaging of the vessel network and its distal vessels, by restoring the intensity and geometry profiles of heterogeneous vessels against complex and dynamic backgrounds.

eess.IV↗