Searcharxiv⌕ Search

arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 775 records · Page 43Linked to original sources

D-Score: A White-Box Diagnosis Score for CNNs Based on Mutation Operators

Convolutional neural networks (CNNs) have been widely applied in many safety-critical domains, such as autonomous driving and medical diagnosis. However, concerns have been raised with respect to the trustworthiness of these models: The standard testing method evaluates the performance of a model on a test set, while low-quality and insufficient test sets can lead to unreliable evaluation results, which can have unforeseeable consequences. Therefore, how to comprehensively evaluate CNNs and, based on the evaluation results, how to enhance their trustworthiness are the key problems to be urgently addressed. Prior work has used mutation tests to evaluate the test sets of CNNs. However, the evaluation scores are black boxes and not explicit enough for what is being tested. In this paper, we propose a white-box diagnostic approach that uses mutation operators and image transformation to calculate the feature and attention distribution of the model and further present a diagnosis score, namely D-Score, to reflect the model's robustness and fitness to a dataset. We also propose a D-Score based data augmentation method to enhance the CNN's performance to translations and rescalings. Comprehensive experiments on two widely used datasets and three commonly adopted CNNs demonstrate the effectiveness of our approach.

cs.CV↗

Authenticated Multiparty Quantum Key Agreement for Optical-Ring Quantum Communication Networks

Quantum communication networks are connected by various devices to achieve communication or distributed computing for users in remote locations. In order to solve the problem of generating temporary session key for secure communication in optical-ring quantum networks, a quantum key agreement protocol is proposed. In the key agreement protocols, an attacker can impersonate a legal user to participate in the negotiation process and eavesdrop the agreement key easily. This is often overlooked in most quantum key agreement protocols, which makes them insecure in practical implementation. Considering this problem, the function of authenticating the user's identity is added in the proposed protocol. Combining classical hash function with identity information, we design the authentication operation conforming to the characteristics of quantum search algorithm. In the security analysis of the proposed protocol, quantum state discrimination is utilized to show that the protocol is secure against common attacks and impersonation attack. In addition, only single photons need to be prepared and measured, which makes our protocol feasible with existing technology.

quant-ph↗

LMDA-Net:A lightweight multi-dimensional attention network for general EEG-based brain-computer interface paradigms and interpretability

EEG-based recognition of activities and states involves the use of prior neuroscience knowledge to generate quantitative EEG features, which may limit BCI performance. Although neural network-based methods can effectively extract features, they often encounter issues such as poor generalization across datasets, high predicting volatility, and low model interpretability. Hence, we propose a novel lightweight multi-dimensional attention network, called LMDA-Net. By incorporating two novel attention modules designed specifically for EEG signals, the channel attention module and the depth attention module, LMDA-Net can effectively integrate features from multiple dimensions, resulting in improved classification performance across various BCI tasks. LMDA-Net was evaluated on four high-impact public datasets, including motor imagery (MI) and P300-Speller paradigms, and was compared with other representative models. The experimental results demonstrate that LMDA-Net outperforms other representative methods in terms of classification accuracy and predicting volatility, achieving the highest accuracy in all datasets within 300 training epochs. Ablation experiments further confirm the effectiveness of the channel attention module and the depth attention module. To facilitate an in-depth understanding of the features extracted by LMDA-Net, we propose class-specific neural network feature interpretability algorithms that are suitable for event-related potentials (ERPs) and event-related desynchronization/synchronization (ERD/ERS). By mapping the output of the specific layer of LMDA-Net to the time or spatial domain through class activation maps, the resulting feature visualizations can provide interpretable analysis and establish connections with EEG time-spatial analysis in neuroscience. In summary, LMDA-Net shows great potential as a general online decoding model for various EEG tasks.

cs.LG↗

Joint constraints on cosmological parameters using future multi-band gravitational wave standard siren observations

