arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 595 records · Page 33Linked to original sources

arXiv2025

Exploring the Complex Landscape of Entropy Stabilized Oxides

Entropy-stabilized oxides (ESOs), driven by high configurational entropy, have gained phenomenological research interest due to their potential for tailoring structure property relationships. However, the chemical short range ordering (SRO) and its interplay with local lattice distortion (LD) remain to be explored, although they could diminish the configurational entropy and potentially impact structure property relationships. A combination of experimental and theoretical approaches are employed to investigate the SRO and LD in the prototype ESO, Mg0.2Co0.2Ni0.2Cu0.2Zn0.2O, generally referred to as J14. We demonstrate that the efficiency and accuracy of density functional theory (DFT) relaxed special quasirandom structures (SQS) enhances the analysis of the local structure of J14, unveiling the unique local cationic environments. Importantly, this joint experimental and computational approach sheds light on the understanding of local structure and structure property relationships in J14, demonstrating the necessity for further research into other high entropy and compositionally complex materials.

cond-mat.mtrl-sci↗

arXiv2025

A Reinforcement Learning-Driven Task Scheduling Algorithm for Multi-Tenant Distributed Systems

This paper addresses key challenges in task scheduling for multi-tenant distributed systems, including dynamic resource variation, heterogeneous tenant demands, and fairness assurance. An adaptive scheduling method based on reinforcement learning is proposed. By modeling the scheduling process as a Markov decision process, the study defines the state space, action space, and reward function. A scheduling policy learning framework is designed using Proximal Policy Optimization (PPO) as the core algorithm. This enables dynamic perception of complex system states and real-time decision-making. Under a multi-objective reward mechanism, the scheduler jointly optimizes task latency, resource utilization, and tenant fairness. The coordination between the policy network and the value network continuously refines the scheduling strategy. This enhances overall system performance. To validate the effectiveness of the proposed method, a series of experiments were conducted in multi-scenario environments built using a real-world public dataset. The experiments evaluated task latency control, resource efficiency, policy stability, and fairness. The results show that the proposed method outperforms existing scheduling approaches across multiple evaluation metrics. It demonstrates strong stability and generalization ability. The proposed scheduling framework provides practical and engineering value in policy design, dynamic resource modeling, and multi-tenant service assurance. It effectively improves scheduling efficiency and resource management in distributed systems under complex conditions.

cs.DC↗

arXiv2025

Multi-View Clustering Meets Heterogenous Data: A Fusion Regularized Method

Multi-view clustering leverages consistent and complementary information across multiple views to provide more comprehensive insights than single-view analysis. However, the heterogeneity and redundancy of multi-view data pose significant challenges to the existing clustering techniques. To tackle these challenges effectively, this paper proposes a novel multi-view fusion regularized clustering method with adaptive group sparsity, enabling discriminative clustering while capturing informative features. Technically, for heterogeneous multi-view data with mixed-type feature sets, different losses or divergence metrics are considered with a joint fusion penalty to obtain consistent cluster structures. Moreover, the non-convex group sparsity consisting of inter-group sparsity and intra-group sparsity is utilized to eliminate redundant features, thereby enhancing the robustness. Furthermore, we develop an effective alternating direction method of multipliers (ADMM), where all subproblems can be solved in closed form. Extensive numerical experiments on real data validate the superior performance of our presented method in clustering accuracy and feature selection.

math.OC↗

arXiv2025

Prediction of high-frequency futures return directions based on the mean uncertainty classification methods: An application in China's future market

