arXiv subjects

Haoyu Liu

Publications and source records attributed to Haoyu Liu.

At least 37 records · Page 2Linked to original sources

arXiv2026

Spiral RoPE: Rotate Your Rotary Positional Embeddings in the 2D Plane

Rotary Position Embedding (RoPE) is the de facto positional encoding in large language models due to its ability to encode relative positions and support length extrapolation. When adapted to vision transformers, the standard axial formulation decomposes two-dimensional spatial positions into horizontal and vertical components, implicitly restricting positional encoding to axis-aligned directions. We identify this directional constraint as a fundamental limitation of the standard axial 2D RoPE, which hinders the modeling of oblique spatial relationships that naturally exist in natural images. To overcome this limitation, we propose Spiral RoPE, a simple yet effective extension that enables multi-directional positional encoding by partitioning embedding channels into multiple groups associated with uniformly distributed directions. Each group is rotated according to the projection of the patch position onto its corresponding direction, allowing spatial relationships to be encoded beyond the horizontal and vertical axes. Across a wide range of vision tasks including classification, segmentation, and generation, Spiral RoPE consistently improves performance. Qualitative analysis of attention maps further show that Spiral RoPE exhibits more concentrated activations on semantically relevant objects and better respects local object boundaries, highlighting the importance of multi-directional positional encoding in vision transformers.

cs.CV↗

arXiv2025

Charged Dirac perturbations on Reissner-Nordström black holes in a cavity: quasinormal modes with Robin boundary conditions

We investigate charged Dirac quasinormal spectra on Reissner-Nordström black holes in a mirror-like cavity. For this purpose, we first derive charged Dirac equations, and \textit{two} sets of Robin boundary conditions following the vanishing energy flux principle. The Dirac spectra are then computed both analytically and numerically. Our results reveal a symmetry hidden in the Dirac spectra between two boundary conditions. Moreover, when the cavity is placed close to the event horizon $r_+$, we identify that, in the neutral background the Dirac spectra asymptote to $-(3/8+N/2)i$ [$-(1/8+N/2)i$] for the first [second] boundary condition; while in the charged background the real part of charged Dirac spectra asymptote to $qQ/r_+$ for both boundary conditions; where $N$ is the overtone number, $q$ and $Q$ are charges for the field and for the background. In particular, we uncover a striking anomalous decay pattern, $i.e.$ the excited modes decay \textit{slower} than the fundamental mode, when the charge coupling $qQ$ is large. Our results further illustrate the robustness of vanishing energy flux principle, which are applicable not only to anti-de Sitter black holes but also to black holes in a cavity.

gr-qc↗

arXiv2025

When Deepfake Detection Meets Graph Neural Network:a Unified and Lightweight Learning Framework

The proliferation of generative video models has made detecting AI-generated and manipulated videos an urgent challenge. Existing detection approaches often fail to generalize across diverse manipulation types due to their reliance on isolated spatial, temporal, or spectral information, and typically require large models to perform well. This paper introduces SSTGNN, a lightweight Spatial-Spectral-Temporal Graph Neural Network framework that represents videos as structured graphs, enabling joint reasoning over spatial inconsistencies, temporal artifacts, and spectral distortions. SSTGNN incorporates learnable spectral filters and spatial-temporal differential modeling into a unified graph-based architecture, capturing subtle manipulation traces more effectively. Extensive experiments on diverse benchmark datasets demonstrate that SSTGNN not only achieves superior performance in both in-domain and cross-domain settings, but also offers strong efficiency and resource allocation. Remarkably, SSTGNN accomplishes these results with up to 42$\times$ fewer parameters than state-of-the-art models, making it highly lightweight and resource-friendly for real-world deployment.

cs.CV↗

arXiv2025

MME-RAG: Multi-Manager-Expert Retrieval-Augmented Generation for Fine-Grained Entity Recognition in Task-Oriented Dialogues

Fine-grained entity recognition is crucial for reasoning and decision-making in task-oriented dialogues, yet current large language models (LLMs) continue to face challenges in domain adaptation and retrieval controllability. We introduce MME-RAG, a Multi-Manager-Expert Retrieval-Augmented Generation framework that decomposes entity recognition into two coordinated stages: type-level judgment by lightweight managers and span-level extraction by specialized experts. Each expert is supported by a KeyInfo retriever that injects semantically aligned, few-shot exemplars during inference, enabling precise and domain-adaptive extraction without additional training. Experiments on CrossNER, MIT-Movie, MIT-Restaurant, and our newly constructed multi-domain customer-service dataset demonstrate that MME-RAG performs better than recent baselines in most domains. Ablation studies further show that both the hierarchical decomposition and KeyInfo-guided retrieval are key drivers of robustness and cross-domain generalization, establishing MME-RAG as a scalable and interpretable solution for adaptive dialogue understanding.

