Searcharxiv⌕ Search

arXiv subjects

Yuan Sun

Publications and source records attributed to Yuan Sun.

At least 55 records · Page 3Linked to original sources

Systematic approach to correlators in $T\bar{T}$ deformed CFTs

We investigate higher-order corrections to correlators in a general CFT (conformal field theory) with the double-trace $T\bar{T}$ deformation. Standard perturbation theory proves inadequate for this problem due to the intricate stress-tensor flow induced by the deformation. To tackle this challenge, we introduce a novel technique termed the conservation equation method. This method leverages the stress tensor's trace relation and conservation property to establish relationships between higher and lower-order corrections, and subsequently determine the correlators by enforcing symmetry properties. As an illustration, we compute first- and higher-order corrections to various types of correlators. Our results align with existing calculations in the literature and demonstrate the viability of our method for general CFTs.

hep-th↗

Surface growth scheme for bulk reconstruction and $T\bar T$ deformation

In this paper, we study the dynamical connection between the surface growth scheme and the conformal field theory with $T\bar{T}$ deformation. By utilizing the extended one-shot entanglement distillation tensor network, we find that the iterative growth, i.e. radial evolution of homogenous and isotropic bulk minimal surfaces in asymptotically anti-de Sitter (AdS) spacetime can be mapped to the $T\bar{T}$ operator flow driven by the deformation parameter. Our results show that the $T\bar{T}$ deformation can provide a dynamical mechanism for the surface growth in asymptotically AdS spacetime, which may shed light on reconstructing bulk gravitational dynamics from the surface growth scheme.

hep-th↗

Efficient Adaptation of Pre-trained Vision Transformer underpinned by Approximately Orthogonal Fine-Tuning Strategy

A prevalent approach in Parameter-Efficient Fine-Tuning (PEFT) of pre-trained Vision Transformers (ViT) involves freezing the majority of the backbone parameters and solely learning low-rank adaptation weight matrices to accommodate downstream tasks. These low-rank matrices are commonly derived through the multiplication structure of down-projection and up-projection matrices, exemplified by methods such as LoRA and Adapter. In this work, we observe an approximate orthogonality among any two row or column vectors within any weight matrix of the backbone parameters; however, this property is absent in the vectors of the down/up-projection matrices. Approximate orthogonality implies a reduction in the upper bound of the model's generalization error, signifying that the model possesses enhanced generalization capability. If the fine-tuned down/up-projection matrices were to exhibit this same property as the pre-trained backbone matrices, could the generalization capability of fine-tuned ViTs be further augmented? To address this question, we propose an Approximately Orthogonal Fine-Tuning (AOFT) strategy for representing the low-rank weight matrices. This strategy employs a single learnable vector to generate a set of approximately orthogonal vectors, which form the down/up-projection matrices, thereby aligning the properties of these matrices with those of the backbone. Extensive experimental results demonstrate that our method achieves competitive performance across a range of downstream image classification tasks, confirming the efficacy of the enhanced generalization capability embedded in the down/up-projection matrices.

cs.CV↗

3-path-connectivity of bubble-sort star graphs

Let $G$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. Let $T$ be a subset of $ V(G)$ with cardinality $|T|\geq2$. A path connecting all vertices of $T$ is called a $T$-path of $G$. Two $T$-paths $P_i$ and $P_j$ are said to be internally disjoint if $V(P_i)\cap V(P_j)=T$ and $E(P_i)\cap E(P_j)=\emptyset$. Denote by $π_G(T)$ the maximum number of internally disjoint $T$- paths in G. Then for an integer $\ell$ with $\ell\geq2$, the $\ell$-path-connectivity $π_\ell(G)$ of $G$ is formulated as $\min\{π_G(T)\,|\,T\subseteq V(G)$ and $|T|=\ell\}$. In this paper, we study the $3$-path-connectivity of $n$-dimensional bubble-sort star graph $BS_n$. By deeply analyzing the structure of $BS_n$, we show that $π_3(BS_n)=\lfloor\frac{3n}2\rfloor-3$, for any $n\geq3$.

math.CO↗

FedAPM: Federated Learning via ADMM with Partial Model Personalization

