Searcharxiv⌕ Search

arXiv subjects

Zhuo Zhang

Publications and source records attributed to Zhuo Zhang.

At least 55 records · Page 3Linked to original sources

From Poisoned to Aware: Fostering Backdoor Self-Awareness in LLMs

Large Language Models (LLMs) can acquire deceptive behaviors through backdoor attacks, where the model executes prohibited actions whenever secret triggers appear in the input. Existing safety training methods largely fail to address this vulnerability, due to the inherent difficulty of uncovering hidden triggers implanted in the model. Motivated by recent findings on LLMs' situational awareness, we propose a novel post-training framework that cultivates self-awareness of backdoor risks and enables models to articulate implanted triggers even when they are absent from the prompt. At its core, our approach introduces an inversion-inspired reinforcement learning framework that encourages models to introspectively reason about their own behaviors and reverse-engineer the triggers responsible for misaligned outputs. Guided by curated reward signals, this process transforms a poisoned model into one capable of precisely identifying its implanted trigger. Surprisingly, we observe that such backdoor self-awareness emerges abruptly within a short training window, resembling a phase transition in capability. Building on this emergent property, we further present two complementary defense strategies for mitigating and detecting backdoor threats. Experiments on five backdoor attacks, compared against six baseline methods, demonstrate that our approach has strong potential to improve the robustness of LLMs against backdoor risks. The code is available at LLM Backdoor Self-Awareness.

cs.CR↗

Emergence of Deviance Detection in Cortical Cultures through Maturation, Criticality, and Early Experience

Mismatch negativity (MMN) in humans reflects deviance detection (DD), a core neural mechanism of predictive processing. However, the fundamental principles by which DD emerges and matures during early cortical development-potentially providing a neuronal scaffold for MMN-remain unclear. Here, we tracked the development of DD in dissociated cortical cultures grown on high-density CMOS microelectrode arrays from 10 to 35 days in vitro (DIV). Cultures were stimulated with oddball and many-standards control paradigms while spontaneous and evoked activity were recorded longitudinally. At early stages, stimulus-evoked responses were confined to fast components reflecting direct activation. From DIV15-20 onward, robust late responses appeared, and deviant stimuli progressively evoked stronger responses than frequent and control stimuli, marking the onset of DD. By DIV30, responses became stronger, faster, and more temporally precise. Neuronal avalanche analysis revealed a gradual transition from subcritical to near-critical dynamics, with cultures exhibiting power-law statistics showing the strongest deviant responses. Nonetheless, DD was also present in non-critical networks, indicating that criticality is not required for its emergence but instead stabilizes and amplifies predictive processing as networks mature. Early oddball experience reinforces the deviant pathway, resulting in faster conduction along those circuits. However, as frequent and deviant pathways become less distinct, the deviance detection index is reduced. Together, these findings demonstrate that DD arises intrinsically through local circuit maturation, while self-organization toward criticality and early experience further refine its strength and timing, providing mechanistic insight into predictive coding in simplified cortical networks and informing the design of adaptive, prediction-sensitive artificial systems.

q-bio.NC↗

A new bound on the relative error in the Chebotarev density theorem

We unconditionally improve the uniformity in the Chebotarev density theorem for Galois extensions of number fields using nonabelian base change. This leads to the first theoretical improvement over Weiss's bound for the least norm of an unramified prime ideal with given Artin symbol.

math.NT↗

ASTRA: Autonomous Spatial-Temporal Red-teaming for AI Software Assistants

AI coding assistants like GitHub Copilot are rapidly transforming software development, but their safety remains deeply uncertain-especially in high-stakes domains like cybersecurity. Current red-teaming tools often rely on fixed benchmarks or unrealistic prompts, missing many real-world vulnerabilities. We present ASTRA, an automated agent system designed to systematically uncover safety flaws in AI-driven code generation and security guidance systems. ASTRA works in three stages: (1) it builds structured domain-specific knowledge graphs that model complex software tasks and known weaknesses; (2) it performs online vulnerability exploration of each target model by adaptively probing both its input space, i.e., the spatial exploration, and its reasoning processes, i.e., the temporal exploration, guided by the knowledge graphs; and (3) it generates high-quality violation-inducing cases to improve model alignment. Unlike prior methods, ASTRA focuses on realistic inputs-requests that developers might actually ask-and uses both offline abstraction guided domain modeling and online domain knowledge graph adaptation to surface corner-case vulnerabilities. Across two major evaluation domains, ASTRA finds 11-66% more issues than existing techniques and produces test cases that lead to 17% more effective alignment training, showing its practical value for building safer AI systems.