cs.CL↗

arXiv2025

Right Answer at the Right Time - Temporal Retrieval-Augmented Generation via Graph Summarization

Question answering in temporal knowledge graphs requires retrieval that is both time-consistent and efficient. Existing RAG methods are largely semantic and typically neglect explicit temporal constraints, which leads to time-inconsistent answers and inflated token usage. We propose STAR-RAG, a temporal GraphRAG framework that relies on two key ideas: building a time-aligned rule graph and conducting propagation on this graph to narrow the search space and prioritize semantically relevant, time-consistent evidence. This design enforces temporal proximity during retrieval, reduces the candidate set of retrieval results, and lowers token consumption without sacrificing accuracy. Compared with existing temporal RAG approaches, STAR-RAG eliminates the need for heavy model training and fine-tuning, thereby reducing computational cost and significantly simplifying deployment.Extensive experiments on real-world temporal KG datasets show that our method achieves improved answer accuracy while consuming fewer tokens than strong GraphRAG baselines.

cs.IR↗

arXiv2025

Schramm-Loewner evolution contains a topological Sierpiński carpet when $κ$ is close to 8

We consider the Schramm-Loewner evolution (SLE$_κ$) for $κ\in (4,8)$, which is the regime where the curve is self-intersecting but not space-filling. We show that there exists $δ_0>0$ such that for $κ\in (8 - δ_0,8)$, the range of an SLE$_κ$ curve almost surely contains a topological Sierpiński carpet. Combined with a result of Ntalampekos (2021), this implies that in this parameter range, SLE$_κ$ is almost surely conformally non-removable, and the conformal welding problem for SLE$_κ$ does not have a unique solution. Our result also implies that for $κ\in (8 - δ_0,8)$, the adjacency graph of the complementary connected components of the SLE$_κ$ curve is disconnected.

math.PR↗

arXiv2025

Three-point connectivity constant for $q$-state Potts spin clusters

Recently, Ang--Cai--Sun--Wu (2024) determined the three-point connectivity constant for two-dimensional critical percolation, confirming a prediction of Delfino and Viti (2010). In this paper, we address the analogous problem for planar critical $q$-state Potts spin clusters. We introduce a continuum three-point connectivity constant and compute it explicitly. Under the scaling-limit conjecture for Potts spin clusters, this quantity coincides with the scaling limit of the properly normalized probability that three points lie in the same spin cluster. The resulting formula agrees with the imaginary DOZZ formula up to an explicit $q$-dependent constant with a geometric interpretation. This answers a question from Delfino--Picco--Santachiara--Viti (2013). The proof exploits the coupling between CLE and LQG, together with the BCLE descriptions of $q$-state Potts scaling limits due to Miller--Sheffield--Werner (2017) and Köhler-Schindler and Lehmkühler (2025).

math.PR↗

arXiv2025

MAIN: Mutual Alignment Is Necessary for instruction tuning

Instruction tuning has empowered large language models (LLMs) to achieve remarkable performance, yet its success heavily depends on the availability of large-scale, high-quality instruction-response pairs. To meet this demand, various methods have been developed to synthesize data at scale. However, current methods for scaling up data generation often overlook a crucial aspect: the alignment between instructions and responses. We hypothesize that the quality of instruction-response pairs is determined not by the individual quality of each component, but by the degree of mutual alignment. To address this, we propose a Mutual Alignment Framework (MAIN) which enforces coherence between instructions and responses through mutual constraints. We demonstrate that MAIN generalizes well across model architectures and sizes, achieving state-of-the-art performance on LLaMA, Mistral, and Qwen models across diverse benchmarks. This work underscores the critical role of instruction-response alignment in enabling generalizable and high-quality instruction tuning for LLMs. All code is available from our repository.

cs.CL↗

arXiv2025

A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness

