arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 811 records · Page 45Linked to original sources

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

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↗

arXiv2023

On Measuring the 21 cm Global Spectrum of the Cosmic Dawn with an Interferometer Array

We theoretically investigate the recovery of global spectrum (monopole) from visibilities (cross-correlation only) measured by the interferometer array and the feasibility of extracting 21 cm signal of cosmic dawn. In our approach, the global spectrum is obtained by solving the monopole and higher-order components simultaneously from the visibilities measured with up to thousands of baselines. Using this algorithm, the monopole of both foreground and the 21 cm signal can be correctly recovered in a broad range of conditions. We find that a 3D baseline distribution can have much better performance than a 2D (planar) baseline distribution, particularly when there is a lack of shorter baselines. We simulate for ground-based 2D and 3D array configurations, and a cross-shaped space array located at the Sun-Earth L2 point that can form 3D baselines through orbital precession. In all simulations we obtain good recovered global spectrum, and successfully extract the 21 cm signal from it, with reasonable number of antennas and observation time.

astro-ph.CO↗

arXiv2023

Robust Extrinsic Self-Calibration of Camera and Solid State LiDAR

This letter proposes an extrinsic calibration approach for a pair of monocular camera and prism-spinning solid-state LiDAR. The unique characteristics of the point cloud measured resulting from the flower-like scanning pattern is first disclosed as the vacant points, a type of outlier between foreground target and background objects. Unlike existing method using only depth continuous measurements, we use depth discontinuous measurements to retain more valid features and efficiently remove vacant points. The larger number of detected 3D corners thus contain more robust a priori information than usual which, together with the 2D corners detected by overlapping cameras and constrained by the proposed circularity and rectangularity rules, produce accurate extrinsic estimates. The algorithm is evaluated with real field experiments adopting both qualitative and quantitative performance criteria, and found to be superior to existing algorithms. The code is available on GitHub.

cs.RO↗

arXiv2023

A tensor optimization algorithm for computing Lagrangians of hypergraphs

The Lagrangian of a hypergraph is a crucial tool for studying hypergraph extremal problems. Though Lagrangians of some special structure hypergraphs have closed-form solutions, it is a challenging problem to compute the Lagrangian of a general large scale hypergraph. In this paper, we exploit a fast computational scheme involving the adjacency tensor of a hypergraph. Furthermore, we propose to utilize the gradient projection method on a simplex from nonlinear optimization for solving the Lagrangian of a large scale hypergraph iteratively. Using the Lojasiewicz gradient inequality, we analyze the global and local convergence of the gradient projection method. Numerical experiments illustrate that the proposed numerical method could compute Lagrangians of large scale hypergraphs efficiently.

math.OC↗

arXiv2023

Gravitational wave constraints on non-birefringent dispersions of gravitational waves due to Lorentz violations with GWTC-3

The standard model extension (SME) is an effective field theory framework that can be used to study the possible violations of Lorentz symmetry in the gravitational interaction. In the SME's gauge invariant linearized gravity sector, the dispersion relation of GWs is modified, resulting in anisotropy, birefringence, and dispersion effects in the propagation of GWs. In this paper, we mainly focus on the non-birefringent and anisotropic dispersion relation in the propagation of GWs due to the violation of Lorentz symmetry. With the modified dispersion relation, we calculate the corresponding modified waveform of GWs generated by the coalescence of compact binaries. We consider the effects from the operators with the lowest mass dimension $d=6$ in the gauge invariant linearized gravity sector of the SME which are expected to have the dominant Lorentz-violating effect on the propagation of GWs. For this case, the Lorentz-violating effects are presented by 25 coefficients and we constrain them independently by the ``maximal-reach" approach. We use 90 high-confidence GW events in the GWTC-3 catalog and use {\tt Bilby}, an open source software, and {\tt Dynest}, a nested sampling package, to perform parameter estimation with the modified waveform. We do not find any evidence of Lorentz violation in the GWs data and give a $90\%$ confidence interval for each Lorentz violating coefficient.

gr-qc↗

arXiv2023

Control of Raman scattering quantum interference pathways in graphene

Graphene is an ideal platform to study the coherence of quantum interference pathways by tuning doping or laser excitation energy. The latter produces a Raman excitation profile that provides direct insight into the lifetimes of intermediate electronic excitations and, therefore, on quantum interference, which has so far remained elusive. Here, we control the Raman scattering pathways by tuning the laser excitation energy in graphene doped up to 1.05eV, above what achievable with electrostatic doping. The Raman excitation profile of the G mode indicates its position and full width at half maximum are linearly dependent on doping. Doping-enhanced electron-electron interactions dominate the lifetime of Raman scattering pathways, and reduce Raman interference. This paves the way for engineering quantum pathways in doped graphene, nanotubes and topological insulators.

cond-mat.mes-hall↗

arXiv2023

How Close is ChatGPT to Human Experts? Comparison Corpus, Evaluation, and Detection

