Search arXiv⌕ Search

arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 541 records · Page 30Linked to original sources

Dynamical Models of the Milky Way in Action Space with LAMOST DR8 and GAIA EDR3

This work explores dynamical models of the Milky Way (MW) by analyzing a sample of 86,109 K giant stars selected through cross-matching the LAMOST DR8 and Gaia EDR3 surveys. Our earlier torus models in Wang et al. (2017) did not include Gaia data, making them incompatible with the new proper motion distributions of samples. Here, we refine the construction of action-based, self-consistent models to constrain the three-dimensional velocity distribution of K giants over a larger parameter space, drawing on a series of existing MW models. This approach produces several new MW models. Our best-fit model for the local kinematics near the Sun indicates a MW virial mass of 1.35 $\times 10^{12} M_\odot$, a local stellar density of 0.0696 $\rm M_\odot pc^{-3}$, and a local dark matter density of 0.0115 $\rm M_\odot pc^{-3}$. Our main conclusion supports a thicker and more extended thick disk, alongside a cooler thin disk, compared to the best-fitting model in Wang et al. (2017). Near the Sun, our model aligns well with observations, but is less satisfactory at distances far from the Galactic center, perhaps implying unidentified structures. Further high-precision observations will be critical for understanding the dynamics in these outer Galactic regions, and will require a more realistic model.

astro-ph.GA↗

Non-linear integral equations for the XXX spin-1/2 quantum chain with non-diagonal boundary fields

The XXX spin-$\frac{1}{2}$ Heisenberg chain with non-diagonal boundary fields represents a cornerstone model in the study of integrable systems with open boundaries. Despite its significance, solving this model exactly has remained a formidable challenge due to the breaking of $U(1)$ symmetry. Building on the off-diagonal Bethe Ansatz (ODBA), we derive a set of nonlinear integral equations (NLIEs) that encapsulate the exact spectrum of the model. For $U(1)$ symmetric spin-$\frac{1}{2}$ chains such NLIEs involve two functions $a(x)$ and $\bar{a}(x)$ coupled by an integration kernel with short-ranged elements. The solution functions show characteristic features for arguments at some length scale which grows logarithmically with system size $N$. For the non $U(1)$ symmetric case, the equations involve a novel third function $c(x)$, which captures the inhomogeneous contributions of the $T$-$Q$ relation. The kernel elements coupling this function to the standard ones are long-ranged and lead for the ground-state to a winding phenomenon. In $\log(1+a(x))$ and $\log(1+\bar a(x))$ we observe a sudden change by $2π$i at a characteristic scale $x_1$ of the argument. Other features appear at a value $x_0$ which is of order $\log N$. These two length scales, $x_1$ and $x_0$, are independent: their ratio $x_1/x_0$ is large for small $N$ and small for large $N$. Explicit solutions to the NLIEs are obtained numerically for these limiting cases, though intermediate cases ($x_1/x_0 \sim 1$) present computational challenges. This work lays the foundation for studying finite-size corrections and conformal properties of other integrable spin chains with non-diagonal boundaries, opening new avenues for exploring boundary effects in quantum integrable systems.

cond-mat.str-el↗

Magnetic Resonance Image Processing Transformer for General Accelerated Image Reconstruction

Recent advancements in deep learning have enabled the development of generalizable models that achieve state-of-the-art performance across various imaging tasks. Vision Transformer (ViT)-based architectures, in particular, have demonstrated strong feature extraction capabilities when pre-trained on large-scale datasets. In this work, we introduce the Magnetic Resonance Image Processing Transformer (MR-IPT), a ViT-based framework designed to enhance the generalizability and robustness of accelerated MRI reconstruction. Unlike conventional deep learning models that require separate training for different acceleration factors, MR-IPT is pre-trained on a large-scale dataset encompassing multiple undersampling patterns and acceleration settings, enabling a unified reconstruction framework. By leveraging a shared transformer backbone, MR-IPT effectively learns universal feature representations, allowing it to generalize across diverse reconstruction tasks. Extensive experiments demonstrate that MR-IPT outperforms both CNN-based and existing transformer-based methods, achieving superior reconstruction quality across varying acceleration factors and sampling masks. Moreover, MR-IPT exhibits strong robustness, maintaining high performance even under unseen acquisition setups, highlighting its potential as a scalable and efficient solution for accelerated MRI. Our findings suggest that transformer-based general models can significantly advance MRI reconstruction, offering improved adaptability and stability compared to traditional deep learning approaches.

