arXiv subjects

Chul-Ho Lee

Publications and source records attributed to Chul-Ho Lee.

At least 19 recordsLinked to original sources

arXiv2025

Accelerating Sparse Matrix-Matrix Multiplication on GPUs with Processing Near HBMs

Sparse General Matrix-Matrix Multiplication (SpGEMM) is a fundamental operation in numerous scientific computing and data analytics applications, often bottlenecked by irregular memory access patterns. This paper presents Hash based Multi-phase SpGEMM on GPU and the Acceleration of Indirect Memory Access (AIA) technique, a novel custom near-memory processing approach to optimizing SpGEMM on GPU HBM. Our hardware-software co-designed framework for SpGEMM demonstrates significant performance improvements over state-of-the-art methods, particularly in handling complex, application-specific workloads. We evaluate our approach on various graph workloads, including graph contraction, Markov clustering, and Graph Neural Networks (GNNs), showcasing its practical applicability. For graph analytics applications, AIA demonstrates up to 17.3% time reduction from the software-only implementation, while achieving time reduction of 76.5% for Graph Contraction and 58.4% for Markov Clustering compared to cuSPARSE. For GNN training applications with structured global pruning, our hybrid approach delivers an average of 1.43x speedup over software-only implementation across six benchmark datasets and three architectures (GCN, GIN, GraphSAGE), and shows 1.95x speedup for GNN workloads when compared to cuSPARSE, with up to 4.18x gains on large-scale datasets.

cs.DC↗

arXiv2025

FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance

Due to the growing concern about unsavory behaviors of machine learning models toward certain demographic groups, the notion of 'fairness' has recently drawn much attention from the community, thereby motivating the study of fairness in graph clustering. Fair graph clustering aims to partition the set of nodes in a graph into $k$ disjoint clusters such that the proportion of each protected group within each cluster is consistent with the proportion of that group in the entire dataset. It is, however, computationally challenging to incorporate fairness constraints into existing graph clustering algorithms, particularly for large graphs. To address this problem, we propose FairAD, a computationally efficient fair graph clustering method. It first constructs a new affinity matrix based on the notion of algebraic distance such that fairness constraints are imposed. A graph coarsening process is then performed on this affinity matrix to find representative nodes that correspond to $k$ clusters. Finally, a constrained minimization problem is solved to obtain the solution of fair clustering. Experiment results on the modified stochastic block model and six public datasets show that FairAD can achieve fair clustering while being up to 40 times faster compared to state-of-the-art fair graph clustering algorithms.

cs.LG↗

arXiv2025

Effective Delayed Patching for Transient Malware Control on Networks

Patching nodes is an effective network defense strategy for malware control at early stages, and its performance is primarily dependent on how accurately the infection propagation is characterized. In this paper, we aim to design a novel patching policy based on the susceptible-infected epidemic network model by incorporating the influence of patching delay--the type of delay that has been largely overlooked in designing patching policies in the literature, while being prevalent in practice. We first identify 'critical edges' that form a boundary to separate the most likely infected nodes from the nodes which would still remain healthy after the patching delay. We next leverage the critical edges to determine which nodes to be patched in light of limited patching resources at early stages. To this end, we formulate a constrained graph partitioning problem and use its solution to identify a set of nodes to patch or vaccinate under the limited resources, to effectively prevent malware propagation from getting through the healthy region. We numerically validate that our patching policy significantly outperforms other baseline policies in protecting the healthy nodes under limited patching resources and in the presence of patching delay.

cs.NI↗

arXiv2025

TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction

