arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 271 records · Page 15Linked to original sources

arXiv2025

Deep Learning Enhanced Multivariate GARCH

This paper introduces a novel multivariate volatility modeling framework, named Long Short-Term Memory enhanced BEKK (LSTM-BEKK), that integrates deep learning into multivariate GARCH processes. By combining the flexibility of recurrent neural networks with the econometric structure of BEKK models, our approach is designed to better capture nonlinear, dynamic, and high-dimensional dependence structures in financial return data. The proposed model addresses key limitations of traditional multivariate GARCH-based methods, particularly in capturing persistent volatility clustering and asymmetric co-movement across assets. Leveraging the data-driven nature of LSTMs, the framework adapts effectively to time-varying market conditions, offering improved robustness and forecasting performance. Empirical results across multiple equity markets confirm that the LSTM-BEKK model achieves superior performance in terms of out-of-sample portfolio risk forecast, while maintaining the interpretability from the BEKK models. These findings highlight the potential of hybrid econometric-deep learning models in advancing financial risk management and multivariate volatility forecasting.

q-fin.CP↗

arXiv2025

Policy Newton Algorithm in Reproducing Kernel Hilbert Space

Reinforcement learning (RL) policies represented in Reproducing Kernel Hilbert Spaces (RKHS) offer powerful representational capabilities. While second-order optimization methods like Newton's method demonstrate faster convergence than first-order approaches, current RKHS-based policy optimization remains constrained to first-order techniques. This limitation stems primarily from the intractability of explicitly computing and inverting the infinite-dimensional Hessian operator in RKHS. We introduce Policy Newton in RKHS, the first second-order optimization framework specifically designed for RL policies represented in RKHS. Our approach circumvents direct computation of the inverse Hessian operator by optimizing a cubic regularized auxiliary objective function. Crucially, we leverage the Representer Theorem to transform this infinite-dimensional optimization into an equivalent, computationally tractable finite-dimensional problem whose dimensionality scales with the trajectory data volume. We establish theoretical guarantees proving convergence to a local optimum with a local quadratic convergence rate. Empirical evaluations on a toy financial asset allocation problem validate these theoretical properties, while experiments on standard RL benchmarks demonstrate that Policy Newton in RKHS achieves superior convergence speed and higher episodic rewards compared to established first-order RKHS approaches and parametric second-order methods. Our work bridges a critical gap between non-parametric policy representations and second-order optimization methods in reinforcement learning.

cs.LG↗

arXiv2025

Breaker: Removing Shortcut Cues with User Clustering for Single-slot Recommendation System

In a single-slot recommendation system, users are only exposed to one item at a time, and the system cannot collect user feedback on multiple items simultaneously. Therefore, only pointwise modeling solutions can be adopted, focusing solely on modeling the likelihood of clicks or conversions for items by users to learn user-item preferences, without the ability to capture the ranking information among different items directly. However, since user-side information is often much more abundant than item-side information, the model can quickly learn the differences in user intrinsic tendencies, which are independent of the items they are exposed to. This can cause these intrinsic tendencies to become a shortcut bias for the model, leading to insufficient mining of the most concerned user-item preferences. To solve this challenge, we introduce the Breaker model. Breaker integrates an auxiliary task of user representation clustering with a multi-tower structure for cluster-specific preference modeling. By clustering user representations, we ensure that users within each cluster exhibit similar characteristics, which increases the complexity of the pointwise recommendation task on the user side. This forces the multi-tower structure with cluster-driven parameter learning to better model user-item preferences, ultimately eliminating shortcut biases related to user intrinsic tendencies. In terms of training, we propose a delayed parameter update mechanism to enhance training stability and convergence, enabling end-to-end joint training of the auxiliary clustering and classification tasks. Both offline and online experiments demonstrate that our method surpasses the baselines. It has already been deployed and is actively serving tens of millions of users daily on Meituan, one of the most popular e-commerce platforms for services.

cs.IR↗

arXiv2025

IMPACT: Iterative Mask-based Parallel Decoding for Text-to-Audio Generation with Diffusion Modeling