eess.IV↗

Pseudo Transitions in the Finite-Size Blume-Capel Model

This article investigates the pseudo transitions of the Blume-Capel model on two-dimensional finite-size lattices. By employing the Wang-Landau sampling method and microcanonical inflection point analysis, we identified the positions of phase transitions as well as higher-order phase transitions. Through Metropolis sampling and canonical ensemble analysis, we determined the geometric characteristics of the system at these transition points. When the crystal field parameter $D$ exceeds 1.965, crossing the tricritical point, no third-order dependent phase transition is observed. However, a fourth-order independent transition was identified in the high-temperature region, and through Metropolis sampling analysis, a phase transition from the ordered paramagnetic phase to the disordered paramagnetic phase was confirmed, enhancing the phase diagram. Furthermore, the positions of the third-order phase transition obtained from both microcanonical and canonical analyses are consistent and mutually corroborative. We speculate that third-order dependent transitions vanish in the presence of strong first-order phase transitions.

cond-mat.stat-mech↗

Enhancing Reasoning to Adapt Large Language Models for Domain-Specific Applications

This paper presents SOLOMON, a novel Neuro-inspired Large Language Model (LLM) Reasoning Network architecture that enhances the adaptability of foundation models for domain-specific applications. Through a case study in semiconductor layout design, we demonstrate how SOLOMON enables swift adaptation of general-purpose LLMs to specialized tasks by leveraging Prompt Engineering and In-Context Learning techniques. Our experiments reveal the challenges LLMs face in spatial reasoning and applying domain knowledge to practical problems. Results show that SOLOMON instances significantly outperform their baseline LLM counterparts and achieve performance comparable to state-of-the-art reasoning model, o1-preview. We discuss future research directions for developing more adaptive AI systems that can continually learn, adapt, and evolve in response to new information and changing requirements.

cs.CL↗

FMDLlama: Financial Misinformation Detection based on Large Language Models

The emergence of social media has made the spread of misinformation easier. In the financial domain, the accuracy of information is crucial for various aspects of financial market, which has made financial misinformation detection (FMD) an urgent problem that needs to be addressed. Large language models (LLMs) have demonstrated outstanding performance in various fields. However, current studies mostly rely on traditional methods and have not explored the application of LLMs in the field of FMD. The main reason is the lack of FMD instruction tuning datasets and evaluation benchmarks. In this paper, we propose FMDLlama, the first open-sourced instruction-following LLMs for FMD task based on fine-tuning Llama3.1 with instruction data, the first multi-task FMD instruction dataset (FMDID) to support LLM instruction tuning, and a comprehensive FMD evaluation benchmark (FMD-B) with classification and explanation generation tasks to test the FMD ability of LLMs. We compare our models with a variety of LLMs on FMD-B, where our model outperforms other open-sourced LLMs as well as OpenAI's products. This project is available at https://github.com/lzw108/FMD.

cs.CL↗

Decentralized MIMO Systems with Imperfect CSI using LMMSE Receivers