Gravitational waves (GWs) from the compact binary coalescences can be used as standard sirens to explore the cosmic expansion history. In the next decades, it is anticipated that we could obtain the multi-band GW standard siren data (from nanohertz to a few hundred hertz), which are expected to play an important role in cosmological parameter estimation. In this work, we give for the first time the joint constraints on cosmological parameters using the future multi-band GW standard siren observations. We simulate the multi-band GW standard sirens based on the SKA-era pulsar timing array (PTA), the Taiji observatory, and the Cosmic Explorer (CE) to perform cosmological analysis. In the $Λ$CDM model, we find that the joint PTA+Taiji+CE data could provide a tight constraint on the Hubble constant with a $0.5\%$ precision. Moreover, PTA+Taiji+CE could break the cosmological parameter degeneracies generated by CMB, especially in the dynamical dark energy models. When combining the PTA+Taiji+CE data with the CMB data, the constraint precisions of $Ω_{\rm m}$ and $H_0$ are $1.0\%$ and $0.3\%$, meeting the standard of precision cosmology. The joint CMB+PTA+Taiji+CE data give $σ(w)=0.028$ in the $w$CDM model and $σ(w_0)=0.11$ and $σ(w_a)=0.32$ in the $w_0w_a$CDM model, which are comparable with or close to the latest constraint results by CMB+BAO+SN. In conclusion, it is worth expecting to use the future multi-band GW observations to explore the nature of dark energy and measure the Hubble constant.

astro-ph.CO↗

A Heterogeneous Parallel Non-von Neumann Architecture System for Accurate and Efficient Machine Learning Molecular Dynamics

This paper proposes a special-purpose system to achieve high-accuracy and high-efficiency machine learning (ML) molecular dynamics (MD) calculations. The system consists of field programmable gate array (FPGA) and application specific integrated circuit (ASIC) working in heterogeneous parallelization. To be specific, a multiplication-less neural network (NN) is deployed on the non-von Neumann (NvN)-based ASIC (SilTerra 180 nm process) to evaluate atomic forces, which is the most computationally expensive part of MD. All other calculations of MD are done using FPGA (Xilinx XC7Z100). It is shown that, to achieve similar-level accuracy, the proposed NvN-based system based on low-end fabrication technologies (180 nm) is 1.6x faster and 10^2-10^3x more energy efficiency than state-of-the-art vN based MLMD using graphics processing units (GPUs) based on much more advanced technologies (12 nm), indicating superiority of the proposed NvN-based heterogeneous parallel architecture.

cs.LG↗

Bayesian Reconstruction of Magnetic Resonance Images using Gaussian Processes

A central goal of modern magnetic resonance imaging (MRI) is to reduce the time required to produce high-quality images. Efforts have included hardware and software innovations such as parallel imaging, compressed sensing, and deep learning-based reconstruction. Here, we propose and demonstrate a Bayesian method to build statistical libraries of magnetic resonance (MR) images in k-space and use these libraries to identify optimal subsampling paths and reconstruction processes. Specifically, we compute a multivariate normal distribution based upon Gaussian processes using a publicly available library of T1-weighted images of healthy brains. We combine this library with physics-informed envelope functions to only retain meaningful correlations in k-space. This covariance function is then used to select a series of ring-shaped subsampling paths using Bayesian optimization such that they optimally explore space while remaining practically realizable in commercial MRI systems. Combining optimized subsampling paths found for a range of images, we compute a generalized sampling path that, when used for novel images, produces superlative structural similarity and error in comparison to previously reported reconstruction processes (i.e. 96.3% structural similarity and <0.003 normalized mean squared error from sampling only 12.5% of the k-space data). Finally, we use this reconstruction process on pathological data without retraining to show that reconstructed images are clinically useful for stroke identification.

physics.med-ph↗

Prospects for measuring dark energy with 21 cm intensity mapping experiments: A joint survey strategy

The 21 cm intensity mapping (IM) technique provides us with an efficient way to observe the cosmic large-scale structure (LSS). From the LSS data, one can use the baryon acoustic oscillation and redshift space distortion to trace the expansion and growth history of the universe, and thus measure the dark energy parameters. In this paper, we make a forecast for cosmological parameter estimation with the synergy of three 21 cm IM experiments. Specifically, we adopt a novel joint survey strategy, FAST ($0<z<0.35$)+SKA1-MID ($0.35<z<0.8$)+HIRAX ($0.8<z<2.5$), to measure dark energy. We simulate the 21 cm IM observations under the assumption of excellent foreground removal. We find that the synergy of three experiments could place quite tight constraints on cosmological parameters. For example, it provides $σ(Ω_{\rm m})=0.0039$ and $σ(H_0)=0.27\ \rm km\ s^{-1}\ Mpc^{-1}$ in the $Λ$CDM model. Notably, the synergy could break the cosmological parameter degeneracies when constraining the dynamical dark energy models. Concretely, the joint observation offers $σ(w)=0.019$ in the $w$CDM model, and $σ(w_0)=0.085$ and $σ(w_a)=0.32$ in the $w_0w_a$CDM model. These results are better than or equal to those given by CMB+BAO+SN. In addition, when the foreground removal efficiency is relatively low, the strategy still performs well. Therefore, the 21 cm IM joint survey strategy is promising and worth pursuing.

