Searcharxiv⌕ Search

arXiv subjects

Yuan Fang

Publications and source records attributed to Yuan Fang.

At least 37 records · Page 2Linked to original sources

Omni-Supervised Motion Editing: Balancing Change and Invariance through Positive-Negative Learning

Text-based human motion editing aims to modify existing motion sequences according to natural language instructions while maintaining the consistency of the original motion. Existing diffusion-based approaches often rely on heuristic similarity cues or coarse global conditioning, leading to motion distortion and suboptimal semantic alignment. The key challenge lies in balancing change (i.e. precisely editing target regions) and invariance (i.e. preserving unedited parts). To handle such challenge, we propose an Omni-Supervised Positive-Negative Learning framework, named OmniME. Our method integrates three complementary components: (1) retrospective feature supervision that enforces coarse-to-fine consistency across transformer layers,(2) motion preservation mechanism that focuses on subtle variations according to the source-target similarity, and (3) triplet-based semantic alignment that strengthens text-motion correspondence. Together, these components form a unified supervision paradigm that balances change and invariance. Extensive experiments on the MotionFix and STANCE Adjustment datasets demonstrate that OmniME achieves state-of-the-art performance in editing alignment, validating the effectiveness of our unified learning framework. Our source codes and models have been released at: https://github.com/rocket-ycyer/OmniME.git

cs.CV↗

Clustering as Reasoning: A $k$-Means Interpretation of Chain-of-Thought Graph Learning

Chain-of-Thought (CoT) prompting has shown promise in enhancing the reasoning capabilities of large language models (LLMs) on text-attributed graphs (TAGs). This work reframes CoT-based graph learning through the principle of clustering as reasoning, offering a $k$-means interpretation of how iterative reasoning operates over graph-structured data. We observe that existing graph CoT methods rely on disjoint architectures and fixed graph representations, limiting step-by-step semantic-topological interaction and interpretability. To overcome this limitation, we propose a unified framework named KCoT that integrates CoT reasoning with graph representation learning. Our key theoretical result reveals a formal mathematical correspondence between a Transformer block and the $k$-means algorithm, allowing reasoning to be interpreted as iterative assignment and update steps. Based on this insight, we introduce a Semantic Discriminating Prompt that explicitly formulates these steps as structured CoT reasoning, together with a structure-grounded alignment strategy to fuse topological priors with evolving thought-conditioned representations. Experiments on standard benchmarks demonstrate consistent improvements over state-of-the-art methods, validating clustering as a principled mechanism for CoT-based graph learning.

cs.AI↗

Event-Aware Prompt Learning for Dynamic Graphs

Real-world graph typically evolve via a series of events, modeling dynamic interactions between objects across various domains. For dynamic graph learning, dynamic graph neural networks (DGNNs) have emerged as popular solutions. Recently, prompt learning methods have been explored on dynamic graphs. However, existing methods generally focus on capturing the relationship between nodes and time, while overlooking the impact of historical events. In this paper, we propose EVP, an event-aware dynamic graph prompt learning framework that can serve as a plug-in to existing methods, enhancing their ability to leverage historical events knowledge. First, we extract a series of historical events for each node and introduce an event adaptation mechanism to align the fine-grained characteristics of these events with downstream tasks. Second, we propose an event aggregation mechanism to effectively integrate historical knowledge into node representations. Finally, we conduct extensive experiments on four public datasets to evaluate and analyze EVP.

cs.LG↗

HoReN: Normalized Hopfield Retrieval for Large-Scale Sequential Model Editing

Large language models encode vast factual knowledge that can become outdated or incorrect after deployment, yet retraining is prohibitively costly. This motivates lifelong model editing, which updates targeted behavior while preserving the rest of the model. Existing editors, both parameter-modifying and parameter-preserving, degrade severely as edits accumulate and struggle to generalize across paraphrases. We propose HoReN, a codebook-based parameter-preserving editor that wraps a single MLP layer with a discrete key-value memory. HoReN treats each codebook entry as both a knowledge key and a Hopfield stored pattern, retrieves edits by angular similarity on the unit hypersphere, and refines queries through damped Hopfield dynamics so paraphrases converge to the correct memory basin while unrelated inputs remain stable. HoReN achieves strong editing performance with consistent gains across diverse benchmarks spanning standard ZsRE, structured WikiBigEdit, and unstructured UnKE evaluations. Moreover, HoReN scales to 50K sequential edits on ZsRE with stable overall performance above 0.93, while prior editors collapse or degrade severely before reaching 10K. Our code is available at https://github.com/ha11ucin8/HoReN.