Temporal graph link prediction aims to predict future interactions between nodes in a graph based on their historical interactions, which are encoded in node embeddings. We observe that heterogeneity naturally appears in temporal interactions, e.g., a few node pairs can make most interaction events, and interaction events happen at varying intervals. This leads to the problems of ineffective temporal information encoding and forgetting of past interactions for a pair of nodes that interact intermittently for their link prediction. Existing methods, however, do not consider such heterogeneity in their learning process, and thus their learned temporal node embeddings are less effective, especially when predicting the links for infrequently interacting node pairs. To cope with the heterogeneity, we propose a novel framework called TAMI, which contains two effective components, namely log time encoding function (LTE) and link history aggregation (LHA). LTE better encodes the temporal information through transforming interaction intervals into more balanced ones, and LHA prevents the historical interactions for each target node pair from being forgotten. State-of-the-art temporal graph neural networks can be seamlessly and readily integrated into TAMI to improve their effectiveness. Experiment results on 13 classic datasets and three newest temporal graph benchmark (TGB) datasets show that TAMI consistently improves the link prediction performance of the underlying models in both transductive and inductive settings. Our code is available at https://github.com/Alleinx/TAMI_temporal_graph.

cs.LG↗

arXiv2025

Hund's coupling assisted orbital-selective superconductivity in Ba1-xKxFe2As2

While the superconducting transition temperature of hole-doped Ba_{1-x}K_{x}Fe_{2}As_{2} decreases past optimal doping, superconductivity does not completely disappear even for the fully doped KFe_{2}As_{2} compound. In fact, superconductivity is robust through a Lifshitz transition where electron bands become hole-like around the zone corner at around x=0.7, thus challenging the conventional understanding of superconductivity in iron-based systems. High-resolution angle-resolved photoemission spectroscopy is used to investigate the superconducting gap structure, as well as the normal state electronic structure, around optimal doping and across the Lifshitz transition. Our findings reveal a largely orbital-dependent superconducting gap structure, where the more strongly correlated d_{xy} band has a vanishing superconducting gap at higher doping, aligning with the Hund's metal behavior observed in the normal state. Notably, the superconducting gap on the d_{xy} band disappears before the Lifshitz transition, suggesting that the Fermi surface topology may play a secondary role. We discuss how these results point to orbital-selective superconducting pairing and how strong correlations via Hund's coupling may shape superconducting gap structures in iron-based and other multiorbital superconductors.

cond-mat.supr-con↗

arXiv2025

Graph-based Fingerprint Update Using Unlabelled WiFi Signals

WiFi received signal strength (RSS) environment evolves over time due to movement of access points (APs), AP power adjustment, installation and removal of APs, etc. We study how to effectively update an existing database of fingerprints, defined as the RSS values of APs at designated locations, using a batch of newly collected unlabelled (possibly crowdsourced) WiFi signals. Prior art either estimates the locations of the new signals without updating the existing fingerprints or filters out the new APs without sufficiently embracing their features. To address that, we propose GUFU, a novel effective graph-based approach to update WiFi fingerprints using unlabelled signals with possibly new APs. Based on the observation that similar signal vectors likely imply physical proximity, GUFU employs a graph neural network (GNN) and a link prediction algorithm to retrain an incremental network given the new signals and APs. After the retraining, it then updates the signal vectors at the designated locations. Through extensive experiments in four large representative sites, GUFU is shown to achieve remarkably higher fingerprint adaptivity as compared with other state-of-the-art approaches, with error reduction of 21.4% and 29.8% in RSS values and location prediction, respectively.

cs.NI↗

arXiv2025

Demystifying Distributed Training of Graph Neural Networks for Link Prediction

Graph neural networks (GNNs) are powerful tools for solving graph-related problems. Distributed GNN frameworks and systems enhance the scalability of GNNs and accelerate model training, yet most are optimized for node classification. Their performance on link prediction remains underexplored. This paper demystifies distributed training of GNNs for link prediction by investigating the issue of performance degradation when each worker trains a GNN on its assigned partitioned subgraph without having access to the entire graph. We discover that the main sources of the issue come from not only the information loss caused by graph partitioning but also the ways of drawing negative samples during model training. While sharing the complete graph information with each worker resolves the issue and preserves link prediction accuracy, it incurs a high communication cost. We propose SpLPG, which effectively leverages graph sparsification to mitigate the issue of performance degradation at a reduced communication cost. Experiment results on several public real-world datasets demonstrate the effectiveness of SpLPG, which reduces the communication overhead by up to about 80% while mostly preserving link prediction accuracy.