astro-ph.CO↗

Distribution-restrained Softmax Loss for the Model Robustness

Recently, the robustness of deep learning models has received widespread attention, and various methods for improving model robustness have been proposed, including adversarial training, model architecture modification, design of loss functions, certified defenses, and so on. However, the principle of the robustness to attacks is still not fully understood, also the related research is still not sufficient. Here, we have identified a significant factor that affects the robustness of models: the distribution characteristics of softmax values for non-real label samples. We found that the results after an attack are highly correlated with the distribution characteristics, and thus we proposed a loss function to suppress the distribution diversity of softmax. A large number of experiments have shown that our method can improve robustness without significant time consumption.

cs.LG↗

Null test for cosmic curvature using Gaussian process

The cosmic curvature $Ω_{K,0}$, which determines the spatial geometry of the universe, is an important parameter in modern cosmology. Any deviation from $Ω_{K,0}=0$ would have a profound impact on primordial inflation paradigm and fundamental physics. In this work, we adopt a cosmological model-independent method to test whether $Ω_{K,0}$ deviates from zero. We use the Gaussian process to reconstruct the reduced Hubble parameter $E(z)$ and the derivative of distance $D'(z)$ from observational data, and then determine $Ω_{K,0}$ with a null test relation. The cosmic chronometer (CC) Hubble data, baryon acoustic oscillation (BAO) Hubble data, and supernovae Pantheon sample are considered. Our result is consistent with a spatially flat universe within the domain of reconstruction $0 1$, it tends to favor a closed universe. In this sense, there is still a possibility for a closed universe. We also carry out the null test of the cosmic curvature at $0<z<4.5$ using the simulated gravitational wave standard sirens, CC+BAO and redshift drift Hubble data. The result shows that in the future, with the synergy of multiple high-quality observations, we can tightly constrain the spatial geometry or exclude the flat universe.

astro-ph.CO↗

Machine learning assisted phase and size-controlled synthesis of iron oxides

The controllable synthesis of iron oxides particles is a critical issue for materials science, energy storage, biomedical applications, environmental science, and earth science. However, synthesis of iron oxides with desired phase and size are still a time-consuming and trial-and-error process. This study presents solutions for two fundamental challenges in materials synthesis: predicting the outcome of a synthesis from specified reaction parameters and correlating sets of parameters to obtain products with desired outcomes. Four machine learning algorithms, including random forest, logistic regression, support vector machine, and k-nearest neighbor, were trained to predict the phase and particle size of iron oxide based on experimental conditions. Among the models, random forest exhibited the best performance, achieving 96% and 81% accuracy when predicting the phase and size of iron oxides in the test dataset. Premutation feature importance analysis shows that most models (except logistic regression) rely on known features such as precursor concentration, pH, and temperature to predict the phases from synthesis conditions. The robustness of the random forest models was further verified by comparing prediction and experimental results based on 24 randomly generated methods in additive and non-additive systems not included in the datasets. The predictions of product phase and particle size from the models are in good agreement with the experimental results. Additionally, a searching and ranking algorithm was developed to recommend potential synthesis parameters for obtaining iron oxide products with desired phase and particle size from previous studies in the dataset.

cond-mat.mtrl-sci↗

Machine Learning Automated Approach for Enormous Synchrotron X-Ray Diffraction Data Interpretation

Manual analysis of XRD data is usually laborious and time consuming. The deep neural network (DNN) based models trained by synthetic XRD patterns are proved to be an automatic, accurate, and high throughput method to analysis common XRD data collected from solid sample in ambient environment. However, it remains unknown that whether synthetic XRD based models are capable to solve u-XRD mapping data for in-situ experiments involving liquid phase exhibiting lower quality with significant artifacts. In this study, we collected u-XRD mapping data from an LaCl3-calcite hydrothermal fluid system and trained two categories of models to solve the experimental XRD patterns. The models trained by synthetic XRD patterns show low accuracy (as low as 64%) when solving experimental u-XRD mapping data. The accuracy of the DNN models was significantly improved (90% or above) when training them with the dataset containing both synthetic and small number of labeled experimental u-XRD patterns. This study highlighted the importance of labeled experimental patterns on the training of DNN models to solve u-XRD mapping data from in-situ experiments involving liquid phase.

