arXiv subjects

Haiquan Zhao

Publications and source records attributed to Haiquan Zhao.

At least 19 recordsLinked to original sources

arXiv2026

Nonlinear Bias-Compensated Adaptive Filter and Its Application for Time-Series Prediction

Most existing nonlinear adaptive filtering algorithms only account for output noise, neglecting the fact that input noise is also prevalent in practice. Although the recently proposed bias-compensated kernel least mean square (BCKLMS) algorithm addresses input noise in the nonlinear errors-in-variables (EIV) model, it still suffers from two major limitations. First, the use of a fixed-size dictionary restricts network growth but also prevents it from fully capturing the characteristics of the input signal. Second, as an least mean square (LMS) based algorithm, it exhibits poor robustness in the presence of non-Gaussian noise in the output signal. To overcome these issues, this paper proposes the random Fourier bias-compensated filter under general adaptive function (RFFBCGA) algorithm. Within the random Fourier feature based bias-compensated (RFFBC) framework, the proposed algorithm not only maintains a fixed network structure and effectively mitigates input noise interference through the BC term, but also achieves improved characterization of the input signal. Moreover, by leveraging the flexible form of the general adaptive (GA) function, the algorithm's robustness across various noise scenarios is further enhanced. Extensive simulations, including real-world time series prediction tasks, demonstrate the superiority of the proposed method.

cs.LG↗

arXiv2026

Qwen-AgentWorld: Language World Models for General Agents

A world model predicts environment dynamics based on current observations and actions, serving as a core cognitive mechanism for reasoning and planning. In this work, we investigate how world modeling based on language models can further push the boundaries of general agents. (i) We first focus on building foundation models for agentic environment simulation. We introduce Qwen-AgentWorld-35B-A3B and Qwen-AgentWorld-397B-A17B, the first language world models capable of simulating agentic environments covering 7 domains via long chain-of-thought reasoning. Leveraging more than 10M environment interaction trajectories of 7 domains in real-world environments, we develop Qwen-AgentWorld through a three-stage training pipeline: CPT injects general-purpose world modeling capabilities from the state transition dynamics and augmented professional corpora, SFT activates next-state-prediction reasoning, and RL sharpens simulation fidelity through a tailored framework with hybrid rubric-and-rule rewards. To evaluate language world models, we present AgentWorldBench, a comprehensive benchmark constructed from real-world interactions of 5 frontier models on 9 established benchmarks. Empirical results demonstrate that Qwen-AgentWorld significantly outperforms existing frontier models. (ii) Beyond foundation models, we further investigate two complementary paradigms through which world modeling enhances general agents. First, as a decoupled environment simulator, Qwen-AgentWorld supports scalable and controllable simulation of thousands of real-world environments for agentic RL, yielding gains that surpass real-environment training alone. Second, as a unified agent foundation model, world-model training acts as a highly effective warm-up that improves downstream performance across 7 agentic benchmarks. Code: https://github.com/QwenLM/Qwen-AgentWorld

cs.CL↗

arXiv2026

Robust Set-Membership Diffusion Normalization Subband Adaptive Filtering Algorithms Over Distributed Networks

With the development of wireless sensor networks, distributed networks have received widespread attention. According to the different ways of connecting the nodes in the distributed network can be divided into different structures, of which the diffusion type structure is the most commonly used one due to its simple, stable and reliable. In order to improve the robustness of the diffusion subband algorithm in distributed networks, the median absolute deviation (MAD) theorem is applied to the error boundary selection, and this paper proposes a diffusion subband algorithm with a robust boundary. Through simulations, it is verified that the proposed algorithm can effectively reduce the update step size in the face of outlier interference, so that the algorithm has a good convergence performance and also has good robustness to impulsive noise.

eess.SP↗

arXiv2026

Online Censoring-Based Widely Linear Total Least lncosh Method for Improved Power System Frequency Estimation

Recently, under the presumption of a noise-free input, the augmented complex least lncosh (ACLlncosh) method was introduced for a power system frequency estimate and showed robust performance when impulsive noise polluted the output signal. However, in practical terms, noise often contaminates input signals, which drastically reduces the efficiency of the ACLlncosh method. To enhance robustness against noisy input-output while maintaining resilience to impulsive noise in the output signal, this paper proposed an online censoring-based widely linear total least lncosh (OC-WL-TLlnC) method. This method improves performance under both balanced and unbalanced settings by filtering out less valuable data via online censoring, hence reducing the computing burden. Furthermore, a variable parameter approach is incorporated to accelerate convergence and improve steady-state accuracy, thereby ensuring adaptability to dynamic power system conditions. The proposed methods significantly enhance frequency estimate performance by addressing the constraints of current techniques and offering a computationally efficient, noise-resilient solution for real-time power system monitoring.

