arXiv subjects

Hao Yuan

Publications and source records attributed to Hao Yuan.

At least 55 records · Page 3Linked to original sources

arXiv2023

Phase transitions in the Haldane-Hubbard model with ionic potentials

By employing the exact-diagonalization method, we revisit the ground-state phase diagram of the Haldane-Hubbard model on the honeycomb lattice with staggered sublattice potentials. The phase diagram includes the band insulator, Mott insulator, and two Chern insulator phases with Chern numbers C=2 and C=1, respectively. The character of transitions between different phases is studied by analyzing the lower-lying energy levels, excitation gaps, structure factors, and fidelity metric. We find that the C=1 phase can be continuously deformed into the C=2 phase without a gap closure in the periodic boundary condition, while a further analysis on the Berry curvatures indicates that the excitation gap closes at the phase boundary in a twisted boundary condition, accompanied by the discontinuities of structure factors. All the other phase transitions are found to be first-order ones as expected.

cond-mat.str-el↗

arXiv2023

Soft X-ray spectro-ptychography on boron nitride nanotubes, carbon nanotubes and permalloy nanorods

Spectro-ptychography offers improved spatial resolution and additional phase spectral information relative to that provided by scanning transmission X-ray microscopes (STXM). However, carrying out ptychography at the lower range of soft X-ray energies (e.g., below 200 eV to 600 eV) on samples with weakly scattering signals can be challenging. We present soft X-ray ptychography results at energies as low as 180 eV and illustrate the capabilities with results from permalloy nanorods (Fe 2p), carbon nanotubes (C 1s), and boron nitride bamboo nanostructures (B 1s, N1s). We describe optimization of low energy X-ray spectro-ptychography and discuss important challenges associated with measurement approaches, reconstruction algorithms, and their effects on the reconstructed images. A method for evaluating the increase in radiation dose when using overlapping sampling is presented.

cond-mat.mtrl-sci↗

arXiv2022

A Simple Temporal Information Matching Mechanism for Entity Alignment Between Temporal Knowledge Graphs

Entity alignment (EA) aims to find entities in different knowledge graphs (KGs) that refer to the same object in the real world. Recent studies incorporate temporal information to augment the representations of KGs. The existing methods for EA between temporal KGs (TKGs) utilize a time-aware attention mechanism to incorporate relational and temporal information into entity embeddings. The approaches outperform the previous methods by using temporal information. However, we believe that it is not necessary to learn the embeddings of temporal information in KGs since most TKGs have uniform temporal representations. Therefore, we propose a simple graph neural network (GNN) model combined with a temporal information matching mechanism, which achieves better performance with less time and fewer parameters. Furthermore, since alignment seeds are difficult to label in real-world applications, we also propose a method to generate unsupervised alignment seeds via the temporal information of TKG. Extensive experiments on public datasets indicate that our supervised method significantly outperforms the previous methods and the unsupervised one has competitive performance.

cs.AI↗

arXiv2022

Explainability in Graph Neural Networks: A Taxonomic Survey

Deep learning methods are achieving ever-increasing performance on many artificial intelligence tasks. A major limitation of deep models is that they are not amenable to interpretability. This limitation can be circumvented by developing post hoc techniques to explain the predictions, giving rise to the area of explainability. Recently, explainability of deep models on images and texts has achieved significant progress. In the area of graph data, graph neural networks (GNNs) and their explainability are experiencing rapid developments. However, there is neither a unified treatment of GNN explainability methods, nor a standard benchmark and testbed for evaluations. In this survey, we provide a unified and taxonomic view of current GNN explainability methods. Our unified and taxonomic treatments of this subject shed lights on the commonalities and differences of existing methods and set the stage for further methodological developments. To facilitate evaluations, we generate a set of benchmark graph datasets specifically for GNN explainability. We summarize current datasets and metrics for evaluating GNN explainability. Altogether, this work provides a unified methodological treatment of GNN explainability and a standardized testbed for evaluations.

cs.LG↗

arXiv2022

Restricted mean survival time regression model with time-dependent covariates

In clinical or epidemiological follow-up studies, methods based on time scale indicators such as the restricted mean survival time (RMST) have been developed to some extent. Compared with traditional hazard rate indicator system methods, the RMST is easier to interpret and does not require the proportional hazard assumption. To date, regression models based on the RMST are indirect or direct models of the RMST and baseline covariates. However, time-dependent covariates are becoming increasingly common in follow-up studies. Based on the inverse probability of censoring weighting (IPCW) method, we developed a regression model of the RMST and time-dependent covariates. Through Monte Carlo simulation, we verified the estimation performance of the regression parameters of the proposed model. Compared with the time-dependent Cox model and the fixed (baseline) covariate RMST model, the time-dependent RMST model has a better prediction ability. Finally, an example of heart transplantation was used to verify the above conclusions.