In this paper, we mainly focus on the prediction of short-term average return directions in China's high-frequency futures market. As minor fluctuations with limited amplitude and short duration are typically regarded as random noise, only price movements of sufficient magnitude qualify as statistically significant signals. Therefore data imbalance emerges as a key problem during predictive modeling. From the view of data distribution imbalance, we employee the mean-uncertainty logistic regression (mean-uncertainty LR) classification method under the sublinear expectation (SLE) framework, and further propose the mean-uncertainty support vector machines (mean-uncertainty SVM) method for the prediction. Corresponding investment strategies are developed based on the prediction results. For data selection, we utilize trading data and limit order book data of the top 15 liquid products among the most active contracts in China's future market. Empirical results demonstrate that comparing with conventional LR-related and SVM-related imbalanced data classification methods, the two mean-uncertainty approaches yields significant advantages in both classification metrics and average returns per trade.

q-fin.TR↗

arXiv2025

Fixed-Time Voltage Regulation for Boost Converters via Unit-Safe Saturating Functions

This paper explores the voltage regulation challenges in boost converter systems, which are critical components in power electronics due to their ability to step up voltage levels efficiently. The proposed control algorithm ensures fixed-time stability, a desirable property that guarantees system stability within a fixed time frame regardless of initial conditions. To tackle the common chattering issues in conventional fixed-time control methods, a novel class of function families is introduced. State observers and adaptive parameters are utilized to manage the uncertainties associated with unknown load resistance. Furthermore, a new disturbance observer is developed using the proposed function family, and its advantages and limitations are illustrated through comparison with existing designs. Finally, both non-real-time and real-time simulations are conducted to validate the effectiveness and deployability of the proposed control algorithm.

eess.SY↗

arXiv2025

Temporal Self-Rewarding Language Models: Decoupling Chosen-Rejected via Past-Future

Self-Rewarding Language Models propose an architecture in which the Large Language Models(LLMs) both generates responses and evaluates its own outputs via LLM-as-a-Judge prompting, dynamically improving its generative capabilities through iterative Direct Preference Optimization (DPO). However, our analysis reveals a critical limitation in existing Self-Rewarding paradigms: the synchronized improvement of chosen and rejected responses progressively narrows the representational difference between contrasting samples, undermining effective preference learning. We propose \textbf{Temporal Self-Rewarding Language Models} that strategically coordinate past, present, and future model generations to sustain learning signals. Our dual-phase framework introduces: (1) \textit{Anchored Rejection} - fixing rejected responses using the past initial model's outputs and (2) \textit{Future-Guided Chosen} - dynamically curating chosen samples using next-generation model predictions. Extensive experiments across three model families (Llama, Qwen, Mistral) and different model sizes (Llama3B/8B/70B) demonstrate significant improvements when trained with our method compared to Self-Rewarding using same computation resources. For example, Llama3.1-8B reaches a 29.44 win rate on AlpacaEval 2.0 with our method, outperforming the Self-Rewarding baseline (19.69) by 9.75. Notably, our method also demonstrates superior out-of-distribution generalization across mathematical reasoning (GSM8K), knowledge-based QA (ARC, TruthfulQA), and code generation (HumanEval) tasks, even though we do not specifically collect such training data.

cs.CL↗

arXiv2025

SafeWork-R1: Coevolving Safety and Intelligence under the AI-45$^{\circ}$ Law