eess.SP↗

arXiv2026

Half-Quadratic Criterion based Adaptive Graph Signal Processing Algorithm

In recent years, progress in adaptive graph signal processing algorithms has provided effective solutions for processing signals defined on graph structures. As a classical strategy in information theory, the Generalized Maximum Correntropy Criterion (GMCC) exhibits good resistance to non-Gaussian noises. When non-Gaussian noise interferes with the graph signal, the graph signal processing algorithm based on GMCC (GSP GMCC) algorithm shows better performance. However, the GSP GMCC algorithm itself has three parameters that need to be manually tuned, and the process of manually tuning the parameters is complex and tedious. Meanwhile, the non-concave and non-convex nature of the GMCC function itself limits its own convergence rate and adaptive estimation accuracy. To solve the above problems, based on the strongly convex function half-quadratic criterion (HQC), the GSP HQC algorithm is proposed in this paper. The performance analysis of the GSP HQC algorithm is implemented in this paper. Simulation experiments demonstrate that the GSP HQC algorithm achieves superior performance in terms of convergence rate and adaptive estimation accuracy while maintaining computational complexity comparable to existing algorithms

eess.SP↗

arXiv2026

Broad learning system with robust adaptive kernel

For the performance degradation problem of broad learning system (BLS) in non-Gaussian noise environment, the variant of BLS based on M-estimator shows good robust performance. However, in most cases, the determination of the optimal loss function is often very time-consuming due to the lack of prior knowledge of the sample data. Therefore, this paper constructs a variant of BLS based on adaptive robust kernel (AR-BLS) to improve the generalization performance of the model in non-Gaussian noise environment. Adaptive robust kernel function is a general loss function that includes many common M-estimator paradigms. By alternately optimizing model weights and adaptive robust kernel parameters, AR-BLS realizes the adaptive adjustment of model robustness under different outlier noise distributions without human intervention. In addition, the iterative convergence of AR-BLS algorithm is proved based on Zangwill's global convergence theorem. Simulation experiments on multiple public datasets and actual application scenarios verify the effectiveness of the proposed method.

eess.SP↗

arXiv2026

Decentralized Variational Bayesian UKF with Maximum Generalized Student's t-kernel Correntropy for Wide-Area Power System state estimation

A Conventional centralized state estimators exhibit limited robustness in large-scale grids and face practical deployment hurdles. To overcome these challenges, this paper proposes a decentralized maximum generalized Student's t-kernel correntropy Variational Bayesian unscented Kalman filter (D-MGST-VBUKF). The algorithm optimizes the estimation performance at three levels for the regionalized state estimation needs: first, to address non-Gaussian measurement noise in practical systems, we propose the cost function using MGST, retaining Student's t robustness while improving adaptability to complex noise by expanding the degree-of-freedom parameter; secondly, the VB inference framework is constructed to model the unknown noise distribution online, and the joint optimization of the noise statistical characteristics and state estimation is realized by constructing the conjugate prior distribution; finally, the regional state fusion mechanism is established based on the topological correlation characteristics of the power grid, and the global consistency correction of the local estimation results is realized by constructing the state coordination equation of the boundary nodes. Simulation experiments in IEEE 14-bus and IEEE 39-bus system show that the method has stronger robustness compared with the traditional algorithm under non-Gaussian noise environment and unknown noise environment.

eess.SP↗

arXiv2026

Outlier-Robust unscented Kalman filter based on generalized correntropy induced

Conventional Kalman filtering (KF) approaches exhibit significant limitations in addressing nonlinear state estimation problems contaminated by non-Gaussian noise disturbances. To overcome these challenges, this work proposes a robust iterative square root unscented Kalman Filter based on the generalized correntropy induced (SR-GCI-IUKF). While sharing the maximum correntropy criterion's (MCC) ability to characterize higher-order noise statistics, the proposed GCI framework exhibits intrinsic kernel bandwidth insensitivit a critical advantage enabling robust adaptation to diverse complex noise environments through its generalized kernel structure. For nonlinear state estimation challenges, the algorithm constructs a nonlinear error generalization model that dynamically corrects measurement-induced errors during the state update phase, thereby significantly enhancing estimation accuracy in strongly nonlinear regimes. Furthermore, the square-root decomposition implementation ensures numerical robustness by preserving covariance matrix positive definiteness throughout recursive operations. Theoretical stability guarantees are established through rigorous error dynamics analysis, demonstrating bounded estimation variance under non-Gaussian disturbances. Finally, experiments are carried out in nonlinear systems, land vehicle navigation systems as well as power system FASE to compare other robust algorithms, and it is determined that the proposed algorithm has stronger robustness.

