Search arXiv⌕ Search

arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 631 records · Page 35Linked to original sources
arXiv2023

A Synergy between On- and Off-Chip Data Reuse for GPU-based Out-of-Core Stencil Computation

Stencil computation is an extensively-utilized class of scientific-computing applications that can be efficiently accelerated by graphics processing units (GPUs). Out-of-core approaches enable a GPU to handle large stencil codes whose data size is beyond the memory capacity of the GPU. However, current research on out-of-core stencil computation primarily focus on minimizing the amount of data transferred between the CPU and GPU. Few studies consider simultaneously optimizing data transfer and kernel execution. To fill the research gap, this work presents a synergy between on- and off-chip data reuse for out-of-core stencil codes, termed SO2DR. First, overlapping regions between data chunks are shared in the off-chip memory to eliminate redundant CPU-GPU data transfer. Secondly, redundant computation at the off-chip memory level is intentionally introduced to decouple kernel execution from region sharing, hence enabling data reuse in the on-chip memory. Experimental results demonstrate that SO2DR significantly enhances the kernel-execution performance while reducing the CPU-GPU data-transfer time. Specifically, SO2DR achieves average speedups of 2.78x and 1.14x for five stencil benchmarks, compared to an out-of-core stencil code which is free of redundant transfer and computation, and an in-core stencil code which is free of data transfer, respectively.

cs.DC↗
arXiv2023

Client-side Gradient Inversion Against Federated Learning from Poisoning

Federated Learning (FL) enables distributed participants (e.g., mobile devices) to train a global model without sharing data directly to a central server. Recent studies have revealed that FL is vulnerable to gradient inversion attack (GIA), which aims to reconstruct the original training samples and poses high risk against the privacy of clients in FL. However, most existing GIAs necessitate control over the server and rely on strong prior knowledge including batch normalization and data distribution information. In this work, we propose Client-side poisoning Gradient Inversion (CGI), which is a novel attack method that can be launched from clients. For the first time, we show the feasibility of a client-side adversary with limited knowledge being able to recover the training samples from the aggregated global model. We take a distinct approach in which the adversary utilizes a malicious model that amplifies the loss of a specific targeted class of interest. When honest clients employ the poisoned global model, the gradients of samples belonging to the targeted class are magnified, making them the dominant factor in the aggregated update. This enables the adversary to effectively reconstruct the private input belonging to other clients using the aggregated update. In addition, our CGI also features its ability to remain stealthy against Byzantine-robust aggregation rules (AGRs). By optimizing malicious updates and blending benign updates with a malicious replacement vector, our method remains undetected by these defense mechanisms. To evaluate the performance of CGI, we conduct experiments on various benchmark datasets, considering representative Byzantine-robust AGRs, and exploring diverse FL settings with different levels of adversary knowledge about the data. Our results demonstrate that CGI consistently and successfully extracts training input in all tested scenarios.

cs.CR↗
arXiv2023

Task-Oriented Communication for Multi-Device Cooperative Edge Inference

This paper investigates task-oriented communication for multi-device cooperative edge inference, where a group of distributed low-end edge devices transmit the extracted features of local samples to a powerful edge server for inference. While cooperative edge inference can overcome the limited sensing capability of a single device, it substantially increases the communication overhead and may incur excessive latency. To enable low-latency cooperative inference, we propose a learning-based communication scheme that optimizes local feature extraction and distributed feature encoding in a task-oriented manner, i.e., to remove data redundancy and transmit information that is essential for the downstream inference task rather than reconstructing the data samples at the edge server. Specifically, we leverage an information bottleneck (IB) principle to extract the task-relevant feature at each edge device and adopt a distributed information bottleneck (DIB) framework to formalize a single-letter characterization of the optimal rate-relevance tradeoff for distributed feature encoding. To admit flexible control of the communication overhead, we extend the DIB framework to a distributed deterministic information bottleneck (DDIB) objective that explicitly incorporates the representational costs of the encoded features. As the IB-based objectives are computationally prohibitive for high-dimensional data, we adopt variational approximations to make the optimization problems tractable. To compensate the potential performance loss due to the variational approximations, we also develop a selective retransmission (SR) mechanism to identify the redundancy in the encoded features of multiple edge devices to attain additional communication overhead reduction. Extensive experiments evidence that the proposed task-oriented communication scheme achieves a better rate-relevance tradeoff than baseline methods.

eess.SP↗
arXiv2023

Observation of Flat Band and Van Hove Singularity in Non-superconducting Nitrogen-doped Lutetium Hydride

