SearcharxivSearch

arXiv subjects

Bo Yin

Publications and source records attributed to Bo Yin.

At least 19 recordsLinked to original sources

MambaADv2: Evolving Duality-enhanced State Space Model for Unsupervised Anomaly Detection

While recent advancements in anomaly detection have demonstrated the efficacy of CNN- and Transformer-based approaches, these architectures face inherent limitations: CNNs struggle to capture long-range dependencies, whereas Transformers suffer from quadratic computational complexity. Consequently, Mamba-based architectures have attracted considerable attention, as they successfully combine superior long-range dependency modeling with linear computational complexity. By critically rethinking the structural evolution across the Mamba lineage 1-3 series, this paper proposes MambaADv2, a framework tailored for multi-class unsupervised anomaly detection. MambaADv2 comprises a pre-trained encoder and a Mamba-inspired decoder, equipped with Duality-enhanced State Space (DSS) modules across multiple scales. The proposed DSS module effectively models both global dependencies and local representations by integrating parallel-cascaded Hybrid State Space (HSS) blocks and frequency-enhanced convolution operations. The structure of the Hybrid State Space (HSS) block is tailored by following the SSD-based Mamba lineage and incorporating Mamba3-style position-aware state-space modeling, leveraging the dual computational paths of linear recurrence and parallel matrix formulation to model local continuity and global contextual comparison, thereby better serving the core anomaly detection objective of precisely reconstructing normal representations while magnifying anomalous deviations. Additionally, we propose a semantics-adaptive progressive scanning strategy that decays scanning complexity along the feature pyramid.

cs.CV

SPOT-E: Test-Time Entropy Shaping with Visual Spotlights for Frozen VLMs

Vision-language models (VLMs) often underperform on evidence intensive tasks because decisive visual evidence are small, localized, and easy to overlook, leading to failures in evidence readout even when high-level reasoning is intact. Prior inference-time visual interventions can improve grounding without retraining, but they are largely open-loop and lack a mechanism to verify whether highlighted evidence is actually used. We study answer-span prediction entropy as a model-internal feedback signal and show that naive entropy minimization is ambiguous, since low entropy may arise from evidence-grounded confidence or shortcut collapse. To resolve this ambiguity, we introduce low-entropy anchors and an entropy-shaping objective that reduces answer uncertainty while preserving baseline high-confidence tokens. We instantiate this principle in SPOT-E, a plug-and-play test-time method that produces question-conditioned spotlights, optimized per instance via light-weight tuning based on Group Relative Policy Optimization (GRPO). Across all benchmarks and different VLM families, SPOT-E yields consistent gains and improved robustness under visual corruptions. Code is publicly available at: https://github.com/YinBo0927/SPOT-E

cs.CV

Coexistence of topologically nontrivial and trivial insulating states in topological Anderson Chern insulator

The interplay between disorder and topology has become a central theme in condensed matter physics. Disorder can not only destroy topological phases but also induce them, as exemplified by the topological Anderson insulator (TAI). Here we show that, in close analogy, disorder can drive the clean-limit, time-reversal-broken(T-broken) quantum spin Hall state of ferromagnetic(FM) monolayer MnBi4Te7 into a quantum anomalous Hall phase, which was called topological Anderson Chern insulator (TACI). Using density functional theory (DFT) and nonequilibrium Green's func tion (NEGF) calculations in the presence of disorder, we identify disorder induced phases-including T-broken TAI, TACI, Normal insulator, etc., then construct a comprehensive phase diagram. To discriminate multiple phases in the strong disorder regime, we further use the density of states computed within the self-consistent Born approximation (SCBA), which in particular distinguishes gapped and ungapped topological phases. We find that the two effective band inversions of Hamiltonian are suppressed at distinct critical disorder strengths; the survival of a single inversion over a finite disorder window stabilizes the TACI. Remarkably, at strong disorder, we further propose a zero Hall plateau insulating state characterized by an insulating bulk and edge channels subject to diffusive scattering that can coexist with the TACI. This behavior is distinct from a conventional band-gap Chern insulator and provides a clear experimental signature.