The introduction of ChatGPT has garnered widespread attention in both academic and industrial communities. ChatGPT is able to respond effectively to a wide range of human questions, providing fluent and comprehensive answers that significantly surpass previous public chatbots in terms of security and usefulness. On one hand, people are curious about how ChatGPT is able to achieve such strength and how far it is from human experts. On the other hand, people are starting to worry about the potential negative impacts that large language models (LLMs) like ChatGPT could have on society, such as fake news, plagiarism, and social security issues. In this work, we collected tens of thousands of comparison responses from both human experts and ChatGPT, with questions ranging from open-domain, financial, medical, legal, and psychological areas. We call the collected dataset the Human ChatGPT Comparison Corpus (HC3). Based on the HC3 dataset, we study the characteristics of ChatGPT's responses, the differences and gaps from human experts, and future directions for LLMs. We conducted comprehensive human evaluations and linguistic analyses of ChatGPT-generated content compared with that of humans, where many interesting results are revealed. After that, we conduct extensive experiments on how to effectively detect whether a certain text is generated by ChatGPT or humans. We build three different detection systems, explore several key factors that influence their effectiveness, and evaluate them in different scenarios. The dataset, code, and models are all publicly available at https://github.com/Hello-SimpleAI/chatgpt-comparison-detection.

cs.CL↗

arXiv2023

Asymptotic Mutual Information Analysis for Double-scattering MIMO Channels: A New Approach by Gaussian Tools

The asymptotic mutual information (MI) analysis for multiple-input multiple-output (MIMO) systems over double-scattering channels has achieved engaging results, but the convergence rates of the mean, variance, and the distribution of the MI are not yet available in the literature. In this paper, by utilizing the large random matrix theory (RMT), we give a central limit theory (CLT) for the MI and derive the closed-form approximation for the mean and the variance by a new approach -- Gaussian tools. The convergence rates of the mean, variance, and the characteristic function are proved to be O(1/N) for the first time, where N is the number of transmit antennas. Furthermore, the impact of the number of effective scatterers on the mean and variance was investigated in the moderate-to-high SNR regime with some interesting physical insights. The proposed evaluation framework can be utilized for the asymptotic performance analysis of other systems over double-scattering channels.

cs.IT↗

arXiv2022

SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning

To lower the communication complexity of federated min-max learning, a natural approach is to utilize the idea of infrequent communications (through multiple local updates) same as in conventional federated learning. However, due to the more complicated inter-outer problem structure in federated min-max learning, theoretical understandings of communication complexity for federated min-max learning with infrequent communications remain very limited in the literature. This is particularly true for settings with non-i.i.d. datasets and partial client participation. To address this challenge, in this paper, we propose a new algorithmic framework called stochastic sampling averaging gradient descent ascent (SAGDA), which i) assembles stochastic gradient estimators from randomly sampled clients as control variates and ii) leverages two learning rates on both server and client sides. We show that SAGDA achieves a linear speedup in terms of both the number of clients and local update steps, which yields an $\mathcal{O}(ε^{-2})$ communication complexity that is orders of magnitude lower than the state of the art. Interestingly, by noting that the standard federated stochastic gradient descent ascent (FSGDA) is in fact a control-variate-free special version of SAGDA, we immediately arrive at an $\mathcal{O}(ε^{-2})$ communication complexity result for FSGDA. Therefore, through the lens of SAGDA, we also advance the current understanding on communication complexity of the standard FSGDA method for federated min-max learning.

cs.LG↗

arXiv2022

Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection

