arXiv subjects

Chuan Chen

Publications and source records attributed to Chuan Chen.

At least 37 records · Page 2Linked to original sources

arXiv2025

Universal non-Hermitian transport in disordered systems

In disordered Hermitian systems, localization of energy eigenstates prohibits wave propagation. In non-Hermitian systems, however, wave propagation is possible even when the eigenstates of Hamiltonian are exponentially localized by disorders. We find in this regime that non-Hermitian wave propagation exhibits novel universal scaling behaviors without Hermitian counterpart. Furthermore, our theory demonstrates how the tail of imaginary-part density of states dictates wave propagation in the long-time limit. Specifically, for the three typical classes, namely the Gaussian, the uniform, and the linear imaginary-part density of states, we obtain logarithmically suppressed sub-ballistic transport, and two types of subdiffusion with exponents that depend only on spatial dimensions, respectively. Our work highlights the fundamental differences between Hermitian and non-Hermitian Anderson localization, and uncovers unique universality in non-Hermitian wave propagation.

quant-ph↗

arXiv2025

Anyon polarons as a window into competing phases of the Kitaev honeycomb model under a Zeeman field

We compute the spectra of anyon quasiparticles in all three super-selection sectors of the Kitaev model (i.e., visons, fermions and bosons), perturbed by a Zeeman field away from its exactly solvable limit, to gain insights on the competition of its non-abelian spin-liquid with other nearby phases, such as the mysterious intermediate state observed in the antiferromagnetic model. Both for the ferro- and antiferro-magnetic models we find that the fermions and visons become gapless at nearly identical critical Zeeman couplings. In the ferromagnetic model this is consistent with a direct transition into a polarized state. In the anti-ferromagnetic model this implies that previous theories of the intermediate phase viewed as a spin liquid with a different fermion Chern number are inadequate, as they presume that the vison gap does not close. In the antiferromagnetic model we also find that a bosonic quasiparticle becomes gapless at nearly the same critical field as the fermions and visons. This boson carries the quantum numbers of an anti-ferromagnetic order parameter, suggesting that the intermediate phase has spontaneously broken symmetry with this order.

cond-mat.str-el↗

arXiv2025

Reframing Spatial Dependence as Geographic Feature Attribution

Spatial dependence, referring to the correlation between variable values observed at different geographic locations, is one of the most fundamental characteristics of spatial data. The presence of spatial dependence violates the classical statistical assumption of independent and identically distributed observations and implies a high degree of information redundancy within spatial datasets. However, this redundancy can also be interpreted as structured information, which has been widely leveraged in spatial modeling, prediction, and explanation tasks. With the rise of geospatial big data and the rapid advancement of deep learning and large models, effectively modeling and characterizing spatial dependence has become essential for enhancing the performance of spatial analysis and uncovering latent spatial processes. From a data-driven perspective, this study proposes a novel interpretation: spatial dependence can be understood as the contribution of geographic location -- specifically, latitude and longitude -- to the observed variation in target variables. To validate this hypothesis, we conduct simulation experiments in which data are generated based on known spatial processes. We train machine learning models to predict variable values using only coordinate information. Subsequently, XAI techniques are employed to quantify the contribution of spatial features. The resulting importance scores are then compared with local indicators of spatial association (LISA). Across a range of spatial process settings, we observe consistently high correlations (greater than 0.94) between coordinate-based contributions and LISA values. These findings offer a new data-driven perspective on spatial dependence, bridging traditional spatial statistical approaches with modern machine learning techniques.

physics.soc-ph↗

arXiv2025

Clients Collaborate: Flexible Differentially Private Federated Learning with Guaranteed Improvement of Utility-Privacy Trade-off

