arXiv subjects

Xinyue Wang

Publications and source records attributed to Xinyue Wang.

At least 37 records · Page 2Linked to original sources

arXiv2026

From Classification to Ranking: Enhancing LLM Reasoning Capabilities for MBTI Personality Detection

Personality detection aims to measure an individual's corresponding personality traits through their social media posts. The advancements in Large Language Models (LLMs) offer novel perspectives for personality detection tasks. Existing approaches enhance personality trait analysis by leveraging LLMs to extract semantic information from textual posts as prompts, followed by training classifiers for categorization. However, accurately classifying personality traits remains challenging due to the inherent complexity of human personality and subtle inter-trait distinctions. Moreover, prompt-based methods often exhibit excessive dependency on expert-crafted knowledge without autonomous pattern-learning capacity. To address these limitations, we view personality detection as a ranking task rather than a classification and propose a corresponding reinforcement learning training paradigm. First, we employ supervised fine-tuning (SFT) to establish personality trait ranking capabilities while enforcing standardized output formats, creating a robust initialization. Subsequently, we introduce Group Relative Policy Optimization (GRPO) with a specialized ranking-based reward function. Unlike verification tasks with definitive solutions, personality assessment involves subjective interpretations and blurred boundaries between trait categories. Our reward function explicitly addresses this challenge by training LLMs to learn optimal answer rankings. Comprehensive experiments have demonstrated that our method achieves state-of-the-art performance across multiple personality detection benchmarks.

cs.CL↗

arXiv2026

Transformer Is Inherently a Causal Learner

We reveal that transformers trained in an autoregressive manner naturally encode time-delayed causal structures in their learned representations. When predicting future values in multivariate time series, the gradient sensitivities of transformer outputs with respect to past inputs directly recover the underlying causal graph, without any explicit causal objectives or structural constraints. We prove this connection theoretically under standard identifiability conditions and develop a practical extraction method using aggregated gradient attributions. On challenging cases such as nonlinear dynamics, long-term dependencies, and non-stationary systems, this approach greatly surpasses the performance of state-of-the-art discovery algorithms, especially as data heterogeneity increases, exhibiting scaling potential where causal accuracy improves with data volume and heterogeneity, a property traditional methods lack. This unifying view lays the groundwork for a future paradigm where causal discovery operates through the lens of foundation models, and foundation models gain interpretability and enhancement through the lens of causality.

cs.LG↗

arXiv2025

ESMC: MLLM-Based Embedding Selection for Explainable Multiple Clustering

Typical deep clustering methods, while achieving notable progress, can only provide one clustering result per dataset. This limitation arises from their assumption of a fixed underlying data distribution, which may fail to meet user needs and provide unsatisfactory clustering outcomes. Our work investigates how multi-modal large language models (MLLMs) can be leveraged to achieve user-driven clustering, emphasizing their adaptability to user-specified semantic requirements. However, directly using MLLM output for clustering has risks for producing unstructured and generic image descriptions instead of feature-specific and concrete ones. To address these issues, our method first discovers that MLLMs' hidden states of text tokens are strongly related to the corresponding features, and leverages these embeddings to perform clusterings from any user-defined criteria. We also employ a lightweight clustering head augmented with pseudo-label learning, significantly enhancing clustering accuracy. Extensive experiments demonstrate its competitive performance on diverse datasets and metrics.

cs.LG↗

arXiv2025

Boost of critical current density near quantum critical points in FeSe-Based superconductors with two superconducting domes

Recent studies have identified two superconducting domes in FeSe-based superconductors. It was discovered that each dome is accompanied by a distinct nematic quantum critical point (QCP): one associated with a pure nematic QCP, and the other with a nematic QCP entangled with antiferromagnetism (AFM). In this study, we delve into the evolution of the critical current density ($J_{\rm{c}}$) with doping in FeSe${_{1-x}}$(Te/S)${_{x}}$ single crystals, focusing on the behavior within the two superconducting domes. Surprisingly, three maxima of $J_{\rm{c}}$ were found in the two superconducting domes, with two sharp peaks in $J_{\rm{c}}$ observed precisely at the endpoints of the nematic phases, at $x$(Te) $\sim$ 0.5 for Te-doped and $x$(S) $\sim$ 0.17 for S-doped FeSe. The mechanisms of vortex pinning and the influence of quantum critical fluctuations have been extensively explored, emphasizing the contribution of quantum critical fluctuations in modulating $J_{\rm{c}}$. Additionally, an increase in $J_{\rm{c}}$ was also noted near FeSe$_{0.1}$Te$_{0.9}$, where its origin has been explored and discussed. This finding provides crucial clues about the existence of an ordered phase endpoint beneath the superconducting dome, offering an initial basis for further investigation into the potential presence of a QCP beneath it.