eess.SP↗

arXiv2026

A Fast Robust Adaptive filter using Improved Data-Reuse Method

Adaptive filter in complex scenarios demands algorithms that integrate fast convergence, low complexity, and robust performance under diverse noise conditions. To address this challenge, we propose a online censoring robust total generalized adaptive filter using improved data-reused method (RTGA-IDROC) algorithm. The proposed RTGA variant possesses the advantages of both the total least squares (TLS) strategy and the robust generalized adaptive (RGA) function. This algorithm not only effectively handles input noise under the errors-in-variables (EIV) model but also achieves excellent performance across diverse noise environments. Furthermore, to meet the high demand for convergence speed in practical applications, an improved data reuse (IDR) method is introduced, enabling faster convergence in the early stages of iteration without compromising steady-state performance. The increased computational complexity brought by the IDR method is mitigated using the online censoring (OC) strategy. We also modify the OC threshold for real-valued algorithms, as the original threshold was defined for the complex domain. Beyond these algorithmic enhancements, a local stability analysis for the proposed algorithm is provided, and the theoretical steady-state mean-square deviation (MSD) is derived. Finally, simulation experiments in system identification and acoustic echo cancellation (AEC) scenarios validate the superior performance of the proposed algorithm.

eess.SP↗

arXiv2026

Augmented Set-membership Affine Projection Algorithm and Its Performance Analysis

The augmented affine projection algorithm (AAPA) has considerably excellent performance for highly colored input signals. However, the direct matrix inversion operation leads to a high computational complexity, especially with high projection order. Inspired by the excellent characteristics of set-membership filtering (SMF), this paper proposes the augmented set-membership affine projection algorithm (ASM-APA), which not only has low computational complexity but also offers improved performance compared with AAPA. Then, the computational complexity and stability of ASM-APA are analyzed, and the condition for maintaining the stability of the algorithm is provided. Finally, in the computer simulation phase, the results of the simulation experiments demonstrated that ASM-APA has superior performance compared to AAPA.

eess.SP↗

arXiv2026

Fractional-Order Subband p-Norm Adaptive Filter via Transformation Nearest Kronecker Product Decomposition for Active Noise Control

The conventional normalized subband p-norm (NSPN) algorithm achieves robustness in $α$-stable noise ($1<α\leq 2$) by utilizing low-order error moments. However, its performance degrades significantly under three scenarios: (1) non-Gaussian inputs, (2) $α$-stable noise with $0<α\leq 1$, and (3) sparse system identification. To address these limitations, this paper proposes a fractional-order NSPN algorithm based on the nearest Kronecker product (NKP) decomposition and fractional-order stochastic gradient descent, termed NKP-FoNSPN. Theoretical bounds for the fractional-order parameter $β$ are also derived. Notably, when $β=1$, the NKP-FoNSPN reduces to a new NKP-NSPN algorithm, while its non-NKP decomposition variant becomes the fractional-order NSPN (FoNSPN) algorithm. Furthermore, a novel transformation-based NKP (TNKP) decomposition technique is designed, which exhibits lower computational complexity than conventional NKP for specific filter structures. The resulting TNKP-based FoNSPN (TNKP-FoNSPN) achieves lower steady-state misadjustment and multiplication cost compared with the NKP-FoNSPN algorithm. Additionally, complete computational complexity analyses are provided. For active noise control (ANC) scenarios, we develop filtered-x variants: NKP-FxFoNSPN and TNKP-FxFoNSPN. From the former, two additional variants are derived: NKP-FxNSPN and FxFoNSPN. Simulations using diverse noise sources (pink, helicopter, gunshot, pile driver, and traction substation noise) demonstrate the superiority of the proposed algorithms. Finally, we validate their noise reduction performance in a real constructed single-channel duct ANC and a simulated multi-channel ANC systems.

eess.AS↗

arXiv2026

Your Models Have Thought Enough: Training Large Reasoning Models to Stop Overthinking

