Search arXiv⌕ Search

arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 595 records · Page 33Linked to original sources

Comparison of viscosity solutions for a class of second order PDEs on the Wasserstein space

We prove a comparison result for viscosity solutions of second order parabolic partial differential equations in the Wasserstein space. The comparison is valid for semisolutions that are Lipschitz continuous in the measure in a Fourier-Wasserstein metric and uniformly continuous in time. The class of equations we consider is motivated by Mckean-Vlasov control problems with common noise and filtering problems. The proof of comparison relies on a novel version of Ishii's lemma, which is tailor-made for the class of equations we consider.

math.AP↗

mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrieval

We present systematic efforts in building long-context multilingual text representation model (TRM) and reranker from scratch for text retrieval. We first introduce a text encoder (base size) enhanced with RoPE and unpadding, pre-trained in a native 8192-token context (longer than 512 of previous multilingual encoders). Then we construct a hybrid TRM and a cross-encoder reranker by contrastive learning. Evaluations show that our text encoder outperforms the same-sized previous state-of-the-art XLM-R. Meanwhile, our TRM and reranker match the performance of large-sized state-of-the-art BGE-M3 models and achieve better results on long-context retrieval benchmarks. Further analysis demonstrate that our proposed models exhibit higher efficiency during both training and inference. We believe their efficiency and effectiveness could benefit various researches and industrial applications.

cs.CL↗

IntrinsicVoice: Empowering LLMs with Intrinsic Real-time Voice Interaction Abilities

Current methods of building LLMs with voice interaction capabilities rely heavily on explicit text autoregressive generation before or during speech response generation to maintain content quality, which unfortunately brings computational overhead and increases latency in multi-turn interactions. To address this, we introduce IntrinsicVoic,e an LLM designed with intrinsic real-time voice interaction capabilities. IntrinsicVoice aims to facilitate the transfer of textual capabilities of pre-trained LLMs to the speech modality by mitigating the modality gap between text and speech. Our novelty architecture, GroupFormer, can reduce speech sequences to lengths comparable to text sequences while generating high-quality audio, significantly reducing the length difference between speech and text, speeding up inference, and alleviating long-text modeling issues. Additionally, we construct a multi-turn speech-to-speech dialogue dataset named \method-500k which includes nearly 500k turns of speech-to-speech dialogues, and a cross-modality training strategy to enhance the semantic alignment between speech and text. Experimental results demonstrate that IntrinsicVoice can generate high-quality speech response with latency lower than 100ms in multi-turn dialogue scenarios. Demos are available at https://instrinsicvoice.github.io/.

cs.SD↗

DA-Ada: Learning Domain-Aware Adapter for Domain Adaptive Object Detection

Domain adaptive object detection (DAOD) aims to generalize detectors trained on an annotated source domain to an unlabelled target domain. As the visual-language models (VLMs) can provide essential general knowledge on unseen images, freezing the visual encoder and inserting a domain-agnostic adapter can learn domain-invariant knowledge for DAOD. However, the domain-agnostic adapter is inevitably biased to the source domain. It discards some beneficial knowledge discriminative on the unlabelled domain, i.e., domain-specific knowledge of the target domain. To solve the issue, we propose a novel Domain-Aware Adapter (DA-Ada) tailored for the DAOD task. The key point is exploiting domain-specific knowledge between the essential general knowledge and domain-invariant knowledge. DA-Ada consists of the Domain-Invariant Adapter (DIA) for learning domain-invariant knowledge and the Domain-Specific Adapter (DSA) for injecting the domain-specific knowledge from the information discarded by the visual encoder. Comprehensive experiments over multiple DAOD tasks show that DA-Ada can efficiently infer a domain-aware visual encoder for boosting domain adaptive object detection. Our code is available at https://github.com/Therock90421/DA-Ada.

cs.CV↗

SurgicalGS: Dynamic 3D Gaussian Splatting for Accurate Robotic-Assisted Surgical Scene Reconstruction