cs.LG↗

GraphReAct: Reasoning and Acting for Multi-step Graph Inference

Reasoning-acting frameworks enhance large language models (LLMs) by interleaving reasoning with actions for dynamic information acquisition. However, extending this paradigm to graph learning remains underexplored. Graph data is inherently structured, with information distributed across nodes and edges and encoded through both topology and latent representations. As a result, effective reasoning over graphs requires not only retrieving informative evidence from the graph, but also progressively refining the accumulated context during multi-step inference. In this work, we propose GraphReAct, a graph reasoning-acting framework that enables step-by-step inference over graph-structured data. Specifically, we design a graph-based action space with two complementary retrieval actions: topological retrieval, which captures local structural dependencies, and semantic retrieval, which accesses non-local but relevant evidence in the representation space. These actions dynamically expand the reasoning context. To further support multi-step reasoning, we introduce another type of action, context refinement, which distills and reorganizes accumulated information into a compact representation. By interleaving reasoning with both retrieval and refinement actions, our framework enables a progressive transition from context expansion to compression. Extensive experiments on six benchmark datasets demonstrate that GraphReAct consistently outperforms state-of-the-art methods, validating the effectiveness of reasoning-acting for graph learning.

cs.AI↗

Nonlinear thermal and thermoelectric transport from quantum geometry

Quantum geometry may enable the development of quantum phases ranging from superconductivity to correlated topological states. One powerful probe of quantum geometry is the nonlinear Hall response which detects Berry curvature dipole in systems with time-reversal invariance and broken inversion symmetry. With broken time-reversal symmetry, this response is also associated with quantum metric dipole. Here we investigate nonlinear thermal and thermoelectric responses, which provide a wealth of new information about quantum geometry. In particular, we uncover a web of connections between these quantities that parallel the standard Wiedemann-Franz and Mott relations. Implications for the studies of a variety of topological systems, including Weyl-Kondo semimetals and Bernal bilayer graphene, are discussed.

cond-mat.mes-hall↗

CoEvoT: Co-Evolving Chain-of-Thought Prompting for Graph-LLM Reasoning

Graph learning under distribution shift presents a persistent challenge, where models adapt to new graphs with limited or even no supervision. Recent graph--LLM approaches move toward label-efficient prediction by linearizing graphs into prompts and using large language models (LLMs) as predictors, and can adopt Chain-of-Thought (CoT) prompting to exploit LLM's multi-step reasoning capability. However, existing CoT-based graph--LLM methods generate intermediate thoughts while conditioning on fixed graph tokens, limiting step-wise refinement of structural cues. In this paper, we propose CoEvoT, a simple yet effective co-evolving CoT prompting framework for graph--LLM reasoning. CoEvoT couples text-to-graph token rewriting and graph-to-text reasoning guidance in a closed loop: each intermediate textual thought is used to update the graph token evidence state via a lightweight condition network, and the updated tokens are fed back into the next-step instruction to guide subsequent LLM reasoning. This enables step-wise, state-aware evidence refinement, rather than reasoning over a fixed graph snapshot. Extensive experiments on eight datasets demonstrate that CoEvoT consistently outperforms state-of-the-art baselines.

cs.CL↗

The Intermediate-Mass Black Hole Reverberation Mapping Project: Stable Optical Continuum Lags of an IMBH in the Dwarf Galaxy NGC 4395 Over Years

NGC 4395 is a nearby dwarf spiral galaxy hosting an active galactic nucleus (AGN) powered by an intermediate-mass black hole (IMBH, $M_{\rm BH} \sim 10^{4}$--$10^{5}\,M_\odot$). Recent optical continuum reverberation mapping studies have suggested potential lag variations between different epochs, offering important clues to the physical mechanisms governing variability in the vicinity of the central black hole. We present continuous intranight multi-band photometric monitoring of NGC 4395 based on five nights of observations, including three nights from the Faulkes Telescope North (two of which are archival) and two new nights from Mephisto. This represents the first systematic investigation of optical continuum lag stability in a galaxy hosting a robustly confirmed IMBH. By applying difference-imaging techniques to both the new observations and the reprocessed archival data, we detect statistically significant optical inter-band lags of $\sim 5$--15 minutes, which increase monotonically with increasing wavelength. No obvious $u$-band lag excess is observed, implying a negligible fractional contribution from diffuse continuum (DC) emission to the optical continuum, in agreement with our spectral decomposition results. The inter-band lags remain stable over multi-year baselines. We suggest that this long-term lag stability may be related to the minor DC contribution, a relatively steady disk-corona structure, and the unusually high X-ray-to-optical luminosity ratio characteristic of low-luminosity AGNs, which likely allows X-ray reprocessing to dominate over other potential variability mechanisms. Future facilities like Gemini/SCORPIO, with its simultaneous optical-to-near-infrared coverage, will be ideally suited to play an important role in advancing this field.