With recent advancements in graph neural networks (GNNs), spectral GNNs have received increasing popularity by virtue of their ability to retrieve graph signals in the spectral domain. These models feature uniqueness in efficient computation as well as rich expressiveness, which stems from advanced management and profound understanding of graph data. However, few systematic studies have been conducted to assess spectral GNNs, particularly in benchmarking their efficiency, memory consumption, and effectiveness in a unified and fair manner. There is also a pressing need to select spectral models suitable for learning specific graph data and deploying them to massive web-scale graphs, which is currently constrained by the varied model designs and training settings. In this work, we extensively benchmark spectral GNNs with a focus on the spectral perspective, demystifying them as spectral graph filters. We analyze and categorize 35 GNNs with 27 corresponding filters, spanning diverse formulations and utilizations of the graph data. Then, we implement the filters within a unified spectral-oriented framework with dedicated graph computations and efficient training schemes. In particular, our implementation enables the deployment of spectral GNNs over million-scale graphs and various tasks with comparable performance and less overhead. Thorough experiments are conducted on the graph filters with comprehensive metrics on effectiveness and efficiency, offering novel observations and practical guidelines that are only available from our evaluations across graph scales. Different from the prevailing belief, our benchmark reveals an intricate landscape regarding the effectiveness and efficiency of spectral graph filters, demonstrating the potential to achieve desirable performance through tailored spectral manipulation of graph data.

cs.LG↗

arXiv2025

Co-persona: Leveraging LLMs and Expert Collaboration to Understand User Personas through Social Media Data Analysis

This study introduces Co-Persona, a methodological framework bridging large-scale social media analysis with authentic user understanding through systematic integration of Large Language Models and expert validation. Through a case study of B.Co, a Chinese manufacturer, we investigated Co-Persona application in bedside lamp development. Our methodology analyzed over 38 million posts from Xiao Hongshu, employing multi-stage data processing combining advanced NLP with expert validation. Analysis revealed five user personas derived from bedtime behaviors: Health Aficionados, Night Owls, Interior Decorators, Child-care Workers, and Workaholics-each showing unique pre-sleep activities and product preferences. Findings demonstrate Co-Persona enhances manufacturers' ability to process large datasets while maintaining user understanding. The methodology provides structured approaches for targeted marketing and product strategies. Research contributes to theoretical understanding of data-driven persona development and practical applications in consumer-driven innovation. Code and data available at https://github.com/INFPa/LLMwithPersona.

cs.HC↗

arXiv2025

Efficient Fine-Grained Guidance for Diffusion Model Based Symbolic Music Generation

Developing generative models to create or conditionally create symbolic music presents unique challenges due to the combination of limited data availability and the need for high precision in note pitch. To address these challenges, we introduce an efficient Fine-Grained Guidance (FGG) approach within diffusion models. FGG guides the diffusion models to generate music that aligns more closely with the control and intent of expert composers, which is critical to improve the accuracy, listenability, and quality of generated music. This approach empowers diffusion models to excel in advanced applications such as improvisation, and interactive music creation. We derive theoretical characterizations for both the challenges in symbolic music generation and the effects of the FGG approach. We provide numerical experiments and subjective evaluation to demonstrate the effectiveness of our approach. We have published a demo page to showcase performances, which enables real-time interactive generation.

cs.SD↗

arXiv2025

IDA-Bench: Evaluating LLMs on Interactive Guided Data Analysis

Large Language Models (LLMs) show promise as data analysis agents, but existing benchmarks overlook the iterative nature of the field, where experts' decisions evolve with deeper insights of the dataset. To address this, we introduce IDA-Bench, a novel benchmark evaluating LLM agents in multi-round interactive scenarios. Derived from complex Kaggle notebooks, tasks are presented as sequential natural language instructions by an LLM-simulated user. Agent performance is judged by comparing its final numerical output to the human-derived baseline. Initial results show that even state-of-the-art coding agents (like Claude-3.7-thinking) succeed on < 50% of the tasks, highlighting limitations not evident in single-turn tests. This work underscores the need to improve LLMs' multi-round capabilities for building more reliable data analysis agents, highlighting the necessity of achieving a balance between instruction following and reasoning.

cs.CL↗

arXiv2025

Empowering Economic Simulation for Massively Multiplayer Online Games through Generative Agent-Based Modeling

Within the domain of Massively Multiplayer Online (MMO) economy research, Agent-Based Modeling (ABM) has emerged as a robust tool for analyzing game economics, evolving from rule-based agents to decision-making agents enhanced by reinforcement learning. Nevertheless, existing works encounter significant challenges when attempting to emulate human-like economic activities among agents, particularly regarding agent reliability, sociability, and interpretability. In this study, we take a preliminary step in introducing a novel approach using Large Language Models (LLMs) in MMO economy simulation. Leveraging LLMs' role-playing proficiency, generative capacity, and reasoning aptitude, we design LLM-driven agents with human-like decision-making and adaptability. These agents are equipped with the abilities of role-playing, perception, memory, and reasoning, addressing the aforementioned challenges effectively. Simulation experiments focusing on in-game economic activities demonstrate that LLM-empowered agents can promote emergent phenomena like role specialization and price fluctuations in line with market rules.

cs.AI↗

arXiv2025

GeAR: Generation Augmented Retrieval