To defend against privacy leakage of user data, differential privacy is widely used in federated learning, but it is not free. The addition of noise randomly disrupts the semantic integrity of the model and this disturbance accumulates with increased communication rounds. In this paper, we introduce a novel federated learning framework with rigorous privacy guarantees, named FedCEO, designed to strike a trade-off between model utility and user privacy by letting clients ''Collaborate with Each Other''. Specifically, we perform efficient tensor low-rank proximal optimization on stacked local model parameters at the server, demonstrating its capability to flexibly truncate high-frequency components in spectral space. This capability implies that our FedCEO can effectively recover the disrupted semantic information by smoothing the global semantic space for different privacy settings and continuous training processes. Moreover, we improve the SOTA utility-privacy trade-off bound by order of $\sqrt{d}$, where $d$ is the input dimension. We illustrate our theoretical results with experiments on representative datasets and observe significant performance improvements and strict privacy guarantees under different privacy settings. The code is available at https://github.com/6lyc/FedCEO_Collaborate-with-Each-Other.

cs.LG↗

arXiv2025

Electric transport in doped Mott insulators dictated by a non-Ioffe-Larkin composition rule and spinons

The electric resistivity is examined in the constrained Hilbert space of a doped Mott insulator, which is dictated by a non-Ioffe-Larkin composition rule due to the underlying mutual Chern-Simons topological gauge structure. In the low-temperature pseudogap phase, where holons remain condensed while spinons proliferate, the charge transport is governed by a chiral spinon excitation, comprising a bosonic spin-$1/2$ at the core of a supercurrent vortex. It leads to a vanishing resistivity with the ``confinement'' of the spinons in the superconducting phase but a low-$T$ divergence of the resistivity once the spinon confinement is disrupted by external magnetic fields. In the latter, the chiral spinons will generate a Hall number $n_H =$ doping concentration $ δ$ and a Nernst effect to signal an underlying long-range entanglement between the charge and spin degrees of freedom. Their presence is further reflected in thermodynamic quantities such as specific heat and spin susceptibility. Finally, in the high-temperature spin-disordered phase, it is shown that the holons exhibit a linear-$T$ resistivity by scattering with the spinons acting as free local moments, which generate randomized gauge fluxes as perceived by the charge degree of freedom.

cond-mat.str-el↗

arXiv2025

Advances in Robust Federated Learning: A Survey with Heterogeneity Considerations

In the field of heterogeneous federated learning (FL), the key challenge is to efficiently and collaboratively train models across multiple clients with different data distributions, model structures, task objectives, computational capabilities, and communication resources. This diversity leads to significant heterogeneity, which increases the complexity of model training. In this paper, we first outline the basic concepts of heterogeneous federated learning and summarize the research challenges in federated learning in terms of five aspects: data, model, task, device, and communication. In addition, we explore how existing state-of-the-art approaches cope with the heterogeneity of federated learning, and categorize and review these approaches at three different levels: data-level, model-level, and architecture-level. Subsequently, the paper extensively discusses privacy-preserving strategies in heterogeneous federated learning environments. Finally, the paper discusses current open issues and directions for future research, aiming to promote the further development of heterogeneous federated learning.

cs.LG↗

arXiv2025

THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings

Graph node clustering is a fundamental unsupervised task. Existing methods typically train an encoder through selfsupervised learning and then apply K-means to the encoder output. Some methods use this clustering result directly as the final assignment, while others initialize centroids based on this initial clustering and then finetune both the encoder and these learnable centroids. However, due to their reliance on K-means, these methods inherit its drawbacks when the cluster separability of encoder output is low, facing challenges from the Uniform Effect and Cluster Assimilation. We summarize three reasons for the low cluster separability in existing methods: (1) lack of contextual information prevents discrimination between similar nodes from different clusters; (2) training tasks are not sufficiently aligned with the downstream clustering task; (3) the cluster information in the graph structure is not appropriately exploited. To address these issues, we propose conTrastive grapH clustEring by SwApping fUsed gRomov-wasserstein coUplingS (THESAURUS). Our method introduces semantic prototypes to provide contextual information, and employs a cross-view assignment prediction pretext task that aligns well with the downstream clustering task. Additionally, it utilizes Gromov-Wasserstein Optimal Transport (GW-OT) along with the proposed prototype graph to thoroughly exploit cluster information in the graph structure. To adapt to diverse real-world data, THESAURUS updates the prototype graph and the prototype marginal distribution in OT by using momentum. Extensive experiments demonstrate that THESAURUS achieves higher cluster separability than the prior art, effectively mitigating the Uniform Effect and Cluster Assimilation issues

