Searcharxiv⌕ Search

arXiv subjects

Feng Guo

Publications and source records attributed to Feng Guo.

At least 37 records · Page 2Linked to original sources

FAVE: Flow-based Average Velocity Establishment for Sequential Recommendation

Generative recommendation has emerged as a transformative paradigm for capturing the dynamic evolution of user intents in sequential recommendation. While flow-based methods improve the efficiency of diffusion models, they remain hindered by the ``Noise-to-Data'' paradigm, which introduces two critical inefficiencies: prior mismatch, where generation starts from uninformative noise, forcing a lengthy recovery trajectory; and linear redundancy, where iterative solvers waste computation on modeling deterministic preference transitions. To address these limitations, we propose a Flow-based Average Velocity Establishment (Fave) framework for one-step generation recommendation that learns a direct trajectory from an informative prior to the target distribution. Fave is structured via a progressive two-stage training strategy. In Stage 1, we establish a stable preference space through dual-end semantic alignment, applying constraints at both the source (user history) and target (next item) to prevent representation collapse. In Stage 2, we directly resolve the efficiency bottlenecks by introducing a semantic anchor prior, which initializes the flow with a masked embedding from the user's interaction history, providing an informative starting point. Then we learn a global average velocity, consolidating the multi-step trajectory into a single displacement vector, and enforce trajectory straightness via a JVP-based consistency constraint to ensure one-step generation. Extensive experiments on three benchmarks demonstrate that Fave not only achieves state-of-the-art recommendation performance but also delivers an order-of-magnitude improvement in inference efficiency, making it practical for latency-sensitive scenarios.

cs.IR↗

Positivstellensätze for polynomial matrices with universal quantifiers

This paper investigates Positivstellensätze for polynomial matrices subject to universally quantified polynomial matrix inequality constraints. We first establish a matrix-valued Positivstellensatz under the Archimedean condition, incorporating universal quantifiers. For scalar-valued polynomial objectives, we further develop a sparse Positivstellensatz that leverages correlative sparsity patterns within these quantified constraints. Moving beyond the Archimedean framework, we then derive two generalized Positivstellensätze under analogous settings. These results collectively unify and extend foundational theorems in three distinct contexts: classical polynomial Positivstellensätze, their universally quantified counterparts, and matrix polynomial formulations. Applications of the established Positivstellensätze to robust polynomial matrix inequality constrained optimization are also investigated.

math.OC↗

Primal-dual dynamics featuring Hessian-driven damping and variable mass for convex optimization problems

This paper deals with a new Tikhonov regularized primal-dual dynamical system with variable mass and Hessian-driven damping for solving a convex optimization problem with linear equality constraints. The system features several time-dependent parameters: variable mass, slow viscous damping, extrapolation, and temporal scaling. By employing the Lyapunov analysis approach, we obtain the strong convergence of the trajectory generated by the proposed system to the minimal norm solution of the optimization problem, as well as convergence rate results for the primal-dual gap, the objective residual, and the feasibility violation. We also show that the convergence rates of the primal-dual gap, the objective residual, and the feasibility violation can be improved by appropriately adjusting these parameters. Further, we conduct numerical experiments to demonstrate the effectiveness of the theoretical results.

math.OC↗

HalluGuard: Demystifying Data-Driven and Reasoning-Driven Hallucinations in LLMs

The reliability of Large Language Models (LLMs) in high-stakes domains such as healthcare, law, and scientific discovery is often compromised by hallucinations. These failures typically stem from two sources: data-driven hallucinations and reasoning-driven hallucinations. However, existing detection methods usually address only one source and rely on task-specific heuristics, limiting their generalization to complex scenarios. To overcome these limitations, we introduce the Hallucination Risk Bound, a unified theoretical framework that formally decomposes hallucination risk into data-driven and reasoning-driven components, linked respectively to training-time mismatches and inference-time instabilities. This provides a principled foundation for analyzing how hallucinations emerge and evolve. Building on this foundation, we introduce HalluGuard, an NTK-based score that leverages the induced geometry and captured representations of the NTK to jointly identify data-driven and reasoning-driven hallucinations. We evaluate HalluGuard on 10 diverse benchmarks, 11 competitive baselines, and 9 popular LLM backbones, consistently achieving state-of-the-art performance in detecting diverse forms of LLM hallucinations. We open-source our proposed \model{} model at https://github.com/Susan571/HalluGuard-ICLR2026.

cs.LG↗

MixerCSeg: An Efficient Mixer Architecture for Crack Segmentation via Decoupled Mamba Attention