Text-to-audio generation synthesizes realistic sounds or music given a natural language prompt. Diffusion-based frameworks, including the Tango and the AudioLDM series, represent the state-of-the-art in text-to-audio generation. Despite achieving high audio fidelity, they incur significant inference latency due to the slow diffusion sampling process. MAGNET, a mask-based model operating on discrete tokens, addresses slow inference through iterative mask-based parallel decoding. However, its audio quality still lags behind that of diffusion-based models. In this work, we introduce IMPACT, a text-to-audio generation framework that achieves high performance in audio quality and fidelity while ensuring fast inference. IMPACT utilizes iterative mask-based parallel decoding in a continuous latent space powered by diffusion modeling. This approach eliminates the fidelity constraints of discrete tokens while maintaining competitive inference speed. Results on AudioCaps demonstrate that IMPACT achieves state-of-the-art performance on key metrics including Fréchet Distance (FD) and Fréchet Audio Distance (FAD) while significantly reducing latency compared to prior models. The project website is available at https://audio-impact.github.io/.

eess.AS↗

arXiv2025

Structure-Enhanced Protein Instruction Tuning: Towards General-Purpose Protein Understanding with LLMs

Proteins, as essential biomolecules, play a central role in biological processes, including metabolic reactions and DNA replication. Accurate prediction of their properties and functions is crucial in biological applications. Recent development of protein language models (pLMs) with supervised fine tuning provides a promising solution to this problem. However, the fine-tuned model is tailored for particular downstream prediction task, and achieving general-purpose protein understanding remains a challenge. In this paper, we introduce Structure-Enhanced Protein Instruction Tuning (SEPIT) framework to bridge this gap. Our approach incorporates a novel structure-aware module into pLMs to enrich their structural knowledge, and subsequently integrates these enhanced pLMs with large language models (LLMs) to advance protein understanding. In this framework, we propose a novel instruction tuning pipeline. First, we warm up the enhanced pLMs using contrastive learning and structure denoising. Then, caption-based instructions are used to establish a basic understanding of proteins. Finally, we refine this understanding by employing a mixture of experts (MoEs) to capture more complex properties and functional information with the same number of activated parameters. Moreover, we construct the largest and most comprehensive protein instruction dataset to date, which allows us to train and evaluate the general-purpose protein understanding model. Extensive experiments on both open-ended generation and closed-set answer tasks demonstrate the superior performance of SEPIT over both closed-source general LLMs and open-source LLMs trained with protein knowledge.

cs.CL↗

arXiv2025

LLMs as Better Recommenders with Natural Language Collaborative Signals: A Self-Assessing Retrieval Approach

Incorporating collaborative information (CI) effectively is crucial for leveraging LLMs in recommendation tasks. Existing approaches often encode CI using soft tokens or abstract identifiers, which introduces a semantic misalignment with the LLM's natural language pretraining and hampers knowledge integration. To address this, we propose expressing CI directly in natural language to better align with LLMs' semantic space. We achieve this by retrieving a curated set of the most relevant user behaviors in natural language form. However, identifying informative CI is challenging due to the complexity of similarity and utility assessment. To tackle this, we introduce a Self-assessing COllaborative REtrieval framework (SCORE) following the retrieve-rerank paradigm. First, a Collaborative Retriever (CAR) is developed to consider both collaborative patterns and semantic similarity. Then, a Self-assessing Reranker (SARE) leverages LLMs' own reasoning to assess and prioritize retrieved behaviors. Finally, the selected behaviors are prepended to the LLM prompt as natural-language CI to guide recommendation. Extensive experiments on two public datasets validate the effectiveness of SCORE in improving LLM-based recommendation.

cs.IR↗

arXiv2025

Improving Recommendation Fairness without Sensitive Attributes Using Multi-Persona LLMs

Despite the success of recommender systems in alleviating information overload, fairness issues have raised concerns in recent years, potentially leading to unequal treatment for certain user groups. While efforts have been made to improve recommendation fairness, they often assume that users' sensitive attributes are available during model training. However, collecting sensitive information can be difficult, especially on platforms that involve no personal information disclosure. Therefore, we aim to improve recommendation fairness without any access to sensitive attributes. However, this is a non-trivial task because uncovering latent sensitive patterns from complicated user behaviors without explicit sensitive attributes can be difficult. Consequently, suboptimal estimates of sensitive distributions can hinder the fairness training process. To address these challenges, leveraging the remarkable reasoning abilities of Large Language Models (LLMs), we propose a novel LLM-enhanced framework for Fair recommendation withOut Sensitive Attributes (LLMFOSA). A Multi-Persona Sensitive Information Inference module employs LLMs with distinct personas that mimic diverse human perceptions to infer and distill sensitive information. Furthermore, a Confusion-Aware Sensitive Representation Learning module incorporates inference results and rationales to develop robust sensitive representations, considering the mislabeling confusion and collective consensus among agents. The model is then optimized by a formulated mutual information objective. Extensive experiments on two public datasets validate the effectiveness of LLMFOSA in improving fairness.