astro-ph.GA↗

A generalised pre-training strategy for deep learning networks in semantic segmentation of remotely sensed images

In the segmentation of remotely sensed images, deep learning models are typically pre-trained using large image databases like ImageNet before fine-tuned on domain-specific datasets. However, the performance of these fine-tuned models is often hindered by the large domain gaps (i.e., differences in scenes and modalities) between ImageNet's images and remotely sensed images being processed. Therefore, many researchers have undertaken efforts to establish large-scale domain-specific image datasets for pre-training, aiming to enhance model performance. However, establishing such datasets is often challenging, requiring significant effort, and these datasets often exhibit limited generaliza-bility to other application scenarios. To address these issues, this study introduces a novel yet simple pre-training strategy designed to guide a model away from learning domain-specific features in a pre-training dataset during pre-training, thereby improving the generalisation ability of the pre-trained model. To evaluate the strategy's effectiveness, deep learning models are pre-trained on ImageNet and subsequently fine-tuned on four semantic segmentation datasets with diverse scenes and modalities, including iSAID, MFNet, PST900 and Potsdam. Experimental results show that the proposed pre-training strategy led to state-of-the-art accuracies on all four datasets, namely 67.4% mIoU for iSAID, 56.9% mIoU for MFNet, 84.22% mIoU for PST900, 91.88% mF1 for Potsdam. This research lays the groundwork for developing a unified foundation model applicable to both computer vision and remote sensing applications.

cs.CV↗

Pathway to lowest-energy structures and stress relaxation for the surface triple junction verified by machine learning

The behavior of surface triple junctions (STJ) at emergent grain boundaries on free surfaces is critical to the microstructure evolution, and therefore to the stability of the next generation interconnect. Yet,despite this significant importance, its lowest-energy structure and local stress have remained persistently unknown. Here, we fill this critical gap through high-resolution experimental mapping of the local surface deformation at STJ, the analysis of the local structure and stress relaxation, and ergodic searching metastable structures. We establish the zipped Y-shaped notch as the universal lowest-energy structures. This energetic preference was well explained by the distinctive local stress mechanism and was excellently verified with machine learning methods for a wide range of boundaries. By revealing the elusive thermodynamics of STJs, our findings advance the research field by redefining the energetic framework for capillary driven structure evolution and providing foundation for understanding kinetically diffusive deformation and for engineering thin-film interconnects and related materials.

cond-mat.mtrl-sci↗

Reverse Constitutional AI: A Framework for Controllable Toxic Data Generation via Probability-Clamped RLAIF

Ensuring the safety of large language models (LLMs) requires robust red teaming, yet the systematic synthesis of high-quality toxic data remains under-explored. We propose Reverse Constitutional AI (R-CAI), a framework for automated and controllable adversarial data generation that moves beyond isolated jailbreak prompts. By inverting a harmless constitution into a constitution of toxicity and iteratively refining model outputs through a critique--revision pipeline, R-CAI enables scalable synthesis of multi-dimensional adversarial data without human annotation. Optimizing solely for toxicity-related rewards, however, can lead to reward hacking and degraded semantic coherence. To address this challenge, we introduce probability clamping within reinforcement learning from AI feedback, which stabilizes adversarial optimization while preserving adversarial intent. Experiments demonstrate that R-CAI generates diverse, high-quality toxic data and that probability clamping substantially improves semantic coherence (15%) without sacrificing adversarial strength. Overall, R-CAI provides a fully automated framework for red teaming data generation and systematic safety evaluation of aligned language models.

cs.CL↗

Two-Dimensional Ferromagnetism in Monolayers of MnSi