Hydrogen-rich materials offer a compelling avenue towards room temperature superconductivity, albeit under ultra-high pressure. However, the experimental investigation of the electronic band structure remains elusive, due to the inherent instability of most of the hydrogen-rich materials upon pressure release. Very recently, nitrogen-doped lutetium hydride was claimed to host room temperature superconductivity under near ambient pressure but was disproven by following works. Upon decompression, nitrogen doped lutetium hydride manifests a stable metallic phase with dark blue color. Moreover, high temperature superconductivity has been reported in lutetium hydrides Lu4H23 (~71 K) under around 200 GPa. These properties engender an unprecedented opportunity, allowing for the experimental investigation of the electronic band structure intrinsic to hydrogen-rich material. In this work, using angle resolved photoemission spectroscopy to investigate the non-superconducting nitrogen doped lutetium hydride, we observed significant flat band and Van Hove singularity marginally below the Fermi level. These salient features, identified as critical elements, proffer potential amplifiers for the realization of heightened superconductivity, as evidenced by prior research. Our results not only unveil a confluence of potent strong correlation effects and anisotropy within the Lu-H-N compound, but also provide a prospect for engineering high temperature superconductivity through the strategic manipulation of flat band and the VHS, effectively tailoring their alignment with the Fermi energy.

cond-mat.supr-con↗
arXiv2023

Stress-shape misalignment in confluent cell layers

This study investigates the relationship between cell shape and cell-generated stresses in confluent cell layers. Using simultaneous measurements of cell shape orientation and cell-generated contractile forces in MDCK and LP-9 colonies, we report the emergence of correlated, dynamic domains in which misalignment between the directors defined by cell shape and by contractile forces reaches up to 90$^o$, effectively creating extensile domains in a monolayer of contractile cells. To understand this misalignment, we develop a continuum model that decouples the orientation of cell-generated active forces from the orientation of the cell shapes. This challenges the prevailing understanding that cells throughout a tissue create either contractile or extensile forces, and the validity of the usual active nematic models of cell motility where active forces are strictly slaved to cell shape orientation.

physics.bio-ph↗
arXiv2023

NTU4DRadLM: 4D Radar-centric Multi-Modal Dataset for Localization and Mapping

Simultaneous Localization and Mapping (SLAM) is moving towards a robust perception age. However, LiDAR- and visual- SLAM may easily fail in adverse conditions (rain, snow, smoke and fog, etc.). In comparison, SLAM based on 4D Radar, thermal camera and IMU can work robustly. But only a few literature can be found. A major reason is the lack of related datasets, which seriously hinders the research. Even though some datasets are proposed based on 4D radar in past four years, they are mainly designed for object detection, rather than SLAM. Furthermore, they normally do not include thermal camera. Therefore, in this paper, NTU4DRadLM is presented to meet this requirement. The main characteristics are: 1) It is the only dataset that simultaneously includes all 6 sensors: 4D radar, thermal camera, IMU, 3D LiDAR, visual camera and RTK GPS. 2) Specifically designed for SLAM tasks, which provides fine-tuned ground truth odometry and intentionally formulated loop closures. 3) Considered both low-speed robot platform and fast-speed unmanned vehicle platform. 4) Covered structured, unstructured and semi-structured environments. 5) Considered both middle- and large- scale outdoor environments, i.e., the 6 trajectories range from 246m to 6.95km. 6) Comprehensively evaluated three types of SLAM algorithms. Totally, the dataset is around 17.6km, 85mins, 50GB and it will be accessible from this link: https://github.com/junzhang2016/NTU4DRadLM

cs.RO↗
arXiv2023

Quantitative characterization in contact Hamiltonian dynamics -- I

Based on the contact Hamiltonian Floer theory established by Will J. Merry and the second author that applies to any admissible contact Hamiltonian system $(M, ξ= \ker α, h)$, where $h$ is a contact Hamiltonian function on a Liouville fillable contact manifold $(M, ξ= \ker α)$, we associate a persistence module to $(M, ξ, h)$, called a gapped module, that is parametrized only by a partially ordered set. It enables us to define various numerical Floer-theoretic invariants. In this paper, we focus on the contact spectral invariants and their applications. Several key properties are proved, which include stability with respect to the Shelukhin-Hofer norm in contact geometry and a triangle inequality of contact spectral invariants. In particular, our stability property does not involve any conformal factors; our triangle inequality is derived from a novel analysis on pair-of-pants in the contact Hamiltonian Floer homology. While this paper was nearing completion, the authors were made aware of upcoming work by Dylan Cant, where a similar persistence module for contact Hamiltonian dynamics was constructed.

math.SG↗
arXiv2023

A multinode quantum network over a metropolitan area