cs.IR↗

arXiv2025

Understanding the Robustness of Graph Neural Networks against Adversarial Attacks

Recent studies have shown that graph neural networks (GNNs) are vulnerable to adversarial attacks, posing significant challenges to their deployment in safety-critical scenarios. This vulnerability has spurred a growing focus on designing robust GNNs. Despite this interest, current advancements have predominantly relied on empirical trial and error, resulting in a limited understanding of the robustness of GNNs against adversarial attacks. To address this issue, we conduct the first large-scale systematic study on the adversarial robustness of GNNs by considering the patterns of input graphs, the architecture of GNNs, and their model capacity, along with discussions on sensitive neurons and adversarial transferability. This work proposes a comprehensive empirical framework for analyzing the adversarial robustness of GNNs. To support the analysis of adversarial robustness in GNNs, we introduce two evaluation metrics: the confidence-based decision surface and the accuracy-based adversarial transferability rate. Through experimental analysis, we derive 11 actionable guidelines for designing robust GNNs, enabling model developers to gain deeper insights. The code of this study is available at https://github.com/star4455/GraphRE.

cs.LG↗

arXiv2025

A fully flexible joint lattice position and dose optimization method for LATTICE therapy

Lattice radiotherapy (LATTICE) is a form of spatially fractionated radiation therapy (SFRT) designed to deliver high doses to tumor regions while sparing surrounding tissues. Traditional LATTICE uses rigid vertex patterns, limiting adaptability for irregular tumors or those near critical organs. This study introduces a novel planning method with flexible vertex placement and joint optimization of vertex positions and dose distribution, enhancing treatment precision. The method integrates vertex positioning with other treatment variables within a constrained optimization framework, allowing dynamic adjustments. Results showed that plans generated with the new method (NEW) demonstrated superior or comparable quality to conventional LATTICE plans, with improvements in the optimization objective and peak-to-valley dose ratio (PVDR). This approach offers significant improvements in target dose conformity and OAR sparing, providing an enhanced LATTICE technique.

physics.med-ph↗

arXiv2025

From Assistants to Adversaries: Exploring the Security Risks of Mobile LLM Agents

The growing adoption of large language models (LLMs) has led to a new paradigm in mobile computing--LLM-powered mobile AI agents--capable of decomposing and automating complex tasks directly on smartphones. However, the security implications of these agents remain largely unexplored. In this paper, we present the first comprehensive security analysis of mobile LLM agents, encompassing three representative categories: System-level AI Agents developed by original equipment manufacturers (e.g., YOYO Assistant), Third-party Universal Agents (e.g., Zhipu AI AutoGLM), and Emerging Agent Frameworks (e.g., Alibaba Mobile Agent). We begin by analyzing the general workflow of mobile agents and identifying security threats across three core capability dimensions: language-based reasoning, GUI-based interaction, and system-level execution. Our analysis reveals 11 distinct attack surfaces, all rooted in the unique capabilities and interaction patterns of mobile LLM agents, and spanning their entire operational lifecycle. To investigate these threats in practice, we introduce AgentScan, a semi-automated security analysis framework that systematically evaluates mobile LLM agents across all 11 attack scenarios. Applying AgentScan to nine widely deployed agents, we uncover a concerning trend: every agent is vulnerable to targeted attacks. In the most severe cases, agents exhibit vulnerabilities across eight distinct attack vectors. These attacks can cause behavioral deviations, privacy leakage, or even full execution hijacking. Based on these findings, we propose a set of defensive design principles and practical recommendations for building secure mobile LLM agents. Our disclosures have received positive feedback from two major device vendors. Overall, this work highlights the urgent need for standardized security practices in the fast-evolving landscape of LLM-driven mobile automation.

cs.CR↗

arXiv2025

Tensor robust principal component analysis via the tensor nuclear over Frobenius norm