cs.CR↗

Separated-Variable Spectral Neural Networks: A Physics-Informed Learning Approach for High-Frequency PDEs

Solving high-frequency oscillatory partial differential equations (PDEs) is a critical challenge in scientific computing, with applications in fluid mechanics, quantum mechanics, and electromagnetic wave propagation. Traditional physics-informed neural networks (PINNs) suffer from spectral bias, limiting their ability to capture high-frequency solution components. We introduce Separated-Variable Spectral Neural Networks (SV-SNN), a novel framework that addresses these limitations by integrating separation of variables with adaptive spectral methods. Our approach features three key innovations: (1) decomposition of multivariate functions into univariate function products, enabling independent spatial and temporal networks; (2) adaptive Fourier spectral features with learnable frequency parameters for high-frequency capture; and (3) theoretical framework based on singular value decomposition to quantify spectral bias. Comprehensive evaluation on benchmark problems including Heat equation, Helmholtz equation, Poisson equations and Navier-Stokes equations demonstrates that SV-SNN achieves 1-3 orders of magnitude improvement in accuracy while reducing parameter count by over 90\% and training time by 60\%. These results establish SV-SNN as an effective solution to the spectral bias problem in neural PDE solving. The implementation will be made publicly available upon acceptance at https://github.com/xgxgnpu/SV-SNN.

cs.LG↗

Self-Accelerating Topological Edge States

Edge states emerging at the boundaries of materials with nontrivial topology are attractive for many practical applications due to their remarkable robustness to disorder and local boundary deformations, which cannot result in scattering of the energy of the edge states impinging on such defects into the bulk of material, as long as forbidden topological gap remains open in its spectrum. The velocity of the such states traveling along the edge of the topological insulator is typically determined by their Bloch momentum. In contrast, here, using valley Hall edge states forming at the domain wall between two honeycomb lattices with broken inversion symmetry, we show that by imposing Airy envelope on them one can construct edge states which, on the one hand, exhibit \textit{self-acceleration} along the boundary of the insulator despite their fixed Bloch momentum and, on the other hand, \textit{do not diffract} along the boundary despite the presence of localized features in their shapes. We construct both linear and nonlinear self-accelerating edge states, and show that nonlinearity considerably affects their envelopes. Such self-accelerating edge states exhibit self-healing properties typical for nondiffracting beams. Self-accelerating valley Hall edge states can circumvent sharp corners, provided the oscillating tail of the self-accelerating topological state is properly apodized by using an exponential function. Our findings open new prospects for control of propagation dynamics of edge excitations in topological insulators and allow to study rich phenomena that may occur upon interactions of nonlinear envelope topological states.

physics.optics↗

SFOOD: A Multimodal Benchmark for Comprehensive Food Attribute Analysis Beyond RGB with Spectral Insights

With the rise and development of computer vision and LLMs, intelligence is everywhere, especially for people and cars. However, for tremendous food attributes (such as origin, quantity, weight, quality, sweetness, etc.), existing research still mainly focuses on the study of categories. The reason is the lack of a large and comprehensive benchmark for food. Besides, many food attributes (such as sweetness, weight, and fine-grained categories) are challenging to accurately percept solely through RGB cameras. To fulfill this gap and promote the development of intelligent food analysis, in this paper, we built the first large-scale spectral food (SFOOD) benchmark suite. We spent a lot of manpower and equipment costs to organize existing food datasets and collect hyperspectral images of hundreds of foods, and we used instruments to experimentally determine food attributes such as sweetness and weight. The resulting benchmark consists of 3,266 food categories and 2,351 k data points for 17 main food categories. Extensive evaluations find that: (i) Large-scale models are still poor at digitizing food. Compared to people and cars, food has gradually become one of the most difficult objects to study; (ii) Spectrum data are crucial for analyzing food properties (such as sweetness). Our benchmark will be open source and continuously iterated for different food analysis tasks.

cs.CV↗

MGC: A Compiler Framework Exploiting Compositional Blindness in Aligned LLMs for Malware Generation