cond-mat.supr-con↗

arXiv2025

Increase of critical current density in FeSe superconductor by strain effect

Conventional $J_c$-enhancement methods like doping and irradiation often introduce extrinsic elements or defects, altering intrinsic properties. Here, we report a significant $J_c$ enhancement in FeSe single crystals through compressive strain applied using a glass-fiber-reinforced plastic substrate with anisotropic thermal contraction during cooling. Under zero field at 2 K, $J_{\text{c}}$ increases by a factor of $\sim$4 from $\sim 2.3 \times 10^{4}$ to $\sim 8.7 \times 10^{4}$ A cm$^{-2}$; at 5 T, it achieves an order-of-magnitude enhancement, rising from $\sim 1.0 \times 10^{3}$ to $\sim 1.0 \times 10^{4}$ A cm$^{-2}$. Analysis based on the Dew-Hughes model of the $f_{\text{p}}$(h) relationship shows that strain strengthens vortex pinning, and shifts the pinning mechanism from point-like pinning to combined point and surface pinnings. This work offers an effective method to enhance FeSe's current-carrying limitation, deepens understanding of iron-based superconductors' pinning mechanisms, and highlights strain engineering's potential for optimizing superconducting performance.

cond-mat.supr-con↗

arXiv2025

AIRepr: An Analyst-Inspector Framework for Evaluating Reproducibility of LLMs in Data Science

Large language models (LLMs) are increasingly used to automate data analysis through executable code generation. Yet, data science tasks often admit multiple statistically valid solutions, e.g. different modeling strategies, making it critical to understand the reasoning behind analyses, not just their outcomes. While manual review of LLM-generated code can help ensure statistical soundness, it is labor-intensive and requires expertise. A more scalable approach is to evaluate the underlying workflows-the logical plans guiding code generation. However, it remains unclear how to assess whether an LLM-generated workflow supports reproducible implementations. To address this, we present AIRepr, an Analyst-Inspector framework for automatically evaluating and improving the reproducibility of LLM-generated data analysis workflows. Our framework is grounded in statistical principles and supports scalable, automated assessment. We introduce two novel reproducibility-enhancing prompting strategies and benchmark them against standard prompting across 15 analyst-inspector LLM pairs and 1,032 tasks from three public benchmarks. Our findings show that workflows with higher reproducibility also yield more accurate analyses, and that reproducibility-enhancing prompts substantially improve both metrics. This work provides a foundation for transparent, reliable, and efficient human-AI collaboration in data science. Our code is publicly available.

cs.LG↗

arXiv2025

ATM-GAD: Adaptive Temporal Motif Graph Anomaly Detection for Financial Transaction Networks

Financial fraud detection is essential to safeguard billions of dollars, yet the intertwined entities and fast-changing transaction behaviors in modern financial systems routinely defeat conventional machine learning models. Recent graph-based detectors make headway by representing transactions as networks, but they still overlook two fraud hallmarks rooted in time: (1) temporal motifs--recurring, telltale subgraphs that reveal suspicious money flows as they unfold--and (2) account-specific intervals of anomalous activity, when fraud surfaces only in short bursts unique to each entity. To exploit both signals, we introduce ATM-GAD, an adaptive graph neural network that leverages temporal motifs for financial anomaly detection. A Temporal Motif Extractor condenses each account's transaction history into the most informative motifs, preserving both topology and temporal patterns. These motifs are then analyzed by dual-attention blocks: IntraA reasons over interactions within a single motif, while InterA aggregates evidence across motifs to expose multi-step fraud schemes. In parallel, a differentiable Adaptive Time-Window Learner tailors the observation window for every node, allowing the model to focus precisely on the most revealing time slices. Experiments on four real-world datasets show that ATM-GAD consistently outperforms seven strong anomaly-detection baselines, uncovering fraud patterns missed by earlier methods.

cs.LG↗

arXiv2025