cond-mat.dis-nn

On-Policy Self-Evolution via Failure Trajectories for Agentic Safety Alignment

Tool-using LLM agents fail through trajectories rather than only final responses, as they may execute unsafe tool calls, follow injected instructions, comply with harmful requests, or over-refuse benign tasks despite producing a seemingly safe answer. Existing safety-alignment signals are largely response-level or off-policy, and often incur a safety-utility trade-off: improving agent safety comes at the cost of degraded task performance. Such sparse and single-objective rewards severely limit real-world usability. To bridge this gap, we propose FATE, an on-policy self-evolving framework that transforms verifier-scored failures into repair supervision without expert demonstrations. For each failure, the same policy proposes repair candidates, which are then re-scored by verifiers and filtered across security, utility, over-refusal control, and trajectory validity. This dense trajectory-level information is then used as a supervision signal for agent self-evolution. During this process, we further introduce Pareto-Front Policy Optimization (PFPO), combining supervised warmup with Pareto-aware policy optimization to preserve safety-utility trade-offs. Experiments on AgentDojo, AgentHarm, and ATBench show that FATE improves safety across different models and scales while preserving useful behavior. Compared with strong baselines, FATE reduces attack success rate by 33.5%, harmful compliance by 82.6%, and improves external trajectory-safety diagnosis by 6.5%. These results suggest that failed trajectories can provide structured repair supervision for safer self-evolving agents.

cs.AI

VPD-100K: Towards Generalizable and Fine-grained Visual Privacy Protection

Privacy protection has become a critical requirement in the era of ubiquitous visual data sharing, imposing higher demands on efficient and robust privacy detection algorithms. However, current robust detection models are severely hindered by the lack of comprehensive datasets. Existing privacy-oriented datasets often suffer from limited scale, coarse-grained annotations, and narrow domain coverage, failing to capture the intricate details of sensitive information in realworld environments. To bridge this gap, we present a large-scale, fine-grained Visual Privacy Dataset (VPD-100K), designed to facilitate generalized privacy detection. We establish a holistic taxonomy comprising four primary domains: Human Presence, On-Screen Personally Identifiable Information (PII), Physical Identifiers, and Location Indicators, containing 100,000 images annotated with 33 fine-grained classes and over 190,000 object instances. Statistical analysis reveals that our dataset features long-tailed distributions, small object scales, and high visual complexity. These characteristics make the dataset particularly valuable for demanding, unconstrained applications such as live streaming, where actors frequently face unintentional, realtime information leakage. Furthermore, we design an effective frequency-enhanced lightweight module consisting of frequency-domain attention fusion and adaptive spectral gating mechanism that breaks the limitations of spatial pixel intensity to better capture the subtle details of sensitive information. Extensive experiments conducted on both diverse image and streaming videos benchmarks consistently demonstrate the effectiveness of our VPD-100K dataset and the wellcurated frequency mechanism. The code and dataset are available at https://vpd-100k.github.io/.

cs.CV

Vision-Language-Action Safety: Threats, Challenges, Evaluations, and Mechanisms