Large Reasoning Models (LRMs) have achieved impressive performance on challenging tasks, yet their deep reasoning often incurs substantial computational costs. To achieve efficient reasoning, existing reinforcement learning methods still struggle to construct short reasoning path during the rollout stage, limiting effective learning. Inspired by Evidence Accumulation Models, we find that LRMs have accumulated sufficient information early in reasoning, making further reasoning steps redundant. Based on this insight, we propose Just-Enough Thinking (JET), which trains models to proactively terminate unnecessary reasoning. JET performs trajectory truncation during rollout to expose the model to short, distributionally consistent reasoning paths. Besides, it uses a quality-controlled length reward to better encourage concise reasoning while maintaining correctness. Extensive experiments demonstrate that JET significantly improves reasoning efficiency without sacrificing accuracy. Especially, DeepSeek-Distill-Qwen-1.5B achieves a 4.6% accuracy gain while reducing output length by 46.3% on the Olympiad benchmark. Our code is available in the GitHub.

cs.AI↗

arXiv2026

Robust distributed extended Kalman filter based on adaptive multi-kernel mixture maximum correntropy for non-Gaussian systems

As one of the most advanced variants in the correntropy family, the multi-kernel correntropy criterion demonstrates superior accuracy in handling non-Gaussian noise, particularly with multimodal distributions. However, current approaches suffer from key limitations-namely, reliance on a single type of sensitive Gaussian kernel and the manual selection of free parameters. To address these issues and further boost robustness, this paper introduces the concept of multi-kernel mixture correntropy (MKMC), along with its key properties. MKMC employs a flexible kernel function composed of a mixture of two Students t-Cauchy functions with adjustable (non-zero) means. Building on this criterion within multi-sensor networks, we propose a robust distributed extended Kalman filter-AMKMMC-RDEKF based on adaptive multi-kernel mixture maximum correntropy. To reduce communication overhead, a consensus averaging strategy is incorporated. Furthermore, an adaptive mechanism is introduced to mitigate the impact of manually tuned free parameters. At the same time, the computational complexity and convergence ability of the proposed algorithm are analyzed. The effectiveness of the proposed algorithm is validated through challenging scenarios involving power system and land vehicle state estimation.

eess.SP↗

arXiv2026

P-norm based Fractional-Order Robust Subband Adaptive Filtering Algorithm for Impulsive Noise and Noisy Input

Building upon the mean p-power error (MPE) criterion, the normalized subband p-norm (NSPN) algorithm demonstrates superior robustness in $α$-stable noise environments ($1 < α\leq 2$) through effective utilization of low-order moment hidden in robust loss functions. Nevertheless, its performance degrades significantly when processing noise input or additive noise characterized by $α$-stable processes ($0 < α\leq 1$). To overcome these limitations, we propose a novel fractional-order NSPN (FoNSPN) algorithm that incorporates the fractional-order stochastic gradient descent (FoSGD) method into the MPE framework. Additionally, this paper also analyzes the convergence range of its step-size, the theoretical domain of values for the fractional-order $β$, and establishes the theoretical steady-state mean square deviation (MSD) model. Simulations conducted in diverse impulsive noise environments confirm the superiority of the proposed FoNSPN algorithm against existing state-of-the-art algorithms.

eess.SP↗

arXiv2026

Nearest Kronecker Product Decomposition Based Subband Adaptive Filter: Algorithms and Applications

Recently, the nearest Kronecker product (NKP) decomposition-based normalized least mean square (NLMS-NKP) algorithm has demonstrated superior convergence performance compared to the conventional NLMS algorithm. However, its convergence rate exhibits significant degradation when processing highly correlated input signals. To address this problem, we propose a type-I NKP-based normalized subband adaptive filter (NSAF) algorithm, namely NSAF-NKP-I. Nevertheless, this algorithm incurs substantially higher computational overhead than the NLMS-NKP algorithm. Remarkably, our enhanced type-II NKP-based NSAF (NSAF-NKP-II) algorithm achieves equivalent convergence performance while substantially reducing computational complexity. Furthermore, to enhance robustness against impulsive noise interference, we develop two robust variants: the maximum correntropy criterion-based robust NSAF-NKP (RNSAF-NKP-MCC) and logarithmic criterion-based robust NSAF-NKP (RNSAF-NKP-LC) algorithms. Additionally, detailed analyses of computational complexity, step-size range, and theoretical steady-state performance are provided for theproposed algorithms. To enhance the practicability of the NSAF-NKP-II algorithm in complex nonlinear environments, we further devise two nonlinear implementations: the trigonometric functional link network-based NKP-NSAF (TFLN-NSAF-NKP) and Volterra series expansion-based NKP-NSAF (Volterra-NKP-NSAF) algorithms. In active noise control (ANC) systems, we further propose the filtered-x NSAF-NKP-II (NKP-FxNSAF) algorithm. Simulation experiments in echo cancellation, sparse system identification, nonlinear processing, and ANC scenarios are conducted to validate the superiority of the proposed algorithms over existing state-of-the-art counterparts.

