arXiv subjects

Yuan Xu

Publications and source records attributed to Yuan Xu.

At least 73 records · Page 4Linked to original sources

arXiv2025

Trapping of Single Atoms in Metasurface Optical Tweezer Arrays

Optical tweezer arrays have emerged as a key experimental platform for quantum computation, quantum simulation, and quantum metrology, enabling unprecedented levels of control over single atoms and molecules. However, existing tweezer platforms have fundamental limitations in array geometry, size, and scalability. Here we demonstrate the trapping of single strontium atoms in optical tweezer arrays generated via holographic metasurfaces. We realize two dimensional arrays with more than 1000 trapped atoms, arranged in arbitrary geometries with trap spacings as small as 1.5 um. The arrays have a high uniformity in terms of trap depth, trap frequency, and positional accuracy, rivaling or surpassing existing approaches. This is enabled by highly efficient holographic metasurfaces fabricated from high-refractive index materials, silicon-rich silicon nitride and titanium dioxide. Leveraging sub-micrometer pixel sizes and high pixel densities, our platform allows scaling far beyond current capabilities. As a demonstration, we realize an optical tweezer array with 360,000 traps. These advances will facilitate tweezer-array based quantum applications that require large system sizes.

physics.atom-ph↗

arXiv2025

X-Intelligence 3.0: Training and Evaluating Reasoning LLM for Semiconductor Display

Large language models (LLMs) have recently achieved significant advances in reasoning and demonstrated their advantages in solving challenging problems. Yet, their effectiveness in the semiconductor display industry remains limited due to a lack of domain-specific training and expertise. To bridge this gap, we present X-Intelligence 3.0, the first high-performance reasoning model specifically developed for the semiconductor display industry. This model is designed to deliver expert-level understanding and reasoning for the industry's complex challenges. Leveraging a carefully curated industry knowledge base, the model undergoes supervised fine-tuning and reinforcement learning to enhance its reasoning and comprehension capabilities. To further accelerate development, we implemented an automated evaluation framework that simulates expert-level assessments. We also integrated a domain-specific retrieval-augmented generation (RAG) mechanism, resulting in notable performance gains on benchmark datasets. Despite its relatively compact size of 32 billion parameters, X-Intelligence 3.0 outperforms SOTA DeepSeek-R1-671B across multiple evaluations. This demonstrates its exceptional efficiency and establishes it as a powerful solution to the longstanding reasoning challenges faced by the semiconductor display industry.

cs.CL↗

arXiv2025

Best approximation by polynomials on the conic domains

A new modulus of smoothness and its equivalent $K$-function are defined on the conic domains in $\mathbb{R}^d$, and used to characterize the weighted best approximation by polynomials. Both direct and weak inverse theorems of the characterization are established via the modulus of smoothness. For the conic surface $\mathbb{V}_0^{d+1} = \{(x,t): \|x\| = t\le 1\}$, the natural weight function is $t^{-1}(1-t)^γ$, which has a singularity at the apex, the rotational part of the modulus of smoothness is defined in terms of the difference operator in Euler angles with an increment $h/\sqrt{t}$, akin to the Ditzian-Totik modulus on the interval but with $\sqrt{t}$ in the denominator, which captures the singularity at the apex.

math.CA↗

arXiv2025

APR-Transformer: Initial Pose Estimation for Localization in Complex Environments through Absolute Pose Regression

Precise initialization plays a critical role in the performance of localization algorithms, especially in the context of robotics, autonomous driving, and computer vision. Poor localization accuracy is often a consequence of inaccurate initial poses, particularly noticeable in GNSS-denied environments where GPS signals are primarily relied upon for initialization. Recent advances in leveraging deep neural networks for pose regression have led to significant improvements in both accuracy and robustness, especially in estimating complex spatial relationships and orientations. In this paper, we introduce APR-Transformer, a model architecture inspired by state-of-the-art methods, which predicts absolute pose (3D position and 3D orientation) using either image or LiDAR data. We demonstrate that our proposed method achieves state-of-the-art performance on established benchmark datasets such as the Radar Oxford Robot-Car and DeepLoc datasets. Furthermore, we extend our experiments to include our custom complex APR-BeIntelli dataset. Additionally, we validate the reliability of our approach in GNSS-denied environments by deploying the model in real-time on an autonomous test vehicle. This showcases the practical feasibility and effectiveness of our approach. The source code is available at:https://github.com/GT-ARC/APR-Transformer.

cs.RO↗

arXiv2025

Intelligent Interaction Strategies for Context-Aware Cognitive Augmentation