cs.LG↗

arXiv2024

Toward Ethical Spatial Analysis: Addressing Endogenous Bias Through Visual Analytics

Spatial analysis can generate both exogenous and endogenous biases, which will lead to ethics issues. Exogenous biases arise from external factors or environments and are unrelated to internal operating mechanisms, while endogenous biases stem from internal processes or technologies. Although much attention has been given to exogenous biases, endogenous biases in spatial analysis have been largely overlooked, and a comprehensive methodology for addressing them is yet to be developed. To tackle this challenge, we propose that visual analytics can play a key role in understanding geographic data and improving the interpretation of analytical results. In this study, we conducted a preliminary investigation using various visualization techniques to explore endogenous biases. Our findings demonstrate the potentials of visual analytics to uncover hidden biases and identify associated issues. Additionally, we synthesized these visualization strategies into a framework that approximates a method for detecting endogenous biases. Through this work, we advocate for the integration of visualization at three critical stages of spatial analysis in order to minimize errors, address ethical concerns, and reduce misinterpretations associated with endogenous biases.

cs.HC↗

arXiv2024

PRECISE: Pre-training Sequential Recommenders with Collaborative and Semantic Information

Real-world recommendation systems commonly offer diverse content scenarios for users to interact with. Considering the enormous number of users in industrial platforms, it is infeasible to utilize a single unified recommendation model to meet the requirements of all scenarios. Usually, separate recommendation pipelines are established for each distinct scenario. This practice leads to challenges in comprehensively grasping users' interests. Recent research endeavors have been made to tackle this problem by pre-training models to encapsulate the overall interests of users. Traditional pre-trained recommendation models mainly capture user interests by leveraging collaborative signals. Nevertheless, a prevalent drawback of these systems is their incapacity to handle long-tail items and cold-start scenarios. With the recent advent of large language models, there has been a significant increase in research efforts focused on exploiting LLMs to extract semantic information for users and items. However, text-based recommendations highly rely on elaborate feature engineering and frequently fail to capture collaborative similarities. To overcome these limitations, we propose a novel pre-training framework for sequential recommendation, termed PRECISE. This framework combines collaborative signals with semantic information. Moreover, PRECISE employs a learning framework that initially models users' comprehensive interests across all recommendation scenarios and subsequently concentrates on the specific interests of target-scene behaviors. We demonstrate that PRECISE precisely captures the entire range of user interests and effectively transfers them to the target interests. Empirical findings reveal that the PRECISE framework attains outstanding performance on both public and industrial datasets.

cs.IR↗

arXiv2024

Incremental Context-free Grammar Inference in Black Box Settings

Black-box context-free grammar inference presents a significant challenge in many practical settings due to limited access to example programs. The state-of-the-art methods, Arvada and Treevada, employ heuristic approaches to generalize grammar rules, initiating from flat parse trees and exploring diverse generalization sequences. We have observed that these approaches suffer from low quality and readability, primarily because they process entire example strings, adding to the complexity and substantially slowing down computations. To overcome these limitations, we propose a novel method that segments example strings into smaller units and incrementally infers the grammar. Our approach, named Kedavra, has demonstrated superior grammar quality (enhanced precision and recall), faster runtime, and improved readability through empirical comparison.

cs.PL↗

arXiv2024

Mapping AI Ethics Narratives: Evidence from Twitter Discourse Between 2015 and 2022