eess.AS↗

arXiv2025

State-of-charge estimation of lithium-ion batteries using a tree seed and genetic algorithm-optimized generalized mixture minimum error entropy-based square root cubature Kalman filter

The cubature Kalman filter based on minimum error entropy (MEE-CKF) offers accurate and robust performance in state of charge (SOC) estimation. However, due to the inflexibility of the minimum error entropy (MEE), this algorithm demonstrates limited robustness when confronted with more complex noise environments. To address these limitations, this paper proposes a generalized mixture minimum error entropy-based (GMMEE) square-root cubature Kalman filter (GMMEE-SRCKF). The square-root algorithm ensures improved numerical stability and avoids covariance degeneration, while the GMMEE criterion with two flexible kernels adapts effectively to non-Gaussian noise. Moreover, a hybrid tree seed and genetic algorithm (TSGA) is introduced to optimize the kernel parameters automatically. Experimental results confirm that the TSGA-optimized GMMEE-SRCKF outperforms existing robust filters, achieving the root mean square error (RMSE) of less than 0.5%.

eess.SP↗

arXiv2025

Distributed Cubature Kalman Filter based on MEEF with Adaptive Cauchy Kernel for State Estimation

Nowadays, with the development of multi-sensor networks, the distributed cubature Kalman filter is one of the well-known existing schemes for state estimation, for which the influence of the non-Gaussian noise, abnormal data, and communication burden are urgent challenges. In this paper, a distributed cubature Kalman filter based on adaptive minimum error entropy with fiducial points (AMEEF) criterion (AMEEF-DCKF) is proposed to overcome the above limitations. Specifically, firstly, in order to solve the influence of various types of non-Gaussian noise and abnormal data, the AMEEF optimization criterion is designed, in which the kernels used are Cauchy kernels with adaptive bandwidth. At the same time, the designed optimization criterion has enhanced the numerical stability and optimized the kernel bandwidth value. Next, in order to address the communication burden problem in multi-sensor networks, where a leader and a follower are distinguished, a distributed algorithm is constructed to achieve an average consensus among these sensors, called leader-follower average consensus (LFAC). Additionally, the convergence proof of the average consensus algorithm and the computational complexity analysis of the AMEEF-DCKF algorithm are also presented. Finally, through a 10-node sensor network, the effectiveness of the proposed algorithm is demonstrated in estimating the state of the power system and navigating land vehicles in complex environments.

eess.SP↗

arXiv2025

Generalized Modified Blake-Zisserman Robust Spline Adaptive Filter for Generalized Gaussian Noise

The spline adaptive filtering (SAF) algorithm-based information-theoretic learning has exhibited strong convergence performance in nonlinear system identification (NSI), establishing SAF as a promising framework for adaptive filtering. However, existing SAF-based methods suffer from performance degradation under generalized Gaussian noise (GGN) environment and exhibit significant steady-state misalignment under impulse noise. Moreover, prior research on SAF algorithms has not effectively addressed the adverse effects caused by outliers. To overcome these challenges, the generalized modified Blake-Zisserman robust spline adaptive filtering (SAF-GMBZ) algorithm is proposed. Compared to conventional SAF algorithms, SAF-GMBZ exhibits superior learning performance in GGN. Furthermore, the mean convergence ranges of the step-sizes and the steady-state mean-square error (MSE) are calculated by introducing the commonly utilized assumptions. To arrive at good convergence accuracy and noise cancellation capability in active noise control (ANC) application, the filter-c GMBZ (FcGMBZ) algorithm is further developed based on SAF-GMBZ. Simulation results confirm the accuracy of the theoretical steady-state MSE, and the superiority of the SAF-GMBZ algorithm under GGN environment in NSI, along with the effectiveness of the FcGMBZ algorithm in ANC application under impulsive noise environment.

eess.SP↗