Feature encoders play a key role in pixel-level crack segmentation by shaping the representation of fine textures and thin structures. Existing CNN-, Transformer-, and Mamba-based models each capture only part of the required spatial or structural information, leaving clear gaps in modeling complex crack patterns. To address this, we present MixerCSeg, a mixer architecture designed like a coordinated team of specialists, where CNN-like pathways focus on local textures, Transformer-style paths capture global dependencies, and Mamba-inspired flows model sequential context within a single encoder. At the core of MixerCSeg is the TransMixer, which explores Mamba's latent attention behavior while establishing dedicated pathways that naturally express both locality and global awareness. To further enhance structural fidelity, we introduce a spatial block processing strategy and a Direction-guided Edge Gated Convolution (DEGConv) that strengthens edge sensitivity under irregular crack geometries with minimal computational overhead. A Spatial Refinement Multi-Level Fusion (SRF) module is then employed to refine multi-scale details without increasing complexity. Extensive experiments on multiple crack segmentation benchmarks show that MixerCSeg achieves state-of-the-art performance with only 2.05 GFLOPs and 2.54 M parameters, demonstrating both efficiency and strong representational capability. The code is available at https://github.com/spiderforest/MixerCSeg.

cs.CV↗

MM-NeuroOnco: A Multimodal Benchmark and Instruction Dataset for MRI-Based Brain Tumor Diagnosis

Accurate brain tumor diagnosis requires models to not only detect lesions but also generate clinically interpretable reasoning grounded in imaging manifestations, yet existing public datasets remain limited in annotation richness and diagnostic semantics. To bridge this gap, we introduce MM-NeuroOnco, a large-scale multimodal benchmark and instruction-tuning dataset for brain tumor MRI understanding, consisting of 24,726 MRI slices from 20 data sources paired with approximately 200,000 semantically enriched multimodal instructions spanning diverse tumor subtypes and imaging modalities. To mitigate the scarcity and high cost of diagnostic semantic annotations, we develop a multi-model collaborative pipeline for automated medical information completion and quality control, enabling the generation of diagnosis-related semantics beyond mask-only annotations. Building upon this dataset, we further construct MM-NeuroOnco-Bench, a manually annotated evaluation benchmark with a rejection-aware setting to reduce biases inherent in closed-ended question formats. Evaluation across ten representative models shows that even the strongest baseline, Gemini 3 Flash, achieves only 41.88% accuracy on diagnosis-related questions, highlighting the substantial challenges of multimodal brain tumor diagnostic understanding. Leveraging MM-NeuroOnco, we further propose NeuroOnco-GPT, which achieves a 27% absolute accuracy improvement on diagnostic questions following fine-tuning. This result demonstrates the effectiveness of our dataset and benchmark in advancing clinically grounded multimodal diagnostic reasoning. Code and dataset are publicly available at: https://github.com/gfnnnb/MM-NeuroOnco

cs.CV↗

Perception Characteristics Distance: Measuring Stability and Robustness of Perception System in Dynamic Conditions under a Certain Decision Rule

The safety of autonomous driving systems (ADS) depends on accurate perception across distance and driving conditions. The outputs of AI perception algorithms are stochastic, which have a major impact on decision making and safety outcomes, including time-to-collision estimation. However, current perception evaluation metrics do not reflect the stochastic nature of perception algorithms. We introduce the Perception Characteristics Distance (PCD), a novel metric incorporating model output uncertainty as represented by the farthest distance at which an object can be reliably detected. To represent a system's overall perception capability in terms of reliable detection distance, we average PCD values across multiple detection quality and probabilistic thresholds to produce the average PCD (aPCD). For empirical validation, we present the SensorRainFall dataset, collected on the Virginia Smart Road using a sensor-equipped vehicle (cameras, radar, and LiDAR) under different weather (clear and rainy) and illumination conditions (daylight, streetlight, and nighttime). The dataset includes ground-truth distances, bounding boxes, and segmentation masks for target objects. Experiments with state-of-the-art models show that aPCD captures meaningful differences across weather, daylight, and illumination conditions, which traditional evaluation metrics fail to reflect. PCD provides an uncertainty-aware measure of perception performance, supporting safer and more robust ADS operation, while the SensorRainFall dataset offers a valuable benchmark for evaluation. The SensorRainFall dataset is publicly available at https://www.kaggle.com/datasets/datadrivenwheels/sensorrainfall, and the evaluation code is available at https://github.com/datadrivenwheels/PCD_Python.