Centralized baseband processing (CBP) is required to achieve the full potential of massive multiple-input multiple-output (MIMO) systems. However, due to the large number of antennas, CBP suffers from two major issues: 1) Tremendous data interconnection between radio frequency (RF) circuitry and processing fabrics; and 2) high-dimensional computation. To this end, decentralized baseband processing (DBP) has been proposed, where the antennas at the BS are partitioned into clusters connected to separate RF circuits and equipped with separate computing units. Unfortunately, due to the decentralized structure, the optimal fusion scheme and performance analysis for DBP with general spatial correlation between clusters and imperfect channel state information (CSI) are not available in the literature. In this paper, we consider a decentralized MIMO system where all clusters adopt linear minimum mean-square error (LMMSE) receivers with imperfect CSI. Specifically, we first establish the optimal linear fusion scheme which has high computational and data input/output (I/O) costs. To reduce the costs, we further propose two sub-optimal fusion schemes with reduced complexity. For all three schemes, we derive the closed-form expressions for the signal-to-interference-and-noise ratio (SINR) by leveraging random matrix theory (RMT) and demonstrate the conditions under which the sub optimal schemes are optimal. Furthermore, we determine the optimal regularization parameter for decentralized LMMSE receivers, identify the best antenna partitioning strategy, and prove that the SINR will decrease as the number of clusters increases. Numerical simulations validate the accuracy of the theoretical results.

cs.IT↗

Geometric properties of the additional third-order transitions in the two-dimensional Potts model

Within the canonical ensemble framework, this paper investigates the presence of higher-order transition signals in the $q$-state Potts model (for $q \geq 3$), using two geometric order parameters: isolated spins number and the average perimeter of clusters. Our results confirm that higher-order transitions exist in the Potts model, where the number of isolated spins reliably indicates third-order independent transitions. This signal persists regardless of the system's phase transition order, even at higher values of $q$. In contrast, the average perimeter of clusters, used as an order parameter for detecting third-order dependent transitions, shows that for $q = 6$ and $q = 8$, the signal for third-order dependent transitions disappears, indicating its absence in systems undergoing first-order transitions. These findings are consistent with results from microcanonical inflection-point analysis, further validating the robustness of this approach.

cond-mat.stat-mech↗

The Wasserstein Space of Stochastic Processes in Continuous Time

Researchers from different areas have independently defined extensions of the usual weak convergence of laws of stochastic processes with the goal of adequately accounting for the flow of information. Natural approaches are convergence of the Aldous--Knight prediction process, Hellwig's information topology, convergence in adapted distribution in the sense of Hoover--Keisler and the weak topology induced by optimal stopping problems. The first main contribution of this article is that on continuous processes with natural filtrations there exists a canonical adapted weak topology which can be defined by all of these approaches; moreover, the adapted weak topology is metrized by a suitable adapted Wasserstein distance $\mathcal{AW}$. While the set of processes with natural filtrations is not complete, we establish that its completion consists precisely of the space ${\rm FP}$ of stochastic processes with general filtrations. We also show that $({\rm FP}, \mathcal{AW})$ exhibits several desirable properties. Specifically, it is Polish, martingales form a closed subset and approximation results such as Donsker's theorem extend to $\mathcal{AW}$.

math.PR↗

FAST drift scan survey for HI intensity mapping: simulation on Bayesian-stacking-based HI mass function estimation

This study investigates the estimation of the neutral hydrogen (HI) mass function (HIMF) using a Bayesian stacking approach with simulated data for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) HI intensity mapping (HIIM) drift-scan surveys. Using data from the IllustrisTNG simulation, we construct HI sky cubes at redshift $z\sim0.1$ and the corresponding optical galaxy catalogs, simulating FAST observations under various survey strategies, including pilot, deep-field, and ultradeep-field surveys. The HIMF is measured for distinct galaxy populations -- classified by optical properties into red, blue, and bluer galaxies -- and injected with systematic effects such as observational noise and flux confusion caused by the FAST beam. The results show that Bayesian stacking significantly enhances HIMF measurements. For red and blue galaxies, the HIMF can be well constrained with pilot surveys, while deeper surveys are required for the bluer galaxy population. Our analysis also reveals that sample variance dominates over observational noise, emphasizing the importance of wide-field surveys to improve constraints. Furthermore, flux confusion shifts the HIMF toward higher masses, which we address using a transfer function for correction. Finally, we explore the effects of intrinsic sample incompleteness and propose a framework to quantify its impact. This work lays the groundwork for future \hiMF studies with FAST HIIM, addressing key challenges and enabling robust analyses of HI content across galaxy populations.