stat.ME↗

arXiv2022

Observation of novel topological states in hyperbolic lattices

The discovery of novel topological states has served as a major branch in physics and material science. However, to date, most of the established topological states of matter have been employed in Euclidean systems, where the interplay between unique geometrical characteristics of curved spaces and exotic topological phases is less explored, especially on the experimental perspective. Recently, the experimental realization of the hyperbolic lattice, which is the regular tessellation in non-Euclidean spaces with a constant negative curvature, has attracted much attention in the field of simulating exotic phenomena from quantum physics in curved spaces to the general relativity. The question is whether there are novel topological states in such a non-Euclidean system without analogues in Euclidean spaces. Here, we demonstrate both in theory and experiment that novel topological states possessing unique properties compared with their Euclidean counterparts can exist in engineered hyperbolic lattices. Specially, based on the extended Haldane model, the boundary-dominated first-order Chern edge state with a nontrivial real-space Chern number is achieved, and the associated one-way propagation is proven. Furthermore, we show that fractal-like midgap higher-order zero modes appear in deformed hyperbolic lattices, where the number of zero modes increases exponentially with the increase of lattice size. These novel topological states are observed in designed hyperbolic circuit networks by measuring site-resolved impendence responses and dynamics of voltage packets. Our findings suggest a novel platform to study topological phases beyond Euclidean space and may have potential applications in the field of designing high-efficient topological devices, such as topological lasers, with extremely fewer trivial regions.

cond-mat.mes-hall↗

arXiv2021

Implementation of an alternative method for assessing competing risks: restricted mean time lost