2D ferromagnets offer valuable insights into the fundamentals of magnetism and stimulate the progress of ultracompact spintronics. The demand for seamless integration of the materials with the Si technology, particularly helpful to their applications in nanoelectronics, draws attention to 2D magnetic silicides. MnSi is a prominent silicide hosting magnetic phases with unconventional properties; however, little is known about magnetic states of MnSi at the 2D limit. Here, we explore the magnetism of ultrathin films of MnSi on silicon, down to a single monolayer. Angle-resolved photoemission spectra suggest exchange splitting of MnSi bands. Magnetization measurements confirm that the ferromagnetic state in MnSi is rather robust with respect to the number of monolayers. Thick metallic films demonstrate the anomalous Hall effect and negative magnetoresistance; however, as the number of monolayers drops below 3, MnSi becomes an insulator. Most importantly, the ferromagnetism of ultrathin MnSi films acquires a 2D character, as its effective Curie temperature depends on weak magnetic fields. The present study establishes MnSi monolayers as 2D ferromagnets that can find potential applications in silicon-based spintronics.

cond-mat.mtrl-sci↗

SemiConLens: Visual Analytics for 2D Semiconductor Discovery

The past few years have witnessed vibrant efforts in discovering new two-dimensional (2D) semiconductor materials from both academia and the industry, due to their promising potential in resolving the severe performance deterioration of traditional semiconductors resulting from condensed silicon thickness. However, existing methods (e.g., Density Functional Theory (DFT) or machine-learning-based approaches) suffer from various challenges such as small datasets, and reliability and trustworthiness issues. To bridge this gap, we propose SemiConLens, a visual analytics approach to combine human expertise with the power of ML to enable effective and reliable 2D semiconductor discovery. Specifically, we first develop a new Correlation Aware Multivariate Imputation (CAMI) method and use ML models like autoencoder, which can better learn from limited data and reveal uncertainty, to address the challenge of sparse data in semiconductivity prediction. Built upon this, our visualization module, consisting of three visualization views with linked interactions, allows material researchers to interactively filter, discover and compare 2D semiconductor candidates. A novel circular glyph design and a new cluster-aware layout optimization approach are proposed to effectively display all the user-configurable key attributes and possible prediction uncertainties of each semiconductor candidate, ensuring a reliable and trustable 2D semiconductor discovery. We assess SemiConLens through quantitative evaluations, expert interviews, and use cases. The results demonstrate SemiConLens's capability to help material researchers conduct effective discovery of desirable 2D semiconductors.

cs.HC↗

StaR-KVQA: Structured Reasoning Traces for Implicit-Knowledge Visual Question Answering

Knowledge-based Visual Question Answering (KVQA) requires models to ground entities in images and reason over factual knowledge. Recent work has introduced its implicit-knowledge variant, IK-KVQA, where a multimodal large language model (MLLM) is the sole knowledge source and answers are produced without external retrieval. Existing IK-KVQA approaches, however, are typically trained with answer-only supervision: reasoning remains implicit, justifications are often weak or inconsistent, and generalization after standard supervised fine-tuning (SFT) can be brittle. We propose StaR-KVQA, a framework that equips IK-KVQA with dual-path structured reasoning traces - symbolic relation paths over text and vision together with path-grounded natural-language explanations - to provide a stronger inductive bias than generic answer-only supervision. These traces act as modality-aware scaffolds that guide the model toward relevant entities and attributes, offering more structure than generic chain-of-thought supervision while not constraining reasoning to any single fixed path. With a single open-source MLLM, StaR-KVQA constructs and selects traces to build an offline trace-enriched dataset and then performs structure-aware self-distillation; no external retrievers, verifiers, or curated knowledge bases are used, and inference is a single autoregressive pass. Across benchmarks, StaR-KVQA consistently improves both answer accuracy and the transparency of intermediate reasoning, achieving up to +11.3% higher answer accuracy on OK-VQA over the strongest baseline.

cs.CV↗

Dimensionality tuning of heavy-fermion states in ultrathin CeSi2 films

Dimensionality tuning is an important method to modify the electronic states of quantum materials. However, the mechanism of such tuning in heavy fermion systems and its connection with transport properties remain largely unexplored. Here by combining molecular beam epitaxy (MBE), in-situ angle-resolved photoemission spectroscopy (ARPES) and transport measurements, we study the electronic states of the heavy-fermion compound CeSi2 as a function of film thickness. In three dimensional thick films, our measurements reveal a dispersive Kondo peak at the Fermi level (EF) and satellite peaks originating from crystal electric field (CEF) excitations, characteristic of heavy fermion systems. For two-dimensional ultrathin films, the CEF satellites are largely suppressed while the ground-state Kondo peak at EF remains strong, although it develops at lower temperatures. Simultaneously, the maximum temperature Tmax of the magnetic resistivity, \r{ho}m(T), changes from ~100 K in thick films to ~35 K in ultrathin films. This can be attributed to the dimensionality driven reduction of CEF excitations during the Kondo process, in good agreement with spectroscopic results. Our work provides direct insight to understand the quantum confinement effects on strongly correlated 4f-electron systems and opens up new opportunities to explore emergent phenomena in two-dimensional heavy-fermion materials.