astro-ph.CO↗

Study on a Fast Solver for Combined Field Integral Equations of 3D Conducting Bodies Based on Graph Neural Networks

In this paper, we present a graph neural networks (GNNs)-based fast solver (GraphSolver) for solving combined field integral equations (CFIEs) of 3D conducting bodies. Rao-Wilton-Glisson (RWG) basis functions are employed to discretely and accurately represent the geometry of 3D conducting bodies. A concise and informative graph representation is then constructed by treating each RWG function as a node in the graph, enabling the flow of current between nodes. With the transformed graphs, GraphSolver is developed to directly predict real and imaginary parts of the x, y and z components of the surface current densities at each node (RWG function). Numerical results demonstrate the efficacy of GraphSolver in solving CFIEs for 3D conducting bodies with varying levels of geometric complexity, including basic 3D targets, missile-shaped targets, and airplane-shaped targets.

cs.LG↗

Testing the Cosmic Distance Duality Relation Using Strong Gravitational Lensing Time Delays and Type Ia Supernovae

We present a comprehensive test of the cosmic distance duality relation (DDR) using a combination of strong gravitational lensing (SGL) time delay measurements and Type Ia supernovae (SNe Ia) data. We investigate three different parameterizations of potential DDR violations. To bridge the gap between SGL and SNe Ia datasets, we implement an artificial neural network (ANN) approach to reconstruct the distance modulus of SNe Ia. Our analysis uniquely considers both scenarios where the absolute magnitude of SNe Ia ($M_B$) is treated as a free parameter and where it is fixed to a Cepheid-calibrated value. Using a sample of six SGL systems and the Pantheon+ SNe Ia dataset, we find no statistically significant evidence for DDR violations across all parameterizations. The consistency of our findings across different parameterizations not only reinforces confidence in the standard DDR but also demonstrates the robustness of our analytical approach.

astro-ph.CO↗

Convergence Rate of Particle System for Second-order PDEs On Wasserstein Space

In this paper, we provide a convergence rate for particle approximations of a class of second-order PDEs on Wasserstein space. We show that, up to some error term, the infinite-dimensional inf(sup)-convolution of the finite-dimensional value function yields a super (sub)-viscosity solution to the PDEs on Wasserstein space. Hence, we obtain a convergence rate using a comparison principle of such PDEs on Wasserstein space. Our argument is purely analytic and relies on the regularity of value functions established in \cite{DaJaSe23}.

math.AP↗

The Backpropagation of the Wave Network

This paper provides an in-depth analysis of Wave Network, a novel token representation method derived from the Wave Network, designed to capture both global and local semantics of input text through wave-inspired complex vectors. In complex vector token representation, each token is represented with a magnitude component, capturing the global semantics of the entire input text, and a phase component, encoding the relationships between individual tokens and the global semantics. Building on prior research that demonstrated the effectiveness of wave-like operations, such as interference and modulation, during forward propagation, this study investigates the convergence behavior, backpropagation characteristics, and embedding independence within the Token2Wave framework. A detailed computational complexity analysis shows that Token2Wave can significantly reduce video memory usage and training time compared to BERT. Gradient comparisons for the [CLS] token, total input text, and classifier parameters further highlight Token2Wave's unique characteristics. This research offers new insights into wave-based token representations, demonstrating their potential to enable efficient and computationally friendly language model architectures.

cs.CL↗

Superradiant growth anomaly magnification in evolution of vector bosonic condensates bounded by a Kerr black hole with near-horizon reflection

Ultralight vector particles can form evolving condensates around a Kerr black hole (BH) due to superradiant instability. We study the effect of near-horizon reflection on the evolution of this system: by matching three pieces of asymptotic expansions of the Proca equation in Kerr metric and considering the leading order in the electric mode, we present explicit analytical expressions for the corrected spectrum and the superradiant instability rates. Particularly, in high-spin BH cases, we identify an anomalous situation where the superadiance rate is temporarily increased by the reflection parameter $\mathcal{R}$, which also occurs in the scalar scenario, but is largely magnified in vector condensates due to a faster growth rate in dominant mode. We point out the condition for the growth anomaly in the adiabatic case is that information carried per particle exceeds a certain value $δI/δN>2πk_\text{B} \sqrt{(1+\mathcal{R})/(1-\mathcal{R})}$. We further construct several featured quantities to illustrate it, and formalize the anomaly-induced gravitational wave strain deformation.