Accurate 3D reconstruction of dynamic surgical scenes from endoscopic video is essential for robotic-assisted surgery. While recent 3D Gaussian Splatting methods have shown promise in achieving high-quality reconstructions with fast rendering speeds, their use of inverse depth loss functions compresses depth variations. This can lead to a loss of fine geometric details, limiting their ability to capture precise 3D geometry and effectiveness in intraoperative application. To address these challenges, we present SurgicalGS, a dynamic 3D Gaussian Splatting framework specifically designed for surgical scene reconstruction with improved geometric accuracy. Our approach first initialises a Gaussian point cloud using depth priors, employing binary motion masks to identify pixels with significant depth variations and fusing point clouds from depth maps across frames for initialisation. We use the Flexible Deformation Model to represent dynamic scene and introduce a normalised depth regularisation loss along with an unsupervised depth smoothness constraint to ensure more accurate geometric reconstruction. Extensive experiments on two real surgical datasets demonstrate that SurgicalGS achieves state-of-the-art reconstruction quality, especially in terms of accurate geometry, advancing the usability of 3D Gaussian Splatting in robotic-assisted surgery.

cs.CV↗

Outage Probability Analysis for OTFS in Lossy Communications

This paper analyzes the outage probability of orthogonal time frequency space (OTFS) modulation under a lossy communication scenario. First of all, we introduce the channel model and the vector form representation of OTFS this paper uses. Then, we derive an exact expression of the OTFS outage probability in lossy communication scenarios, using Shannon's lossy source-channel separation theorem. Because the channel is time-varying, calculating the exact outage probability is computationally expensive. Therefore, this paper aims to derive a lower bound of the outage probability, which can relatively easily be calculated. Thus, given the distortion requirement and number of the resolvable paths, we can obtain a performance limit under the optimal condition as a reference. Finally, the experimental results of outage probability are obtained by Monte-Carlo method, and compared with the theoretical results calculated by the closed-from expression of the lower bound.

cs.IT↗

SAFE: Semantic Adaptive Feature Extraction with Rate Control for 6G Wireless Communications

Most current Deep Learning-based Semantic Communication (DeepSC) systems are designed and trained exclusively for particular single-channel conditions, which restricts their adaptability and overall bandwidth utilization. To address this, we propose an innovative Semantic Adaptive Feature Extraction (SAFE) framework, which significantly improves bandwidth efficiency by allowing users to select different sub-semantic combinations based on their channel conditions. This paper also introduces three advanced learning algorithms to optimize the performance of SAFE framework as a whole. Through a series of simulation experiments, we demonstrate that the SAFE framework can effectively and adaptively extract and transmit semantics under different channel bandwidth conditions, of which effectiveness is verified through objective and subjective quality evaluations.

cs.NI↗

Search for the Hawking radiation of primordial black holes: prospective sensitivity of LHAASO

Primordial black holes (PBHs), more generally, BHs, undergo evaporation and, in principle, will end their lives in bursts of very high-energy gamma rays. The notable aspect of the PBHs with an initial mass of $\sim10^{14}$ g is that they are expected to end their lives today. In this work, we assess the potential sensitivity of the Large High Altitude Air Shower Observatory (LHAASO) in detecting the local burst rate density of PBHs. Our results suggest that LHAASO is capable of probing for PBH bursts within a proximity of $\sim0.1$ pc from the Sun, measuring a local burst rate density of $\sim$ 1200 (or 700)$\,\mathrm{pc}^{-3}\,\mathrm{yr}^{-1}$ with $99\%$ confidence during a 3-year (or 5-year) observational campaign. This level of sensitivity surpasses the most rigorous observational constraint provided by the High Altitude Water Cherenkov Observatory (HAWC) by an order of magnitude. Additionally, we propose data analysis strategies for LHAASO to optimize the search for PBHs and reach its potential detection limits.

astro-ph.HE↗

Cascade Prompt Learning for Vision-Language Model Adaptation

Prompt learning has surfaced as an effective approach to enhance the performance of Vision-Language Models (VLMs) like CLIP when applied to downstream tasks. However, current learnable prompt tokens are primarily used for the single phase of adapting to tasks (i.e., adapting prompt), easily leading to overfitting risks. In this work, we propose a novel Cascade Prompt Learning CasPL framework to enable prompt learning to serve both generic and specific expertise (i.e., boosting and adapting prompt) simultaneously. Specifically, CasPL is a new learning paradigm comprising two distinct phases of learnable prompts: the first boosting prompt is crafted to extract domain-general knowledge from a senior larger CLIP teacher model by aligning their predicted logits using extensive unlabeled domain images. The second adapting prompt is then cascaded with the frozen first set to fine-tune the downstream tasks, following the approaches employed in prior research. In this manner, CasPL can effectively capture both domain-general and task-specific representations into explicitly different gradual groups of prompts, thus potentially alleviating overfitting issues in the target domain. It's worth noting that CasPL serves as a plug-and-play module that can seamlessly integrate into any existing prompt learning approach. CasPL achieves a significantly better balance between performance and inference speed, which is especially beneficial for deploying smaller VLM models in resource-constrained environments. Compared to the previous state-of-the-art method PromptSRC, CasPL shows an average improvement of 1.85% for base classes, 3.44% for novel classes, and 2.72% for the harmonic mean over 11 image classification datasets. Code is publicly available at: https://github.com/megvii-research/CasPL.