WebGeoInfer: A Structure-Free and Multi-Stage Framework for Geolocation Inference of Devices Exposing Information

Remote management devices facilitate critical infrastructure monitoring for administrators but simultaneously increase asset exposure. Sensitive geographical information overlooked in exposed device management pages poses substantial security risks. Therefore, identifying devices that reveal location information due to administrator negligence is crucial for cybersecurity regulation. Despite the rich information exposed by web interfaces of remote management devices, automatically discovering geographical locations remains challenging due to unstructured formats, varying styles, and incomplete geographical details. This study introduces WebGeoInfer, a structure-free geolocation inference framework utilizing multi-stage information enhancement. WebGeoInfer clusters similar device web pages and analyzes inter-cluster differences to extract potential geographical information, bypassing structural limitations. Through search engine enhancement and Large Language Models mining, the framework extracts geographical coordinates from identified information. WebGeoInfer successfully inferred locations for 5,435 devices across 94 countries and 2,056 cities, achieving accuracy rates of 96.96\%, 88.05\%, and 79.70\% at country, city, and street levels, respectively.

cs.CR↗

arXiv2025

Crabs: Consuming Resource via Auto-generation for LLM-DoS Attack under Black-box Settings

Large Language Models (LLMs) have demonstrated remarkable performance across diverse tasks yet still are vulnerable to external threats, particularly LLM Denial-of-Service (LLM-DoS) attacks. Specifically, LLM-DoS attacks aim to exhaust computational resources and block services. However, existing studies predominantly focus on white-box attacks, leaving black-box scenarios underexplored. In this paper, we introduce Auto-Generation for LLM-DoS (AutoDoS) attack, an automated algorithm designed for black-box LLMs. AutoDoS constructs the DoS Attack Tree and expands the node coverage to achieve effectiveness under black-box conditions. By transferability-driven iterative optimization, AutoDoS could work across different models in one prompt. Furthermore, we reveal that embedding the Length Trojan allows AutoDoS to bypass existing defenses more effectively. Experimental results show that AutoDoS significantly amplifies service response latency by over 250$\times\uparrow$, leading to severe resource consumption in terms of GPU utilization and memory usage. Our work provides a new perspective on LLM-DoS attacks and security defenses. Our code is available at https://github.com/shuita2333/AutoDoS.

cs.CL↗

arXiv2025

$PD^3F$: A Pluggable and Dynamic DoS-Defense Framework Against Resource Consumption Attacks Targeting Large Language Models

Large Language Models (LLMs), due to substantial computational requirements, are vulnerable to resource consumption attacks, which can severely degrade server performance or even cause crashes, as demonstrated by denial-of-service (DoS) attacks designed for LLMs. However, existing works lack mitigation strategies against such threats, resulting in unresolved security risks for real-world LLM deployments. To this end, we propose the Pluggable and Dynamic DoS-Defense Framework ($PD^3F$), which employs a two-stage approach to defend against resource consumption attacks from both the input and output sides. On the input side, we propose the Resource Index to guide Dynamic Request Polling Scheduling, thereby reducing resource usage induced by malicious attacks under high-concurrency scenarios. On the output side, we introduce the Adaptive End-Based Suppression mechanism, which terminates excessive malicious generation early. Experiments across six models demonstrate that $PD^3F$ significantly mitigates resource consumption attacks, improving users' access capacity by up to 500% during adversarial load. $PD^3F$ represents a step toward the resilient and resource-aware deployment of LLMs against resource consumption attacks.

cs.CR↗

arXiv2025

Modeling Unseen Environments with Language-guided Composable Causal Components in Reinforcement Learning

Generalization in reinforcement learning (RL) remains a significant challenge, especially when agents encounter novel environments with unseen dynamics. Drawing inspiration from human compositional reasoning -- where known components are reconfigured to handle new situations -- we introduce World Modeling with Compositional Causal Components (WM3C). This novel framework enhances RL generalization by learning and leveraging compositional causal components. Unlike previous approaches focusing on invariant representation learning or meta-learning, WM3C identifies and utilizes causal dynamics among composable elements, facilitating robust adaptation to new tasks. Our approach integrates language as a compositional modality to decompose the latent space into meaningful components and provides theoretical guarantees for their unique identification under mild assumptions. Our practical implementation uses a masked autoencoder with mutual information constraints and adaptive sparsity regularization to capture high-level semantic information and effectively disentangle transition dynamics. Experiments on numerical simulations and real-world robotic manipulation tasks demonstrate that WM3C significantly outperforms existing methods in identifying latent processes, improving policy learning, and generalizing to unseen tasks.