In federated learning (FL), the assumption that datasets from different devices are independent and identically distributed (i.i.d.) often does not hold due to user differences, and the presence of various data modalities across clients makes using a single model impractical. Personalizing certain parts of the model can effectively address these issues by allowing those parts to differ across clients, while the remaining parts serve as a shared model. However, we found that partial model personalization may exacerbate client drift (each client's local model diverges from the shared model), thereby reducing the effectiveness and efficiency of FL algorithms. We propose an FL framework based on the alternating direction method of multipliers (ADMM), referred to as FedAPM, to mitigate client drift. We construct the augmented Lagrangian function by incorporating first-order and second-order proximal terms into the objective, with the second-order term providing fixed correction and the first-order term offering compensatory correction between the local and shared models. Our analysis demonstrates that FedAPM, by using explicit estimates of the Lagrange multiplier, is more stable and efficient in terms of convergence compared to other FL frameworks. We establish the global convergence of FedAPM training from arbitrary initial points to a stationary point, achieving three types of rates: constant, linear, and sublinear, under mild assumptions. We conduct experiments using four heterogeneous and multimodal datasets with different metrics to validate the performance of FedAPM. Specifically, FedAPM achieves faster and more accurate convergence, outperforming the SOTA methods with average improvements of 12.3% in test accuracy, 16.4% in F1 score, and 18.0% in AUC while requiring fewer communication rounds.

cs.LG↗

Heterodyne detection of low-frequency fields via Rydberg EIT with phase demodulation

Recently, the rapid progress of quantum sensing research reveals that the Rydberg atoms have great potentials in becoming high-precision centimeter-scale antenna of low-frequency fields. In order to facilitate efficient and reliable detection of low-frequency fields via Rydberg atoms, we design, implement and analyze a special but low-cost and scalable method based on heterodyning processes under the condition of electromagnetically induced transparency (EIT) embedded in typical two-photon ground-Rydberg transition. Instead of relying on observing changes in absorption of light by Rydberg atoms, our method focuses on the phase modulation effect on the probe laser induced by the low-frequency fields via the Rydberg EIT mechanism and utilizes a demodulation process to accurately retrieve the signal. The general principles of our method apply to both electric and magnetic fields and it is even possible to realize the combination of both functionalities in the same apparatus. In particular, we experimentally demonstrate the full cycle of operations with respect to both cases. In the measurement of low-frequency electric fields, we discover that the Rydberg dipole-dipole interaction among atoms induce linear superposition of Rydberg states with different angular momentum that generates a first-order response corresponding to the signature of linear Stark effect. As the Rydberg atoms have excellent coupling strengths with electric fields, our results indicate that our method can hopefully reach high-precision performance for practical tasks in the future.

physics.atom-ph↗

Reliable Disentanglement Multi-view Learning Against View Adversarial Attacks

Trustworthy multi-view learning has attracted extensive attention because evidence learning can provide reliable uncertainty estimation to enhance the credibility of multi-view predictions. Existing trusted multi-view learning methods implicitly assume that multi-view data is secure. However, in safety-sensitive applications such as autonomous driving and security monitoring, multi-view data often faces threats from adversarial perturbations, thereby deceiving or disrupting multi-view models. This inevitably leads to the adversarial unreliability problem (AUP) in trusted multi-view learning. To overcome this tricky problem, we propose a novel multi-view learning framework, namely Reliable Disentanglement Multi-view Learning (RDML). Specifically, we first propose evidential disentanglement learning to decompose each view into clean and adversarial parts under the guidance of corresponding evidences, which is extracted by a pretrained evidence extractor. Then, we employ the feature recalibration module to mitigate the negative impact of adversarial perturbations and extract potential informative features from them. Finally, to further ignore the irreparable adversarial interferences, a view-level evidential attention mechanism is designed. Extensive experiments on multi-view classification tasks with adversarial attacks show that RDML outperforms the state-of-the-art methods by a relatively large margin. Our code is available at https://github.com/Willy1005/2025-IJCAI-RDML.

cs.LG↗

$T\overline{T}$ Deformation: Introduction and Some Recent Advances

This review explores recent advances in the theory of $T\bar{T}$ deformation, an irrelevant yet solvable deformation of quantum field theories defined via the quadratic form of the energy-momentum tensor. It addresses classical and quantum aspects, highlighting significant developments across various fields, including field theory, holography, and string theory. Classically, $T\bar{T}$ deformation manifests through multiple geometric interpretations, notably random geometry, Jackiw-Teitelboim-like gravity, and uniform light-cone gauge frameworks. For quantum aspects, the deformation introduces notable features such as non-locality, UV-IR mixing, solvable renormalization structures, and intriguing modifications to correlation functions and entanglement properties. Furthermore, the paper examines the profound relationship between $T\bar{T}$ deformation and holography, particularly within the mixed boundary conditions/cutoff AdS holography proposal and holographic entanglement entropy. Connections to string theory through single-trace deformations and their holographic duals further reveal the deformed structure of the worldsheet. This review synthesizes recent developments and outlines potential directions for future research in the study of $T\bar{T}$-like deformation.

hep-th↗

Robust Duality Learning for Unsupervised Visible-Infrared Person Re-Identification

Unsupervised visible-infrared person re-identification (UVI-ReID) aims to retrieve pedestrian images across different modalities without costly annotations, but faces challenges due to the modality gap and lack of supervision. Existing methods often adopt self-training with clustering-generated pseudo-labels but implicitly assume these labels are always correct. In practice, however, this assumption fails due to inevitable pseudo-label noise, which hinders model learning. To address this, we introduce a new learning paradigm that explicitly considers Pseudo-Label Noise (PLN), characterized by three key challenges: noise overfitting, error accumulation, and noisy cluster correspondence. To this end, we propose a novel Robust Duality Learning framework (RoDE) for UVI-ReID to mitigate the effects of noisy pseudo-labels. First, to combat noise overfitting, a Robust Adaptive Learning mechanism (RAL) is proposed to dynamically emphasize clean samples while down-weighting noisy ones. Second, to alleviate error accumulation-where the model reinforces its own mistakes-RoDE employs dual distinct models that are alternately trained using pseudo-labels from each other, encouraging diversity and preventing collapse. However, this dual-model strategy introduces misalignment between clusters across models and modalities, creating noisy cluster correspondence. To resolve this, we introduce Cluster Consistency Matching (CCM), which aligns clusters across models and modalities by measuring cross-cluster similarity. Extensive experiments on three benchmarks demonstrate the effectiveness of RoDE.

cs.CV↗

Search for New Particles with Flying Quantum Sensors in Space

Recent advancements in space science and technologies offer exciting prospects for investigating novel research that is unattainable within terrestrial laboratories. Here we propose the implementation of space-based quantum sensing to explore ultralight new particles beyond the standard model. The central idea involves probing long-range interactions between spin ensembles of space quantum sensors and the particles residing within Earth, mediated by ultralight particles. We show that such interactions can be substantially enhanced in space platforms and thus increase the search sensitivity. In contrast to their terrestrial counterparts, space-based quantum searches exhibit remarkable velocity enhancements, approaching the first cosmic speed, and thus enables the exploration of unexplored parameter space concerning ultralight new particles. Furthermore, the substantial abundance of electrons and nucleons within Earth plays a crucial role in extending the scope of our mission. Our projected search sensitivity can surpass the sensitivities of both terrestrial experiments and proposals by up to approximately 7 orders of magnitude. We also briefly discuss other space mission, including ``space-ground integrated" network of quantum sensors for dark matter searches.

quant-ph↗

Language Models for Business Optimisation with a Real World Case Study in Production Scheduling

Business optimisation has been used extensively to determine optimal solutions for challenging business operations. Problem formulation is an important part of business optimisation as it influences both the validity of solutions and the efficiency of the optimisation process. While different optimisation modelling languages have been developed, problem formulation is still not a trivial task and usually requires optimisation expertise and problem-domain knowledge. Recently, Large Language Models (LLMs) have demonstrated outstanding performance across different language-related tasks. Since problem formulation can be viewed as a translation task, there is a potential to leverage LLMs to automate problem formulation. However, developing an LLM for problem formulation is challenging, due to limited training data, and the complexity of real-world optimisation problems. Several prompt engineering methods have been proposed in the literature to automate problem formulation with LLMs. While the initial results are encouraging, the accuracy of formulations generated by these methods can still be significantly improved. In this paper, we present an LLM-based framework for automating problem formulation in business optimization. Our approach introduces a method for fine-tuning cost-efficient LLMs specifically tailored to specialized business optimization challenges. The experiment results demonstrate that our framework can generate accurate formulations for conventional and real-world business optimisation problems in production scheduling. Extensive analyses show the effectiveness and the convergence of the proposed fine-tuning method. The proposed method also shows very competitive performance when compared with the state-of-the-art prompt engineering methods in the literature when tested on general linear programming problems.

cs.AI↗

Boosting the Class-Incremental Learning in 3D Point Clouds via Zero-Collection-Cost Basic Shape Pre-Training

Existing class-incremental learning methods in 3D point clouds rely on exemplars (samples of former classes) to resist the catastrophic forgetting of models, and exemplar-free settings will greatly degrade the performance. For exemplar-free incremental learning, the pre-trained model methods have achieved state-of-the-art results in 2D domains. However, these methods cannot be migrated to the 3D domains due to the limited pre-training datasets and insufficient focus on fine-grained geometric details. This paper breaks through these limitations, proposing a basic shape dataset with zero collection cost for model pre-training. It helps a model obtain extensive knowledge of 3D geometries. Based on this, we propose a framework embedded with 3D geometry knowledge for incremental learning in point clouds, compatible with exemplar-free (-based) settings. In the incremental stage, the geometry knowledge is extended to represent objects in point clouds. The class prototype is calculated by regularizing the data representation with the same category and is kept adjusting in the learning process. It helps the model remember the shape features of different categories. Experiments show that our method outperforms other baseline methods by a large margin on various benchmark datasets, considering both exemplar-free (-based) settings.

cs.CV↗

Binary-Integer-Programming Based Algorithm for Expert Load Balancing in Mixture-of-Experts Models

For pre-training of MoE (Mixture-of-Experts) models, one of the main issues is unbalanced expert loads, which may cause routing collapse or increased computational overhead. Existing methods contain the Loss-Controlled method and the Loss-Free method, where both the unbalanced degrees at first several training steps are still high and decrease slowly. In this work, we propose BIP-Based Balancing, an expert load balancing algorithm based on binary integer programming (BIP). The algorithm maintains an additional vector q on each MoE layer that can help change the top-K order of s by solving a binary integer programming with very small time costs. We implement the algorithm on two MoE language models: 16-expert (0.3B) and 64-expert (1.1B). The experimental results show that on both models comparing with the Loss-Controlled method and the Loss-Free method, our algorithm trains models with the lowest perplexities, while saves at least 13% of pre-training time compared with the Loss-Controlled method. Within our current knowledge, this is the first routing algorithm that achieves maintaining load balance status on every expert in every MoE layer from the first step to the last step during the whole pre-training process, while the trained MoE models also perform well. The code material of this work is available at https://github.com/sunyuanLLM/bip_routing_algorithm.

cs.LG↗

Tailoring Generative AI Chatbots for Multiethnic Communities in Disaster Preparedness Communication: Extending the CASA Paradigm

This study is among the first to develop different prototypes of generative artificial intelligence (GenAI) chatbots powered by GPT-4 to communicate hurricane preparedness information to diverse residents. Drawing from the Computers Are Social Actors paradigm and the literature on disaster vulnerability and cultural tailoring, we conducted a between-subjects experiment with 441 Black, Hispanic, and Caucasian residents of Florida. Our results suggest that GenAI chatbots varying in tone formality and cultural tailoring significantly influence perceptions of their friendliness and credibility, which, in turn, relate to hurricane preparedness outcomes. These results highlight the potential of using GenAI chatbots to improve diverse communities' disaster preparedness.

cs.CL↗

Analysis of heralded higher-fidelity two-qubit entangling gates with self-correction

For the quantum error correction (QEC) and noisy intermediate-scale quantum (NISQ) algorithms to function with high efficiency, the raw fidelity of quantum logic gates on physical qubits needs to satisfy strict requirement. The neutral atom quantum computing equipped with Rydberg blockade gates has made impressive progress recently, which makes it worthwhile to explore its potential in the two-qubit entangling gates, including Controlled-PHASE gate and in particular the CZ gate. Provided the quantum coherence is well preserved, improving the fidelity of Rydberg blockade gates calls for special mechanisms to deal with adverse effects caused by realistic experimental conditions. Here the heralded very-high-fidelity Rydberg blockade Controlled-PHASE gate is designed to address these issues, which contains self-correction and projection as the key steps. This trailblazing method can be built on the basis of the previously established buffer-atom-mediated gate, and a special form of symmetry under PT transformation plays a crucial role in the process. We further analyze the performance with respect to a few typical sources of imperfections. This procedure can also be regarded as quantum hardware error correction or mitigation. While this paper by itself does not cover every single subtle issue and still contains many over-simplifications, we find it reasonable to anticipate very-high-fidelity two-qubit quantum logic gate operated in the sense of heralded but probabilistic, whose gate error can reduce to the level of $10^{-4}$--$10^{-6}$ or even lower with reasonably high possibilities.

quant-ph↗

The Streetscape Application Services Stack (SASS): Towards a Distributed Sensing Architecture for Urban Applications

As urban populations grow, cities are becoming more complex, driving the deployment of interconnected sensing systems to realize the vision of smart cities. These systems aim to improve safety, mobility, and quality of life through applications that integrate diverse sensors with real-time decision-making. Streetscape applications-focusing on challenges like pedestrian safety and adaptive traffic management-depend on managing distributed, heterogeneous sensor data, aligning information across time and space, and enabling real-time processing. These tasks are inherently complex and often difficult to scale. The Streetscape Application Services Stack (SASS) addresses these challenges with three core services: multimodal data synchronization, spatiotemporal data fusion, and distributed edge computing. By structuring these capabilities as clear, composable abstractions with clear semantics, SASS allows developers to scale streetscape applications efficiently while minimizing the complexity of multimodal integration. We evaluated SASS in two real-world testbed environments: a controlled parking lot and an urban intersection in a major U.S. city. These testbeds allowed us to test SASS under diverse conditions, demonstrating its practical applicability. The Multimodal Data Synchronization service reduced temporal misalignment errors by 88%, achieving synchronization accuracy within 50 milliseconds. Spatiotemporal Data Fusion service improved detection accuracy for pedestrians and vehicles by over 10%, leveraging multicamera integration. The Distributed Edge Computing service increased system throughput by more than an order of magnitude. Together, these results show how SASS provides the abstractions and performance needed to support real-time, scalable urban applications, bridging the gap between sensing infrastructure and actionable streetscape intelligence.

cs.NI↗

Robust Self-Paced Hashing for Cross-Modal Retrieval with Noisy Labels

Cross-modal hashing (CMH) has appeared as a popular technique for cross-modal retrieval due to its low storage cost and high computational efficiency in large-scale data. Most existing methods implicitly assume that multi-modal data is correctly labeled, which is expensive and even unattainable due to the inevitable imperfect annotations (i.e., noisy labels) in real-world scenarios. Inspired by human cognitive learning, a few methods introduce self-paced learning (SPL) to gradually train the model from easy to hard samples, which is often used to mitigate the effects of feature noise or outliers. It is a less-touched problem that how to utilize SPL to alleviate the misleading of noisy labels on the hash model. To tackle this problem, we propose a new cognitive cross-modal retrieval method called Robust Self-paced Hashing with Noisy Labels (RSHNL), which can mimic the human cognitive process to identify the noise while embracing robustness against noisy labels. Specifically, we first propose a contrastive hashing learning (CHL) scheme to improve multi-modal consistency, thereby reducing the inherent semantic gap. Afterward, we propose center aggregation learning (CAL) to mitigate the intra-class variations. Finally, we propose Noise-tolerance Self-paced Hashing (NSH) that dynamically estimates the learning difficulty for each instance and distinguishes noisy labels through the difficulty level. For all estimated clean pairs, we further adopt a self-paced regularizer to gradually learn hash codes from easy to hard. Extensive experiments demonstrate that the proposed RSHNL performs remarkably well over the state-of-the-art CMH methods.

cs.CV↗

TPCH: Tensor-interacted Projection and Cooperative Hashing for Multi-view Clustering

In recent years, anchor and hash-based multi-view clustering methods have gained attention for their efficiency and simplicity in handling large-scale data. However, existing methods often overlook the interactions among multi-view data and higher-order cooperative relationships during projection, negatively impacting the quality of hash representation in low-dimensional spaces, clustering performance, and sensitivity to noise. To address this issue, we propose a novel approach named Tensor-Interacted Projection and Cooperative Hashing for Multi-View Clustering(TPCH). TPCH stacks multiple projection matrices into a tensor, taking into account the synergies and communications during the projection process. By capturing higher-order multi-view information through dual projection and Hamming space, TPCH employs an enhanced tensor nuclear norm to learn more compact and distinguishable hash representations, promoting communication within and between views. Experimental results demonstrate that this refined method significantly outperforms state-of-the-art methods in clustering on five large-scale multi-view datasets. Moreover, in terms of CPU time, TPCH achieves substantial acceleration compared to the most advanced current methods. The code is available at \textcolor{red}{\url{https://github.com/jankin-wang/TPCH}}.

cs.LG↗