Search arXiv⌕ Search

arXiv subjects

Feng Liu

Publications and source records attributed to Feng Liu.

At least 55 records · Page 3Linked to original sources
arXiv2026

NeuroWeaver: An Autonomous Evolutionary Agent for Exploring the Programmatic Space of EEG Analysis Pipelines

Although foundation models have achieved remarkable success in general domains, applying them to electroencephalography (EEG) analysis is constrained by substantial data requirements and large parameter counts, which incur prohibitive computational costs and impede deployment in resource-constrained clinical environments. General-purpose automated machine learning frameworks are likewise ill-suited to this domain, since exploration within an unbounded programmatic space fails to incorporate essential neurophysiological priors and frequently yields neuroscientifically implausible solutions. We therefore propose NeuroWeaver, a unified autonomous evolutionary agent that generalizes across diverse EEG datasets and tasks by reformulating pipeline engineering as a discrete constrained optimization problem solved through large language model (LLM)-driven generation of executable code. A Domain-Informed Subspace Initialization confines the search to a neuroscientifically plausible manifold, while a Multi-Objective Evolutionary Optimization dynamically balances performance, novelty, and efficiency via self-reflective refinement. Across five heterogeneous benchmarks, NeuroWeaver synthesizes lightweight pipelines that outperform state-of-the-art task-specific methods on nearly all metrics and attain accuracy comparable to large-scale foundation models, even surpassing them on the HMC and Workload benchmarks with only $0.18$M and $0.011$M parameters, respectively.

cs.AI↗
arXiv2026

The Locality Cost of Fully Flat Hopf Insulators

Hopf topology permits a strictly finite-range Hamiltonian with one exactly flat topological band. We prove, however, that extending flatness to the complete two-band spectrum necessarily sacrifices strict locality or the gap: any gapped, Hermitian, translationally invariant two-band Hamiltonian with strictly finite-range hopping and two exactly flat bands has vanishing Hopf invariant. Equivalently, within this two-band setting, a Hopf band admits no compactly supported, translation-covariant, orthonormal Wannier generator. For factorized one-flat-band Hopf parents, the unavoidable partner dispersion equals the Gram symbol of translated compact localized states and encodes their nonorthogonality. Full flattening converts this dispersion into exponentially decaying but infinitely supported hopping. Model-independent bounds provide a sufficient criterion for finite-range approximants to retain the Hopf phase. An explicit model yields the axial decay length $ξ_z/a=1/\ln 2$, parameter-free hopping tails, and residual bandwidths testable in circuit and photonic lattices. Hopf topology therefore does not prohibit a flat band but forces the locality--flatness cost to appear as either partner-band dispersion or nonlocal hopping.

cond-mat.mtrl-sci↗
arXiv2026

User Representation via Cross Multi-source Behavior Pre-training for Mobile Games

User representation pre-training has become a fundamental paradigm for alleviating data sparsity in downstream personalization tasks. However, existing studies predominantly focus on single-app or app-level behaviors, overlooking the inherently cross-source and multi-granular nature of user activities on mobile devices. At the device level, user intent emerges from complex interactions among heterogeneous behavior sources and hierarchical action structures, posing challenges that cannot be addressed by conventional app-centric modeling. To tackle this issue, we propose CM-PTM, a novel Cross Multi-source Behavior Pre-Training Model tailored for mobile game user representation learning on device-level behavioral logs. CM-PTM employs hierarchical cascaded mask-then-predict proxy tasks that first infer the source of the next behavior and then progressively refine predictions at the app-action level. This design enables unified modeling of cross-source dependencies and fine-grained behavioral dynamics within a single pre-training paradigm. Extensive experiments on large-scale real-world mobile datasets demonstrate that CM-PTM effectively captures users' endogenous interests and consistently delivers significant performance gains on downstream mobile game recommendation tasks.

cs.AI↗
arXiv2026

DIASENTINEL: An Auditable Multi-Agent System for Guideline-Grounded Diabetes Risk Screening

Large language models (LLMs) offer promising clinical decision support but remain vulnerable to hallucinated facts, unsupported recommendations, and citation errors. We present DIASENTINEL, a fully on-premise multi-agent system for one-year type 2 diabetes mellitus (T2DM) risk screening and guideline-grounded report generation from electronic health records (EHRs). The system integrates calibrated risk prediction, deterministic clinical signal extraction, Reciprocal Rank Fusion over American Diabetes Association (ADA) guidelines, and a hybrid verification layer combining rule-based checks with LLM entailment. The demonstration provides a real-time batch-screening dashboard and an interactive patient report interface with cited recommendations, verification results, and raw EHR comparison. DIASENTINEL demonstrates a practical framework for reliable, auditable, and privacy-preserving LLM-based clinical decision support.