Vision-Language-Action (VLA) models are emerging as a unified substrate for embodied intelligence. This shift raises a new class of safety challenges, stemming from the embodied nature of VLA systems, including irreversible physical consequences, a multimodal attack surface across vision, language, and state, real-time latency constraints on defense, error propagation over long-horizon trajectories, and vulnerabilities in the data supply chain. Yet the literature remains fragmented across robotic learning, adversarial machine learning, AI alignment, and autonomous systems safety. This survey provides a unified and up-to-date overview of safety in Vision-Language-Action models. We organize the field along two parallel timing axes, attack timing (training-time vs. inference-time and defense timing (training-time vs. inference-time, linking each class of threat to the stage at which it can be mitigated. We first define the scope of VLA safety, distinguishing it from text-only LLM safety and classical robotic safety, and review the foundations of VLA models, including architectures, training paradigms, and inference mechanisms. We then examine the literature through four lenses: Attacks, Defenses, Evaluation, and Deployment. We survey training-time threats such as data poisoning and backdoors, as well as inference-time attacks including adversarial patches, cross-modal perturbations, semantic jailbreaks, and freezing attacks. We review training-time and runtime defenses, analyze existing benchmarks and metrics, and discuss safety challenges across six deployment domains. Finally, we highlight key open problems, including certified robustness for embodied trajectories, physically realizable defenses, safety-aware training, unified runtime safety architectures, and standardized evaluation.

cs.RO

Percolation from Quantum Metric in Flat-Band Delocalization

The quantum metric is a fundamental ingredient of band quantum geometry and has recently at tracted intense interest, with most of its transport signatures appearing in the intrinsic second order nonlinear conductivity. In the clean limit, previous works argued that linear response conductivity is insensitive to the quantum metric, while the Berry curvature yields an intrinsic anomalous Hall con tribution. Here we combine analytic derivations with new numerics to show that disorder modifies the linear response conductivity dominated by geometric conductivity which is determined by the real space quantum metric. Focusing on a two dimensional multi-flatband stub-pyrochlore lattice, we identify a critical delocalized regime sandwiched between flat band localization and Anderson localization, characterized by finite geometric conductivity. Upon including spin orbit coupling, this regime evolves into a diffusive metallic phase, constituting a two dimensional inverse Anderson transition. Moreover, exploiting the connection between the real space quantum metric marker and the Wannier function spread, we construct a bond-percolation model on a square lattice. The resulting percolation region quantitatively coincides the critical delocalized regime, the exponent of which supports a classical percolation universality class. These findings suggest that flat band de localization can be understood as a classical percolation of quantum metric puddles. This advances our understanding of quantum geometric contributions to transport and establishes linear response measurements as a new avenue for accessing the quantum metric.

cond-mat.dis-nn

SkillGraph: Self-Evolving Multi-Agent Collaboration with Multimodal Graph Topology

Scaling vision-language models into Visual Multiagent Systems (VMAS) is hindered by two coupled issues. First, communication topologies are fixed before inference, leaving them blind to visual content and query context; second, agent reasoning abilities remain static during deployment. These issues reinforce each other: a rigid topology fails to leverage richer agent expertise, while static agents lack incentives to specialize for a given query. We address this with SkillGraph, a joint framework that evolves both agent expertise and communication topology. Within this framework, a Multimodal Graph Transformer (MMGT) encodes visual tokens, instruction semantics and active skill embeddings to predict a query-conditioned collaboration graph, replacing hand-crafted routing with dynamic, content-aware information flow. Complementing this, a Skill Designer distills and refines reasoning heuristics from failure cases, constructing a self-evolving multimodal Skill Bank. Crucially, updated skill embeddings are fed back into the MMGT, enabling the topology to adapt alongside capability growth. Experiments show that SkillGraph achieves consistent improvements across four benchmarks, five common MAS structures and four base models. Code is available at https://github.com/niez233/skillgraph.

cs.AI

Dual Latent Memory for Visual Multi-agent System

While Visual Multi-Agent Systems (VMAS) promise to enhance comprehensive abilities through inter-agent collaboration, empirical evidence reveals a counter-intuitive "scaling wall": increasing agent turns often degrades performance while exponentially inflating token costs. We attribute this failure to the information bottleneck inherent in text-centric communication, where converting perceptual and thinking trajectories into discrete natural language inevitably induces semantic loss. To this end, we propose \textbf{L}$\mathbf{^{2}}$\textbf{-VMAS}, a novel model-agnostic framework that enables inter-agent collaboration with dual latent memories. Furthermore, we decouple the perception and thinking while dynamically synthesizing dual latent memories. Additionally, we introduce an entropy-driven proactive triggering that replaces passive information transmission with efficient, on-demand memory access. Extensive experiments among backbones, sizes, and multi-agent structures demonstrate that our method effectively breaks the "scaling wall" with superb scalability, improving average accuracy by 2.7-5.4% while reducing token usage by 21.3-44.8%.

cs.AI

Refinement Provenance Inference: Detecting LLM-Refined Training Prompts from Model Behavior

Instruction tuning increasingly relies on LLM-based prompt refinement, where prompts in the training corpus are selectively rewritten by an external refiner to improve clarity and instruction alignment. This motivates an instance-level audit problem: for a fine-tuned model and a training prompt-response pair, can we infer whether the model was trained on the original prompt or its LLM-refined version within a mixed corpus? This matters for dataset governance and dispute resolution when training data are contested. However, it is non-trivial in practice: refined and raw instances are interleaved in the training corpus with unknown, source-dependent mixture ratios, making it harder to develop provenance methods that generalize across models and training setups. In this paper, we formalize this audit task as Refinement Provenance Inference (RPI) and show that prompt refinement yields stable, detectable shifts in teacher-forced token distributions, even when semantic differences are not obvious. Building on this phenomenon, we propose RePro, a logit-based provenance framework that fuses teacher-forced likelihood features with logit-ranking signals. During training, RePro learns a transferable representation via shadow fine-tuning, and uses a lightweight linear head to infer provenance on unseen victims without training-data access. Empirically, RePro consistently attains strong performance and transfers well across refiners, suggesting that it exploits refiner-agnostic distribution shifts rather than rewrite-style artifacts.

cs.LG

LacaDM: A Latent Causal Diffusion Model for Multiobjective Reinforcement Learning

Multiobjective reinforcement learning (MORL) poses significant challenges due to the inherent conflicts between objectives and the difficulty of adapting to dynamic environments. Traditional methods often struggle to generalize effectively, particularly in large and complex state-action spaces. To address these limitations, we introduce the Latent Causal Diffusion Model (LacaDM), a novel approach designed to enhance the adaptability of MORL in discrete and continuous environments. Unlike existing methods that primarily address conflicts between objectives, LacaDM learns latent temporal causal relationships between environmental states and policies, enabling efficient knowledge transfer across diverse MORL scenarios. By embedding these causal structures within a diffusion model-based framework, LacaDM achieves a balance between conflicting objectives while maintaining strong generalization capabilities in previously unseen environments. Empirical evaluations on various tasks from the MOGymnasium framework demonstrate that LacaDM consistently outperforms the state-of-art baselines in terms of hypervolume, sparsity, and expected utility maximization, showcasing its effectiveness in complex multiobjective tasks.

cs.LG

FeRA: Frequency-Energy Constrained Routing for Effective Diffusion Adaptation Fine-Tuning

Diffusion models have achieved remarkable success in generative modeling, yet how to effectively adapt large pretrained models to new tasks remains challenging. We revisit the reconstruction behavior of diffusion models during denoising to unveil the underlying frequency energy mechanism governing this process. Building upon this observation, we propose FeRA, a frequency driven fine tuning framework that aligns parameter updates with the intrinsic frequency energy progression of diffusion. FeRA establishes a comprehensive frequency energy framework for effective diffusion adaptation fine tuning, comprising three synergistic components: (i) a compact frequency energy indicator that characterizes the latent bandwise energy distribution, (ii) a soft frequency router that adaptively fuses multiple frequency specific adapter experts, and (iii) a frequency energy consistency regularization that stabilizes diffusion optimization and ensures coherent adaptation across bands. Routing operates in both training and inference, with inference time routing dynamically determined by the latent frequency energy. It integrates seamlessly with adapter based tuning schemes and generalizes well across diffusion backbones and resolutions. By aligning adaptation with the frequency energy mechanism, FeRA provides a simple, stable, and compatible paradigm for effective and robust diffusion model adaptation.

cs.CV

Don't Forget the Nonlinearity: Unlocking Activation Functions in Efficient Fine-Tuning

Existing parameter-efficient fine-tuning (PEFT) methods primarily adapt weight matrices while keeping activation functions fixed. We introduce \textbf{NoRA}, the first PEFT framework that directly adapts nonlinear activation functions in pretrained transformer-based models. NoRA replaces fixed activations with learnable rational functions and applies structured low-rank updates to numerator and denominator coefficients, with a group-wise design that localizes adaptation and improves stability at minimal cost. On vision transformers trained on CIFAR-10 and CIFAR-100, NoRA matches or exceeds full fine-tuning while updating only 0.4\% of parameters (0.02M), achieving accuracy gains of +0.17\% and +0.27\%. When combined with LoRA (\textbf{NoRA++}), it outperforms LoRA and DoRA under matched training budgets by adding fewer trainable parameters. On LLaMA3-8B instruction tuning, NoRA++ consistently improves generation quality, yielding average MMLU gains of +0.3\%--0.8\%, including +1.6\% on STEM (Alpaca) and +1.3\% on OpenOrca. We further show that NoRA constrains adaptation to a low-dimensional functional subspace, implicitly regularizing update magnitude and direction. These results establish activation-space tuning as a complementary and highly parameter-efficient alternative to weight-based PEFT, positioning activation functions as first-class objects for model adaptation.

cs.LG

Intrinsic layer polarization and multi-flatband transport in non-centrosymmetric mixed-stacked multilayer graphene

Graphene multilayers exhibit electronic spectra that depend sensitively on both the number of layers and their stacking order. Beyond trilayer graphene, mixed stacking sequences (alternating Bernal and rhombohedral layers) give rise to multiple coexisting low-energy bands. Here we investigate ABCBC-stacked pentalayer graphene, a less-studied non-centrosymmetric mixed sequence. This stacking can be regarded as an ABC (rhombohedral) trilayer on top of an AB (Bernal) bilayer, so its low-energy band structure contains both a cubic band and a parabolic band that hybridize. In transport measurements, we observe an intrinsic band gap at charge neutrality whose magnitude changes asymmetrically under an applied perpendicular displacement field. This behavior reflects the spontaneous layer polarization inherent to the broken inversion symmetry and mirror symmetry. By tuning the displacement field and carrier density, we drive multiple Lifshitz transitions in the Fermi surface topology and realize Landau levels with different degeneracies arising from the multi-flatband system. Remarkably, a v = -6 quantum Hall state emerges at an exceptionally low magnetic field (~20 mT), indicating the interplay between spontaneous symmetry breaking and Berry curvatures. Our results establish mixed-stacked multilayer graphene as a tunable platform with various broken symmetries and multiple flatbands, suitable for exploring emergent correlated electronic states.

cond-mat.mes-hall

Observation of topological Anderson Chern insulator phase in MnBi$_4$Te$_7$ monolayer

The correlation of topology and disorder has attracted great intention due to appropriate disorder could induce the phase transition between trivial and nontrivial topological states. While it is widely recognized that strong disorder can produce rich phase diagrams in topological nontrivial states, moderate disorder has been proposed to induce transitions into topologically nontrivial phases counter-intuitively, leading to the concept of topological Anderson insulators. This phenomenon has been theoretically explored and simulated in various systems, yet experimental realization in solid state systems has remained elusive due to challenges in controlling disorder. Here, we report the experimental observation of Chern insulator state signed by the coexistence of quantized Hall plateau and zero longitudinal resistance in monolayer MnBi$_4$Te$_7$ Hall bar device, which originally hosts a trivial insulating state with Chern number $C$ = 0 in clean limit. We demonstrate that the observed trivial to nontrivial transition in this monolayer device can be attributed to disorder, evidenced by universal conductance fluctuations. Our findings substantiate the existence of a long-sought topological Anderson Chern insulator in real materials, a unique variant of the topological Anderson insulator characterized by broken time-reversal-symmetry.

cond-mat.mes-hall

Cohort profile: the Northwest China Real-world and Population-based Cohort

The Northwest China Real-World and Population-based cohort is an ongoing prospective cohort with more than 25 million population, covering almost all residents across approximately 1.66 million square kilometers in northwest China; The cohort integrates data from various sources, including health profiles, examination records, electronic health records, mortality records, statistical yearbooks, and environmental datasets, covering comprehensive health-related factors such as demographics, lifestyle factors, family medical history, living conditions, enrollment in national public health services, physical examinations, blood assay tests, diagnostic assessments, disease outcomes, and cause-specific mortality. This real-world dataset can evaluate clinical treatment effectiveness and prognosis, assess impact of health policy, and investigate the health effects of multiple risk factors . From January 2019 to December 2023, the cohort has included 13,634,481 participants, accumulating 47,050,707 person-years of follow-up, with 13,598,407 medical diagnosis records and 881,114 recorded deaths. Cohort data are available upon request. De-identified and anonymized data are stored on local servers and accessed through a data-sharing platform, enabling users to utilize the data without direct access to the raw information. A description of the proposed research can be sent to Yining Yang & Qian Di.

cs.CY

Kinetic development of low-temperature propane oxidation in a repetitively-pulsed nanosecond discharge

The kinetics of plasma assisted low temperature oxidation of C3H8O2Ar mixtures have been studied in a wide specific deposition energy with the help of nanosecond repetitively pulsed discharge. Two types of nanosecond pulsed plasma sources, the nanosecond capillary discharge (nCD) and dielectric barrier discharge (DBD) combined with the synchrotron photoionization mass spectrometry are investigated. The electron impact reaction rate of propane dissociation and some combustion chemical reactions rate constants are updated according to the nCD and DBD experiment results,and uncertainty of the reactions are analyzed in detail. Compared to the existing model, the updated model's prediction accuracy has great improvement in species H2O, CO, CO2, CH4, CH2O, CH3OH, C2H2, C2H4, C2H6, C2H5OH, C2H5OOH, C3H4-A, C3H4-P, C2H5CHO, i-C3H7OH and C3H7OOH. The propane oxidation processes assisted by DBD and nCD were compared under different single pulse deposition energy (SPDE) conditions while maintaining the same total deposition energy. The reduced electric field in nCD is concentrated at 150-200 Td and 450-500 Td, whereas in DBD it ranges from 0-25 Td and 50-250 Td. Notably, SPDE shows minimal influence on the propane oxidation process, which is primarily controlled by total deposition energy and demonstrates little dependence on the discharge type (DBD or nCD).

physics.plasm-ph

Deep Boosting Robustness of DNN-based Image Watermarking via DBMark

Image watermarking is a technique for hiding information into images that can withstand distortions while requiring the encoded image to be perceptually identical to the original image. Recent work based on deep neural networks (DNN) has achieved impressive progression in digital watermarking. Higher robustness under various distortions is the eternal pursuit of digital image watermarking approaches. In this paper, we propose DBMARK, a novel end-to-end digital image watermarking framework to deep boost the robustness of DNN-based image watermarking. The key novelty is the synergy of invertible neural networks (INN) and effective watermark features generation. The framework generates watermark features with redundancy and error correction ability through the effective neural network based message processor, synergized with the powerful information embedding and extraction abilities of INN to achieve higher robustness and invisibility. The powerful learning ability of neural networks enables the message processor to adapt to various distortions. In addition, we propose to embed the watermark information in the discrete wavelet transform (DWT) domain and design low-low (LL) sub-band loss to enhance invisibility. Extensive experiment results demonstrate the superiority of the proposed framework compared with the state-of-the-art ones under various distortions such as dropout, cropout, crop, Gaussian filter, and JPEG compression.

cs.CV