cs.RO↗

From Lagging to Leading: Validating Hard Braking Events as High-Density Indicators of Segment Crash Risk

Identifying high crash risk road segments and accurately predicting crash incidence is fundamental to implementing effective safety countermeasures. While collision data inherently reflects risk, the infrequency and inconsistent reporting of crashes present a major challenge to robust risk prediction models. The proliferation of connected vehicle technology offers a promising avenue to leverage high-density safety metrics for enhanced crash forecasting. A Hard-Braking Event (HBE), interpreted as an evasive maneuver, functions as a potent proxy for elevated driving risk due to its demonstrable correlation with underlying crash causal factors. Crucially, HBE data is significantly more readily available across the entire road network than conventional collision records. This study systematically evaluated the correlation at individual road segment level between police-reported collisions and aggregated and anonymized HBEs identified via the Google Android Auto platform, utilizing datasets from California and Virginia. Empirical evidence revealed that HBEs occur at a rate magnitudes higher than traffic crashes. Employing the state-of-the-practice Negative-Binomial regression models, the analysis established a statistically significant positive correlation between the HBE rate and the crash rate: road segments exhibiting a higher frequency of HBEs were consistently associated with a greater incidence of crashes. This sophisticated model incorporated and controlled for various confounding factors, including road type, speed profile, proximity to ramps, and road segment slope. The HBEs derived from connected vehicle technology thus provide a scalable, high-density safety surrogate metric for network-wide traffic safety assessment, with the potential to optimize safer routing recommendations and inform the strategic deployment of active safety countermeasures.

cs.OH↗

Stability-Guaranteed Dual Kalman Filtering for Electrochemical Battery State Estimation

Accurate and stable state estimation is critical for battery management. Although dual Kalman filtering can jointly estimate states and parameters, the strong coupling between filters may cause divergence under large initialization errors or model mismatch. This paper proposes a Stability Guaranteed Dual Kalman Filtering (SG-DKF) method. A Lyapunov-based analysis yields a sufficient stability condition, leading to an adaptive dead-zone rule that suspends parameter updates when the innovation exceeds a stability bound. Applied to an electrochemical battery model, SG-DKF achieves accuracy comparable to a dual EKF and reduces state of charge RMSE by over 45% under large initial state errors.

eess.SY↗

Bridging Code Graphs and Large Language Models for Better Code Understanding

Large Language Models (LLMs) have demonstrated remarkable performance in code intelligence tasks such as code generation, summarization, and translation. However, their reliance on linearized token sequences limits their ability to understand the structural semantics of programs. While prior studies have explored graphaugmented prompting and structure-aware pretraining, they either suffer from prompt length constraints or require task-specific architectural changes that are incompatible with large-scale instructionfollowing LLMs. To address these limitations, this paper proposes CGBridge, a novel plug-and-play method that enhances LLMs with Code Graph information through an external, trainable Bridge module. CGBridge first pre-trains a code graph encoder via selfsupervised learning on a large-scale dataset of 270K code graphs to learn structural code semantics. It then trains an external module to bridge the modality gap among code, graph, and text by aligning their semantics through cross-modal attention mechanisms. Finally, the bridge module generates structure-informed prompts, which are injected into a frozen LLM, and is fine-tuned for downstream code intelligence tasks. Experiments show that CGBridge achieves notable improvements over both the original model and the graphaugmented prompting method. Specifically, it yields a 16.19% and 9.12% relative gain in LLM-as-a-Judge on code summarization, and a 9.84% and 38.87% relative gain in Execution Accuracy on code translation. Moreover, CGBridge achieves over 4x faster inference than LoRA-tuned models, demonstrating both effectiveness and efficiency in structure-aware code understanding.

cs.CL↗

Optimizing Parameter Estimation for Electrochemical Battery Model: A Comparative Analysis of Operating Profiles on Computational Efficiency and Accuracy

Parameter estimation in electrochemical models remains a significant challenge in their application. This study investigates the impact of different operating profiles on electrochemical model parameter estimation to identify the optimal conditions. In particular, the present study is focused on Nickel Manganese Cobalt Oxide(NMC) lithium-ion batteries. Based on five fundamental current profiles (C/5, C/2, 1C, Pulse, DST), 31 combinations of conditions were generated and used for parameter estimation and validation, resulting in 961 evaluation outcomes. The Particle Swarm Optimization is employed for parameter identification in electrochemical models, specifically using the Single Particle Model (SPM). The analysis considered three dimensions: model voltage output error, parameter estimation error, and time cost. Results show that using all five profiles (C/5, C/2, 1C, Pulse, DST) minimizes voltage output error, while {C/5, C/2, Pulse, DST} minimizes parameter estimation error. The shortest time cost is achieved with {1C}. When considering both model voltage output and parameter errors, {C/5, C/2, 1C, DST} is optimal. For minimizing model voltage output error and time cost, {C/2, 1C} is best, while {1C} is ideal for parameter error and time cost. The comprehensive optimal condition is {C/5, C/2, 1C, DST}. These findings provide guidance for selecting current conditions tailored to specific needs.