Large language models (LLMs) have democratized software development, reducing the expertise barrier for programming complex applications. This accessibility extends to malicious software development, raising significant security concerns. While LLM providers have implemented alignment mechanisms to prevent direct generation of overtly malicious code, these safeguards predominantly evaluate individual prompts in isolation, overlooking a critical vulnerability: malicious operations can be systematically decomposed into benign-appearing sub-tasks. In this paper, we introduce the Malware Generation Compiler (MGC), a novel framework that leverages this vulnerability through modular decomposition and alignment-evasive generation. MGC employs a specialized Malware Description Intermediate Representation (MDIR) to bridge high-level malicious intents and benign-appearing code snippets. Extensive evaluation demonstrates that our attack reliably generates functional malware across diverse task specifications and categories, outperforming jailbreaking methods by +365.79% and underground services by +78.07% in correctness on three benchmark datasets. Case studies further show that MGC can reproduce and even enhance 16 real-world malware samples. This work provides critical insights for security researchers by exposing the risks of compositional attacks against aligned AI systems. Demonstrations are available at https://sites.google.com/view/malware-generation-compiler.

cs.CR↗

Pattern formation Statistics on Fermat Quotients

Despite their simple definition as $\mathfrak{q}_p(b):=\frac{b^{p-1}-1}{p} \pmod p$, for $0\le b \le p^2-1$ and $\gcd(b,p)=1$, and their regular arrangement in a $p\times(p-1)$ Fermat quotient matrix $\mathtt{FQM}(p)$ of integers from $[0,p-1]$, Fermat quotients modulo $p$ are well known for their overall lack of regularity. Here, we discuss this contrasting effect by proving that, on the one hand, any line of the matrix behaves like an analogue of a randomly distributed sequence of numbers, and on the other hand, the spatial statistics of distances on regular $N$-patterns confirm the natural expectations.

math.NT↗

SecFormer: Fast and Accurate Privacy-Preserving Inference for Transformer Models via SMPC

With the growing use of Transformer models hosted on cloud platforms to offer inference services, privacy concerns are escalating, especially concerning sensitive data like investment plans and bank account details. Secure Multi-Party Computing (SMPC) emerges as a promising solution to protect the privacy of inference data and model parameters. However, the application of SMPC in Privacy-Preserving Inference (PPI) for Transformer models often leads to considerable slowdowns or declines in performance. This is largely due to the multitude of nonlinear operations in the Transformer architecture, which are not well-suited to SMPC and difficult to circumvent or optimize effectively. To address this concern, we introduce a comprehensive PPI framework called SecFormer to achieve fast and accurate PPI for Transformer models. We successfully eliminate the high-cost exponential and maximum operations in PPI without sacrificing model performance and develop a suite of efficient SMPC protocols by employing suitable numerical computation methods to boost other complex nonlinear functions in PPI, including GeLU, LayerNorm, and a redesigned Softmax. Our extensive experiments reveal that SecFormer outperforms MPCFormer in performance, showing improvements of $3.4\%$ and $24.7\%$ for BERT$_{\text{BASE}}$ and BERT$_{\text{LARGE}}$, respectively. In terms of efficiency, SecFormer is 3.57 and 3.58 times faster than PUMA for BERT$_{\text{BASE}}$ and BERT$_{\text{LARGE}}$, demonstrating its effectiveness and speed.

cs.LG↗

MambaMIC: An Efficient Baseline for Microscopic Image Classification with State Space Models

In recent years, CNN and Transformer-based methods have made significant progress in Microscopic Image Classification (MIC). However, existing approaches still face the dilemma between global modeling and efficient computation. While the Selective State Space Model (SSM) can simulate long-range dependencies with linear complexity, it still encounters challenges in MIC, such as local pixel forgetting, channel redundancy, and lack of local perception. To address these issues, we propose a simple yet efficient vision backbone for MIC tasks, named MambaMIC. Specifically, we introduce a Local-Global dual-branch aggregation module: the MambaMIC Block, designed to effectively capture and fuse local connectivity and global dependencies. In the local branch, we use local convolutions to capture pixel similarity, mitigating local pixel forgetting and enhancing perception. In the global branch, SSM extracts global dependencies, while Locally Aware Enhanced Filter reduces channel redundancy and local pixel forgetting. Additionally, we design a Feature Modulation Interaction Aggregation Module for deep feature interaction and key feature re-localization. Extensive benchmarking shows that MambaMIC achieves state-of-the-art performance across five datasets. code is available at https://zs1314.github.io/MambaMIC

cs.CV↗

Deviance Detection and Regularity Sensitivity in Dissociated Neuronal Cultures

