arXiv subjects

Yuan Fang

Publications and source records attributed to Yuan Fang.

At least 91 records · Page 5Linked to original sources

arXiv2025

Performance Analysis and Low-Complexity Beamforming Design for Near-Field Physical Layer Security

Extremely large-scale arrays (XL-arrays) have emerged as a key enabler in achieving the unprecedented performance requirements of future wireless networks, leading to a significant increase in the range of the near-field region. This transition necessitates the spherical wavefront model for characterizing the wireless propagation rather than the far-field planar counterpart, thereby introducing extra degrees of freedom (DoFs) to wireless system design. In this paper, we explore the beam focusing-based physical layer security (PLS) in the near field, where multiple legitimate users and one eavesdropper are situated in the near-field region of the XL-array base station (BS). First, we consider a special case with one legitimate user and one eavesdropper to shed useful insights into near-field PLS. In particular, it is shown that 1) Artificial noise (AN) is crucial to near-field security provisioning, transforming an insecure system to a secure one; 2) AN can yield numerous security gains, which considerably enhances PLS in the near field as compared to the case without AN taken into account. Next, for the general case with multiple legitimate users, we propose an efficient low-complexity approach to design the beamforming with AN to guarantee near-field secure transmission. Specifically, the low-complexity approach is conceived starting by introducing the concept of interference domain to capture the inter-user interference level, followed by a three-step identification framework for designing the beamforming. Finally, numerical results reveal that 1) the PLS enhancement in the near field is pronounced thanks to the additional spatial DoFs; 2) the proposed approach can achieve close performance to that of the computationally-extensive conventional approach yet with a significantly lower computational complexity.

eess.SP↗

arXiv2025

DeformPAM: Data-Efficient Learning for Long-horizon Deformable Object Manipulation via Preference-based Action Alignment

In recent years, imitation learning has made progress in the field of robotic manipulation. However, it still faces challenges when addressing complex long-horizon tasks with deformable objects, such as high-dimensional state spaces, complex dynamics, and multimodal action distributions. Traditional imitation learning methods often require a large amount of data and encounter distributional shifts and accumulative errors in these tasks. To address these issues, we propose a data-efficient general learning framework (DeformPAM) based on preference learning and reward-guided action selection. DeformPAM decomposes long-horizon tasks into multiple action primitives, utilizes 3D point cloud inputs and diffusion models to model action distributions, and trains an implicit reward model using human preference data. During the inference phase, the reward model scores multiple candidate actions, selecting the optimal action for execution, thereby reducing the occurrence of anomalous actions and improving task completion quality. Experiments conducted on three challenging real-world long-horizon deformable object manipulation tasks demonstrate the effectiveness of this method. Results show that DeformPAM improves both task completion quality and efficiency compared to baseline methods even with limited data. Code and data will be available at https://deform-pam.robotflow.ai.

cs.RO↗

arXiv2025

Resolving the Kagome Origin of the Strange Metallicity in Ni$_3$In

Strong correlations promote singular properties such as strange metallicity, which shows considerable commonality across quantum materials platforms. Understanding the mechanism for such emerging universality is an outstanding challenge, given that the underlying degrees of freedom can be complex and varied. Progress may be made in flat band systems, especially kagome and other frustrated-lattice metals with active flat bands. These systems show strange metal behavior that bears a striking resemblance to what happens in heavy-fermion metals. Here, in scanning tunneling spectroscopy of kagome metal Ni$_3$In, we find a zero-bias peak-dip structure whose variation with magnetic field and temperature tracks the evolution of the strange metal properties. We identify the origin of the peak as compact molecular orbitals formed by destructive interference over the kagome sites, resulting in emergent $f$-shell-like localized moments. Using quasi-particle interference, we visualize their interaction with the Dirac light bands. We thus unveil the essential microscopic ingredients of the $d$-electron-based kagome metals that, while distinct from the atomic orbitals of the $f$-electron-based heavy fermion materials, are responsible for a shared phenomenology between the two types of systems. Our findings provide a new window to uncover and interconnect the essential and yet diverse microscopic building blocks in disparate families of quantum materials that drive a convergence towards a universal understanding in the regime of amplified quantum fluctuations.

cond-mat.str-el↗