Human cognition is constrained by processing limitations, leading to cognitive overload and inefficiencies in knowledge synthesis and decision-making. Large Language Models (LLMs) present an opportunity for cognitive augmentation, but their current reactive nature limits their real-world applicability. This position paper explores the potential of context-aware cognitive augmentation, where LLMs dynamically adapt to users' cognitive states and task environments to provide appropriate support. Through a think-aloud study in an exhibition setting, we examine how individuals interact with multi-modal information and identify key cognitive challenges in structuring, retrieving, and applying knowledge. Our findings highlight the need for AI-driven cognitive support systems that integrate real-time contextual awareness, personalized reasoning assistance, and socially adaptive interactions. We propose a framework for AI augmentation that seamlessly transitions between real-time cognitive support and post-experience knowledge organization, contributing to the design of more effective human-centered AI systems.

cs.HC↗

arXiv2025

Assessing Validity of ICD-10 Administrative Data in Coding Comorbidities

Objectives: Administrative data is commonly used to inform chronic disease prevalence and support health informatics research. This study assessed the validity of coding comorbidity in the International Classification of Diseases, 10th Revision (ICD-10) administrative data. Methods: We analyzed three chart review cohorts (4,008 patients in 2003, 3,045 in 2015, and 9,024 in 2022) in Alberta, Canada. Nurse reviewers assessed the presence of 17 clinical conditions using a consistent protocol. The reviews were linked with administrative data using unique identifiers. We compared the accuracy in coding comorbidity by ICD-10, using chart review data as the reference standard. Results: Our findings showed that the mean difference in prevalence between chart reviews and ICD-10 for these 17 conditions was 2.1% in 2003, 7.6% in 2015, and 6.3% in 2022. Some conditions were relatively stable, such as diabetes (1.9%, 2.1%, and 1.1%) and metastatic cancer (0.3%, 1.1%, and 0.4%). For these 17 conditions, the sensitivity ranged from 39.6-85.1% in 2003, 1.3-85.2% in 2015, and 3.0-89.7% in 2022. The C-statistics for predicting in-hospital mortality using comorbidities by ICD-10 were 0.84 in 2003, 0.81 in 2015, and 0.78 in 2022. Discussion: The under-coding could be primarily due to the increase of hospital patient volumes and the limited time allocated to coders. There is a potential to develop artificial intelligence methods based on electronic health records to support coding practices and improve coding quality. Conclusion: Comorbidities were increasingly under-coded over 20 years. The validity of ICD-10 decreased but remained relatively stable for certain conditions mandated for coding. The under-coding exerted minimal impact on in-hospital mortality prediction.

q-bio.QM↗

arXiv2025

Latent Embedding Adaptation for Human Preference Alignment in Diffusion Planners

This work addresses the challenge of personalizing trajectories generated in automated decision-making systems by introducing a resource-efficient approach that enables rapid adaptation to individual users' preferences. Our method leverages a pretrained conditional diffusion model with Preference Latent Embeddings (PLE), trained on a large, reward-free offline dataset. The PLE serves as a compact representation for capturing specific user preferences. By adapting the pretrained model using our proposed preference inversion method, which directly optimizes the learnable PLE, we achieve superior alignment with human preferences compared to existing solutions like Reinforcement Learning from Human Feedback (RLHF) and Low-Rank Adaptation (LoRA). To better reflect practical applications, we create a benchmark experiment using real human preferences on diverse, high-reward trajectories.

cs.LG↗

arXiv2025

Quantum squeezing amplification with a weak Kerr nonlinear oscillator

Quantum squeezed states, with reduced quantum noise, have been widely utilized in quantum sensing and quantum error correction applications. However, generating and manipulating these nonclassical states with a large squeezing degree typically requires strong nonlinearity, which inevitably induces additional decoherence that diminishes the overall performance. Here, we demonstrate the generation and amplification of squeezed states in a superconducting microwave cavity with weak Kerr nonlinearity. By subtly engineering an off-resonant microwave drive, we observe cyclic dynamics of the quantum squeezing evolution for various Fock states |N> with N up to 6 in displaced frame of the cavity. Furthermore, we deterministically realize quantum squeezing amplification by alternately displacing the Kerr oscillator using the Trotterization technique, achieving a maximum squeezing degree of 14.6 dB and squeezing rate of 0.28 MHz. Our hardware-efficient displacement-enhanced squeezing operations provide an alternative pathway for generating large squeezed states, promising potential applications in quantum-enhanced sensing and quantum information processing.

quant-ph↗

arXiv2025

CrowdHMTware: A Cross-level Co-adaptation Middleware for Context-aware Mobile DL Deployment