cs.LG↗

arXiv2025

Cubic ReSTe as a High-Performance Thermoelectric Material

We report thermoelectric properties of sintered samples of undoped, W-doped, and Sb-doped ReSTe crystallized in a cubic MoSBr-type structure. All samples exhibited p-type thermoelectric properties. ReSTe and Re0.993W0.007STe exhibited the largest dimensionless figure of merit ZT, reaching 0.4 at 660 K. This high performance is attributed to large power factor owing to the degenerate semiconducting state realized by the strong spin-orbit coupling and low lattice thermal conductivity of the sintered samples. Furthermore, electronic band dispersion of ReSTe is almost flat at the bottom of the conduction band, suggesting that n-type ReSTe is expected to exhibit much higher performance than p-type ReSTe.

cond-mat.mtrl-sci↗

arXiv2025

First-principles Study of Metallic-atom Diffusion in Thermoelectric Material Mg$_3$Sb$_2$

Mg$_3$Sb$_2$ is a promising thermoelectric material that consists of nontoxic and earth-abundant elements. We investigate metallic-atom diffusion in Mg$_3$Sb$_2$ by calculating the defect formation energy and the diffusion energy barrier for several kinds of metallic-atom impurities. We find that early transition metals, including $4d$ elements, with a large atomic radius have a high defect formation energy, whereas Mg and late transition metals such as Ni, Cu, and Zn have relatively low formation energies as interstitial impurities. Interstitial Ni, which is found to have a very low defect formation energy, might diffuse in the $ab$ plane at high temperatures with the energy barrier of 0.7 eV, while it seems difficult to diffuse in the $c$ direction. Interstitial Cu has a higher defect formation energy than Ni but has a low energy barrier of $\sim$0.4 eV for diffusion in the $ab$ plane. This study will offer important knowledge for developing a thermoelectric device of Mg$_3$Sb$_2$.

cond-mat.mtrl-sci↗

arXiv2024

M$^3$-Impute: Mask-guided Representation Learning for Missing Value Imputation