Public participation is indispensable for an insightful understanding of the ethics issues raised by AI technologies. Twitter is selected in this paper to serve as an online public sphere for exploring discourse on AI ethics, facilitating broad and equitable public engagement in the development of AI technology. A research framework is proposed to demonstrate how to transform AI ethics-related discourse on Twitter into coherent and readable narratives. It consists of two parts: 1) combining neural networks with large language models to construct a topic hierarchy that contains popular topics of public concern without ignoring small but important voices, thus allowing a fine-grained exploration of meaningful information. 2) transforming fragmented and difficult-to-understand social media information into coherent and easy-to-read stories through narrative visualization, providing a new perspective for understanding the information in Twitter data. This paper aims to advocate for policy makers to enhance public oversight of AI technologies so as to promote their fair and sustainable development.

cs.CY↗

arXiv2024

Fast adiabatic preparation of multi-squeezed states by jumping along the path

Multi-squeezed states, also known as generalized squeezed states, are valuable quantum non-Gaussian resources, because they can feature non-classical properties such as large phase-space Wigner negativities. In this work, we introduce a novel shortcuts to adiabaticity (STA) method for the fast preparation of multi-squeezed states. In contrast to previous STA methods, which rely on the use of counterdiabatic control to suppress unwanted non-adiabatic effects, our method simplifies the process and accelerates state preparation by selecting an appropriate sampling along a quantum evolution path. We demonstrate the high-fidelity and fast preparation of multi-squeezed states, as well as hybrid entangled states between a bosonic mode and a qubit.

quant-ph↗

arXiv2024

Migrate Demographic Group For Fair GNNs

Graph Neural networks (GNNs) have been applied in many scenarios due to the superior performance of graph learning. However, fairness is always ignored when designing GNNs. As a consequence, biased information in training data can easily affect vanilla GNNs, causing biased results toward particular demographic groups (divided by sensitive attributes, such as race and age). There have been efforts to address the fairness issue. However, existing fair techniques generally divide the demographic groups by raw sensitive attributes and assume that are fixed. The biased information correlated with raw sensitive attributes will run through the training process regardless of the implemented fair techniques. It is urgent to resolve this problem for training fair GNNs. To tackle this problem, we propose a brand new framework, FairMigration, which can dynamically migrate the demographic groups instead of keeping that fixed with raw sensitive attributes. FairMigration is composed of two training stages. In the first stage, the GNNs are initially optimized by personalized self-supervised learning, and the demographic groups are adjusted dynamically. In the second stage, the new demographic groups are frozen and supervised learning is carried out under the constraints of new demographic groups and adversarial training. Extensive experiments reveal that FairMigration balances model performance and fairness well.

cs.LG↗

arXiv2024

FedBRB: An Effective Solution to the Small-to-Large Scenario in Device-Heterogeneity Federated Learning

Recently, the success of large models has demonstrated the importance of scaling up model size. This has spurred interest in exploring collaborative training of large-scale models from federated learning perspective. Due to computational constraints, many institutions struggle to train a large-scale model locally. Thus, training a larger global model using only smaller local models has become an important scenario (i.e., the \textbf{small-to-large scenario}). Although recent device-heterogeneity federated learning approaches have started to explore this area, they face limitations in fully covering the parameter space of the global model. In this paper, we propose a method called \textbf{FedBRB} (\underline{B}lock-wise \underline{R}olling and weighted \underline{B}roadcast) based on the block concept. FedBRB can uses small local models to train all blocks of the large global model, and broadcasts the trained parameters to the entire space for faster information interaction. Experiments demonstrate FedBRB yields substantial performance gains, achieving state-of-the-art results in this scenario. Moreover, FedBRB using only minimal local models can even surpass baselines using larger local models.

cs.LG↗

arXiv2024

Privacy Computing Meets Metaverse: Necessity, Taxonomy and Challenges