In clinical and epidemiological studies, hazard ratios are often applied to compare treatment effects between two groups for survival data. For competing risks data, the corresponding quantities of interest are cause-specific hazard ratios (cHRs) and subdistribution hazard ratios (sHRs). However, they both have some limitations related to model assumptions and clinical interpretation. Therefore, we recommend restricted mean time lost (RMTL) as an alternative that is easy to interpret in a competing risks framework. Based on the difference in restricted mean time lost (RMTLd), we propose a new estimator, hypothetical test and sample size formula. The simulation results show that the estimation of the RMTLd is accurate and that the RMTLd test has robust statistical performance (both type I error and power). The results of three example analyses also verify the performance of the RMTLd test. From the perspectives of clinical interpretation, application conditions and statistical performance, we recommend that the RMTLd be reported with the HR in the analysis of competing risks data and that the RMTLd even be regarded as the primary outcome when the proportional hazard assumption fails. The R code (crRMTL) is publicly available from Github (https://github.com/chenzgz/crRMTL.1). Keywords: survival analysis, competing risks, hazard ratio, restricted mean time lost, sample size, hypothesis test

stat.AP↗

arXiv2021

A Dual-Attention Neural Network for Pun Location and Using Pun-Gloss Pairs for Interpretation

Pun location is to identify the punning word (usually a word or a phrase that makes the text ambiguous) in a given short text, and pun interpretation is to find out two different meanings of the punning word. Most previous studies adopt limited word senses obtained by WSD(Word Sense Disambiguation) technique or pronunciation information in isolation to address pun location. For the task of pun interpretation, related work pays attention to various WSD algorithms. In this paper, a model called DANN (Dual-Attentive Neural Network) is proposed for pun location, effectively integrates word senses and pronunciation with context information to address two kinds of pun at the same time. Furthermore, we treat pun interpretation as a classification task and construct pungloss pairs as processing data to solve this task. Experiments on the two benchmark datasets show that our proposed methods achieve new state-of-the-art results. Our source code is available in the public code repository.

cs.CL↗

arXiv2021

Observation of anyonic Bloch oscillations

Bloch oscillations are exotic phenomena describing the periodic motion of a wave packet subjected to the external force in a lattice, where the system possessing single- or multipleparticles could exhibit distinct oscillation behaviors. In particular, it has been pointed out that quantum statistics could dramatically affected the Bloch oscillation even in the absence of particle interactions, where the oscillation frequency of two pseudofermions with the anyonic statistical angle being pi becomes half of that for two bosons. However, these statisticdependent Bloch oscillations have never been observed in experiments up to now. Here, we report the first experimental simulation of anyonic Bloch oscillations using electric circuits. By mapping eigenstates of two anyons to modes of designed circuit simulators, the Bloch oscillation of two bosons and two pseudofermions are verified by measuring the voltage dynamics. It is found that the oscillation period in the two-boson simulator is almost twice of that in the two-pseudofermion simulator, which is consistent with the theoretical prediction. Our proposal provides a flexible platform to investigate and visualize many interesting phenomena related to particle statistics, and could have potential applications in the field of the novelty signal control.

cond-mat.mes-hall↗

arXiv2021

DIG: A Turnkey Library for Diving into Graph Deep Learning Research

Although there exist several libraries for deep learning on graphs, they are aiming at implementing basic operations for graph deep learning. In the research community, implementing and benchmarking various advanced tasks are still painful and time-consuming with existing libraries. To facilitate graph deep learning research, we introduce DIG: Dive into Graphs, a turnkey library that provides a unified testbed for higher level, research-oriented graph deep learning tasks. Currently, we consider graph generation, self-supervised learning on graphs, explainability of graph neural networks, and deep learning on 3D graphs. For each direction, we provide unified implementations of data interfaces, common algorithms, and evaluation metrics. Altogether, DIG is an extensible, open-source, and turnkey library for researchers to develop new methods and effortlessly compare with common baselines using widely used datasets and evaluation metrics. Source code is available at https://github.com/divelab/DIG.

cs.LG↗

arXiv2021

Observation of non-Hermitian many-body skin effects in Hilbert space

Non-Hermiticity greatly expands existing physical laws beyond the Hermitian framework, revealing various novel phenomena with unique properties. Up to now, most exotic nonHermitian effects, such as exceptional points and non-Hermitian skin effects, are discovered in single-particle systems. The interplay between non-Hermitian and manybody correlation is expected to be a more fascinating but much less explored area. Due to the complexity of the problem, current researches in this field mainly stay at the theoretical level. The experimental observation of predicted non-Hermitian manybody phases is still a great challenging. Here, we report the first experimental simulation of strongly correlated non-Hermitian many-body system, and reveal a new type of nonHermitian many-body skin states toward effective boundaries in Hilbert space. Such an interaction-induced non-Hermitian many-body skin effect represents the aggregation of bosonic clusters with non-identical occupations in the periodic lattice. In particular, by mapping eigen-states of three correlated bosons to modes of the designed threedimensional electric circuit, non-Hermitian many-body skin effects in Hilbert space is verified by measuring the spatial impedance response. Our finding not only discloses a new physical effect in the non-Hermitian many-body system, but also suggests a flexible platform to further investigate other non-Hermitian correlated phases in experiments.

cond-mat.mes-hall↗

arXiv2021

Towards Improved and Interpretable Deep Metric Learning via Attentive Grouping

Grouping has been commonly used in deep metric learning for computing diverse features. However, current methods are prone to overfitting and lack interpretability. In this work, we propose an improved and interpretable grouping method to be integrated flexibly with any metric learning framework. Our method is based on the attention mechanism with a learnable query for each group. The query is fully trainable and can capture group-specific information when combined with the diversity loss. An appealing property of our method is that it naturally lends itself interpretability. The attention scores between the learnable query and each spatial position can be interpreted as the importance of that position. We formally show that our proposed grouping method is invariant to spatial permutations of features. When used as a module in convolutional neural networks, our method leads to translational invariance. We conduct comprehensive experiments to evaluate our method. Our quantitative results indicate that the proposed method outperforms prior methods consistently and significantly across different datasets, evaluation metrics, base models, and loss functions. For the first time to the best of our knowledge, our interpretation results clearly demonstrate that the proposed method enables the learning of distinct and diverse features across groups. The code is available on https://github.com/XinyiXuXD/DGML-master.

cs.CV↗

arXiv2021

BESS Aided Reconfigurable Energy Supply using Deep Reinforcement Learning for 5G and Beyond

The year of 2020 has witnessed the unprecedented development of 5G networks, along with the widespread deployment of 5G base stations (BSs). Nevertheless, the enormous energy consumption of BSs and the incurred huge energy cost have become significant concerns for the mobile operators. As the continuous decline of the renewable energy cost, equipping the power-hungry BSs with renewable energy generators could be a sustainable solution. In this work, we propose an energy storage aided reconfigurable renewable energy supply solution for the BS, which could supply clean energy to the BS and store surplus energy for backup usage. Specifically, to flexibly reconfigure the battery's discharging/charging operations, we propose a deep reinforcement learning based reconfiguring policy, which can adapt to the dynamical renewable energy generations as well as the varying power demands. Our experiments using the real-world data on renewable energy generations and power demands demonstrate that, our reconfigurable power supply solution can achieve an energy saving ratio of 74.8%, compared to the case with traditional power grid supply.

cs.DC↗

arXiv2021

Dynamic prediction and analysis based on restricted mean survival time in survival analysis with nonproportional hazards

In the process of clinical diagnosis and treatment, the restricted mean survival time (RMST), which reflects the life expectancy of patients up to a specified time, can be used as an appropriate outcome measure. However, the RMST only calculates the mean survival time of patients within a period of time after the start of follow-up and may not accurately portray the change in a patient's life expectancy over time. The life expectancy can be adjusted for the time the patient has already survived and defined as the conditional restricted mean survival time (cRMST). A dynamic RMST model based on the cRMST can be established by incorporating time-dependent covariates and covariates with time-varying effects. We analysed data from a study of primary biliary cirrhosis (PBC) to illustrate the use of the dynamic RMST model. The predictive performance was evaluated using the C-index and the prediction error. The proposed dynamic RMST model, which can explore the dynamic effects of prognostic factors on survival time, has better predictive performance than the RMST model. Three PBC patient examples were used to illustrate how the predicted cRMST changed at different prediction times during follow-up. The use of the dynamic RMST model based on the cRMST allows for optimization of evidence-based decision-making by updating personalized dynamic life expectancy for patients.

stat.AP↗

arXiv2021

Fast Quantum Property Prediction via Deeper 2D and 3D Graph Networks

Molecular property prediction is gaining increasing attention due to its diverse applications. One task of particular interests and importance is to predict quantum chemical properties without 3D equilibrium structures. This is practically favorable since obtaining 3D equilibrium structures requires extremely expensive calculations. In this work, we design a deep graph neural network to predict quantum properties by directly learning from 2D molecular graphs. In addition, we propose a 3D graph neural network to learn from low-cost conformer sets, which can be obtained with open-source tools using an affordable budget. We employ our methods to participate in the 2021 KDD Cup on OGB Large-Scale Challenge (OGB-LSC), which aims to predict the HOMO-LUMO energy gap of molecules. Final evaluation results reveal that we are one of the winners with a mean absolute error of 0.1235 on the holdout test set. Our implementation is available as part of the MoleculeX package (https://github.com/divelab/MoleculeX).

cs.LG↗

arXiv2021

Semi-discrete and fully discrete mixed finite element methods for Maxwell viscoelastic model of wave propagation

Semi-discrete and fully discrete mixed finite element methods are considered for Maxwell-model-based problems of wave propagation in linear viscoelastic solid. This mixed finite element framework allows the use of a large class of existing mixed conforming finite elements for elasticity in the spatial discretization. In the fully discrete scheme, a Crank-Nicolson scheme is adopted for the approximation of the temporal derivatives of stress and velocity variables. Error estimates of the semi-discrete and fully discrete schemes, as well as an unconditional stability result for the fully discrete scheme, are derived. Numerical experiments are provided to verify the theoretical results.

math.NA↗

arXiv2021

On Explainability of Graph Neural Networks via Subgraph Explorations

We consider the problem of explaining the predictions of graph neural networks (GNNs), which otherwise are considered as black boxes. Existing methods invariably focus on explaining the importance of graph nodes or edges but ignore the substructures of graphs, which are more intuitive and human-intelligible. In this work, we propose a novel method, known as SubgraphX, to explain GNNs by identifying important subgraphs. Given a trained GNN model and an input graph, our SubgraphX explains its predictions by efficiently exploring different subgraphs with Monte Carlo tree search. To make the tree search more effective, we propose to use Shapley values as a measure of subgraph importance, which can also capture the interactions among different subgraphs. To expedite computations, we propose efficient approximation schemes to compute Shapley values for graph data. Our work represents the first attempt to explain GNNs via identifying subgraphs explicitly and directly. Experimental results show that our SubgraphX achieves significantly improved explanations, while keeping computations at a reasonable level.

cs.LG↗

arXiv2021

Self-Supervised Contrastive Learning for Efficient User Satisfaction Prediction in Conversational Agents

Turn-level user satisfaction is one of the most important performance metrics for conversational agents. It can be used to monitor the agent's performance and provide insights about defective user experiences. Moreover, a powerful satisfaction model can be used as an objective function that a conversational agent continuously optimizes for. While end-to-end deep learning has shown promising results, having access to a large number of reliable annotated samples required by these methods remains challenging. In a large-scale conversational system, there is a growing number of newly developed skills, making the traditional data collection, annotation, and modeling process impractical due to the required annotation costs as well as the turnaround times. In this paper, we suggest a self-supervised contrastive learning approach that leverages the pool of unlabeled data to learn user-agent interactions. We show that the pre-trained models using the self-supervised objective are transferable to the user satisfaction prediction. In addition, we propose a novel few-shot transfer learning approach that ensures better transferability for very small sample sizes. The suggested few-shot method does not require any inner loop optimization process and is scalable to very large datasets and complex models. Based on our experiments using real-world data from a large-scale commercial system, the suggested approach is able to significantly reduce the required number of annotations, while improving the generalization on unseen out-of-domain skills.

cs.LG↗