We address the problem of tensor robust principal component analysis (TRPCA), which entails decomposing a given tensor into the sum of a low-rank tensor and a sparse tensor. By leveraging the tensor singular value decomposition (t-SVD), we introduce the ratio of the tensor nuclear norm to the tensor Frobenius norm (TNF) as a nonconvex approximation of the tensor's tubal rank in TRPCA. Additionally, we utilize the traditional L1 norm to identify the sparse tensor. For brevity, we refer to the combination of TNF and L1 as simply TNF. Under a series of incoherence conditions, we prove that a pair of tensors serves as a local minimizer of the proposed TNF-based TRPCA model if one tensor is sufficiently low in rank and the other tensor is sufficiently sparse. In addition, we propose replacing the L1 norm with the ratio of the L1 and Frobenius norm for tensors, the latter denoted as the LF norm. We refer to the combination of TNF and L1/LF as the TNF+ model in short. To solve both TNF and TNF+ models, we employ the alternating direction method of multipliers (ADMM) and prove subsequential convergence under certain conditions. Finally, extensive experiments on synthetic data, real color images, and videos are conducted to demonstrate the superior performance of our proposed models in comparison to state-of-the-art methods in TRPCA.

math.NA↗

arXiv2025

Comparing $h$-genera, Bridge-1 genera and Heegaard genera of knots

Let $h(K)$, $g_H(K)$, $g_1(K)$, $t(K)$ be the $h$-genus, Heegaard genus, bridge-1 genus, tunnel number of a knot $K$ in the $3$-sphere $S^3$, respectively. It is known that $g_H(K)-1=t(K)\leq g_1(K)\leq h(K)\leq g_H(K)$. A natural question arises: when do these invariants become equal? We provide the necessary and sufficient conditions for equality and use these to show that for each integer $n\geq 1$, the following three families of knots are infinite: \begin{eqnarray} A_{n}=\{K\mid t(K)=n<g_1(K)\}, B_{n}=\{K\mid g_1(K)=n<h(K)\}, C_{n}=\{K\mid h(K)=n<g_H(K)\}. \end{eqnarray} This result resolves a conjecture in \cite{Mo2}, confirming that each of these families is infinite.

math.GT↗

arXiv2025

CoPAL: Corrective Planning of Robot Actions with Large Language Models

In the pursuit of fully autonomous robotic systems capable of taking over tasks traditionally performed by humans, the complexity of open-world environments poses a considerable challenge. Addressing this imperative, this study contributes to the field of Large Language Models (LLMs) applied to task and motion planning for robots. We propose a system architecture that orchestrates a seamless interplay between multiple cognitive levels, encompassing reasoning, planning, and motion generation. At its core lies a novel replanning strategy that handles physically grounded, logical, and semantic errors in the generated plans. We demonstrate the efficacy of the proposed feedback architecture, particularly its impact on executability, correctness, and time complexity via empirical evaluation in the context of a simulation and two intricate real-world scenarios: blocks world, barman and pizza preparation.

cs.RO↗

arXiv2025

To Help or Not to Help: LLM-based Attentive Support for Human-Robot Group Interactions

How can a robot provide unobtrusive physical support within a group of humans? We present Attentive Support, a novel interaction concept for robots to support a group of humans. It combines scene perception, dialogue acquisition, situation understanding, and behavior generation with the common-sense reasoning capabilities of Large Language Models (LLMs). In addition to following user instructions, Attentive Support is capable of deciding when and how to support the humans, and when to remain silent to not disturb the group. With a diverse set of scenarios, we show and evaluate the robot's attentive behavior, which supports and helps the humans when required, while not disturbing if no help is needed.

cs.RO↗

arXiv2025

The role and contribution of resonance effect for the decay process of $\bar B^{0}_s \rightarrow π^{+}π^{-}P$

