arXiv subjects

Zihan Yang

Publications and source records attributed to Zihan Yang.

44 records · Page 3Linked to original sources

arXiv2024

Ac$_3$Ni$_2$O$_7$ and La$_2$$Ae$Ni$_2$O$_6$F ($Ae$ = Sr, Ba): Benchmark Materials for Bilayer Nickelate Superconductivity

We theoretically propose Ac$_3$Ni$_2$O$_7$, La$_2$BaNi$_2$O$_6$F, and La$_2$SrNi$_2$O$_6$F compounds to be benchmark materials for bilayer nickelate superconductivity. The stable phase of Ac$_3$Ni$_2$O$_7$ and La$_2$BaNi$_2$O$_6$F are found to be $I4/mmm$ without the lattice distortion caused by octahedra rotation at ambient pressure, where as the lattice distortion in La$_2$SrNi$_2$O$_6$F can be suppressed with relatively small external pressure of 4 GPa. The magnetism, electronic structure and spin susceptibilities of Ac$_3$Ni$_2$O$_7$ are extremely close to those of La$_3$Ni$_2$O$_7$ at 30 GPa. The ground state of La$_2$BaNi$_2$O$_6$F and La$_2$SrNi$_2$O$_6$F are antiferromagnetically coupled checkerboard bilayer with sizable magnetic moment on Ni. In addition, the inter-layer coupling $J_{\perp}$ between Ni-bilayers in La$_2$BaNi$_2$O$_6$F or La$_2$SrNi$_2$O$_6$F is only $\sim$ 1/10 of that in Ac$_3$Ni$_2$O$_7$ or La$_3$Ni$_2$O$_7$ at 30 GPa. We argue that these compounds may serve as superconducting candidates at ambient pressure and can be employed to testify theoretical proposals for bilayer nickelate superconductivity.

cond-mat.supr-con↗

arXiv2023

Helios: An Efficient Out-of-core GNN Training System on Terabyte-scale Graphs with In-memory Performance

Training graph neural networks (GNNs) on large-scale graph data holds immense promise for numerous real-world applications but remains a great challenge. Several disk-based GNN systems have been built to train large-scale graphs in a single machine. However, they often fall short in terms of performance, especially when training on terabyte-scale graphs. This is because existing disk-based systems either overly focus on minimizing the number of SSD accesses or do not fully overlap SSD accesses with GNN training, thus resulting in substantial unnecessary overhead on the CPU side and then low GPU utilization. To this end, we propose Helios, a system that can train GNN on terabyte graphs in a single machine while achieving throughput comparable with in-memory systems. To achieve this, we first present a GPU-initiated asynchronous disk IO stack, allowing the GPU to directly access graph data on SSD. This design only requires about 30% GPU cores to reach the almost maximal disk IO throughput and wastes no GPU cores between IO submission and IO completion such that the majority of GPU cores are left for other GNN kernels. Second, we design a GPU-managed heterogeneous cache that extends the cache hierarchy to heterogeneous CPU and GPU memory and thus enhances cache lookup throughput significantly by GPU parallelism. Finally, we build a deep GNN-aware pipeline that seamlessly integrates the computation and communication phases of the entire GNN training process, maximizing the utility of GPU computation cycles. Experimental results demonstrate that Helios can match the training throughput of in-memory GNN systems, even for terabyte-scale graphs. Remarkably, Helios surpasses the state-of-the-art GPU-managed baselines by up to 6.43x and exceeds CPU-managed baselines by over 182x on all terabyte-scale graphs.

cs.DC↗

arXiv2023

Superconductivity of cerium under pressures up to 54GPa