cond-mat.str-el↗

Chiral Weyl-Kondo semimetals and hexagonal heavy fermion systems

Strong correlation, in concert with symmetry and topology, engenders novel gapless phases of matter, though only a tip of the iceberg has been seen. An exemplary framework is provided by Weyl-Kondo semimetals, in which Weyl fermions develop through crystalline symmetry constraints on the emergent low-energy heavy-fermion excitations. This paradigm has opened up new opportunities to explore correlated topologies without a noninteracting counterpart, but fully realizing this potential requires a large base of candidate materials. Here we confront the challenge on both fronts by studying heavy fermion systems with hexagonal space groups. This family contains a large number of chiral nonsymmorphic crystal structures that promote Weyl degeneracies and, in addition, feature geometric frustration in the $f$-electron magnetism. Our calculations for the heavy fermion states identify Weyl-Kondo semimetals with chiral or achiral Weyl nodes in the respective structural classes. We also develop the first search strategy of any kind for the difficult case of strongly correlated materials, which is also suitable for automation, using a combination of materials database, symmetry classification and search for desired experimental properties, and propose as candidate topological heavy fermion systems the chiral CePt$_2$B and achiral Ce$_2$NiGe$_3$ and Ce$_6$Co$_{2-δ}$Si$_3$. Our findings raise the prospect for strongly correlated metallic topology in the unusual setting of exotic quantum magnetism and, moreover, point a way to go beyond serendipity in the search for novel strongly correlated quantum materials.

cond-mat.str-el↗

Rethinking Camera Choice: An Empirical Study on Fisheye Camera Properties in Robotic Manipulation

The adoption of fisheye cameras in robotic manipulation, driven by their exceptionally wide Field of View (FoV), is rapidly outpacing a systematic understanding of their downstream effects on policy learning. This paper presents the first comprehensive empirical study to bridge this gap, rigorously analyzing the properties of wrist-mounted fisheye cameras for imitation learning. Through extensive experiments in both simulation and the real world, we investigate three critical research questions: spatial localization, scene generalization, and hardware generalization. Our investigation reveals that: (1) The wide FoV significantly enhances spatial localization, but this benefit is critically contingent on the visual complexity of the environment. (2) Fisheye-trained policies, while prone to overfitting in simple scenes, unlock superior scene generalization when trained with sufficient environmental diversity. (3) While naive cross-camera transfer leads to failures, we identify the root cause as scale overfitting and demonstrate that hardware generalization performance can be improved with a simple Random Scale Augmentation (RSA) strategy. Collectively, our findings provide concrete, actionable guidance for the large-scale collection and effective use of fisheye datasets in robotic learning. More results and videos are available on https://robo-fisheye.github.io/

cs.RO↗

Evaluating Progress in Graph Foundation Models: A Comprehensive Benchmark and New Insights

Graph foundation models (GFM) aim to acquire transferable knowledge by pre-training on diverse graphs, which can be adapted to various downstream tasks. However, domain shift in graphs is inherently two-dimensional: graphs differ not only in what they describe (topic domains) but also in how they are represented (format domains). Most existing GFM benchmarks vary only topic domains, thereby obscuring how knowledge transfers across both dimensions. We present a new benchmark that jointly evaluates topic and format gaps across the full GFM pipeline, including multi-domain self-supervised pre-training and few-shot downstream adaptation, and provides a timely evaluation of recent GFMs in the rapidly evolving landscape. Our protocol enables controlled assessment in four settings: (i) pre-training on diverse topics and formats, while adapting to unseen downstream datasets; (ii) same pre-training as in (i), while adapting to seen datasets; (iii) pre-training on a single topic domain, while adapting to other topics; (iv) pre-training on a base format, while adapting to other formats. This two-axis evaluation disentangles semantic generalization from robustness to representational shifts. We conduct extensive evaluations of eight state-of-the-art GFMs on 33 datasets spanning seven topic domains and six format domains, surfacing new empirical observations and practical insights for future research. Codes/data are available at https://github.com/smufang/GFMBenchmark.

cs.CL↗