cond-mat.dis-nn↗

Probing the interaction between dark energy and dark matter with future fast radio burst observations

Interacting dark energy (IDE) scenario assumes that there exists a direct interaction between dark energy and cold dark matter, but this interaction is hard to be tightly constrained by the current data. Fast radio bursts (FRBs) will be seen in large numbers by future radio telescopes, and thus they have potential to become a promising low-redshift cosmological probe. In this work, we investigate the capability of future FRBs of constraining the dimensionless coupling parameter $β$ in four phenomenological IDE models. If we fix the FRB properties, about $10^5$ FRB data can give constraints on $β$ tighter than the current cosmic microwave background data in the IDE models with the interaction proportional to the energy density of dark energy. In all the IDE models, about $10^6$ FRB data can achieve the absolute errors of $β$ to less than $0.10$, providing a way to precisely measure $β$ by only one cosmological probe. Jointly constraining the FRB properties and cosmological parameters would increase the constraint errors of $β$ by a factor of about 0.5-2.

astro-ph.CO↗

Co-Occurrence Matters: Learning Action Relation for Temporal Action Localization

Temporal action localization (TAL) is a prevailing task due to its great application potential. Existing works in this field mainly suffer from two weaknesses: (1) They often neglect the multi-label case and only focus on temporal modeling. (2) They ignore the semantic information in class labels and only use the visual information. To solve these problems, we propose a novel Co-Occurrence Relation Module (CORM) that explicitly models the co-occurrence relationship between actions. Besides the visual information, it further utilizes the semantic embeddings of class labels to model the co-occurrence relationship. The CORM works in a plug-and-play manner and can be easily incorporated with the existing sequence models. By considering both visual and semantic co-occurrence, our method achieves high multi-label relationship modeling capacity. Meanwhile, existing datasets in TAL always focus on low-semantic atomic actions. Thus we construct a challenging multi-label dataset UCF-Crime-TAL that focuses on high-semantic actions by annotating the UCF-Crime dataset at frame level and considering the semantic overlap of different events. Extensive experiments on two commonly used TAL datasets, \textit{i.e.}, MultiTHUMOS and TSU, and our newly proposed UCF-Crime-TAL demenstrate the effectiveness of the proposed CORM, which achieves state-of-the-art performance on these datasets.

cs.CV↗

Design, Modeling, and Redundancy Resolution of Soft Robot for Effective Harvesting

Blackberry harvesting is a labor-intensive and costly process, consuming up to 50\% of the total annual crop hours. This paper presents a solution for robotic harvesting through the design, manufacturing, integration, and control of a pneumatically actuated, kinematically redundant soft arm with a tendon-driven soft robotic gripper. The hardware design is optimized for durability and modularity for practical use. The harvesting process is divided into four stages: initial placement, fine positioning, grasp, and move back to home position. For initial placement, we propose a real-time, continuous gain-scheduled redundancy resolution algorithm for simultaneous position and orientation control with joint-limit avoidance. The algorithm relies solely on visual feedback from an eye-to-hand camera and achieved a position and orientation tracking error of $0.64\pm{0.27}$ mm and $1.08\pm{1.5}^{\circ}$, respectively, in benchtop settings. Following accurate initial placement of the robotic arm, fine positioning is achieved using a combination of eye-in-hand and eye-to-hand visual feedback, reaching an accuracy of $0.75\pm{0.36}$ mm. The system's hardware, feedback framework, and control methods are thoroughly validated through benchtop and field tests, confirming feasibility for practical applications.

cs.RO↗

Probing a polymerized black hole with the frequency shifts of photons

As is well-known, black hole plays an important role in probing the quantum effects of gravity in the strong-field regime. In this paper, we focus on a polymerized black hole and investigate the quantum effects on the redshift, blueshift and gravitational redshift of photons emitted by massive particles revolving around this black hole. With a general relativistic formalism, we obtain two elegant and concise expressions for the mass of the black hole and the quantum parameter in terms of few direct observables, and find that all the frequency shifts of photons decrease with the quantum parameter. By expanding the total frequency shift for large orbit of the emitter, low peculiar redshift, and small azimuthal angle, we find that the leading contributions to the frequency shift are originated from the kinematic shift and peculiar shift, and the quantum effects make a negligible contribution. In addition, we study the effects of the plasma on the redshift/blueshift for the first time, and conclude that the presence of plasma results in the decrease of the redshift/blueshift.