There are many deep learning (DL) powered mobile and wearable applications today continuously and unobtrusively sensing the ambient surroundings to enhance all aspects of human lives.To enable robust and private mobile sensing, DL models are often deployed locally on resource-constrained mobile devices using techniques such as model compression or offloading.However, existing methods, either front-end algorithm level (i.e. DL model compression/partitioning) or back-end scheduling level (i.e. operator/resource scheduling), cannot be locally online because they require offline retraining to ensure accuracy or rely on manually pre-defined strategies, struggle with dynamic adaptability.The primary challenge lies in feeding back runtime performance from the back-end level to the front-end level optimization decision. Moreover, the adaptive mobile DL model porting middleware with cross-level co-adaptation is less explored, particularly in mobile environments with diversity and dynamics. In response, we introduce CrowdHMTware, a dynamic context-adaptive DL model deployment middleware for heterogeneous mobile devices. It establishes an automated adaptation loop between cross-level functional components, i.e. elastic inference, scalable offloading, and model-adaptive engine, enhancing scalability and adaptability. Experiments with four typical tasks across 15 platforms and a real-world case study demonstrate that CrowdHMTware can effectively scale DL model, offloading, and engine actions across diverse platforms and tasks. It hides run-time system issues from developers, reducing the required developer expertise.

cs.LG↗

arXiv2024

Digital Modeling of Massage Techniques and Reproduction by Robotic Arms

This paper explores the digital modeling and robotic reproduction of traditional Chinese medicine (TCM) massage techniques. We adopt an adaptive admittance control algorithm to optimize force and position control, ensuring safety and comfort. The paper analyzes key TCM techniques from kinematic and dynamic perspectives, and designs robotic systems to reproduce these massage techniques. The results demonstrate that the robot successfully mimics the characteristics of TCM massage, providing a foundation for integrating traditional therapy with modern robotics and expanding assistive therapy applications.

cs.RO↗

arXiv2024

Lightweight holographic near-eye display system with self-charging capability using solar energy

Near-eye display plays an important role in emerging spatial computing systems, providing a distinctive visual effect of virtual-real fusion. However, its application for all-day wear is greatly limited by the bulky structure, energy expenditure, and continuous battery heating. Here, we propose a lightweight holographic near-eye display system that takes advantage of solar energy for self-charging. To achieve the collection of solar energy and near-eye display without crosstalk, holographic optical elements (HOE) are used to diffract sunlight and signal light into a common waveguide. Then, small-area solar cells convert the collected solar energy and power the system. Compact power supply components replace heavy batteries, contributing to the lightweight design. The simple acquisition of solar energy provides the system with sustainable self-charging capability. We believe that the lightweight design and continuous energy input solution will significantly promote the popularity of near-eye display in our daily lives.

physics.optics↗

arXiv2024

AlphaChimp: Tracking and Behavior Recognition of Chimpanzees

Understanding non-human primate behavior is crucial for improving animal welfare, modeling social behavior, and gaining insights into both distinctly human and shared behaviors. Despite recent advances in computer vision, automated analysis of primate behavior remains challenging due to the complexity of their social interactions and the lack of specialized algorithms. Existing methods often struggle with the nuanced behaviors and frequent occlusions characteristic of primate social dynamics. This study aims to develop an effective method for automated detection, tracking, and recognition of chimpanzee behaviors in video footage. Here we show that our proposed method, AlphaChimp, an end-to-end approach that simultaneously detects chimpanzee positions and estimates behavior categories from videos, significantly outperforms existing methods in behavior recognition. AlphaChimp achieves approximately 10% higher tracking accuracy and a 20% improvement in behavior recognition compared to state-of-the-art methods, particularly excelling in the recognition of social behaviors. This superior performance stems from AlphaChimp's innovative architecture, which integrates temporal feature fusion with a Transformer-based self-attention mechanism, enabling more effective capture and interpretation of complex social interactions among chimpanzees. Our approach bridges the gap between computer vision and primatology, enhancing technical capabilities and deepening our understanding of primate communication and sociality. We release our code and models and hope this will facilitate future research in animal social dynamics. This work contributes to ethology, cognitive science, and artificial intelligence, offering new perspectives on social intelligence.

cs.CV↗

arXiv2024

Eliminating Incoherent Noise: A Coherent Quantum Approach in Multi-Sensor Dark Matter Detection