Understanding how neural networks process complex patterns of information is crucial for advancing both neuroscience and artificial intelligence. To investigate fundamental principles of neural computation, we studied dissociated neuronal cultures, one of the most primitive living neural networks, on high-resolution CMOS microelectrode arrays and tested whether the dissociated culture exhibits regularity sensitivity beyond mere stimulus-specific adaptation and deviance detection. In oddball electrical stimulation paradigms, we confirmed that the neuronal culture produced mismatch responses (MMRs) with true deviance detection beyond mere adaptation. These MMRs were dependent on the N-methyl-D-aspartate (NMDA) receptors, similar to mismatch negativity (MMN) in humans, which is known to have true deviance detection properties. Crucially, we also showed sensitivity to the statistical regularity of stimuli, a phenomenon previously observed only in intact brains: the MMRs in a predictable, periodic sequence were smaller than those in a commonly used sequence in which the appearance of the deviant stimulus was random and unpredictable. These results challenge the traditional view that a hierarchically structured neural network is required to process complex temporal patterns, suggesting instead that deviant detection and regularity sensitivity are inherent properties arising from the primitive neural network. They also suggest new directions for the development of neuro-inspired artificial intelligence systems, emphasizing the importance of incorporating adaptive mechanisms and temporal dynamics in the design of neural networks.

q-bio.NC↗

Dissociated Neuronal Cultures as Model Systems for Self-Organized Prediction

Dissociated neuronal cultures provide a simplified yet effective model system for investigating self-organized prediction and information processing in neural networks. This review consolidates current research demonstrating that these in vitro networks display fundamental computational capabilities, including predictive coding, adaptive learning, goal-directed behavior, and deviance detection. We examine how these cultures develop critical dynamics optimized for information processing, detail the mechanisms underlying learning and memory formation, and explore the relevance of the free energy principle within these systems. Building on these insights, we discuss how findings from dissociated neuronal cultures inform the design of neuromorphic and reservoir computing architectures, with the potential to enhance energy efficiency and adaptive functionality in artificial intelligence. The reduced complexity of neuronal cultures allows for precise manipulation and systematic investigation, bridging theoretical frameworks with practical implementations in bio-inspired computing. Finally, we highlight promising future directions, emphasizing advancements in three-dimensional culture techniques, multi-compartment models, and brain organoids that deepen our understanding of hierarchical and predictive processes in both biological and artificial systems. This review aims to provide a comprehensive overview of how dissociated neuronal cultures contribute to neuroscience and artificial intelligence, ultimately paving the way for biologically inspired computing solutions.

q-bio.NC↗

$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN

In this paper, we investigate three fundamental problems in the Massively Parallel Computation (MPC) model: (i) grid graph connectivity, (ii) approximate Euclidean Minimum Spanning Tree (EMST), and (iii) approximate DBSCAN. Our first result is a $O(1)$-round Las Vegas (i.e., succeeding with high probability) MPC algorithm for computing the connected components on a $d$-dimensional $c$-penetration grid graph ($(d,c)$-grid graph), where both $d$ and $c$ are positive integer constants. In such a grid graph, each vertex is a point with integer coordinates in $\mathbb{N}^d$, and an edge can only exist between two distinct vertices with $\ell_\infty$-norm at most $c$. To our knowledge, the current best existing result for computing the connected components (CC's) on $(d,c)$-grid graphs in the MPC model is to run the state-of-the-art MPC CC algorithms that are designed for general graphs: they achieve $O(\log \log n + \log D)$[FOCS19] and $O(\log \log n + \log \frac{1}λ)$[PODC19] rounds, respectively, where $D$ is the {\em diameter} and $λ$ is the {\em spectral gap} of the graph. With our grid graph connectivity technique, our second main result is a $O(1)$-round Las Vegas MPC algorithm for computing approximate Euclidean MST. The existing state-of-the-art result on this problem is the $O(1)$-round MPC algorithm proposed by Andoni et al.[STOC14], which only guarantees an approximation on the overall weight in expectation. In contrast, our algorithm not only guarantees a deterministic overall weight approximation, but also achieves a deterministic edge-wise weight approximation.The latter property is crucial to many applications, such as finding the Bichromatic Closest Pair and DBSCAN clustering. Last but not the least, our third main result is a $O(1)$-round Las Vegas MPC algorithm for computing an approximate DBSCAN clustering in $O(1)$-dimensional space.

cs.DS↗

OCTAMamba: A State-Space Model Approach for Precision OCTA Vasculature Segmentation

Optical Coherence Tomography Angiography (OCTA) is a crucial imaging technique for visualizing retinal vasculature and diagnosing eye diseases such as diabetic retinopathy and glaucoma. However, precise segmentation of OCTA vasculature remains challenging due to the multi-scale vessel structures and noise from poor image quality and eye lesions. In this study, we proposed OCTAMamba, a novel U-shaped network based on the Mamba architecture, designed to segment vasculature in OCTA accurately. OCTAMamba integrates a Quad Stream Efficient Mining Embedding Module for local feature extraction, a Multi-Scale Dilated Asymmetric Convolution Module to capture multi-scale vasculature, and a Focused Feature Recalibration Module to filter noise and highlight target areas. Our method achieves efficient global modeling and local feature extraction while maintaining linear complexity, making it suitable for low-computation medical applications. Extensive experiments on the OCTA 3M, OCTA 6M, and ROSSA datasets demonstrated that OCTAMamba outperforms state-of-the-art methods, providing a new reference for efficient OCTA segmentation. Code is available at https://github.com/zs1314/OCTAMamba

eess.IV↗

Correcting Large Language Model Behavior via Influence Function

Recent advancements in AI alignment techniques have significantly improved the alignment of large language models (LLMs) with static human preferences. However, the dynamic nature of human preferences can render some prior training data outdated or even erroneous, ultimately causing LLMs to deviate from contemporary human preferences and societal norms. Existing methodologies, whether they involve the curation of new data for continual alignment or the manual correction of outdated data for re-alignment, demand costly human resources. To address this challenge, we propose a novel approach, Large Language Model Behavior Correction with Influence Function Recall and Post-Training (LANCET), which requires no human involvement. LANCET consists of two phases: (1) using influence functions to identify the training data that significantly impact undesirable model outputs, and (2) applying an Influence function-driven Bregman Optimization (IBO) technique to adjust the model's behavior based on these influence distributions. Our experiments demonstrate that LANCET effectively and efficiently correct inappropriate behaviors of LLMs. Furthermore, LANCET can outperform methods that rely on collecting human preferences, and it enhances the interpretability of learning human preferences within LLMs.

cs.LG↗

Symbol Preference Aware Generative Models for Recovering Variable Names from Stripped Binary

Decompilation aims to recover the source code form of a binary executable. It has many security applications, such as malware analysis, vulnerability detection, and code hardening. A prominent challenge in decompilation is to recover variable names. We propose a novel technique that leverages the strengths of generative models while mitigating model biases. We build a prototype, GenNm, from pre-trained generative models CodeGemma-2B, CodeLlama-7B, and CodeLlama-34B. We finetune GenNm on decompiled functions and teach models to leverage contextual information. GenNm includes names from callers and callees while querying a function, providing rich contextual information within the model's input token limitation. We mitigate model biases by aligning the output distribution of models with symbol preferences of developers. Our results show that GenNm improves the state-of-the-art name recovery precision by 5.6-11.4 percentage points on two commonly used datasets and improves the state-of-the-art by 32% (from 17.3% to 22.8%) in the most challenging setup where ground-truth variable names are not seen in the training dataset.

cs.SE↗

Fault Localization from the Semantic Code Search Perspective

The software development process is characterized by an iterative cycle of continuous functionality implementation and debugging, essential for the enhancement of software quality and adaptability to changing requirements. This process incorporates two isolatedly studied tasks: Code Search (CS), which retrieves reference code from a code corpus to aid in code implementation, and Fault Localization (FL), which identifies code entities responsible for bugs within the software project to boost software debugging. These two tasks exhibit similarities since they both address search problems. Notably, CS techniques have demonstrated greater effectiveness than FL ones, possibly because of the precise semantic details of the required code offered by natural language queries, which are not readily accessible to FL methods. Drawing inspiration from this, we hypothesize that a fault localizer could achieve greater proficiency if semantic information about the buggy methods were made available. Based on this idea, we propose CosFL, an FL approach that decomposes the FL task into two steps: query generation, which describes the functionality of the problematic code in natural language, and fault retrieval, which uses CS to find program elements semantically related to the query. Specifically, to depict the buggy functionalities and generate high-quality queries, CosFL extensively harnesses the code analysis, semantic comprehension, and decision-making capabilities of LLMs. Moreover, to enhance the accuracy of CS, CosFL captures varying levels of context information and employs a multi-granularity code search strategy, which facilitates a more precise identification of buggy methods from a holistic view. The evaluation on 835 real bugs from 23 Java projects shows that CosFL successfully localizes 324 bugs within Top-1, which significantly outperforms the state-of-the-art approaches by 26.6%-57.3%.

cs.SE↗