gr-qc↗

PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities

Recently, min-max optimization problems have received increasing attention due to their wide range of applications in machine learning (ML). However, most existing min-max solution techniques are either single-machine or distributed algorithms coordinated by a central server. In this paper, we focus on the decentralized min-max optimization for learning with domain constraints, where multiple agents collectively solve a nonconvex-strongly-concave min-max saddle point problem without coordination from any server. Decentralized min-max optimization problems with domain constraints underpins many important ML applications, including multi-agent ML fairness assurance, and policy evaluations in multi-agent reinforcement learning. We propose an algorithm called PRECISION (proximal gradient-tracking and stochastic recursive variance reduction) that enjoys a convergence rate of $O(1/T)$, where $T$ is the maximum number of iterations. To further reduce sample complexity, we propose PRECISION$^+$ with an adaptive batch size technique. We show that the fast $O(1/T)$ convergence of PRECISION and PRECISION$^+$ to an $ε$-stationary point imply $O(ε^{-2})$ communication complexity and $O(m\sqrt{n}ε^{-2})$ sample complexity, where $m$ is the number of agents and $n$ is the size of dataset at each agent. To our knowledge, this is the first work that achieves $O(ε^{-2})$ in both sample and communication complexities in decentralized min-max learning with domain constraints. Our experiments also corroborate the theoretical results.

cs.LG↗

Knowledge-infused Contrastive Learning for Urban Imagery-based Socioeconomic Prediction

Monitoring sustainable development goals requires accurate and timely socioeconomic statistics, while ubiquitous and frequently-updated urban imagery in web like satellite/street view images has emerged as an important source for socioeconomic prediction. Especially, recent studies turn to self-supervised contrastive learning with manually designed similarity metrics for urban imagery representation learning and further socioeconomic prediction, which however suffers from effectiveness and robustness issues. To address such issues, in this paper, we propose a Knowledge-infused Contrastive Learning (KnowCL) model for urban imagery-based socioeconomic prediction. Specifically, we firstly introduce knowledge graph (KG) to effectively model the urban knowledge in spatiality, mobility, etc., and then build neural network based encoders to learn representations of an urban image in associated semantic and visual spaces, respectively. Finally, we design a cross-modality based contrastive learning framework with a novel image-KG contrastive loss, which maximizes the mutual information between semantic and visual representations for knowledge infusion. Extensive experiments of applying the learnt visual representations for socioeconomic prediction on three datasets demonstrate the superior performance of KnowCL with over 30\% improvements on $R^2$ compared with baselines. Especially, our proposed KnowCL model can apply to both satellite and street imagery with both effectiveness and transferability achieved, which provides insights into urban imagery-based socioeconomic prediction.

cs.CV↗

sMRI-PatchNet: A novel explainable patch-based deep learning network for Alzheimer's disease diagnosis and discriminative atrophy localisation with Structural MRI

Structural magnetic resonance imaging (sMRI) can identify subtle brain changes due to its high contrast for soft tissues and high spatial resolution. It has been widely used in diagnosing neurological brain diseases, such as Alzheimer disease (AD). However, the size of 3D high-resolution data poses a significant challenge for data analysis and processing. Since only a few areas of the brain show structural changes highly associated with AD, the patch-based methods dividing the whole image data into several small regular patches have shown promising for more efficient sMRI-based image analysis. The major challenges of the patch-based methods on sMRI include identifying the discriminative patches, combining features from the discrete discriminative patches, and designing appropriate classifiers. This work proposes a novel patch-based deep learning network (sMRI-PatchNet) with explainable patch localisation and selection for AD diagnosis using sMRI. Specifically, it consists of two primary components: 1) A fast and efficient explainable patch selection mechanism for determining the most discriminative patches based on computing the SHapley Additive exPlanations (SHAP) contribution to a transfer learning model for AD diagnosis on massive medical data; and 2) A novel patch-based network for extracting deep features and AD classfication from the selected patches with position embeddings to retain position information, capable of capturing the global and local information of inter- and intra-patches. This method has been applied for the AD classification and the prediction of the transitional state moderate cognitive impairment (MCI) conversion with real datasets.

eess.IV↗