Missing values are a common problem that poses significant challenges to data analysis and machine learning. This problem necessitates the development of an effective imputation method to fill in the missing values accurately, thereby enhancing the overall quality and utility of the datasets. Existing imputation methods, however, fall short of explicitly considering the `missingness' information in the data during the embedding initialization stage and modeling the entangled feature and sample correlations during the learning process, thus leading to inferior performance. We propose M$^3$-Impute, which aims to explicitly leverage the missingness information and such correlations with novel masking schemes. M$^3$-Impute first models the data as a bipartite graph and uses a graph neural network to learn node embeddings, where the refined embedding initialization process directly incorporates the missingness information. They are then optimized through M$^3$-Impute's novel feature correlation unit (FRU) and sample correlation unit (SRU) that effectively captures feature and sample correlations for imputation. Experiment results on 25 benchmark datasets under three different missingness settings show the effectiveness of M$^3$-Impute by achieving 20 best and 4 second-best MAE scores on average.

cs.LG↗

arXiv2024

SDT-GNN: Streaming-based Distributed Training Framework for Graph Neural Networks

Recently, distributed GNN training frameworks, such as DistDGL and PyG, have been developed to enable training GNN models on large graphs by leveraging multiple GPUs in a distributed manner. Despite these advances, their memory requirements are still excessively high, thereby hindering GNN training on large graphs using commodity workstations. In this paper, we propose SDT-GNN, a streaming-based distributed GNN training framework. Unlike the existing frameworks that load the entire graph in memory, it takes a stream of edges as input for graph partitioning to reduce the memory requirement for partitioning. It also enables distributed GNN training even when the aggregated memory size of GPUs is smaller than the size of the graph and feature data. Furthermore, to improve the quality of partitioning, we propose SPRING, a novel streaming partitioning algorithm for distributed GNN training. We demonstrate the effectiveness and efficiency of SDT-GNN on seven large public datasets. SDT-GNN has up to 95% less memory footprint than DistDGL and PyG without sacrificing the prediction accuracy. SPRING also outperforms state-of-the-art streaming partitioning algorithms significantly.

cs.LG↗

arXiv2024

Single-Crystal Growth and Characterization of Cuprate Superconductor (Hg,Re)Ba$_2$Ca$_2$Cu$_3$O$_{8+δ}$

We grew (Hg,Re)Ba$_2$Ca$_2$Cu$_3$O$_{8+δ}$ ((Hg,Re)1223) single crystals with good reproducibility via the single-step flux method using monoxides as raw materials. A double-sealing method using a thick-walled quartz tube and a stainless-steel container was adopted for explosion protection. The maximum crystal size was approximately 1 mm x 1 mm in the ab plane and 0.04 mm in thickness. The crystal was square-shaped, reflecting the tetragonal crystal structure of (Hg,Re)1223. Magnetic susceptibility measurements indicated a critical temperature of 130 K. The in-plane resistivity exhibited a linear temperature dependence, indicating that the sample was close to optimal doping level. The out-of-plane resistivity was also measured, and the anisotropy parameter was 250-650 at 300 K.

cond-mat.supr-con↗

arXiv2023

Controlling Epidemic Spread Under Immunization Delay Constraints

In this paper, we study the problem of minimizing the spread of a viral epidemic when immunization takes a non-negligible amount of time to take into effect. Specifically, our problem is to determine which set of nodes to be vaccinated when vaccines take a random amount of time in order to maximize the total reward, which is the expected number of saved nodes. We first provide a mathematical analysis for the reward function of vaccinating an arbitrary number of nodes when there is a single source of infection. While it is infeasible to obtain the optimal solution analytically due to the combinatorial nature of the problem, we establish that the problem is a monotone submodular maximization problem and develop a greedy algorithm that achieves a $(1\!-\!1/e)$-approximation. We further extend the scenario to the ones with multiple infection sources and discuss how the greedy algorithm can be applied systematically for the multiple-source scenarios. We finally present extensive simulation results to demonstrate the superiority of our greedy algorithm over other baseline vaccination strategies.

cs.SI↗

arXiv2023

FIS-ONE: Floor Identification System with One Label for Crowdsourced RF Signals

Floor labels of crowdsourced RF signals are crucial for many smart-city applications, such as multi-floor indoor localization, geofencing, and robot surveillance. To build a prediction model to identify the floor number of a new RF signal upon its measurement, conventional approaches using the crowdsourced RF signals assume that at least few labeled signal samples are available on each floor. In this work, we push the envelope further and demonstrate that it is technically feasible to enable such floor identification with only one floor-labeled signal sample on the bottom floor while having the rest of signal samples unlabeled. We propose FIS-ONE, a novel floor identification system with only one labeled sample. FIS-ONE consists of two steps, namely signal clustering and cluster indexing. We first build a bipartite graph to model the RF signal samples and obtain a latent representation of each node (each signal sample) using our attention-based graph neural network model so that the RF signal samples can be clustered more accurately. Then, we tackle the problem of indexing the clusters with proper floor labels, by leveraging the observation that signals from an access point can be detected on different floors, i.e., signal spillover. Specifically, we formulate a cluster indexing problem as a combinatorial optimization problem and show that it is equivalent to solving a traveling salesman problem, whose (near-)optimal solution can be found efficiently. We have implemented FIS-ONE and validated its effectiveness on the Microsoft dataset and in three large shopping malls. Our results show that FIS-ONE outperforms other baseline algorithms significantly, with up to 23% improvement in adjusted rand index and 25% improvement in normalized mutual information using only one floor-labeled signal sample.

cs.NI↗

arXiv2023

Run, Don't Walk: Chasing Higher FLOPS for Faster Neural Networks

To design fast neural networks, many works have been focusing on reducing the number of floating-point operations (FLOPs). We observe that such reduction in FLOPs, however, does not necessarily lead to a similar level of reduction in latency. This mainly stems from inefficiently low floating-point operations per second (FLOPS). To achieve faster networks, we revisit popular operators and demonstrate that such low FLOPS is mainly due to frequent memory access of the operators, especially the depthwise convolution. We hence propose a novel partial convolution (PConv) that extracts spatial features more efficiently, by cutting down redundant computation and memory access simultaneously. Building upon our PConv, we further propose FasterNet, a new family of neural networks, which attains substantially higher running speed than others on a wide range of devices, without compromising on accuracy for various vision tasks. For example, on ImageNet-1k, our tiny FasterNet-T0 is $2.8\times$, $3.3\times$, and $2.4\times$ faster than MobileViT-XXS on GPU, CPU, and ARM processors, respectively, while being $2.9\%$ more accurate. Our large FasterNet-L achieves impressive $83.5\%$ top-1 accuracy, on par with the emerging Swin-B, while having $36\%$ higher inference throughput on GPU, as well as saving $37\%$ compute time on CPU. Code is available at \url{https://github.com/JierunChen/FasterNet}.

cs.CV↗

arXiv2023

Semi-supervised Learning with Network Embedding on Ambient RF Signals for Geofencing Services

In applications such as elderly care, dementia anti-wandering and pandemic control, it is important to ensure that people are within a predefined area for their safety and well-being. We propose GEM, a practical, semi-supervised Geofencing system with network EMbedding, which is based only on ambient radio frequency (RF) signals. GEM models measured RF signal records as a weighted bipartite graph. With access points on one side and signal records on the other, it is able to precisely capture the relationships between signal records. GEM then learns node embeddings from the graph via a novel bipartite network embedding algorithm called BiSAGE, based on a Bipartite graph neural network with a novel bi-level SAmple and aggreGatE mechanism and non-uniform neighborhood sampling. Using the learned embeddings, GEM finally builds a one-class classification model via an enhanced histogram-based algorithm for in-out detection, i.e., to detect whether the user is inside the area or not. This model also keeps on improving with newly collected signal records. We demonstrate through extensive experiments in diverse environments that GEM shows state-of-the-art performance with up to 34% improvement in F-score. BiSAGE in GEM leads to a 54% improvement in F-score, as compared to the one without BiSAGE.

cs.NI↗

arXiv2023

Exploring the magnetic properties of individual barcode nanowires using wide-field diamond microscopy

Barcode magnetic nanowires typically comprise a multilayer magnetic structure in a single body with more than one segment type. Interestingly, owing to selective functionalization and novel interactions between the layers, barcode magnetic nanowires have attracted significant attention, particularly in the field of bioengineering. However, an analysis of their magnetic properties at the individual nanowire level remains challenging. With this background, herein, we investigated the characterization of magnetic nanowires at room temperature under ambient conditions based on magnetic images obtained via wide-field quantum microscopy with nitrogen-vacancy centers in diamond. Consequently, we could extract critical magnetic properties, such as the saturation magnetization and coercivity, of single nanowires by comparing the experimental results with those of micromagnetic simulations. This study opens up the possibility for a versatile characterization method suited to individual magnetic nanowires.

quant-ph↗

arXiv2023

Observation of superconducting vortices carrying a temperature-dependent fraction of the flux quantum

The magnetic response is a state-defining property of superconductors. The magnetic flux penetrates type-II bulk superconductors by forming quantum vortices when the enclosed magnetic flux is equal to the magnetic flux quantum. The flux quantum is the universal quantity that depends only on the ratio of fundamental constants: the electron charge and the Planck constant. This work investigates the vortex state in the hole-overdoped Ba$_{1-x}$K$_x$Fe$_2$As$_2$ by using scanning superconducting quantum interference device (SQUID) magnetometry. We observed quantum vortices that carry only a fraction of the flux quantum, which vary continuously with temperature. This finding establishes the phenomenon that superconductors support quantum vortices with non-universally quantized magnetic flux. Furthermore, the demonstrations of the mobility of the fractional vortices and the manipulability of their positions open up a route for future fluxonics applications.

cond-mat.supr-con↗