cs.CV↗

Interfacial performance evolution of ceramics-in-polymer composite electrolyte in solid-state lithium metal batteries

The incorporation of ceramics into polymers, forming solid composite electrolytes (SCEs) leads to enhanced electrical performance of all-solid-state lithium metal batteries. This is because the dispersed ceramics particles increase the ionic conductivity, while the polymer matrix leads to better contact performance between the electrolyte and the electrode. In this study, we present a model, based on Hybrid Elements Methods, for the time-dependent Li metal and SCE rough interface mechanics, taking into account for the oxide (ceramics) inclusions (using the Equivalent Inclusion method), and the viscoelasticity of the matrix. We study the effect of LLTO particle size, weight concentration, and spatial distribution on the interface mechanical and electrical response. Moreover, considering the viscoelastic spectrum of a real PEO matrix, under a given stack pressure, we investigate the evolution over time of the mechanical and electrical performance of the interface. The presented theoretical/numerical model might be pivotal in tailoring the development of advanced solid state batteries with superior performance; indeed, we found that conditions in the SCE mixture which optimize both the contact resistivity and the interface stability in time.

cond-mat.soft↗

Unraveling the early universe's equation of state and primordial black hole production with PTA, BBN, and CMB observations

Pulsar timing array (PTA) data releases showed strong evidence for a stochastic gravitational-wave background in the nanohertz band. When the signal is interpreted by a scenario of scalar-induced gravitational waves (SIGWs), we encounter overproduction of primordial black holes (PBHs). We wonder if varying the equation of state (EoS) of the early Universe can resolve this issue and thereby lead to a consistent interpretation of the PTA data. Analyzing a data combination of PTA, big-bang nucleosynthesis, and cosmic microwave background, we find that an epoch with EoS $w\sim\mathcal{O}(10^{-2})$ between the end of inflation and the onset of radiation domination can significantly suppress the production of PBHs, leading to alleviation of the PBH-overproduction issue. With the inferred interval $w=0.44_{-0.40}^{+0.52}$ at 95\% confidence level, our scenario can interpret the PTA data just as well as the conventional scenario of SIGWs produced during the radiation domination.

astro-ph.CO↗

Adaptive Transformer Modelling of Density Function for Nonparametric Survival Analysis

Survival analysis holds a crucial role across diverse disciplines, such as economics, engineering and healthcare. It empowers researchers to analyze both time-invariant and time-varying data, encompassing phenomena like customer churn, material degradation and various medical outcomes. Given the complexity and heterogeneity of such data, recent endeavors have demonstrated successful integration of deep learning methodologies to address limitations in conventional statistical approaches. However, current methods typically involve cluttered probability distribution function (PDF), have lower sensitivity in censoring prediction, only model static datasets, or only rely on recurrent neural networks for dynamic modelling. In this paper, we propose a novel survival regression method capable of producing high-quality unimodal PDFs without any prior distribution assumption, by optimizing novel Margin-Mean-Variance loss and leveraging the flexibility of Transformer to handle both temporal and non-temporal data, coined UniSurv. Extensive experiments on several datasets demonstrate that UniSurv places a significantly higher emphasis on censoring compared to other methods.

cs.LG↗

Evolution-aware VAriance (EVA) Coreset Selection for Medical Image Classification