cs.CL↗
arXiv2026

Decentralized and Equilibrium-Set-Oriented Stability Analysis and Control for Power Systems

Conventional power-system stability analysis is largely centralized and centered on a single equilibrium point, which becomes increasingly restrictive in the presence of large-scale fluctuating renewable generation. This paper develops a decentralized framework for stability analysis and control that certifies the asymptotic stability of an equilibrium set rather than that of a given single operating point. To this end, we introduce a new notion termed input--output differential passivity (IODP), which decomposes equilibrium-set stability of the interconnected system into local requirements imposed on individual devices. These requirements are formulated without embedding a particular operating equilibrium into the local conditions; once the certified regions are constructed, stability verification for a given operating scenario reduces to checking whether its equilibrium lies in the certified set. The proposed conditions require each bus to possess a sufficient level of IODP, quantified by an IODP index. To compensate for an IODP shortage, we further develop an I/O-transformation-based passivation controller that reshapes the local input--output behavior of the corresponding device. In this way, all grid-connected components can be made to satisfy the decentralized conditions for system-wide stability. The proposed framework is validated on a modified IEEE 39-bus system. Simulation results demonstrate that it provides a scalable and equilibrium-set-oriented solution for stability certification and control under highly variable operating conditions.

eess.SY↗
arXiv2026

Relative-Degree Wall Restricts Passivity-Based Stability Analysis in Inverter-Dominant Grids

This letter reveals a fundamental limitation of passivity-based distributed stability analysis in power systems. Under the standard formulation, passivity certification inherently imposes a relative-degree compatibility constraint that excludes many high-fidelity inverter dynamic models (e.g., those that include electromagnetic transients). Potential extensions of passivity frameworks are discussed to break this limitation.

eess.SY↗
arXiv2026

VPP: Virtual Pipeline Parallelism for Efficient Chunked Prefill in Long-Context LLM Inference

Chunked prefill pipeline parallelism (CPP) is a key technique for LLM inference. However, equal-size chunks exhibit imbalanced latency, as later chunks attend longer prefix KV caches and incur higher attention costs, leading to pipeline bubbles. Existing approaches mitigate this imbalance through dynamic chunk resizing (Dynamic CPP, DCPP), but our measurements show that this trades scheduling overhead for load balancing, which becomes unfavorable on long sequences. In this study, we propose Virtual Pipeline Parallelism (VPP), which keeps chunk sizes fixed and optimizes the pipeline layout through virtual stages. A V-shaped virtual-stage traversal overlaps each chunk's expensive middle stages with the lighter head and tail stages of its neighbors, while asynchronous communication and pipelined packing further reduce communication stalls and cross-request drain bubbles. We implement VPP in vLLM-Ascend and evaluate it on three MoE-based LLMs with sequences up to 1M tokens on 16 Ascend 910C NPUs. VPP improves throughput by up to 13.1% over DCPP on long sequences and 6.7% on mixed workloads, while preserving performance on short sequences. On a 512K-token DeepSeek-V3.1 prefill workload, VPP reduces the pipeline bubble ratio from 6.4% to 0.1%, achieving a 98.0% reduction compared with DCPP.

cs.DC↗
arXiv2026

Giant Surface-driven Nonlinear Hall Effect in BiTeCl at Room Temperature

The nonlinear Hall effect (NLHE) provides a pathway to generate a Hall response in time-reversal-symmetric yet inversion-symmetry-broken systems. NLHE can rectify an alternating current into a transverse direct voltage, making it attractive for radio-frequency rectification, energy harvesting, and terahertz detection, applications for which device miniaturization remains a central pursuit. In this context, the inherent inversion symmetry breaking at surfaces is particularly appealing: because symmetry is necessarily broken at the surface of any crystal, irrespective of whether its bulk is centrosymmetric, surface-driven nonlinear responses lift the stringent constraint on bulk symmetry and open a route toward compact device architectures. Here we report the observation of a giant, surface-driven second-order nonlinear Hall effect in the Rashba-type polar semiconductor BiTeCl at room temperature. The determined second-order nonlinear Hall susceptibility at 300 K reaches 1.68 $μ$mV$^{-1}$, which is 80 times larger than that of the best previously reported surface-dominated systems. We attribute this giant response to the synergistic interplay between BiTeCl's polar crystal structure and its rich surface states: the polar stacking renders the top and bottom surfaces inequivalent, so that the nonlinear response originates from a single surface without compensation from the other. Symmetry and scaling analyses suggest that both skew-scattering and side-jump mechanisms contribute to the observed effect. Our findings not only identify BiTeCl as a promising platform for future applications utilizing the NLHE, but also establish the asymmetry between the opposite surfaces of a polar crystal as a general design principle for discovering surface-driven materials with larger nonlinear Hall responses.