Document retrieval techniques are essential for developing large-scale information systems. The common approach involves using a bi-encoder to compute the semantic similarity between a query and documents. However, the scalar similarity often fail to reflect enough information, hindering the interpretation of retrieval results. In addition, this process primarily focuses on global semantics, overlooking the finer-grained semantic relationships between the query and the document's content. In this paper, we introduce a novel method, $\textbf{Ge}$neration $\textbf{A}$ugmented $\textbf{R}$etrieval ($\textbf{GeAR}$), which not only improves the global document-query similarity through contrastive learning, but also integrates well-designed fusion and decoding modules. This enables GeAR to generate relevant context within the documents based on a given query, facilitating learning to retrieve local fine-grained information. Furthermore, when used as a retriever, GeAR does not incur any additional computational cost over bi-encoders. GeAR exhibits competitive retrieval performance across diverse scenarios and tasks. Moreover, qualitative analysis and the results generated by GeAR provide novel insights into the interpretation of retrieval results. The code, data, and models will be released at \href{https://github.com/microsoft/LMOps}{https://github.com/microsoft/LMOps}.

cs.IR↗

arXiv2025

Electrical Detection of Single-Domain Néel Vector Reorientation across the Spin-Flop Transition in Cr2O3 Crystals

Electrical transport measurements in heterostructures of antiferromagnetic Cr2O3 bulk crystals and a thin Pt layer exhibit sharp responses as the Néel vector of the Cr2O3 undergoes the spin-flop transition. This abrupt change can arise from several distinct mechanisms including magnetostriction, proximity-induced anomalous Hall, spin Hall anomalous Hall, and spin Hall planar Hall effects. While large Pt devices sensing multiple up/down domains can produce indistinguishable Hall signal jumps due to different initial Néel vector orientations, smaller Pt devices that sense single domains isolate the proximity-induced Hall signals. This allows direct electrical detection of Néel vector reorientation across the spin-flop transition in single domain regions. Furthermore, the single-domain state can be prepared by magnetic field cooling or magnetoelectric cooling. We demonstrate a method to control and characterize almost the three-dimensional orientation of single-domain Néel vectors by exploiting Hall measurements and cooling techniques, crucial for future antiferromagnetic spintronic applications.

cond-mat.mtrl-sci↗

arXiv2025

Disorder-Induced Suppression of Antiferromagnetic Magnon Transport in Cr2O3

We explore the impact of spin disorder associated with structural defects on antiferromagnetic magnon transport by probing the spin-flop transition of Cr2O3 using spin Seebeck effect measurements. By fabricating homoepitaxial Cr2O3 films grown on smooth Cr2O3 crystals, we systematically vary the thickness of the films in which the presence of point defects modulates the spin-flop transition field. We find that magnon propagation through the film is entirely suppressed for film thickness greater than 3 nm, revealing the pivotal role of disorder in governing antiferromagnetic magnon transport.

cond-mat.mtrl-sci↗

arXiv2025

Software Architecture Meets LLMs: A Systematic Literature Review

Large Language Models (LLMs) are used for many different software engineering tasks. In software architecture, they have been applied to tasks such as classification of design decisions, detection of design patterns, and generation of software architecture design from requirements. However, there is little overview on how well they work, what challenges exist, and what open problems remain. In this paper, we present a systematic literature review on the use of LLMs in software architecture. We analyze 18 research articles to answer five research questions, such as which software architecture tasks LLMs are used for, how much automation they provide, which models and techniques are used, and how these approaches are evaluated. Our findings show that while LLMs are increasingly applied to a variety of software architecture tasks and often outperform baselines, some areas, such as generating source code from architectural design, cloud-native computing and architecture, and checking conformance remain underexplored. Although current approaches mostly use simple prompting techniques, we identify a growing research interest in refining LLM-based approaches by integrating advanced techniques.

cs.SE↗

arXiv2025

Anisotropic Field Suppression of Morin Transition Temperature in Epitaxially Grown Hematite Thin Films

We have demonstrated the existence of the Morin transition in epitaxially grown hematite thin films exceeding a critical thickness. The Morin transition temperature can be suppressed by magnetic fields applied both parallel and perpendicular to the Dzyaloshinskii-Moriya (DM) vector, exhibiting a distinct anisotropic behavior that is consistent with bulk hematite crystals. Detailed analysis explains the anisotropic behavior and provides a method for determining the DM strength, which remains nearly constant across the sample thickness over four orders of magnitude. Our findings obtained with transport measurements offer a valuable approach for studying antiferromagnetic spin configurations in thin films and nanodevices.

cond-mat.mtrl-sci↗