In the medical field, managing high-dimensional massive medical imaging data and performing reliable medical analysis from it is a critical challenge, especially in resource-limited environments such as remote medical facilities and mobile devices. This necessitates effective dataset compression techniques to reduce storage, transmission, and computational cost. However, existing coreset selection methods are primarily designed for natural image datasets, and exhibit doubtful effectiveness when applied to medical image datasets due to challenges such as intra-class variation and inter-class similarity. In this paper, we propose a novel coreset selection strategy termed as Evolution-aware VAriance (EVA), which captures the evolutionary process of model training through a dual-window approach and reflects the fluctuation of sample importance more precisely through variance measurement. Extensive experiments on medical image datasets demonstrate the effectiveness of our strategy over previous SOTA methods, especially at high compression rates. EVA achieves 98.27% accuracy with only 10% training data, compared to 97.20% for the full training set. None of the compared baseline methods can exceed Random at 5% selection rate, while EVA outperforms Random by 5.61%, showcasing its potential for efficient medical image analysis.

cs.CV↗

Zero-sum stochastic linear-quadratic Stackelberg differential games of Markovian regime-switching system

This paper investigates a zero-sum stochastic linear-quadratic (SLQ, for short) Stackelberg differential game problem, where the coefficients of the state equation and the weighting matrices in the performance functional are regulated by a Markov chain. By utilizing the findings in \citet{Zhang.X.2021_ILQM}, we directly present the feedback representation to the rational reaction of the follower. For the leader's problem, we derive the optimality system through the variational method and study its unique solvability from the Hilbert space point of view. We construct the explicit optimal control for the leader based on the solution to coupled differential Riccati equations (CDREs, for short) and obtain the solvability of CDREs under the one-dimensional framework. Finally, we provide two concrete examples to illustrate the results developed in this paper.

math.OC↗

LaMAGIC: Language-Model-based Topology Generation for Analog Integrated Circuits

In the realm of electronic and electrical engineering, automation of analog circuit is increasingly vital given the complexity and customized requirements of modern applications. However, existing methods only develop search-based algorithms that require many simulation iterations to design a custom circuit topology, which is usually a time-consuming process. To this end, we introduce LaMAGIC, a pioneering language model-based topology generation model that leverages supervised finetuning for automated analog circuit design. LaMAGIC can efficiently generate an optimized circuit design from the custom specification in a single pass. Our approach involves a meticulous development and analysis of various input and output formulations for circuit. These formulations can ensure canonical representations of circuits and align with the autoregressive nature of LMs to effectively addressing the challenges of representing analog circuits as graphs. The experimental results show that LaMAGIC achieves a success rate of up to 96\% under a strict tolerance of 0.01. We also examine the scalability and adaptability of LaMAGIC, specifically testing its performance on more complex circuits. Our findings reveal the enhanced effectiveness of our adjacency matrix-based circuit formulation with floating-point input, suggesting its suitability for handling intricate circuit designs. This research not only demonstrates the potential of language models in graph generation, but also builds a foundational framework for future explorations in automated analog circuit design.

cs.AR↗

Demonstrating two-particle interference with a one-dimensional delta potential well

In quantum mechanics, the exchange symmetry of wave functions for identical particles has observable effects, including the widely studied Hong-Ou-Mandel (HOM) effect. A theoretical description using second quantization is elegant but abstract. In contrast, this paper describes a simple model of two-particle interference using a one-dimensional delta potential well as a beam splitter. The conditions for the HOM effect are derived from the perspective of wave packet evolution. Furthermore, the interference processes of bosons, fermions and distinguishable particles are demonstrated and compared in detail. The method presented here is concrete, easy to visualize, and can help students to better understand the effects arising from the exchange symmetry of wave functions. The main results can be animated for classroom teaching or developed into an undergraduate seminar topic.

quant-ph↗

On the cosmological abundance of magnetic monopoles

We demonstrate that Debye shielding cannot be employed to constrain the cosmological abundance of magnetic monopoles, contrary to what is stated in the previous literature. Current model-independent bounds on the monopole abundance are then revisited for unit Dirac magnetic charge. We find that the Andromeda Parker bound can be employed to set an upper limit on the monopole flux at the level of $F_M\lesssim 5.3\times 10^{-19}\,\text{cm}^{-2}\text{s}^{-1}\text{sr}^{-1}$ for a monopole mass $10^{13}\,\text{GeV}/c^2\lesssim m\lesssim 10^{16}\,\text{GeV}/c^2$, which is more stringent than the MACRO direct search limit by two orders of magnitude. This translates into stringent constraints on the monopole density parameter $Ω_M$ at the level of $10^{-7}-10^{-4}$ depending on the mass. For larger monopole masses the scenarios in which magnetic monopoles account for all or the majority of dark matter are disfavored.

hep-ph↗