We propose a novel dark matter detection scheme by leveraging quantum coherence across a network of multiple quantum sensors. This method effectively eliminates incoherent background noise, thereby significantly enhancing detection sensitivity. This is achieved by performing a series of basis transformation operations, allowing the coherent signal to be expressed as a combination of sensor population measurements without introducing background noise. We present a comprehensive analytical analysis and complement it with practical numerical simulations. These demonstrations reveal that signal strength is enhanced by the square of the number of sensors, while noise, primarily due to operational infidelity rather than background fluctuations, increases only linearly with the number of sensors. Our approach paves the way for next-generation dark matter searches that optimally utilize an advanced network of sensors and quantum technologies.

hep-ph↗

arXiv2024

Optimization-Aided Construction of Multivariate Chebyshev Polynomials

This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform norm. Exploiting the Moment-SOS hierarchy, we devise a versatile semidefinite-programming-based procedure to compute such best approximants, as well as associated signatures. Applying this procedure in three variables leads to the values of best approximation errors for all monomials up to degree six on the euclidean ball, the simplex, and the cross-polytope. Furthermore, inspired by numerical experiments, we obtain explicit expressions for Chebyshev polynomials in two cases unresolved before, namely for the monomial $x_1^2 x_2^2 x_3$ on the euclidean ball and for the monomial $x_1^2 x_2 x_3$ on the simplex.

math.OC↗

arXiv2024

On the enumeration of series-parallel matroids

By the work of Ferroni and Larson, Kazhdan-Lusztig polynomials and Z-polynomials of complete graphs have combinatorial interpretations in terms of quasi series-parallel matroids. We provide explicit formulas for the number of series-parallel matroids and the number of simple series-parallel matroids of a given rank and cardinality, extending results of Ferroni-Larson and Gao-Proudfoot-Yang-Zhang.

math.CO↗

arXiv2024

Investigating and Mitigating the Multimodal Hallucination Snowballing in Large Vision-Language Models

Though advanced in understanding visual information with human languages, Large Vision-Language Models (LVLMs) still suffer from multimodal hallucinations. A natural concern is that during multimodal interaction, the generated hallucinations could influence the LVLMs' subsequent generation. Thus, we raise a question: When presented with a query relevant to the previously generated hallucination, will LVLMs be misled and respond incorrectly, even though the ground visual information exists? To answer this, we propose a framework called MMHalSnowball to evaluate LVLMs' behaviors when encountering generated hallucinations, where LVLMs are required to answer specific visual questions within a curated hallucinatory conversation. Crucially, our experiment shows that the performance of open-source LVLMs drops by at least $31\%$, indicating that LVLMs are prone to accept the generated hallucinations and make false claims that they would not have supported without distractions. We term this phenomenon Multimodal Hallucination Snowballing. To mitigate this, we further propose a training-free method called Residual Visual Decoding, where we revise the output distribution of LVLMs with the one derived from the residual visual input, providing models with direct access to the visual information. Experiments show that our method can mitigate more than $24\%$ of the snowballed multimodal hallucination while maintaining capabilities.

cs.CV↗

arXiv2024

Minimal cubature rules and Koornwinder polynomials

In his classical paper [5], Koornwinder studied a family of orthogonal polynomials of two variables, derived from symmetric polynomials. This family possesses a rare property that orthogonal polynomials of degree $n$ have $n(n+1)/2$ real common zeros, which leads to important examples in the theory of minimal cubature rules. This paper aims to give an account of the minimal cubature rules of two variables and examples originating from Koornwinder polynomials, and we will also provide further examples.

math.CA↗

arXiv2024

Hashing Beam Training for Integrated Ground-Air-Space Wireless Networks

In integrated ground-air-space (IGAS) wireless networks, numerous services require sensing knowledge including location, angle, distance information, etc., which usually can be acquired during the beam training stage. On the other hand, IGAS networks employ large-scale antenna arrays to mitigate obstacle occlusion and path loss. However, large-scale arrays generate pencil-shaped beams, which necessitate a higher number of training beams to cover the desired space. These factors motivate our investigation into the IGAS beam training problem to achieve effective sensing services. To address the high complexity and low identification accuracy of existing beam training techniques, we propose an efficient hashing multi-arm beam (HMB) training scheme. Specifically, we first construct an IGAS single-beam training codebook for the uniform planar arrays. Then, the hash functions are chosen independently to construct the multi-arm beam training codebooks for each AP. All APs traverse the predefined multi-arm beam training codeword simultaneously and the multi-AP superimposed signals at the user are recorded. Finally, the soft decision and voting methods are applied to obtain the correctly aligned beams only based on the signal powers. In addition, we logically prove that the traversal complexity is at the logarithmic level. Simulation results show that our proposed IGAS HMB training method can achieve 96.4% identification accuracy of the exhaustive beam training method and greatly reduce the training overhead.

cs.IT↗