eess.SY↗

Beyond Superficial Forgetting: Thorough Unlearning through Knowledge Density Estimation and Block Re-insertion

Machine unlearning, which selectively removes harmful knowledge from a pre-trained model without retraining from scratch, is crucial for addressing privacy, regulatory compliance, and ethical concerns in Large Language Models (LLMs). However, existing unlearning methods often struggle to thoroughly remove harmful knowledge, leaving residual harmful knowledge that can be easily recovered. To address these limitations, we propose Knowledge Density-Guided Unlearning via Blocks Reinsertion (KUnBR), a novel approach that first identifies layers with rich harmful knowledge and then thoroughly eliminates the harmful knowledge via re-insertion strategy. Our method introduces knowledge density estimation to quantify and locate layers containing the most harmful knowledge, enabling precise unlearning. Additionally, we design a layer re-insertion strategy that extracts and re-inserts harmful knowledge-rich layers into the original LLM, bypassing gradient obstruction caused by cover layers and ensuring effective gradient propagation during unlearning. Extensive experiments conducted on several unlearning and general capability benchmarks demonstrate that KUnBR achieves state-of-the-art forgetting performance while maintaining model utility.

cs.LG↗

Efficiency and Optimality in Electrochemical Battery Model Parameter Identification: A Comparative Study of Estimation Techniques

Parameter identification for electrochemical battery models has always been challenging due to the multitude of parameters involved, most of which cannot be directly measured. This paper evaluates the efficiency and optimality of three widely-used parameter identification methods for electrochemical battery models: Least Squares Method (LS), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). Therefore, a Single Particle Model (SPM) of a battery was developed and discretized. Battery parameter grouping was then performed to reduce the number of parameters required. Using a set of parameters previously identified from a real battery as a benchmark, we generated fitting and validation datasets to assess the methods' runtime and accuracy. The comparative analysis reveals that PSO outperforms the other methods in terms of accuracy and stability, making it highly effective for parameter identification when there is no prior knowledge of the battery's internal parameters. In contrast, LS is better suited for minor adjustments in parameters, particularly for aging batteries, whereas GA lags behind in both computational efficiency and optimality with respect to PSO.

eess.SY↗

Adaptive Dead-Zone Dual Sliding Mode Observer for Reliable Electrochemical Model-Based SOC Estimation

Accurate state of charge (SOC) estimation is critical for ensuring the safety, reliability, and efficiency of lithium-ion batteries in electric vehicles and energy storage systems. Electrochemical models provide high fidelity for SOC estimation but introduce challenges due to parameter variations, nonlinearities, and computational complexity. To address these issues, this paper proposes an adaptive dead-zone dual sliding mode observer(SMO) based on an improved electrochemical single-particle model. The algorithm integrates a state observer for SOC estimation and a parameter observer for online parameter adaptation. A Lyapunov-derived adaptive dead-zone is introduced to ensure stability, activating parameter updates only when the terminal voltage error lies within a rigorously defined bound. The proposed method was validated under constant-current and UDDS dynamic conditions. Results demonstrate that the adaptive dead-zone dual SMO achieves superior accuracy compared with conventional dual SMO and equivalent circuit model-based EKF methods, maintaining SOC estimation errors within 0.2% under correct initialization and below 1% under a 30% initial SOC error, with rapid convergence. Computational efficiency analysis further shows that the adaptive dead-zone dual sliding mode observer reduces execution time compared with the conventional dual SMO by limiting unnecessary parameter updates, highlighting its suitability for real-time battery management applications. Moreover, robustness under battery aging was confirmed using a cycle-aging model, where the adaptive dead-zone dual SMO maintained stable SOC estimation despite parameter drift. These findings indicate that the proposed method offers a reliable, accurate, and computationally efficient solution for SOC estimation.

eess.SY↗

Non-SOS Positivstellensätze for semi-algebraic sets defined by polynomial matrix inequalities