arXiv2025

Correlated flat-band physics in a bilayer kagome metal based on compact molecular orbitals

Flat bands, when located close to the Fermi energy, can considerably enhance the influence of electron correlations on the low energy physics in kagome and other frustrated-lattice metals. A major challenge in describing the interaction effects in such bulk materials is that the flat band is often intermixed with a large number of other bands. Here we show that the recently introduced notion of compact molecular orbitals (CMOs) enable a path forward in describing the dominant effect of the Coulomb interactions in spite of the complexity of the bandstructure. Our materials-based analysis allows for the understanding of the scanning-tunneling-microscopy experiment [J. C. Souza et al., preprint (2024)] of the bilayer kagome metal Ni$_3$In in terms of the CMO notion. From the resulting CMO, an effective Anderson lattice model can be set up. This CMO-based approach enables the calculation of correlation effects that is difficult to do based on the atomic orbitals. Furthermore, it suggests an enriched phase diagram for the strange metal physics of the kagome metal, which can be tested by future experiments. We discuss the implications of our results for the general correlation physics of flat band systems and beyond.

cond-mat.str-el↗

arXiv2025

Amplified multipartite entanglement witnessed in a quantum critical metal

Strong correlations in matter promote a landscape of quantum phases and associated quantum critical points. For metallic systems, there is increasing recognition that the quantum criticality goes beyond the Landau framework and, thus, novel means are needed to characterize the quantum critical fluid. Here we do so by studying an entanglement quantity, the quantum Fisher information, in a strange metal system, focusing on the exemplary case of an Anderson/Kondo lattice model near its Kondo destruction quantum critical point. The spin quantum Fisher information peaks at the quantum critical point and indicates a strongly entangled ground state. Our results are supported by the quantum Fisher information extracted from inelastic neutron scattering measurements in heavy fermion metals. Our work elucidates the loss of quasiparticles in strange metals, opens a quantum information avenue to advance the understanding of metallic quantum criticality in a broad range of strongly correlated systems, and points to a novel regime of quantum matter to realize amplified entanglement.

cond-mat.str-el↗

arXiv2025

Superconductivity in twisted WSe$_2$ from topology-induced quantum fluctuations

Recently, superconductivity has been observed in twisted WSe$_2$ moiré structures (Xia et al., Nature 2024; Guo et al., Nature 2025). Its transition temperature is high, reaching a few percent of the Fermi temperature scale. Here, we advance a mechanism for superconductivity based on the notion that electronic topology enables quantum fluctuations in a suitable regime of intermediate correlations. In this regime, the Coulomb interaction requires that an active topological flat band and nearby wider bands are considered together. Compact molecular orbitals arise, which give rise to quantum fluctuations through topology-dictated hybridization with the other molecular orbitals. The hybridization competes with the active flat band's natural tendency towards static electronic ordering, thereby weakening the latter; we link this effect with certain salient observations by experiments. Furthermore, the competition yields a quantum critical regime where quasiparticles are lost. The corresponding quantum critical fluctuations drive superconductivity. Broader implications and new connections among correlated materials platforms are discussed.

cond-mat.str-el↗

arXiv2025

Graph Foundation Models: Concepts, Opportunities and Challenges

Foundation models have emerged as critical components in a variety of artificial intelligence applications, and showcase significant success in natural language processing and several other domains. Meanwhile, the field of graph machine learning is witnessing a paradigm transition from shallow methods to more sophisticated deep learning approaches. The capabilities of foundation models in generalization and adaptation motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This paradigm envisions models that are pre-trained on extensive graph data and can be adapted for various graph tasks. Despite this burgeoning interest, there is a noticeable lack of clear definitions and systematic analyses pertaining to this new domain. To this end, this article introduces the concept of Graph Foundation Models (GFMs), and offers an exhaustive explanation of their key characteristics and underlying technologies. We proceed to classify the existing work related to GFMs into three distinct categories, based on their dependence on graph neural networks and large language models. In addition to providing a thorough review of the current state of GFMs, this article also outlooks potential avenues for future research in this rapidly evolving domain.

cs.LG↗

arXiv2025

A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphs

Geodesic distances on manifolds have numerous applications in image processing, computer graphics and computer vision. In this work, we introduce an approach called `LGGD' (Learned Generalized Geodesic Distances). This method involves generating node features by learning a generalized geodesic distance function through a training pipeline that incorporates training data, graph topology and the node content features. The strength of this method lies in the proven robustness of the generalized geodesic distances to noise and outliers. Our contributions encompass improved performance in node classification tasks, competitive results with state-of-the-art methods on real-world graph datasets, the demonstration of the learnability of parameters within the generalized geodesic equation on graph, and dynamic inclusion of new labels.

cs.LG↗

arXiv2025

Node-Time Conditional Prompt Learning In Dynamic Graphs

Dynamic graphs capture evolving interactions between entities, such as in social networks, online learning platforms, and crowdsourcing projects. For dynamic graph modeling, dynamic graph neural networks (DGNNs) have emerged as a mainstream technique. However, they are generally pre-trained on the link prediction task, leaving a significant gap from the objectives of downstream tasks such as node classification. To bridge the gap, prompt-based learning has gained traction on graphs, but most existing efforts focus on static graphs, neglecting the evolution of dynamic graphs. In this paper, we propose DYGPROMPT, a novel pre-training and prompt learning framework for dynamic graph modeling. First, we design dual prompts to address the gap in both task objectives and temporal variations across pre-training and downstream tasks. Second, we recognize that node and time features mutually characterize each other, and propose dual condition-nets to model the evolving node-time patterns in downstream tasks. Finally, we thoroughly evaluate and analyze DYGPROMPT through extensive experiments on four public datasets.

cs.LG↗

arXiv2025

Non-Homophilic Graph Pre-Training and Prompt Learning

Graphs are ubiquitous for modeling complex relationships between objects across various fields. Graph neural networks (GNNs) have become a mainstream technique for graph-based applications, but their performance heavily relies on abundant labeled data. To reduce labeling requirement, pre-training and prompt learning has become a popular alternative. However, most existing prompt methods do not differentiate homophilic and heterophilic characteristics of real-world graphs. In particular, many real-world graphs are non-homophilic, not strictly or uniformly homophilic with mixing homophilic and heterophilic patterns, exhibiting varying non-homophilic characteristics across graphs and nodes. In this paper, we propose ProNoG, a novel pre-training and prompt learning framework for such non-homophilic graphs. First, we analyze existing graph pre-training methods, providing theoretical insights into the choice of pre-training tasks. Second, recognizing that each node exhibits unique non-homophilic characteristics, we propose a conditional network to characterize the node-specific patterns in downstream tasks. Finally, we thoroughly evaluate and analyze ProNoG through extensive experiments on ten public datasets.

cs.LG↗

arXiv2025

Separated Contrastive Learning for Matching in Cross-domain Recommendation with Curriculum Scheduling

Cross-domain recommendation (CDR) is a task that aims to improve the recommendation performance in a target domain by leveraging the information from source domains. Contrastive learning methods have been widely adopted among intra-domain (intra-CL) and inter-domain (inter-CL) users/items for their representation learning and knowledge transfer during the matching stage of CDR. However, we observe that directly employing contrastive learning on mixed-up intra-CL and inter-CL tasks ignores the difficulty of learning from inter-domain over learning from intra-domain, and thus could cause severe training instability. Therefore, this instability deteriorates the representation learning process and hurts the quality of generated embeddings. To this end, we propose a novel framework named SCCDR built up on a separated intra-CL and inter-CL paradigm and a stop-gradient operation to handle the drawback. Specifically, SCCDR comprises two specialized curriculum stages: intra-inter separation and inter-domain curriculum scheduling. The former stage explicitly uses two distinct contrastive views for the intra-CL task in the source and target domains, respectively. Meanwhile, the latter stage deliberately tackles the inter-CL tasks with a curriculum scheduling strategy that derives effective curricula by accounting for the difficulty of negative samples anchored by overlapping users. Empirical experiments on various open-source datasets and an offline proprietary industrial dataset extracted from a real-world recommender system, and an online A/B test verify that SCCDR achieves state-of-the-art performance over multiple baselines.

cs.IR↗

arXiv2025

Bridging Domain Gaps between Pretrained Multimodal Models and Recommendations

With the explosive growth of multimodal content online, pre-trained visual-language models have shown great potential for multimodal recommendation. However, while these models achieve decent performance when applied in a frozen manner, surprisingly, due to significant domain gaps (e.g., feature distribution discrepancy and task objective misalignment) between pre-training and personalized recommendation, adopting a joint training approach instead leads to performance worse than baseline. Existing approaches either rely on simple feature extraction or require computationally expensive full model fine-tuning, struggling to balance effectiveness and efficiency. To tackle these challenges, we propose \textbf{P}arameter-efficient \textbf{T}uning for \textbf{M}ultimodal \textbf{Rec}ommendation (\textbf{PTMRec}), a novel framework that bridges the domain gap between pre-trained models and recommendation systems through a knowledge-guided dual-stage parameter-efficient training strategy. This framework not only eliminates the need for costly additional pre-training but also flexibly accommodates various parameter-efficient tuning methods.

cs.IR↗

arXiv2025

Local and Non-local Entanglement Witnesses of Fermi Liquid

There is a growing interest both in utilizing entanglement means to characterize many-body systems and in uncovering their entanglement depth. Motivated by recent findings that the spin quantum Fisher information witnesses amplified multipartite entanglement of strange metals and characterizes their loss of quasiparticles, we study the quantum Fisher information in various cases of Fermi liquid. We show that local operators generically do not witness any multipartite entanglement in a Fermi liquid, but non-local many-body operators do. Our results point to novel experimental means to detect the entanglement depth of metallic fermionic systems and, in general, open a new avenue to the emerging exploration of entanglement in quantum materials.

cond-mat.str-el↗

arXiv2025

Exploring the Potential of Large Language Models for Heterophilic Graphs

Large language models (LLMs) have presented significant opportunities to enhance various machine learning applications, including graph neural networks (GNNs). By leveraging the vast open-world knowledge within LLMs, we can more effectively interpret and utilize textual data to better characterize heterophilic graphs, where neighboring nodes often have different labels. However, existing approaches for heterophilic graphs overlook the rich textual data associated with nodes, which could unlock deeper insights into their heterophilic contexts. In this work, we explore the potential of LLMs for modeling heterophilic graphs and propose a novel two-stage framework: LLM-enhanced edge discriminator and LLM-guided edge reweighting. In the first stage, we fine-tune the LLM to better identify homophilic and heterophilic edges based on the textual content of their nodes. In the second stage, we adaptively manage message propagation in GNNs for different edge types based on node features, structures, and heterophilic or homophilic characteristics. To cope with the computational demands when deploying LLMs in practical scenarios, we further explore model distillation techniques to fine-tune smaller, more efficient models that maintain competitive performance. Extensive experiments validate the effectiveness of our framework, demonstrating the feasibility of using LLMs to enhance node classification on heterophilic graphs.

cs.LG↗

arXiv2025

Accelerating evolutionary exploration through language model-based transfer learning

Gene expression programming is an evolutionary optimization algorithm with the potential to generate interpretable and easily implementable equations for regression problems. Despite knowledge gained from previous optimizations being potentially available, the initial candidate solutions are typically generated randomly at the beginning and often only include features or terms based on preliminary user assumptions. This random initial guess, which lacks constraints on the search space, typically results in higher computational costs in the search for an optimal solution. Meanwhile, transfer learning, a technique to reuse parts of trained models, has been successfully applied to neural networks. However, no generalized strategy for its use exists for symbolic regression in the context of evolutionary algorithms. In this work, we propose an approach for integrating transfer learning with gene expression programming applied to symbolic regression. The constructed framework integrates Natural Language Processing techniques to discern correlations and recurring patterns from equations explored during previous optimizations. This integration facilitates the transfer of acquired knowledge from similar tasks to new ones. Through empirical evaluation of the extended framework across a range of univariate problems from an open database and from the field of computational fluid dynamics, our results affirm that initial solutions derived via a transfer learning mechanism enhance the algorithm's convergence rate towards improved solutions.

cs.NE↗

arXiv2025

An Aspect Performance-aware Hypergraph Neural Network for Review-based Recommendation

Online reviews allow consumers to provide detailed feedback on various aspects of items. Existing methods utilize these aspects to model users' fine-grained preferences for specific item features through graph neural networks. We argue that the performance of items on different aspects is important for making precise recommendations, which has not been taken into account by existing approaches, due to lack of data. In this paper, we propose an aspect performance-aware hypergraph neural network (APH) for the review-based recommendation, which learns the performance of items from the conflicting sentiment polarity of user reviews. Specifically, APH comprehensively models the relationships among users, items, aspects, and sentiment polarity by systematically constructing an aspect hypergraph based on user reviews. In addition, APH aggregates aspects representing users and items by employing an aspect performance-aware hypergraph aggregation method. It aggregates the sentiment polarities from multiple users by jointly considering user preferences and the semantics of their sentiments, determining the weights of sentiment polarities to infer the performance of items on various aspects. Such performances are then used as weights to aggregate neighboring aspects. Experiments on six real-world datasets demonstrate that APH improves MSE, Precision@5, and Recall@5 by an average of 2.30%, 4.89%, and 1.60% over the best baseline. The source code and data are available at https://github.com/dianziliu/APH.

cs.IR↗

arXiv2024

On the Probability of Necessity and Sufficiency of Explaining Graph Neural Networks: A Lower Bound Optimization Approach

The explainability of Graph Neural Networks (GNNs) is critical to various GNN applications, yet it remains a significant challenge. A convincing explanation should be both necessary and sufficient simultaneously. However, existing GNN explaining approaches focus on only one of the two aspects, necessity or sufficiency, or a heuristic trade-off between the two. Theoretically, the Probability of Necessity and Sufficiency (PNS) holds the potential to identify the most necessary and sufficient explanation since it can mathematically quantify the necessity and sufficiency of an explanation. Nevertheless, the difficulty of obtaining PNS due to non-monotonicity and the challenge of counterfactual estimation limit its wide use. To address the non-identifiability of PNS, we resort to a lower bound of PNS that can be optimized via counterfactual estimation, and propose a framework of Necessary and Sufficient Explanation for GNN (NSEG) via optimizing that lower bound. Specifically, we depict the GNN as a structural causal model (SCM), and estimate the probability of counterfactual via the intervention under the SCM. Additionally, we leverage continuous masks with a sampling strategy to optimize the lower bound to enhance the scalability. Empirical results demonstrate that NSEG outperforms state-of-the-art methods, consistently generating the most necessary and sufficient explanations.

cs.LG↗

arXiv2024

Simultaneous Multiband Photometry of the Early Optical Afterglow of GRB 240825A with Mephisto

Gamma-ray bursts (GRBs) are the most luminous transients in the universe. The interaction of the relativistic jet with the circumburst medium produces an afterglow and generates multiwavelength emission. In this work, we present simultaneous multiband photometry of GRB~240825A with the Multi-channel Photometric Survey Telescope (Mephisto) and analyze its temporal and spectral properties. The measurement began 128 seconds after the GRB trigger and continued until the fourth day when the afterglow essentially diminished and the measured brightness was close to that of the host galaxy. Based on the multiband light curves in the $uvgriz$ bands, we find that the optical flux density satisfies $F_{ν,{\rm obs}}\propto t^{-1.34}ν^{-2.48}$ with a spectral index of $2.48$ much larger than those of most other GRBs. To reconcile the measured much softer spectral energy distribution (SED) with that predicted by the standard afterglow model, an extra host-galaxy extinction of $E_{B-V}\sim(0.37-0.57)$ mag is required. We interpreted this excess as arising from a dense circumburst medium. We further find that the SED of the optical afterglow hardened as the afterglow decayed and the color excess $E_{B-V}$ decreased $\sim0.26$ mag from 100 seconds to 3000 seconds after the GRB trigger. Finally, we analyze the properties of the host galaxy of GRB~240825A based on data from the SDSS, PanSTARRS and HSC-SSP surveys. For a host redshift of $z=0.659$, the stellar mass and star formation rate of the host galaxy are estimated to be $\log(M_*/M_\odot)=10.0^{+0.3}_{-0.3}$ and $\log({\rm SFR}/M_{\odot}{\rm yr}^{-1})= 0.6^{+0.8}_{-3.3}$, respectively, pointing to a gas-rich, star-forming, medium-size galaxy.

astro-ph.HE↗