cs.AI↗

arXiv2025

Predicting Diabetic Macular Edema Treatment Responses Using OCT: Dataset and Methods of APTOS Competition

Diabetic macular edema (DME) significantly contributes to visual impairment in diabetic patients. Treatment responses to intravitreal therapies vary, highlighting the need for patient stratification to predict therapeutic benefits and enable personalized strategies. To our knowledge, this study is the first to explore pre-treatment stratification for predicting DME treatment responses. To advance this research, we organized the 2nd Asia-Pacific Tele-Ophthalmology Society (APTOS) Big Data Competition in 2021. The competition focused on improving predictive accuracy for anti-VEGF therapy responses using ophthalmic OCT images. We provided a dataset containing tens of thousands of OCT images from 2,000 patients with labels across four sub-tasks. This paper details the competition's structure, dataset, leading methods, and evaluation metrics. The competition attracted strong scientific community participation, with 170 teams initially registering and 41 reaching the final round. The top-performing team achieved an AUC of 80.06%, highlighting the potential of AI in personalized DME treatment and clinical decision-making.

eess.IV↗

arXiv2025

Causal-Copilot: An Autonomous Causal Analysis Agent

Causal analysis plays a foundational role in scientific discovery and reliable decision-making, yet it remains largely inaccessible to domain experts due to its conceptual and algorithmic complexity. This disconnect between causal methodology and practical usability presents a dual challenge: domain experts are unable to leverage recent advances in causal learning, while causal researchers lack broad, real-world deployment to test and refine their methods. To address this, we introduce Causal-Copilot, an autonomous agent that operationalizes expert-level causal analysis within a large language model framework. Causal-Copilot automates the full pipeline of causal analysis for both tabular and time-series data -- including causal discovery, causal inference, algorithm selection, hyperparameter optimization, result interpretation, and generation of actionable insights. It supports interactive refinement through natural language, lowering the barrier for non-specialists while preserving methodological rigor. By integrating over 20 state-of-the-art causal analysis techniques, our system fosters a virtuous cycle -- expanding access to advanced causal methods for domain experts while generating rich, real-world applications that inform and advance causal theory. Empirical evaluations demonstrate that Causal-Copilot achieves superior performance compared to existing baselines, offering a reliable, scalable, and extensible solution that bridges the gap between theoretical sophistication and real-world applicability in causal analysis. A live interactive demo of Causal-Copilot is available at https://causalcopilot.com/.

cs.AI↗

arXiv2025

Astrometric Measurements and Analysis of Double Star System BRT 376

Using new telescope images and archival data, we investigated the positions and motions of the stars in double star system 06160-0745 BRT 376. We found that the two stars share nearly identical parallaxes and exhibit a low relative proper motion, suggesting they move together through space. Furthermore, their combined 3D velocity is less than the calculated escape velocity, indicating they are gravitationally bound rather than just physically near each other. These findings point to 06160-0745 BRT 376 being a true binary system. Future observations will help refine our understanding of its orbital path and further illuminate the nature of stars in close, interacting pairs.

astro-ph.SR↗

arXiv2025

Dimensionality Enhanced Out-of-Plane Spin Currents in NbIrTe$_4$ for Efficient Field-Free Switching of Perpendicular Magnetization

Efficient generation of out-of-plane (OOP) spin currents is crucial for advanced spintronic memory applications. However, the theoretical understanding and experimental implementation of robust OOP spin currents for high-density and low-power magnetization switching remain significant challenges of spintronics. Here, we demonstrate that transitioning NbIrTe$_4$ from a two-dimensional quantum spin Hall insulator to a three-dimensional type-II Weyl semimetal markedly enhances OOP spin current generation. The bulk topological Weyl semimetal nature of NbIrTe$_4$, characterized by its Weyl cone, significantly enhances the OOP spin Berry curvature, enabling an unprecedented OOP spin Hall conductivity exceeding $10^5\hbar/2e$ $Ω^{-1}m^{-1} $. This enhancement, surpassing the in-plane component by more than fourfold, enables efficient and field-free spin-orbit torque (SOT) switching of perpendicular magnetization with a low current density of 1.4 MA/cm$^2$. The improved spin Hall conductivity reduces the overall power consumption by more than two orders of magnitude compared to existing systems, such as heavy metals. Our findings highlight the pivotal role of dimensionality in harnessing robust OOP spin currents in topological Weyl semimetals, paving the way for the development of high-density, low-power spintronic memory technologies.