Graph neural networks (GNNs) have received remarkable success in link prediction (GNNLP) tasks. Existing efforts first predefine the subgraph for the whole dataset and then apply GNNs to encode edge representations by leveraging the neighborhood structure induced by the fixed subgraph. The prominence of GNNLP methods significantly relies on the adhoc subgraph. Since node connectivity in real-world graphs is complex, one shared subgraph is limited for all edges. Thus, the choices of subgraphs should be personalized to different edges. However, performing personalized subgraph selection is nontrivial since the potential selection space grows exponentially to the scale of edges. Besides, the inference edges are not available during training in link prediction scenarios, so the selection process needs to be inductive. To bridge the gap, we introduce a Personalized Subgraph Selector (PS2) as a plug-and-play framework to automatically, personally, and inductively identify optimal subgraphs for different edges when performing GNNLP. PS2 is instantiated as a bi-level optimization problem that can be efficiently solved differently. Coupling GNNLP models with PS2, we suggest a brand-new angle towards GNNLP training: by first identifying the optimal subgraphs for edges; and then focusing on training the inference model by using the sampled subgraphs. Comprehensive experiments endorse the effectiveness of our proposed method across various GNNLP backbones (GCN, GraphSage, NGCF, LightGCN, and SEAL) and diverse benchmarks (Planetoid, OGB, and Recommendation datasets). Our code is publicly available at \url{https://github.com/qiaoyu-tan/PS2}

cs.IR↗

arXiv2022

Weakly Supervised Video Anomaly Detection Based on Cross-Batch Clustering Guidance

Weakly supervised video anomaly detection (WSVAD) is a challenging task since only video-level labels are available for training. In previous studies, the discriminative power of the learned features is not strong enough, and the data imbalance resulting from the mini-batch training strategy is ignored. To address these two issues, we propose a novel WSVAD method based on cross-batch clustering guidance. To enhance the discriminative power of features, we propose a batch clustering based loss to encourage a clustering branch to generate distinct normal and abnormal clusters based on a batch of data. Meanwhile, we design a cross-batch learning strategy by introducing clustering results from previous mini-batches to reduce the impact of data imbalance. In addition, we propose to generate more accurate segment-level anomaly scores based on batch clustering guidance further improving the performance of WSVAD. Extensive experiments on two public datasets demonstrate the effectiveness of our approach.

cs.CV↗

arXiv2022

Manifold Learning for Dimensionality Reduction: Quantum Isomap algorithm

Isomap algorithm is a representative manifold learning algorithm. The algorithm simplifies the data analysis process and is widely used in neuroimaging, spectral analysis and other fields. However, the classic Isomap algorithm becomes unwieldy when dealing with large data sets. Our object is to accelerate the classical algorithm with quantum computing, and propose the quantum Isomap algorithm. The algorithm consists of two sub-algorithms. The first one is the quantum Floyd algorithm, which calculates the shortest distance for any two nodes. The other is quantum Isomap algorithm based on quantum Floyd algorithm, which finds a low-dimensional representation for the original high-dimensional data. Finally, we analyze that the quantum Floyd algorithm achieves exponential speedup without sampling. In addition, the time complexity of quantum Isomap algorithm is $O(dNpolylogN)$. Both algorithms reduce the time complexity of classical algorithms.

quant-ph↗

arXiv2022

Magnetic domain structure and domain wall bound states of topological semimetal EuB6

Electrically manipulating domain wall (DW) is at central in the field of spintronics. Magnetic Weyl semimetal (WSM) offers an additional knob for electric manipulation of DW by utilizing the topological DW bound states. Using magnetic WSM material EuB6 as a prototype system, we investigate its DW bound states combining first principles calculations and domain imaging via magnetic force microscopy (MFM). The MFM measurements reveal that domains with magnetization aligned along three [100] directions dominate over others under a small magnetic field along [001] direction. Accordingly, first principles calculations are performed based on experimentally determined DW type, which show a robust DW bound state featuring a spectral distribution over a large portion of the DW Brillouin zone. Such DW bound states should result in significant amount of localized charges which can be used to drive DW motion via the electrostatic forces exerted on the localized DW charges.

cond-mat.mtrl-sci↗

arXiv2022

Dynamic surface tension of the pure liquid-vapor interface subjected to the cyclic loads

We demonstrate a methodology for computationally investigating the mechanical response of a pure molten lead surface system to the lateral mechanical cyclic loads and try to answer the question: how dose the dynamically driven liquid surface system follow the classical physics of the elastic-driven oscillation? The steady-state oscillation of the dynamic surface tension under cyclic load, including the excitation of high frequency vibration mode at different driving frequencies and amplitudes, was compared with the classical theory of single-body driven damped oscillator. Under the highest studied frequency (50 GHz) and amplitude (5%) of the load, the increase of the (mean value) dynamic surface tension could reach ~5%. The peak and trough values of the instantaneous dynamic surface tension could reach (up to) 40% increase and (up to) 20% decrease compared to the equilibrium surface tension, respectively. The extracted generalized natural frequencies and the generalized damping constants seem to be intimately related to the intrinsic timescales of the atomic temporal-spatial correlation functions of the liquids both in the bulk region and in the outermost surface layers. These insights uncovered could be helpful for quantitative manipulation of the liquid surface tension using ultrafast shockwaves or laser pulses.

physics.comp-ph↗

arXiv2022

Realization of Practical Eightfold Fermions and Fourfold van Hove Singularity in TaCo$_2$Te$_2$

Space groups describing the symmetry of lattice structure allow the emergence of fermionic quasiparticles with various degeneracy in the band structure. Theoretical efforts have predicted many materials hosting fermions with the highest degeneracy, i.e., eightfold fermions, yet lacking experimental realization. Here, we explore the band degeneracies in TaCo$_2$Te$_2$ crystals. Through systematic experimental and theoretical analyses, we establish TaCo$_2$Te$_2$ as a nonsymmorphic crystal with negligible spin-orbit coupling (SOC) and long-range magnetic order. These critical properties guarantee the first realization of practical eightfold fermions and fourfold van Hove singularity, as directly observed by photoemission spectroscopy. TaCo$_2$Te$_2$ serves as a topological quantum critical platform, which can be tuned into various magnetic, topologically trivial, and nontrivial phases by adding strain, magnetic field, or SOC. The latter is demonstrated by our first-principles calculations, which show that enhancing SOC in TaCo$_2$Te$_2$ will promote the experimental observation of bulk hourglass fermions. Our results establish TaCo$_2$Te$_2$ as a unique platform to explore states of matter intertwining magnetism, correlation, symmetry, and band topology.

cond-mat.str-el↗