The size of the direct CP asymmetry generated during the weak decay of hadrons is attributed to the weak phase and some strong phases. The weak phase comes from the CKM matrix and a strong phase may result from the resonance effect which is produced by the mixing of vector meson $V\left\{ρ^{0}(770),ω(782),ϕ(1020)\right\}$ to $π^+ π^-$ meson pairs. $ρ^{0}(770)$ can decay directly into $π^+ π^-$ meson pairs, both $ω(782)$ and $ϕ(1020)$ can also decay into $π^+ π^-$ meson pairs with small contribution from isospin symmetry breaking. The main contribution for the middle state vector meson $ρ^{0}(770)-ω(782)-ϕ(1020)$ interference is the mix of $ρ^{0}(770)$, $ω(782)-ρ^{0}(770)$ and $ϕ(1020)-ρ^{0}(770)$. We calculate the CP asymmetry and decay branching ratio for $\bar{B}^0_{s} \rightarrow π^+ π^- π^0 (\bar K ^{0})$ in the framework of QCD factorization and compare them with previous work. We also add the analysis of $\bar{B}^0_{s} \rightarrow π^+ π^- η(η^{(')})$ decay process. The results show that the CP asymmetry of these four decay processes are significantly enhanced especially for the $\bar{B}^0_{s} \rightarrow π^+ π^- \bar K ^{0}$ decay process and the decay branching ratio also changes under resonance effect. These work might provide support for the experimental analysis of the $\bar B^{0}_s$ meson.

hep-ph↗

arXiv2025

SRPO: A Cross-Domain Implementation of Large-Scale Reinforcement Learning on LLM

Recent advances of reasoning models, exemplified by OpenAI's o1 and DeepSeek's R1, highlight the significant potential of Reinforcement Learning (RL) to enhance the reasoning capabilities of Large Language Models (LLMs). However, replicating these advancements across diverse domains remains challenging due to limited methodological transparency. In this work, we present two-Staged history-Resampling Policy Optimization (SRPO), which surpasses the performance of DeepSeek-R1-Zero-32B on the AIME24 and LiveCodeBench benchmarks. SRPO achieves this using the same base model as DeepSeek (i.e. Qwen2.5-32B), using only about 1/10 of the training steps required by DeepSeek-R1-Zero-32B, demonstrating superior efficiency. Building upon Group Relative Policy Optimization (GRPO), we introduce two key methodological innovations: (1) a two-stage cross-domain training paradigm designed to balance the development of mathematical reasoning and coding proficiency, and (2) History Resampling (HR), a technique to address ineffective samples. Our comprehensive experiments validate the effectiveness of our approach, offering valuable insights into scaling LLM reasoning capabilities across diverse tasks.

cs.LG↗

arXiv2025

Interpretable Locomotion Prediction in Construction Using a Memory-Driven LLM Agent With Chain-of-Thought Reasoning

Construction tasks are inherently unpredictable, with dynamic environments and safety-critical demands posing significant risks to workers. Exoskeletons offer potential assistance but falter without accurate intent recognition across diverse locomotion modes. This paper presents a locomotion prediction agent leveraging Large Language Models (LLMs) augmented with memory systems, aimed at improving exoskeleton assistance in such settings. Using multimodal inputs - spoken commands and visual data from smart glasses - the agent integrates a Perception Module, Short-Term Memory (STM), Long-Term Memory (LTM), and Refinement Module to predict locomotion modes effectively. Evaluation reveals a baseline weighted F1-score of 0.73 without memory, rising to 0.81 with STM, and reaching 0.90 with both STM and LTM, excelling with vague and safety-critical commands. Calibration metrics, including a Brier Score drop from 0.244 to 0.090 and ECE from 0.222 to 0.044, affirm improved reliability. This framework supports safer, high-level human-exoskeleton collaboration, with promise for adaptive assistive systems in dynamic industries.

cs.RO↗

arXiv2025

Gigabit-rate Quantum Key Distribution on Integrated Photonic Chips

Quantum key distribution (QKD) provides information-theoretic security guaranteed by the laws of quantum mechanics, making it resistant to future computational threats, including quantum computers. While QKD technology shows great promise, its widespread adoption depends heavily on its usability and viability, with key rate performance and cost-effectiveness serving as critical evaluation metrics. In this work, we report an integrated silicon photonics-based QKD system that achieves a secret key rate of 1.213 Gbit per second over a metropolitan distance of 10 km with polarization multiplexing. Our contributions are twofold. First, in the quantum optical layer, we developed an on-chip quantum transmitter and an efficient quantum receiver that operate at 40 Gbaud/s at room temperature. Second, we designed a discrete-modulated continuous variable (DM CV) QKD implementation with efficient information reconciliation based on polar codes, enabling potentially high-throughput real-time data processing. Our results demonstrate a practical QKD solution that combines high performance with cost efficiency. We anticipate this research will pave the way for large-scale quantum secure networks.

quant-ph↗