This paper establishes new Positivstellensätze for polynomials that are positive on sets defined by polynomial matrix inequalities (PMIs). We extend the classical Handelman and Krivine-Stengle theorems from the scalar inequality setting to the matrix context, deriving explicit certificate forms that do not rely on sums-of-squares (SOS). Specifically, we show that under certain conditions, any polynomial positive on a PMI-defined semialgebraic set admits a representation using Kronecker powers of the defining matrix (or its dilated form) with positive semidefinite coefficient matrices. Under correlative sparsity pattern, we further prove more efficient, sparse representations that significantly reduce computational complexity. By applying these results to polynomial optimization with PMI constraints, we construct a hierarchy of semidefinite programming relaxations whose size depends only on the dimension of the constraint matrix, and not on the number of variables. Consequently, our relaxations may remain computationally feasible for problems with large number of variables and low-dimensional matrix constraints, offering a practical alternative where the traditional SOS-based relaxations become intractable.

math.OC↗

I Know What You Said: Unveiling Hardware Cache Side-Channels in Local Large Language Model Inference

Large Language Models (LLMs) that can be deployed locally have recently gained popularity for privacy-sensitive tasks, with companies such as Meta, Google, and Intel playing significant roles in their development. However, the security of local LLMs through the lens of hardware cache side-channels remains unexplored. In this paper, we unveil novel side-channel vulnerabilities in local LLM inference: token value and token position leakage, which can expose both the victim's input and output text, thereby compromising user privacy. Specifically, we found that adversaries can infer the token values from the cache access patterns of the token embedding operation, and deduce the token positions from the timing of autoregressive decoding phases. To demonstrate the potential of these leaks, we design a novel eavesdropping attack framework targeting both open-source and proprietary LLM inference systems. The attack framework does not directly interact with the victim's LLM and can be executed without privilege. We evaluate the attack on a range of practical local LLM deployments (e.g., Llama, Falcon, and Gemma), and the results show that our attack achieves promising accuracy. The restored output and input text have an average edit distance of 5.2% and 17.3% to the ground truth, respectively. Furthermore, the reconstructed texts achieve average cosine similarity scores of 98.7% (input) and 98.0% (output).

cs.CR↗

Sparse Polynomial Matrix Optimization

A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of polynomial matrix inequalities. This work explores the use of sparsity methods in reducing the complexity of sum-of-squares based methods in verifying polynomial matrix inequalities or solving polynomial matrix optimization. In the unconstrained setting, Newton polytopes can be employed to sparsify the monomial basis, resulting in smaller semidefinite programs. In the general setting, we show how to exploit different types of sparsity (term sparsity, correlative sparsity, matrix sparsity) encoded in polynomial matrices to derive sparse semidefinite programming relaxations for polynomial matrix optimization. For term sparsity, we show that the block structures of the term sparsity iterations with maximal chordal extensions converge to the one determined by PMI sign symmetries. For correlative sparsity, unlike the scalar case, we provide a counterexample showing that asymptotic convergence does not hold under the Archimedean condition and the running intersection property. By employing the theory of matrix-valued measures, we establish several results on detecting global optimality and retrieving optimal solutions under correlative sparsity. The effectiveness of sparsity methods on reducing computational complexity is demonstrated on various examples of polynomial matrix optimization.

math.OC↗

Comparative Performance Analysis of Numerical Discretization Methods for Electrochemical Models of Lithium-ion Batteries

This study evaluates numerical discretization methods for the Single Particle Model (SPM) used in electrochemical modeling. The methods include the Finite Difference Method (FDM), spectral methods, Padé approximation, and parabolic approximation. Evaluation criteria are accuracy, execution time, and memory usage, aiming to guide method selection for electrochemical models. Under constant current conditions, the FDM explicit Euler and Runge-Kutta methods show significant errors, while the FDM implicit Euler method improves accuracy with more nodes. The spectral method achieves the best accuracy and convergence with as few as five nodes. The Padé approximation exhibits increasing errors with higher current, and the parabolic approximation shows higher errors than the converged spectral and FDM implicit Euler methods. Under dynamic conditions, frequency domain analysis indicates that the FDM, spectral, and Padé approximation methods improve high-frequency response by increasing node count or method order. In terms of execution time, the parabolic method is fastest, followed by the Padé approximation. The spectral method is faster than FDM, while the FDM implicit Euler method is the slowest. Memory usage is lowest for the parabolic and Padé methods, moderate for FDM, and highest for the spectral method. These findings provide practical guidance for selecting discretization methods under different operating scenarios.

eess.SY↗