cond-mat.mtrl-sci↗
arXiv2026

A criterion on weak type $(1,1)$ bound of rough singular integrals

In this paper we establish a criterion on weak type $(1,\,1)$ bound of the following rough singular integral $$T_{Ω,K,a}f(x)={\rm p.v.}\int_{\mathbb{R}^n}Ω(x-y)K(x,y)m_{x,y}a f(y)dy,$$ where $m_{x,y}a=\int_0^1a(sx+(1-s)y)ds$ with $a\in L^1(\mathbb{R}^n)$ and $\hat{a}\in L^1(\mathbb{R}^n)$, $Ω$ is homogeneous of degree zero, integrable in $\mathbb{S}^{n-1}$ and satisfies the cancellation condition $\int_{\mathbb{S}^{n-1}}Ω(θ)dσ(θ)=0$ and $K$ is a measurable function defined on $\mathbb{R}^n\times\mathbb{R}^n\setminus \{(x,x):x\in\mathbb{R}^n\}$ and satisfies a Hölder condition. By assuming that $Ω\in L\log L(\mathbb{S}^{n-1})$ and the operator $T_{Ω, K}f(x)={\rm p.v.}\int_{\mathbb{R}^n}Ω(x-y)K(x,y)f(y)dy$ is bounded on $L^2(\mathbb{R}^n)$, we prove the weak type (1,1) bound of $T_{Ω,K,a}$. As several applications, we obtain a large class of singular integral operators which possess weak type $(1,\,1)$ bound. The main results of this paper essentially extend and generalize some known ones.

math.CA↗
arXiv2026

Tight Bound for Nikiforov's Spectral Even-Cycle Conjecture

Nikiforov conjectured that, for every fixed $k\ge2$ and all sufficiently large $n$, the unique $n$-vertex $C_{2k+2}$-free graph with maximum adjacency spectral radius is $S^+_{n,k}$, where $S_{n,k}=K_k\vee\overline K_{n-k}$ and $S^+_{n,k}$ is obtained from $S_{n,k}$ by adding one edge inside the independent part. Cioabă, Desai and Tait proved this conjecture for $n\ge k^{O(k)}$. Later, Li and Ning raised the problem of determining the optimal exponent $γ=γ(k)$ such that the same conclusion holds for $n\ge Ω(k^{γ(k)})$. We prove a stronger uniform theorem for Nikiforov's matrices $A_α(G)=αD(G)+(1-α)A(G)$. More precisely, for every $ε>0$ there are constants $C_ε$ and $k_ε$ such that for all $0\leα\le1-ε$, $k\ge k_ε$ and $n\ge C_εk$, every $n$-vertex $C_{2k+2}$-free graph $G$ satisfies $ρ_α(G)\leρ_α(S^+_{n,k})$, with equality if and only if $G\cong S^+_{n,k}$. In particular, the case $α=0$ answers the problem of Li and Ning, and the $A_α$-spectral even-cycle threshold is linear in $k$, uniformly for all $α$ bounded away from $1$. Our proof introduces a weighted rooted Erdős--Gallai type path lemma, which may be of independent interest in Perron-vector methods for spectral extremal graph problems. The same method also yields asymptotically tight $A_α$-spectral bounds for two local forbidden-subgraph families, namely $(K_1\vee P_\ell)$-free graphs and $F_s$-free graphs, where $F_s$ denotes the friendship graph.

math.CO↗
arXiv2026

Vision Language Models Cannot Plan, but Can They Formalize?

The advancement of vision language models (VLMs) has empowered embodied agents to accomplish simple multimodal planning tasks, but not long-horizon ones requiring long sequences of actions. In text-only simulations, long-horizon planning has seen significant improvement brought by repositioning the role of LLMs. Instead of directly generating action sequences, LLMs translate the planning domain and problem into a formal planning language like the Planning Domain Definition Language (PDDL), which can call a formal solver to derive the plan in a verifiable manner. In multimodal environments, research on VLM-as-formalizer remains scarce, usually involving gross simplifications such as predefined object vocabulary or overly similar few-shot examples. In this work, we present a suite of five VLM-as-formalizer pipelines that tackle one-shot, open-vocabulary, and multimodal PDDL formalization. We evaluate those on an existing benchmark while presenting another two that for the first time account for planning with authentic, multi-view, and low-quality images. We conclude that VLM-as-formalizer greatly outperforms end-to-end plan generation. We find that visual grounding of object relations remains the primary bottleneck for weaker VLMs, while stronger models have largely overcome this limitation. While generating intermediate, textual representations such as captions or scene graphs partially compensate for the performance, their inconsistent gain leaves headroom for future research directions on multimodal planning formalization.