Towards realizing the future quantum internet, a pivotal milestone entails the transition from two-node proof-of-principle experiments conducted in laboratories to comprehensive, multi-node setups on large scales. Here, we report on the debut implementation of a multi-node entanglement-based quantum network over a metropolitan area. We equipped three quantum nodes with atomic quantum memories and their telecom interfaces, and combined them into a scalable phase-stabilized architecture through a server node. We demonstrated heralded entanglement generation between two quantum nodes situated 12.5 km apart, and the storage of entanglement exceeding the round-trip communication time. We also showed the concurrent entanglement generation on three links. Our work provides a metropolitan-scale testbed for the evaluation and exploration of multi-node quantum network protocols and starts a new stage of quantum internet research.

quant-ph↗
arXiv2023

FedCiR: Client-Invariant Representation Learning for Federated Non-IID Features

Federated learning (FL) is a distributed learning paradigm that maximizes the potential of data-driven models for edge devices without sharing their raw data. However, devices often have non-independent and identically distributed (non-IID) data, meaning their local data distributions can vary significantly. The heterogeneity in input data distributions across devices, commonly referred to as the feature shift problem, can adversely impact the training convergence and accuracy of the global model. To analyze the intrinsic causes of the feature shift problem, we develop a generalization error bound in FL, which motivates us to propose FedCiR, a client-invariant representation learning framework that enables clients to extract informative and client-invariant features. Specifically, we improve the mutual information term between representations and labels to encourage representations to carry essential classification knowledge, and diminish the mutual information term between the client set and representations conditioned on labels to promote representations of clients to be client-invariant. We further incorporate two regularizers into the FL framework to bound the mutual information terms with an approximate global representation distribution to compensate for the absence of the ground-truth global representation distribution, thus achieving informative and client-invariant feature extraction. To achieve global representation distribution approximation, we propose a data-free mechanism performed by the server without compromising privacy. Extensive experiments demonstrate the effectiveness of our approach in achieving client-invariant representation learning and solving the data heterogeneity issue.

cs.LG↗
arXiv2023

Coarse distance from dynamically convex to convex

Chaidez and Edtmair have recently found the first example of dynamically convex domains in $\mathbb R^4$ that are not symplectomorphic to convex domains (called symplectically convex domains), answering a long-standing open question. In this paper, we discover new examples of such domains without referring to Chaidez-Edtmair's criterion. We also show that these domains are arbitrarily far from the set of symplectically convex domains in $\mathbb R^4$ with respect to the coarse symplectic Banach-Mazur distance by using an explicit numerical criterion for symplectic non-convexity.

math.SG↗
arXiv2023

Forensic Histopathological Recognition via a Context-Aware MIL Network Powered by Self-Supervised Contrastive Learning

Forensic pathology is critical in analyzing death manner and time from the microscopic aspect to assist in the establishment of reliable factual bases for criminal investigation. In practice, even the manual differentiation between different postmortem organ tissues is challenging and relies on expertise, considering that changes like putrefaction and autolysis could significantly change typical histopathological appearance. Developing AI-based computational pathology techniques to assist forensic pathologists is practically meaningful, which requires reliable discriminative representation learning to capture tissues' fine-grained postmortem patterns. To this end, we propose a framework called FPath, in which a dedicated self-supervised contrastive learning strategy and a context-aware multiple-instance learning (MIL) block are designed to learn discriminative representations from postmortem histopathological images acquired at varying magnification scales. Our self-supervised learning step leverages multiple complementary contrastive losses and regularization terms to train a double-tier backbone for fine-grained and informative patch/instance embedding. Thereafter, the context-aware MIL adaptively distills from the local instances a holistic bag/image-level representation for the recognition task. On a large-scale database of $19,607$ experimental rat postmortem images and $3,378$ real-world human decedent images, our FPath led to state-of-the-art accuracy and promising cross-domain generalization in recognizing seven different postmortem tissues. The source code will be released on \href{https://github.com/ladderlab-xjtu/forensic_pathology}{https://github.com/ladderlab-xjtu/forensic\_pathology}.

cs.CV↗
arXiv2023

Dynamic Low-Rank Instance Adaptation for Universal Neural Image Compression