cond-mat.mes-hall↗

arXiv2025

Strong correlation between $H$-linear magnetoresistance and strange metal in FeSe superconductor

In strange metals, a strong and anomalous scattering effect exists and increases linearly with temperature. In FeSe, we observed that the temperature dependence of resistivity exhibits non-Fermi liquid behavior in two regions below and above a critical pressure, $p_\text{c}$$\sim$2 GPa. As pressure increases, a transition from quadratic to nonsaturating magnetoresistance is observed, with a distinct crossover between these two behaviors indicated by $B^{*}$ in the derivative analysis. After subtracting the quadratic term from the magnetoresistance, the residual magnetoresistance clearly exhibits an $H$-linear behavior. Additionally, two segments of $H$-inear magnetoresistance appear with increasing pressure, each arising from distinct origins. Notably, the two $H$-linear magnetoresistances exist and develop within the strange metal states. These results suggest that $H$-linear magnetoresistance is in strong correlation with the strange metal state, which may affect superconductivity in FeSe under pressure. Our study provides valuable insights into the strange metal state and clues for underlying unconventional superconductivity.

cond-mat.supr-con↗

arXiv2025

Diffusion Transformer Meets Random Masks: An Advanced PET Reconstruction Framework

Deep learning has significantly advanced PET image re-construction, achieving remarkable improvements in image quality through direct training on sinogram or image data. Traditional methods often utilize masks for inpainting tasks, but their incorporation into PET reconstruction frameworks introduces transformative potential. In this study, we pro-pose an advanced PET reconstruction framework called Diffusion tRansformer mEets rAndom Masks (DREAM). To the best of our knowledge, this is the first work to integrate mask mechanisms into both the sinogram domain and the latent space, pioneering their role in PET reconstruction and demonstrating their ability to enhance reconstruction fidelity and efficiency. The framework employs a high-dimensional stacking approach, transforming masked data from two to three dimensions to expand the solution space and enable the model to capture richer spatial rela-tionships. Additionally, a mask-driven latent space is de-signed to accelerate the diffusion process by leveraging sinogram-driven and mask-driven compact priors, which reduce computational complexity while preserving essen-tial data characteristics. A hierarchical masking strategy is also introduced, guiding the model from focusing on fi-ne-grained local details in the early stages to capturing broader global patterns over time. This progressive ap-proach ensures a balance between detailed feature preservation and comprehensive context understanding. Experimental results demonstrate that DREAM not only improves the overall quality of reconstructed PET images but also preserves critical clinical details, highlighting its potential to advance PET imaging technology. By inte-grating compact priors and hierarchical masking, DREAM offers a promising and efficient avenue for future research and application in PET imaging. The open-source code is available at: https://github.com/yqx7150/DREAM.

cs.CV↗

arXiv2025

Towards Generalizable Reinforcement Learning via Causality-Guided Self-Adaptive Representations

General intelligence requires quick adaption across tasks. While existing reinforcement learning (RL) methods have made progress in generalization, they typically assume only distribution changes between source and target domains. In this paper, we explore a wider range of scenarios where not only the distribution but also the environment spaces may change. For example, in the CoinRun environment, we train agents from easy levels and generalize them to difficulty levels where there could be new enemies that have never occurred before. To address this challenging setting, we introduce a causality-guided self-adaptive representation-based approach, called CSR, that equips the agent to generalize effectively across tasks with evolving dynamics. Specifically, we employ causal representation learning to characterize the latent causal variables within the RL system. Such compact causal representations uncover the structural relationships among variables, enabling the agent to autonomously determine whether changes in the environment stem from distribution shifts or variations in space, and to precisely locate these changes. We then devise a three-step strategy to fine-tune the causal model under different scenarios accordingly. Empirical experiments show that CSR efficiently adapts to the target domains with only a few samples and outperforms state-of-the-art baselines on a wide range of scenarios, including our simulated environments, CartPole, CoinRun and Atari games.

cs.LG↗