Cerium is a fascinating element due to its diverse physical properties, which include forming various crystal structures ($γ$, $α$, $α^{'}$, $α^{''}$ and $ε$), mixed valence behavior and superconductivity, making it an ideal platform for investigating the interplay between different electronic states. Here, we present a comprehensive transport study of cerium under hydrostatic pressures up to 54 GPa. Upon applying pressure, cerium undergoes the $α$ $\rightarrow$ $α^{''}$ transition at around 4.9 GPa, which is accompanied by the appearance of superconductivity with $T_{\rm c}$ of 0.4 K, and $T_{\rm c}$ slightly increases to 0.5 K at 11.4 GPa. At 14.3 GPa, $T_{\rm c}$ suddenly increases when the $α^{''}$ phase transforms into the $ε$ phase, reaching a maximum value of 1.25 K at around 17.2 GPa. Upon further increasing the pressure, $T_{\rm c}$ monotonically decreases. Together with the results of previous studies, our findings suggest that the evolution of superconductivity in cerium is closely correlated with the multiple pressure-induced structural transitions and corresponding unusual electronic structures.

cond-mat.supr-con↗

arXiv2023

ChemGymRL: An Interactive Framework for Reinforcement Learning for Digital Chemistry

This paper provides a simulated laboratory for making use of Reinforcement Learning (RL) for chemical discovery. Since RL is fairly data intensive, training agents `on-the-fly' by taking actions in the real world is infeasible and possibly dangerous. Moreover, chemical processing and discovery involves challenges which are not commonly found in RL benchmarks and therefore offer a rich space to work in. We introduce a set of highly customizable and open-source RL environments, ChemGymRL, based on the standard Open AI Gym template. ChemGymRL supports a series of interconnected virtual chemical benches where RL agents can operate and train. The paper introduces and details each of these benches using well-known chemical reactions as illustrative examples, and trains a set of standard RL algorithms in each of these benches. Finally, discussion and comparison of the performances of several standard RL methods are provided in addition to a list of directions for future work as a vision for the further development and usage of ChemGymRL.

cs.LG↗

arXiv2023

Learning CLIP Guided Visual-Text Fusion Transformer for Video-based Pedestrian Attribute Recognition

Existing pedestrian attribute recognition (PAR) algorithms are mainly developed based on a static image. However, the performance is not reliable for images with challenging factors, such as heavy occlusion, motion blur, etc. In this work, we propose to understand human attributes using video frames that can make full use of temporal information. Specifically, we formulate the video-based PAR as a vision-language fusion problem and adopt pre-trained big models CLIP to extract the feature embeddings of given video frames. To better utilize the semantic information, we take the attribute list as another input and transform the attribute words/phrase into the corresponding sentence via split, expand, and prompt. Then, the text encoder of CLIP is utilized for language embedding. The averaged visual tokens and text tokens are concatenated and fed into a fusion Transformer for multi-modal interactive learning. The enhanced tokens will be fed into a classification head for pedestrian attribute prediction. Extensive experiments on a large-scale video-based PAR dataset fully validated the effectiveness of our proposed framework.

cs.CV↗

arXiv2022

Low-Cost Beamforming and DOA Estimation Based on One-Bit Reconfigurable Intelligent Surface

In this work, we consider the Direction-of-Arrival (DOA) estimation problem in a low-cost architecture where only one antenna as the receiver is aided by a reconfigurable intelligent surface (RIS). We introduce the one-bit RIS as a signal reflector to enhance signal transmission in non-line-of-sight (NLOS) situations and substantially simplify the physical hardware for DOA estimation. We optimize the beamforming scheme called measurement matrix to focus the echo power on the receiver with the coarse localization information of the targets as the prior. A beamforming scheme based on the modified genetic algorithm is proposed to optimize the measurement matrix, guaranteeing restricted isometry property (RIP) and meeting single beamforming requirements. The DOA results are finely estimated by solving an atomic-norm based sparse reconstruction problem. Simulation results show that the proposed method outperforms the existing methods in the DOA estimation performance.

eess.SP↗

arXiv2022

A Survey of Automated Data Augmentation Algorithms for Deep Learning-based Image Classification Tasks

In recent years, one of the most popular techniques in the computer vision community has been the deep learning technique. As a data-driven technique, deep model requires enormous amounts of accurately labelled training data, which is often inaccessible in many real-world applications. A data-space solution is Data Augmentation (DA), that can artificially generate new images out of original samples. Image augmentation strategies can vary by dataset, as different data types might require different augmentations to facilitate model training. However, the design of DA policies has been largely decided by the human experts with domain knowledge, which is considered to be highly subjective and error-prone. To mitigate such problem, a novel direction is to automatically learn the image augmentation policies from the given dataset using Automated Data Augmentation (AutoDA) techniques. The goal of AutoDA models is to find the optimal DA policies that can maximize the model performance gains. This survey discusses the underlying reasons of the emergence of AutoDA technology from the perspective of image classification. We identify three key components of a standard AutoDA model: a search space, a search algorithm and an evaluation function. Based on their architecture, we provide a systematic taxonomy of existing image AutoDA approaches. This paper presents the major works in AutoDA field, discussing their pros and cons, and proposing several potential directions for future improvements.

cs.CV↗

arXiv2022

Reconfigurable Intelligent Surface Aided Sparse DOA Estimation Method With Non-ULA

The direction of arrival (DOA) estimation problem is addressed in this letter. A reconfigurable intelligent surface (RIS) aided system for the DOA estimation is proposed. Unlike traditional DOA estimation systems, a low-cost system with only one complete functional receiver is given by changing the phases of the reflected signals at the RIS elements to realize the multiple measurements. Moreover, an atomic norm-based method is proposed for the DOA estimation by exploiting the target sparsity in the spatial domain and solved by a semi-definite programming (SDP) method. Furthermore, the RIS elements can be any geometry array for practical consideration, so a transformation matrix is formulated and different from the conventional SDP method. Simulation results show that the proposed method can estimate the DOA more accurately than the existing methods in the non-uniform linear RIS array.

eess.SP↗