We introduce SafeWork-R1, a cutting-edge multimodal reasoning model that demonstrates the coevolution of capabilities and safety. It is developed by our proposed SafeLadder framework, which incorporates large-scale, progressive, safety-oriented reinforcement learning post-training, supported by a suite of multi-principled verifiers. Unlike previous alignment methods such as RLHF that simply learn human preferences, SafeLadder enables SafeWork-R1 to develop intrinsic safety reasoning and self-reflection abilities, giving rise to safety `aha' moments. Notably, SafeWork-R1 achieves an average improvement of $46.54\%$ over its base model Qwen2.5-VL-72B on safety-related benchmarks without compromising general capabilities, and delivers state-of-the-art safety performance compared to leading proprietary models such as GPT-4.1 and Claude Opus 4. To further bolster its reliability, we implement two distinct inference-time intervention methods and a deliberative search mechanism, enforcing step-level verification. Finally, we further develop SafeWork-R1-InternVL3-78B, SafeWork-R1-DeepSeek-70B, and SafeWork-R1-Qwen2.5VL-7B. All resulting models demonstrate that safety and capability can co-evolve synergistically, highlighting the generalizability of our framework in building robust, reliable, and trustworthy general-purpose AI.

cs.AI↗

arXiv2025

A 13-Billion-Year View of Galaxy Growth: Metallicity Gradient Evolution from the Local Universe to $z=9$ with JWST and Archival Surveys

The galaxy gas-phase metallicity gradients have been extensively studied over the past four decades, both in the local and high-redshift universe, as they trace the baryon cycle and growth of galaxies. With the unprecedented spatial resolution and sensitivity of JWST, it is now possible to measure metallicity and its radial gradients out to redshifts as high as $z = 9$. Here, we present a sample of 455 spectroscopically confirmed galaxies from redshifts $1.7 \lesssim z \lesssim 9$ that are spatially resolved on sub-kiloparsec (kpc) scales by deep JWST NIRCam or NIRISS Wide Field Slitless Spectroscopy (WFSS). Synthesizing these new JWST observations with legacy observations from the literature, we observe that at redshift $z > 5$, galaxy centers are more metal-rich, exhibiting negative metallicity gradients of $\sim-0.4$ dex kpc$^{-1}$. These gradients flatten over time, reaching near-zero around $z \approx 2$, coinciding with the peak of the cosmic star formation rate. Beyond this point, the gradients become negative again at lower redshifts approaching $z=0$. This evolution likely reflects transitions in galaxy formation modes: an inside-out growth phase dominated by intense central star formation with inefficient feedback and limited gas mixing during ``cosmic dawn", enhanced gas mixing due to feedback-driven wind and gas accretion at ``cosmic noon", and a later phase of slow evolution and reduced feedback toward the present day. These physical processes, including gas accretion and feedback, not only regulate star and galaxy formation on a cosmic scale but also shape the evolutionary pathways of individual galaxies over cosmic time.

astro-ph.GA↗

arXiv2025

LCQNN: Linear Combination of Quantum Neural Networks

Quantum neural networks combine quantum computing with advanced data-driven methods, offering promising applications in quantum machine learning. However, the optimal paradigm for balancing trainability and expressivity in QNNs remains an open question. To address this, we introduce the Linear Combination of Quantum Neural Networks (LCQNN) framework, which uses the linear combination of unitaries concept to create a tunable design that mitigates vanishing gradients without incurring excessive classical simulability. We show how specific structural choices, such as adopting $k$-local control unitaries or restricting the model to certain group-theoretic subspaces, prevent gradients from collapsing while maintaining sufficient expressivity for complex tasks. We further employ the LCQNN model to handle supervised learning tasks, demonstrating its effectiveness on real datasets. In group action scenarios, we show that by exploiting symmetry and excluding exponentially large irreducible subspaces, the model circumvents barren plateaus. Overall, LCQNN provides a novel framework for focusing quantum resources into architectures that are practically trainable yet expressive enough to tackle challenging machine learning applications.

quant-ph↗

arXiv2025

Raising the Bar in Graph OOD Generalization: Invariant Learning Beyond Explicit Environment Modeling

Out-of-distribution (OOD) generalization has emerged as a critical challenge in graph learning, as real-world graph data often exhibit diverse and shifting environments that traditional models fail to generalize across. A promising solution to address this issue is graph invariant learning (GIL), which aims to learn invariant representations by disentangling label-correlated invariant subgraphs from environment-specific subgraphs. However, existing GIL methods face two major challenges: (1) the difficulty of capturing and modeling diverse environments in graph data, and (2) the semantic cliff, where invariant subgraphs from different classes are difficult to distinguish, leading to poor class separability and increased misclassifications. To tackle these challenges, we propose a novel method termed Multi-Prototype Hyperspherical Invariant Learning (MPHIL), which introduces two key innovations: (1) hyperspherical invariant representation extraction, enabling robust and highly discriminative hyperspherical invariant feature extraction, and (2) multi-prototype hyperspherical classification, which employs class prototypes as intermediate variables to eliminate the need for explicit environment modeling in GIL and mitigate the semantic cliff issue. Derived from the theoretical framework of GIL, we introduce two novel objective functions: the invariant prototype matching loss to ensure samples are matched to the correct class prototypes, and the prototype separation loss to increase the distinction between prototypes of different classes in the hyperspherical space. Extensive experiments on 11 OOD generalization benchmark datasets demonstrate that MPHIL achieves state-of-the-art performance, significantly outperforming existing methods across graph data from various domains and with different distribution shifts.

cs.LG↗

arXiv2025

SWE-Debate: Competitive Multi-Agent Debate for Software Issue Resolution

Issue resolution has made remarkable progress thanks to the advanced reasoning capabilities of large language models (LLMs). Recently, agent-based frameworks such as SWE-agent have further advanced this progress by enabling autonomous, tool-using agents to tackle complex software engineering tasks. While existing agent-based issue resolution approaches are primarily based on agents' independent explorations, they often get stuck in local solutions and fail to identify issue patterns that span across different parts of the codebase. To address this limitation, we propose SWE-Debate, a competitive multi-agent debate framework that encourages diverse reasoning paths and achieves more consolidated issue localization. SWE-Debate first creates multiple fault propagation traces as localization proposals by traversing a code dependency graph. Then, it organizes a three-round debate among specialized agents, each embodying distinct reasoning perspectives along the fault propagation trace. This structured competition enables agents to collaboratively converge on a consolidated fix plan. Finally, this consolidated fix plan is integrated into an MCTS-based code modification agent for patch generation. Experiments on the SWE-bench benchmark show that SWE-Debate achieves new state-of-the-art results in open-source agent frameworks and outperforms baselines by a large margin.

cs.SE↗

arXiv2025

Gaussian On-the-Fly Splatting: A Progressive Framework for Robust Near Real-Time 3DGS Optimization

3D Gaussian Splatting (3DGS) achieves high-fidelity rendering with fast real-time performance, but existing methods rely on offline training after full Structure-from-Motion (SfM) processing. In contrast, this work introduces Gaussian on-the-fly Splatting (abbreviated as On-the-Fly GS), a progressive framework enabling near real-time 3DGS optimization during image capture. As each image arrives, its pose and sparse points are updated via On-the-Fly SfM, and newly optimized Gaussians are immediately integrated into the 3DGS field. To achieve this, we propose a progressive Local & Semi-Global optimization to prioritize the new image and its neighbors by their corresponding overlapping relationship, allowing the new image and its overlapping images to get more training. To further stabilize training across previous and new images, an adaptive learning rate schedule balances the iterations and the learning rate. Extensive experiments on multiple benchmarks show that our On-the-Fly GS reduces training time significantly, optimizing each new image in seconds with minimal rendering loss, offering one of the first practical steps toward rapid, progressive 3DGS reconstruction.

cs.CV↗

arXiv2025

Breaking Obfuscation: Cluster-Aware Graph with LLM-Aided Recovery for Malicious JavaScript Detection

With the rapid expansion of web-based applications and cloud services, malicious JavaScript code continues to pose significant threats to user privacy, system integrity, and enterprise security. But, detecting such threats remains challenging due to sophisticated code obfuscation techniques and JavaScript's inherent language characteristics, particularly its nested closure structures and syntactic flexibility. In this work, we propose DeCoda, a hybrid defense framework that combines large language model (LLM)-based deobfuscation with code graph learning: (1) We first construct a sophisticated prompt-learning pipeline with multi-stage refinement, where the LLM progressively reconstructs the original code structure from obfuscated inputs and then generates normalized Abstract Syntax Tree (AST) representations; (2) In JavaScript ASTs, dynamic typing scatters semantically similar nodes while deeply nested functions fracture scope capturing, introducing structural noise and semantic ambiguity. To address these challenges, we then propose to learn hierarchical code graph representations via a Cluster-wise Graph that synergistically integrates graph transformer network, node clustering, and node-to-cluster attention to simultaneously capture both local node-level semantics and global cluster-induced structural relationships from AST graph. Experimental results demonstrate that our method achieves F1-scores of 94.64% and 97.71% on two benchmark datasets, demonstrating absolute improvements of 10.74% and 13.85% over state-of-the-art baselines. In false-positive control evaluation at fixed FPR levels (0.0001, 0.001, 0.01), our approach delivers 4.82, 5.91, and 2.53 higher TPR respectively compared to the best-performing baseline. These results highlight the effectiveness of LLM-based deobfuscation and underscore the importance of modeling cluster-level relationships in detecting malicious code.

cs.CR↗

arXiv2025

Technical Report of TeleChat2, TeleChat2.5 and T1

We introduce the latest series of TeleChat models: \textbf{TeleChat2}, \textbf{TeleChat2.5}, and \textbf{T1}, offering a significant upgrade over their predecessor, TeleChat. Despite minimal changes to the model architecture, the new series achieves substantial performance gains through enhanced training strategies in both pre-training and post-training stages. The series begins with \textbf{TeleChat2}, which undergoes pretraining on 10 trillion high-quality and diverse tokens. This is followed by Supervised Fine-Tuning (SFT) and Direct Preference Optimization (DPO) to further enhance its capabilities. \textbf{TeleChat2.5} and \textbf{T1} expand the pipeline by incorporating a continual pretraining phase with domain-specific datasets, combined with reinforcement learning (RL) to improve performance in code generation and mathematical reasoning tasks. The \textbf{T1} variant is designed for complex reasoning, supporting long Chain-of-Thought (CoT) reasoning and demonstrating substantial improvements in mathematics and coding. In contrast, \textbf{TeleChat2.5} prioritizes speed, delivering rapid inference. Both flagship models of \textbf{T1} and \textbf{TeleChat2.5} are dense Transformer-based architectures with 115B parameters, showcasing significant advancements in reasoning and general task performance compared to the original TeleChat. Notably, \textbf{T1-115B} outperform proprietary models such as OpenAI's o1-mini and GPT-4o. We publicly release \textbf{TeleChat2}, \textbf{TeleChat2.5} and \textbf{T1}, including post-trained versions with 35B and 115B parameters, to empower developers and researchers with state-of-the-art language models tailored for diverse applications.

cs.CL↗

arXiv2025

Free-fermion approach to the partition function zeros : Special boundary conditions and product form of solution

Partition function zeros are powerful tools in understanding critical behavior. In this paper we present new results of the Fisher zeros of two-dimensional Ising models, in the framework of free-fermion eight-vertex model. First we succeed in finding special boundary conditions for the free-fermion model, under which the partition function of a finite lattice can be expressed in a double product form. Using appropriate mappings, these boundary conditions are transformed into the corresponding versions of the square, triangular and honeycomb lattice Ising models. Each Ising model is studied in the cases of a zero field and of an imaginary field $i(π/2)k_BT$. For the square lattice model we rediscover the famous Brascamp-Kunz (B-K) boundary conditions. For the triangular and honeycomb lattice models we obtain the B-K type boundary conditions, and the Fisher zeros are conveniently solved from the product form of partition function. The advantage of B-K type boundary conditions is that the Fisher zeros of any finite lattice exactly lie on certain loci, and the accumulation points of zeros can be easily determined in the thermodynamic limit. Our finding and method would be very helpful in studying the partition function zeros of vertex and Ising models.

cond-mat.stat-mech↗

arXiv2025

Attention-Driven Multimodal Alignment for Long-term Action Quality Assessment

Long-term action quality assessment (AQA) focuses on evaluating the quality of human activities in videos lasting up to several minutes. This task plays an important role in the automated evaluation of artistic sports such as rhythmic gymnastics and figure skating, where both accurate motion execution and temporal synchronization with background music are essential for performance assessment. However, existing methods predominantly fall into two categories: unimodal approaches that rely solely on visual features, which are inadequate for modeling multimodal cues like music; and multimodal approaches that typically employ simple feature-level contrastive fusion, overlooking deep cross-modal collaboration and temporal dynamics. As a result, they struggle to capture complex interactions between modalities and fail to accurately track critical performance changes throughout extended sequences. To address these challenges, we propose the Long-term Multimodal Attention Consistency Network (LMAC-Net). LMAC-Net introduces a multimodal attention consistency mechanism to explicitly align multimodal features, enabling stable integration of visual and audio information and enhancing feature representations. Specifically, we introduce a multimodal local query encoder module to capture temporal semantics and cross-modal relations, and use a two-level score evaluation for interpretable results. In addition, attention-based and regression-based losses are applied to jointly optimize multimodal alignment and score fusion. Experiments conducted on the RG and Fis-V datasets demonstrate that LMAC-Net significantly outperforms existing methods, validating the effectiveness of our proposed approach.

cs.CV↗

arXiv2025

Virtual Quantum Markov Chains

Quantum Markov chains generalize classical Markov chains for random variables to the quantum realm and exhibit unique inherent properties, making them an important feature in quantum information theory. In this work, we propose the concept of virtual quantum Markov chains (VQMCs), focusing on scenarios where subsystems retain classical information about global systems from measurement statistics. As a generalization of quantum Markov chains, VQMCs characterize states where arbitrary global shadow information can be recovered from subsystems through local quantum operations and measurements. We present an algebraic characterization for virtual quantum Markov chains and show that the virtual quantum recovery is fully determined by the block matrices of a quantum state on its subsystems. Notably, we find a distinction between two classes of tripartite entanglement by showing that the W state is a VQMC while the GHZ state is not. Furthermore, we introduce the virtual non-Markovianity to quantify the non-Markovianity of a given quantum state, which also assesses the optimal sampling overhead for virtually recovering this state. Our findings elucidate distinctions between quantum Markov chains and virtual quantum Markov chains, extending our understanding of quantum recovery to scenarios prioritizing classical information from measurement statistics.

quant-ph↗

arXiv2025

Detecting Multimedia Generated by Large AI Models: A Survey

The rapid advancement of Large AI Models (LAIMs), particularly diffusion models and large language models, has marked a new era where AI-generated multimedia is increasingly integrated into various aspects of daily life. Although beneficial in numerous fields, this content presents significant risks, including potential misuse, societal disruptions, and ethical concerns. Consequently, detecting multimedia generated by LAIMs has become crucial, with a marked rise in related research. Despite this, there remains a notable gap in systematic surveys that focus specifically on detecting LAIM-generated multimedia. Addressing this, we provide the first survey to comprehensively cover existing research on detecting multimedia (such as text, images, videos, audio, and multimodal content) created by LAIMs. Specifically, we introduce a novel taxonomy for detection methods, categorized by media modality, and aligned with two perspectives: pure detection (aiming to enhance detection performance) and beyond detection (adding attributes like generalizability, robustness, and interpretability to detectors). Additionally, we have presented a brief overview of generation mechanisms, public datasets, online detection tools, and evaluation metrics to provide a valuable resource for researchers and practitioners in this field. Most importantly, we offer a focused analysis from a social media perspective to highlight their broader societal impact. Furthermore, we identify current challenges in detection and propose directions for future research that address unexplored, ongoing, and emerging issues in detecting multimedia generated by LAIMs. Our aim for this survey is to fill an academic gap and contribute to global AI security efforts, helping to ensure the integrity of information in the digital realm. The project link is https://github.com/Purdue-M2/Detect-LAIM-generated-Multimedia-Survey.

cs.MM↗