The latest advancements in neural image compression show great potential in surpassing the rate-distortion performance of conventional standard codecs. Nevertheless, there exists an indelible domain gap between the datasets utilized for training (i.e., natural images) and those utilized for inference (e.g., artistic images). Our proposal involves a low-rank adaptation approach aimed at addressing the rate-distortion drop observed in out-of-domain datasets. Specifically, we perform low-rank matrix decomposition to update certain adaptation parameters of the client's decoder. These updated parameters, along with image latents, are encoded into a bitstream and transmitted to the decoder in practical scenarios. Due to the low-rank constraint imposed on the adaptation parameters, the resulting bit rate overhead is small. Furthermore, the bit rate allocation of low-rank adaptation is \emph{non-trivial}, considering the diverse inputs require varying adaptation bitstreams. We thus introduce a dynamic gating network on top of the low-rank adaptation method, in order to decide which decoder layer should employ adaptation. The dynamic adaptation network is optimized end-to-end using rate-distortion loss. Our proposed method exhibits universality across diverse image datasets. Extensive results demonstrate that this paradigm significantly mitigates the domain gap, surpassing non-adaptive methods with an average BD-rate improvement of approximately $19\%$ across out-of-domain images. Furthermore, it outperforms the most advanced instance adaptive methods by roughly $5\%$ BD-rate. Ablation studies confirm our method's ability to universally enhance various image compression architectures.

eess.IV↗
arXiv2023

IP-Adapter: Text Compatible Image Prompt Adapter for Text-to-Image Diffusion Models