gr-qc↗

RSAR: Restricted State Angle Resolver and Rotated SAR Benchmark

Rotated object detection has made significant progress in the optical remote sensing. However, advancements in the Synthetic Aperture Radar (SAR) field are laggard behind, primarily due to the absence of a large-scale dataset. Annotating such a dataset is inefficient and costly. A promising solution is to employ a weakly supervised model (e.g., trained with available horizontal boxes only) to generate pseudo-rotated boxes for reference before manual calibration. Unfortunately, the existing weakly supervised models exhibit limited accuracy in predicting the object's angle. Previous works attempt to enhance angle prediction by using angle resolvers that decouple angles into cosine and sine encodings. In this work, we first reevaluate these resolvers from a unified perspective of dimension mapping and expose that they share the same shortcomings: these methods overlook the unit cycle constraint inherent in these encodings, easily leading to prediction biases. To address this issue, we propose the Unit Cycle Resolver, which incorporates a unit circle constraint loss to improve angle prediction accuracy. Our approach can effectively improve the performance of existing state-of-the-art weakly supervised methods and even surpasses fully supervised models on existing optical benchmarks (i.e., DOTA-v1.0 dataset). With the aid of UCR, we further annotate and introduce RSAR, the largest multi-class rotated SAR object detection dataset to date. Extensive experiments on both RSAR and optical datasets demonstrate that our UCR enhances angle prediction accuracy. Our dataset and code can be found at: https://github.com/zhasion/RSAR.

cs.CV↗

Exciting games and Monge-Ampère equations

We consider a competition between $d+1$ players, and aim to identify the "most exciting game'' of this kind. This is translated, mathematically, into a stochastic optimization problem over martingales that live on the $d$-dimensional subprobability simplex $Δ$ and terminate on the vertices of $Δ$ (so-called win-martingales), with a cost function related to a scaling limit of Shannon entropies. We uncover a surprising connection between this problem and the seemingly unrelated field of Monge-Ampère equations: If $g$ solves \begin{equation*} \begin{cases} g(x)=\log \det\left(\frac{1}{2}\nabla^2 g(x)\right), \quad \, \ \ \ \ \, \, \, \, x \in Δ, \\ g(x)=\infty, \quad \quad \quad \quad \ \ \ \ \ \quad \quad \, \ \ \ \ \ x\in \partial Δ, \end{cases} \end{equation*} then the winning-probability of the players in the most exciting game is described by $$dM_s=\sqrt{\frac{2 (\nabla^2 g(M_s))^{-1}}{1-s} } \, dB_s.$$ To formalize this, a detailed quantitative analysis of the Monge-Ampère equation for $g$ is crucial. This is then leveraged to prove that $M$ is indeed an optimal win-martingale.

math.PR↗

Viscosity Solutions of Fully second-order HJB Equations in the Wasserstein Space

In this paper, we show that the value functions of mean field control problems with common noise are the unique viscosity solutions to fully second-order Hamilton-Jacobi-Bellman equations, in a Crandall-Lions-like framework. We allow the second-order derivative in measure to be state-dependent and thus infinite-dimensional, rather than derived from a finite-dimensional operator, hence the term ''fully''. Our argument leverages the construction of smooth approximations from particle systems developed by Cosso, Gozzi, Kharroubi, Pham, and Rosestolato [Trans. Amer. Math. Soc., 2023], and the compactness argument via penalization of measure moments in Soner and Yan [Appl. Math. Optim., 2024]. Our work addresses unbounded dynamics and state-dependent common noise volatility, and to our knowledge, this is the first result of its kind in the literature.

math.OC↗