cs.CL↗
arXiv2026

Every fork-free graph is perfectly weight divisible

A graph $G$ is \emph{perfectly weight divisible} if, for every positive integral weight function on $V(G)$ and every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A$ and $B$ such that $H[A]$ is perfect and the maximum weight of a clique in $H[B]$ is smaller than the maximum weight of a clique in $H$. Perfect divisibility and its weighted form provide a natural approach to polynomial $χ$-boundedness. A \emph{fork}, also known as a \emph{chair}, is the graph obtained from a claw by subdividing one of its edges once. In this paper, we prove that every fork-free graph is perfectly weight divisible. As a consequence, we confirm a conjecture of Sivaraman that every fork-free graph is perfectly divisible.

math.CO↗
arXiv2026

Variational Mixture of Graph Neural Experts for Alzheimer's Disease Recognition across Frequency Bands in EEG Brain Networks

Dementia disorders such as Alzheimer's disease (AD) and frontotemporal dementia (FTD) exhibit overlapping electrophysiological signatures in electroencephalography (EEG) that challenge accurate diagnosis. Existing EEG-based methods are limited by full-band frequency analysis, which hinders precise differentiation of dementia subtypes and severity stages. To address this limitation, we propose a Variational Mixture of Graph Neural Experts (VMoGE) framework that integrates multi-band EEG analysis with variational graph neural networks and a mixture-of-experts architecture. Each expert specializes in a specific EEG frequency band and models brain connectivity using a Gaussian Markov Random Field prior, while a variational gating mechanism adaptively integrates expert outputs. This design enables the model to learn frequency-specific brain network representations while modeling latent uncertainty through variational inference. Experimental results on two EEG dementia datasets show that VMoGE achieves strong performance, with an area under the curve (AUC) of 0.89 for healthy controls (HC) vs. AD classification in the main comparison and competitive results across dementia subtyping and Clinical Dementia Rating (CDR) staging tasks. Clinically, VMoGE offers three key translational values: the expert gating weights correlate with Mini-Mental State Examination (MMSE) scores and CDR severity, slow-wave $δ/ θ$-band contributions are associated with AD-related EEG slowing and disease progression, and spatially localized activation maps reveal posterior $θ$/$α$-band alterations and region-specific $β$-band changes, providing neurophysiologically interpretable patterns aligned with known AD neuropathology.

cs.LG↗
arXiv2026

SapiensID 2.0: Aligning Human Recognition Foundation Models with Human Perception

While foundation models have significantly advanced human recognition across diverse modalities, they predominantly rely on static, geometric feature extraction. This approach fundamentally diverges from human perception. Consequently, current models often suffer from "semantic blindness," overfitting to transient noise while failing to leverage invariant soft biometrics, and struggle to capture temporal motion signatures. To bridge this gap, we propose SapiensID 2.0, a human recognition framework enriched with both semantic and temporal awareness. To overcome the lack of soft-biometric annotations, we transfer zero-shot semantic knowledge from Multimodal Large Language Models (MLLMs) into a discriminative embedding space. We resolve the dimensional mismatch between these spaces using Invariant Trait Alignment (ITA) to distill core persistent traits, and Transient Noise Disentanglement (TND) to decouple artifacts like clothing. Furthermore, we design a Kinematic Semantic Attention Head (K-SAH) that extends spatial attention across temporal windows. By tracking semantic patches over time, K-SAH captures rich kinematic signatures without requiring large-scale video datasets. Extensive experiments demonstrate that SapiensID 2.0 achieves state-of-the-art performance across image- and video-based person re-identification and gait recognition, while maintaining robust face recognition capabilities.

cs.CV↗
arXiv2026

A-SR: Self-Evolving Agentic LLMs for Symbolic Regression via Hierarchical Coordination