Recent years have witnessed the strong power of large text-to-image diffusion models for the impressive generative capability to create high-fidelity images. However, it is very tricky to generate desired images using only text prompt as it often involves complex prompt engineering. An alternative to text prompt is image prompt, as the saying goes: "an image is worth a thousand words". Although existing methods of direct fine-tuning from pretrained models are effective, they require large computing resources and are not compatible with other base models, text prompt, and structural controls. In this paper, we present IP-Adapter, an effective and lightweight adapter to achieve image prompt capability for the pretrained text-to-image diffusion models. The key design of our IP-Adapter is decoupled cross-attention mechanism that separates cross-attention layers for text features and image features. Despite the simplicity of our method, an IP-Adapter with only 22M parameters can achieve comparable or even better performance to a fully fine-tuned image prompt model. As we freeze the pretrained diffusion model, the proposed IP-Adapter can be generalized not only to other custom models fine-tuned from the same base model, but also to controllable generation using existing controllable tools. With the benefit of the decoupled cross-attention strategy, the image prompt can also work well with the text prompt to achieve multimodal image generation. The project page is available at \url{https://ip-adapter.github.io}.

cs.CV↗
arXiv2023

Feature Matching Data Synthesis for Non-IID Federated Learning

Federated learning (FL) has emerged as a privacy-preserving paradigm that trains neural networks on edge devices without collecting data at a central server. However, FL encounters an inherent challenge in dealing with non-independent and identically distributed (non-IID) data among devices. To address this challenge, this paper proposes a hard feature matching data synthesis (HFMDS) method to share auxiliary data besides local models. Specifically, synthetic data are generated by learning the essential class-relevant features of real samples and discarding the redundant features, which helps to effectively tackle the non-IID issue. For better privacy preservation, we propose a hard feature augmentation method to transfer real features towards the decision boundary, with which the synthetic data not only improve the model generalization but also erase the information of real features. By integrating the proposed HFMDS method with FL, we present a novel FL framework with data augmentation to relieve data heterogeneity. The theoretical analysis highlights the effectiveness of our proposed data synthesis method in solving the non-IID challenge. Simulation results further demonstrate that our proposed HFMDS-FL algorithm outperforms the baselines in terms of accuracy, privacy preservation, and computational cost on various benchmark datasets.

cs.LG↗
arXiv2023

model-based script synthesis for fuzzing

Kernel fuzzing is important for finding critical kernel vulnerabilities. Close-source (e.g., Windows) operating system kernel fuzzing is even more challenging due to the lack of source code. Existing approaches fuzz the kernel by modeling syscall sequences from traces or static analysis of system codes. However, a common limitation is that they do not learn and mutate the syscall sequences to reach different kernel states, which can potentially result in more bugs or crashes. In this paper, we propose WinkFuzz, an approach to learn and mutate traced syscall sequences in order to reach different kernel states. WinkFuzz learns syscall dependencies from the trace, identifies potential syscalls in the trace that can have dependent subsequent syscalls, and applies the dependencies to insert more syscalls while preserving the dependencies into the trace. Then WinkFuzz fuzzes the synthesized new syscall sequence to find system crashes. We applied WinkFuzz to four seed applications and found a total increase in syscall number of 70.8\%, with a success rate of 61\%, within three insert levels. The average time for tracing, dependency analysis, recovering model script, and synthesizing script was 600, 39, 34, and 129 seconds respectively. The instant fuzzing rate is 3742 syscall executions per second. However, the average fuzz efficiency dropped to 155 syscall executions per second when the initializing time, waiting time, and other factors were taken into account. We fuzzed each seed application for 24 seconds and, on average, obtained 12.25 crashes within that time frame.

cs.CR↗
arXiv2023

Binary Federated Learning with Client-Level Differential Privacy

Federated learning (FL) is a privacy-preserving collaborative learning framework, and differential privacy can be applied to further enhance its privacy protection. Existing FL systems typically adopt Federated Average (FedAvg) as the training algorithm and implement differential privacy with a Gaussian mechanism. However, the inherent privacy-utility trade-off in these systems severely degrades the training performance if a tight privacy budget is enforced. Besides, the Gaussian mechanism requires model weights to be of high-precision. To improve communication efficiency and achieve a better privacy-utility trade-off, we propose a communication-efficient FL training algorithm with differential privacy guarantee. Specifically, we propose to adopt binary neural networks (BNNs) and introduce discrete noise in the FL setting. Binary model parameters are uploaded for higher communication efficiency and discrete noise is added to achieve the client-level differential privacy protection. The achieved performance guarantee is rigorously proved, and it is shown to depend on the level of discrete noise. Experimental results based on MNIST and Fashion-MNIST datasets will demonstrate that the proposed training algorithm achieves client-level privacy protection with performance gain while enjoying the benefits of low communication overhead from binary model updates.

cs.LG↗
arXiv2023

$\mathrm{H}α$ chromospheric activity of F-, G-, and K-type stars observed by the LAMOST Medium-Resolution Spectroscopic Survey

The distribution of stellar $\mathrm{H}α$ chromospheric activity with respect to stellar atmospheric parameters (effective temperature $T_\mathrm{eff}$, surface gravity $\log\,g$, and metallicity $\mathrm{[Fe/H]}$) and main-sequence/giant categories is investigated for the F-, G-, and K-type stars observed by the LAMOST Medium-Resolution Spectroscopic Survey (MRS). A total of 329,294 MRS spectra from LAMOST DR8 are utilized in the analysis. The $\mathrm{H}α$ activity index ($I_{\mathrm{H}α}$) and the $\mathrm{H}α$ $R$-index ($R_{\mathrm{H}α}$) are evaluated for the MRS spectra. The $\mathrm{H}α$ chromospheric activity distributions with individual stellar parameters as well as in the $T_\mathrm{eff}$ -- $\log\,g$ and $T_\mathrm{eff}$ -- $\mathrm{[Fe/H]}$ parameter spaces are analyzed based on the $R_{\mathrm{H}α}$ index data. It is found that: (1) for the main-sequence sample, the $R_{\mathrm{H}α}$ distribution with $T_\mathrm{eff}$ has a bowl-shaped lower envelope with a minimum at about 6200 K, a hill-shaped middle envelope with a maximum at about 5600 K, and an upper envelope continuing to increase from hotter to cooler stars; (2) for the giant sample, the middle and upper envelopes of the $R_{\mathrm{H}α}$ distribution first increase with a decrease of $T_\mathrm{eff}$ and then drop to a lower activity level at about 4300 K, revealing different activity characteristics at different stages of stellar evolution; (3) for both the main-sequence and giant samples, the upper envelope of the $R_{\mathrm{H}α}$ distribution with metallicity is higher for stars with $\mathrm{[Fe/H]}$ greater than about $-1.0$, and the lowest-metallicity stars hardly exhibit high $\mathrm{H}α$ indices. A dataset of $\mathrm{H}α$ activity indices for the LAMOST MRS spectra analyzed is provided with this paper.

astro-ph.SR↗
arXiv2023

Towards Optimal Reconstruction of Shear Field with PDF-Folding

Weak lensing provides a direct way of mapping the density distribution in the universe. To reconstruct the density field from the shear catalog, an important step is to build the shear field from the shear catalog, which can be quite nontrivial due to the inhomogeneity of the background galaxy distribution and the shape noise. We propose the PDF-Folding method as a statistically optimal way of reconstructing the shear field. It is an extention of the PDF-SYM method, which is previously designed for optimizing the stacked shear signal as well as the shear-shear correlation for the Fourier\_Quad shear estimators. PDF-Folding does not require smoothing kernels as in traditional methods, therefore it suffers less information loss on small scales, and avoids possible biases due to the spatial variation of shear on the scale of the kernel. We show with analytic reasoning as well as numerical examples that the new method can reach the optimal signal-to-noise ratio on the reconstructed shear map under general observing conditions, i.e., with inhomogeneous background densities or masks. We also show the performance of the new method on real data around foreground galaxy clusters.

astro-ph.CO↗