Metaverse, the core of the next-generation Internet, is a computer-generated holographic digital environment that simultaneously combines spatio-temporal, immersive, real-time, sustainable, interoperable, and data-sensitive characteristics. It cleverly blends the virtual and real worlds, allowing users to create, communicate, and transact in virtual form. With the rapid development of emerging technologies including augmented reality, virtual reality and blockchain, the metaverse system is becoming more and more sophisticated and widely used in various fields such as social, tourism, industry and economy. However, the high level of interaction with the real world also means a huge risk of privacy leakage both for individuals and enterprises, which has hindered the wide deployment of metaverse. Then, it is inevitable to apply privacy computing techniques in the framework of metaverse, which is a current research hotspot. In this paper, we conduct comprehensive research on the necessity, taxonomy and challenges when privacy computing meets metaverse. Specifically, we first introduce the underlying technologies and various applications of metaverse, on which we analyze the challenges of data usage in metaverse, especially data privacy. Next, we review and summarize state-of-the-art solutions based on federated learning, differential privacy, homomorphic encryption, and zero-knowledge proofs for different privacy problems in metaverse. Finally, we show the current security and privacy challenges in the development of metaverse and provide open directions for building a well-established privacy-preserving metaverse system. For easy access and reference, we integrate the related publications and their codes into a GitHub repository: https://github.com/6lyc/Awesome-Privacy-Computing-in-Metaverse.git.

cs.CR↗

arXiv2024

Unbiased Estimation for Total Treatment Effect Under Interference Using Aggregated Dyadic Data

In social media platforms, user behavior is often influenced by interactions with other users, complicating the accurate estimation of causal effects in traditional A/B experiments. This study investigates situations where an individual's outcome can be broken down into the sum of multiple pairwise outcomes, a reflection of user interactions. These outcomes, referred to as dyadic data, are prevalent in many social network contexts. Utilizing a Bernoulli randomized design, we introduce a novel unbiased estimator for the total treatment effect (TTE), which quantifies the difference in population mean when all individuals are assigned to treatment versus control groups. We further explore the bias of our estimator in scenarios where it is impractical to include all individuals in the experiment, a common constraint in online control experiments. Our numerical results reveal that our proposed estimator consistently outperforms some commonly used estimators, underscoring its potential for more precise causal effect estimation in social media environments.

cs.SI↗

arXiv2024

Ego Group Partition: A Novel Framework for Improving Ego Experiments in Social Networks

Estimating the average treatment effect in social networks is challenging due to individuals influencing each other. One approach to address interference is ego cluster experiments, where each cluster consists of a central individual (ego) and its peers (alters). Clusters are randomized, and only the effects on egos are measured. In this work, we propose an improved framework for ego cluster experiments called ego group partition (EGP), which directly generates two groups and an ego sub-population instead of ego clusters. Under specific model assumptions, we propose two ego group partition algorithms. Compared to the original ego clustering algorithm, our algorithms produce more egos, yield smaller biases, and support parallel computation. The performance of our algorithms is validated through simulation and real-world case studies.

cs.SI↗

arXiv2024

Contrastive Deep Nonnegative Matrix Factorization for Community Detection

Recently, nonnegative matrix factorization (NMF) has been widely adopted for community detection, because of its better interpretability. However, the existing NMF-based methods have the following three problems: 1) they directly transform the original network into community membership space, so it is difficult for them to capture the hierarchical information; 2) they often only pay attention to the topology of the network and ignore its node attributes; 3) it is hard for them to learn the global structure information necessary for community detection. Therefore, we propose a new community detection algorithm, named Contrastive Deep Nonnegative Matrix Factorization (CDNMF). Firstly, we deepen NMF to strengthen its capacity for information extraction. Subsequently, inspired by contrastive learning, our algorithm creatively constructs network topology and node attributes as two contrasting views. Furthermore, we utilize a debiased negative sampling layer and learn node similarity at the community level, thereby enhancing the suitability of our model for community detection. We conduct experiments on three public real graph datasets and the proposed model has achieved better results than state-of-the-art methods. Code available at https://github.com/6lyc/CDNMF.git.

cs.LG↗