Symbolic regression aims to discover closed-form equations from data, but existing LLM-guided methods often rely on a unified proposal loop that compresses heterogeneous search failures into a scalar score and a single prompt. We propose A-SR, a self-evolving agentic framework that shifts the control unit from expression edits to role-conditioned evidence views. A-SR coordinates formula discovery through routing among coordination protocols, an online evaluator-reward role policy, and state-routed process memory. During search, evaluator feedback characterizes reliability and productivity, updates role-level utilities, and routes elite motifs, failure traces, and validity diagnostics to different agents. The framework self-evolves at two timescales: within a run, it adapts the search process without updating LLM parameters; across runs, recorded trajectories can be distilled into open-source LLMs as role-conditioned proposal priors. Averaged over the four LSR-Synth scientific domains in LLM-SRBench, A-SR improves Acc@0.01 over baselines from 25.79% to 48.30% with Llama3.1-8B, while A-SR-LoRA improves the corresponding Qwen3-4B result from 24.58% to 38.29%. On four real-world scientific discovery tasks, A-SR obtains the best in-distribution or out-of-distribution normalized mean squared error on 7 of 8 reported metrics.

cs.CL↗
arXiv2026

Adversarial Purification by Consistency-aware Latent Space Optimization on Data Manifolds

Deep neural networks (DNNs) are vulnerable to adversarial samples crafted by adding imperceptible perturbations to clean data, potentially leading to incorrect and dangerous predictions. Adversarial purification has been an effective means to improve DNNs robustness by removing these perturbations before feeding the data into the model. However, it faces significant challenges in preserving key structural and semantic information of data, as the imperceptible nature of adversarial perturbations makes it hard to avoid over-correcting, which can destroy important information and degrade model performance. In this paper, we break away from traditional adversarial purification methods by focusing on the clean data manifold. To this end, we reveal that samples generated by a well-trained generative model are close to clean ones but far from adversarial ones. Leveraging this insight, we propose Consistency Model-based Adversarial Purification (CMAP), which optimizes vectors within the latent space of a pre-trained consistency model to generate samples for restoring clean data. Specifically, 1) we propose a Perceptual consistency restoration mechanism by minimizing the discrepancy between generated samples and input samples in both pixel and perceptual spaces. 2) To maintain the optimized latent vectors within the valid data manifold, we introduce a Latent distribution consistency constraint strategy to align generated samples with the clean data distribution. 3) We also apply a Latent vector consistency prediction scheme via an ensemble approach to enhance prediction reliability. CMAP fundamentally addresses adversarial perturbations at their source, providing a robust purification. Extensive experiments on CIFAR-10 and ImageNet-100 show that our CMAP significantly enhances robustness against strong adversarial attacks while preserving high natural accuracy.

cs.LG↗
arXiv2026

AutoSupervision: Closing the Feedback Loop in Scientific Workflows with Grounded Revision Verification

Recent advances in large language models (LLMs) have enabled AI systems to assist scientific research and peer review. However, an essential capability for reliable AI-assisted scientific workflows remains underexplored: verifying whether reviewer feedback leads to meaningful and evidence-supported manuscript improvements. We introduce AutoSupervision, which evaluates whether scientific manuscript revisions genuinely address reviewer concerns through grounded evidence. AutoSupervision leverages transparent peer-review records as a natural source of supervision, where reviewer comments specify scientific concerns, author responses describe claimed resolutions, and revised manuscripts provide evidence of changes. Given reviewer comments, author responses, and revised manuscripts, models must characterize reviewer concerns, determine whether concerns have been addressed, and identify supporting manuscript evidence. We construct AutoSupervision from 56,000 Nature Communications articles and corresponding review records. Then we conducted experiments on LLMs, the ablation study, and the case study. Our results show that while LLMs perform well in characterizing reviewer concerns, with GPT-5.5 achieving a score of 0.754, evidence-based verification remains the primary bottleneck, with the best-performing model reaching only 0.501.

cs.CL↗
arXiv2026

Optimal coloring of $\{\mathrm{cap},\mathrm{even\ hole}\}$-free graphs with no short odd holes

A \emph{hole} is an induced cycle of length at least four, and an \emph{even hole} is a hole of even length. A \emph{cap} is obtained from a hole by adding a vertex adjacent to exactly two consecutive vertices of the hole. Chen, Xu, and Xu proved that every $\{\mathrm{cap},\mathrm{even\ hole}\}$-free graph $G$ satisfies $χ(G)\leq \left\lceil\frac{5}{4}ω(G)\right\rceil$, and improved this bound to $χ(G)\leq \left\lceil\frac{7}{6}ω(G)\right\rceil$ when $5$-holes are also excluded. They asked whether, for every integer $q\geq3$, every $\{\mathrm{cap},\mathrm{even\ hole}\}$-free graph $G$ with no odd hole of length at most $2q-1$ satisfies $$ χ(G)\leq \left\lceil\frac{2q+1}{2q}ω(G)\right\rceil. $$ We answer this question affirmatively and show that the bound is sharp for every $q\geq3$.

math.CO↗