arXiv subjects

Bo Wang

Publications and source records attributed to Bo Wang.

At least 145 records · Page 8Linked to original sources

arXiv2026

On the computation of the dyadic Green's functions of Maxwell's equations in layered media

In this paper, two formulations for the computation of the dyadic Green's functions of Maxwell's equations in layered media are presented in details. The first formulation derived using TE/TM decomposition is well-known and intensively used in engineering community while the second formulation derived using vector potential and a matrix basis is recently used in establishing a fast multipole method. We significantly simplify the derivation of second formulation and show that it is equivalent to the first one while the derivation is more straightforward as the interface conditions are directly decoupled using the vector potential. The matrix basis is designed to split out all non-symmetric factors in the density functions which facilitates the derivation of far-field approximations for the dyadic Green's functions. Moreover, it can be applied to the computation of the dyadic Green's functions of elastic wave equation in layered media.

math-ph↗

arXiv2026

Generative Recommendation for Large-Scale Advertising

Generative recommendation has recently attracted widespread attention in industry due to its potential for scaling and stronger model capacity. However, deploying real-time generative recommendation in large-scale advertising requires designs beyond large-language-model (LLM)-style training and serving recipes. We present a production-oriented generative recommender co-designed across architecture, learning, and serving, named GR4AD (Generative Recommendation for ADdvertising). As for tokenization, GR4AD proposes UA-SID (Unified Advertisement Semantic ID) to capture complicated business information. Furthermore, GR4AD introduces LazyAR, a lazy autoregressive decoder that relaxes layer-wise dependencies for short, multi-candidate generation, preserving effectiveness while reducing inference cost, which facilitates scaling under fixed serving budgets. To align optimization with business value, GR4AD employs VSL (Value-Aware Supervised Learning) and proposes RSPO (Ranking-Guided Softmax Preference Optimization), a ranking-aware, list-wise reinforcement learning algorithm that optimizes value-based rewards under list-level metrics for continual online updates. For online inference, we further propose dynamic beam serving, which adapts beam width across generation levels and online load to control compute. Large-scale online A/B tests show up to 4.2% ad revenue improvement over an existing DLRM-based stack, with consistent gains from both model scaling and inference-time scaling. GR4AD has been fully deployed in Kuaishou advertising system with over 400 million users and achieves high-throughput real-time serving.

cs.IR↗

arXiv2026

SHOE: Semantic HOI Open-Vocabulary Evaluation Metric

Open-vocabulary human-object interaction (HOI) detection is a step towards building scalable systems that generalize to unseen interactions in real-world scenarios and support grounded multimodal systems that reason about human-object relationships. However, standard evaluation metrics, such as mean Average Precision (mAP), treat HOI classes as discrete categorical labels and fail to credit semantically valid but lexically different predictions (e.g., "lean on couch" vs. "sit on couch"), limiting their applicability for evaluating open-vocabulary predictions that go beyond any predefined set of HOI labels. We introduce SHOE (Semantic HOI Open-Vocabulary Evaluation), a new evaluation framework that incorporates semantic similarity between predicted and ground-truth HOI labels. SHOE decomposes each HOI prediction into its verb and object components, estimates their semantic similarity using the average of multiple large language models (LLMs), and combines them into a similarity score to evaluate alignment beyond exact string match. This enables a flexible and scalable evaluation of both existing HOI detection methods and open-ended generative models using standard benchmarks such as HICO-DET. Experimental results show that SHOE scores align more closely with human judgments than existing metrics, including LLM-based and embedding-based baselines, achieving an agreement of 85.73% with the average human ratings. Our work underscores the need for semantically grounded HOI evaluation that better mirrors human understanding of interactions. We will release our evaluation metric to the public to facilitate future research.

cs.CV↗

arXiv2026

SN2024abfl: A Low-Luminosity Type IIP Supernova at the Low-Mass End of Core Collapse

We present optical photometric and spectroscopic observations of the low-luminosity (LL) Type IIP supernova SN\,2024abfl. The distance to its host galaxy is highly uncertain, with independent estimates of $9.5^{+2.3}_{-2.4}$ Mpc and $15.0^{+8.9}_{-1.9}$ Mpc. Even adopting the larger distance, the inferred plateau luminosity is only $\sim 10^{41}\rm erg\,s^{-1}$, placing SN 2024abfl at the extreme faint end of SNe IIP population. Its light curve exhibits a long-lasting plateau of approximately 110 days. The spectra show exceptionally low expansion velocities, with the \FeII\, velocity of $\sim1200\,\rm km\,s^{-1}$ at 50 days after the explosion, significantly lower than the typical values of $\sim2000-5500\,\rm km\,s^{-1}$ observed in SNe IIP, placing SN\,2024abfl among the slowest-expanding LL SNe IIP. Bolometric modeling yields a synthesized $^{56}$Ni mass of $\sim0.002-0.004\,\rm M_\odot$, though this estimate remains subject to significant uncertainty owing to the poorly constrained distance. Considering the plateau color and duration, the magnitude drop from plateau to tail, and the progenitor luminosity, we favor a low-mass core-collapse origin for SN\,2024abfl.

astro-ph.SR↗

arXiv2026

PANTHER: Generative Pretraining Beyond Language for Sequential User Behavior Modeling

Large language models (LLMs) have shown that generative pretraining can distill vast world knowledge into compact token representations. While LLMs encapsulate extensive world knowledge, they remain limited in modeling the behavioral knowledge contained within user interaction histories. User behavior forms a distinct modality, where each action, defined by multi-dimensional attributes such as time, context, and transaction type, constitutes a behavioral token. Modeling these high-cardinality sequences is challenging, and discriminative models often falter under limited supervision. To bridge this gap, we extend generative pretraining to user behavior, learning transferable representations from unlabeled behavioral data analogous to how LLMs learn from text. We present PANTHER, a hybrid generative-discriminative framework that unifies user behavior pretraining and downstream adaptation, enabling large-scale sequential user representation learning and real-time inference. PANTHER introduces: (1) Structured Tokenization to compress multi-dimensional transaction attributes into an interpretable vocabulary; (2) Sequence Pattern Recognition Module (SPRM) for modeling periodic transaction motifs; (3) a Unified User-Profile Embedding that fuses static demographics with dynamic transaction histories; and (4) Real-time scalability enabled by offline caching of pretrained embeddings for millisecond-level inference. Fully deployed and operational online at WeChat Pay, PANTHER delivers a 25.6 percent boost in next-transaction prediction HitRate@1 and a 38.6 percent relative improvement in fraud detection recall over baselines. Cross-domain evaluations on public benchmarks show strong generalization, achieving up to 21 percent HitRate@1 gains over transformer baselines, establishing PANTHER as a scalable, high-performance framework for industrial sequential user behavior modeling.

cs.LG↗

arXiv2026

Boosting LLMs for Mutation Generation

LLM-based mutation testing is a promising testing technology, but existing approaches typically rely on a fixed set of mutations as few-shot examples or none at all. This can result in generic low-quality mutations, missed context-specific mutation patterns, substantial numbers of redundant and uncompilable mutants, and limited semantic similarity to real bugs. To overcome these limitations, we introduce SMART (Semantic Mutation with Adaptive Retrieval and Tuning). SMART integrates retrieval-augmented generation (RAG) on a vectorized dataset of real-world bugs, focused code chunking, and supervised fine-tuning using mutations coupled with real-world bugs. We conducted an extensive empirical study of SMART using 1,991 real-world Java bugs from the Defects4J and ConDefects datasets, comparing SMART to the state-of-the-art LLM-based approaches, LLMut and LLMorpheus. The results reveal that SMART substantially improves mutation validity, effectiveness, and efficiency (even enabling small-scale 7B-scale models to match or even surpass large models like GPT-4o). We also demonstrate that SMART significantly improves downstream software engineering applications, including test case prioritization and fault localization. More specifically, SMART improves validity (weighted average generation rate) from 42.89% to 65.6%. It raises the non-duplicate rate from 87.38% to 95.62%, and the compilable rate from 88.85% to 90.21%. In terms of effectiveness, it achieves a real bug detection rate of 92.61% (vs. 57.86% for LLMut) and improves the average Ochiai coefficient from 25.61% to 38.44%. For fault localization, SMART ranks 64 more bugs as Top-1 under MUSE and 57 more under Metallaxis.

cs.SE↗

arXiv2026

Universal Formula Families for Safe Stabilization of Single-Input Nonlinear Systems

We develop an optimization-free framework for safe stabilization of single-input control-affine nonlinear systems with a given control Lyapunov function (CLF) and a given control barrier function (CBF), where the desired equilibrium lies in the interior of the safe set. An explicit compatibility condition is derived that is necessary and sufficient for the pointwise simultaneous satisfaction of the CLF and CBF inequalities. When this condition holds, two closed-form continuous state-feedback laws are constructed from the Lie-derivative data of the CLF and CBF via standard universal stabilizer formulas, yielding asymptotic stabilization of the origin and forward invariance of the interior of the safe set, without online quadratic programming. The two laws belong to broader families parametrized by a free nondecreasing function, providing additional design flexibility. When the compatibility condition fails, a safety-prioritizing modification preserves forward invariance and drives the state toward the safe-set boundary until a compatible region is reached, whereupon continuity at the origin and asymptotic stabilization are recovered. The framework produces families of explicit constructive alternatives to CLF-CBF quadratic programming for scalar-input nonlinear systems.

eess.SY↗

arXiv2026

Edu-Values: Towards Evaluating the Chinese Education Values of Large Language Models

In this paper, we present Edu-Values, the first Chinese education values evaluation benchmark that includes seven core values: professional philosophy, teachers' professional ethics, education laws and regulations, cultural literacy, educational knowledge and skills, basic competencies and subject knowledge. We meticulously design 1,418 questions, covering multiple-choice, multi-modal question answering, subjective analysis, adversarial prompts, and Chinese traditional culture (short answer) questions. We conduct human feedback based automatic evaluation over 21 state-of-the-art (SoTA) LLMs, and highlight three main findings: (1) due to differences in educational culture, Chinese LLMs outperform English LLMs, with Qwen 2 ranking the first with a score of 81.37; (2) LLMs often struggle with teachers' professional ethics and professional philosophy; (3) leveraging Edu-Values to build an external knowledge repository for RAG significantly improves LLMs' alignment. This demonstrates the effectiveness of the proposed benchmark.

cs.CL↗

arXiv2026

Strong decays of the hidden-charm molecular pentaquarks

We investigate the strong decays of the recently observed hidden-charm pentaquarks $P_ψ^N(4312)$, $P_ψ^N(4440)$, and $P_ψ^N(4457)$, as well as $P_{ψs}^Λ(4338)$ and $P_{ψs}^Λ(4459)$, within the molecular framework using the effective Lagrangian approach. We construct the effective Lagrangians describing the S-wave couplings between these pentaquarks and their constituent hadrons, namely $Σ_c\bar{D}^{(*)}$ and $Ξ_c\bar{D}^{(*)}$, and determine the coupling constants via the residues of the scattering $T$-matrix at the bound-state poles. Our results show that the decay widths are sensitive to the cutoff parameters in the form factors, whereas the branching fractions exhibit only weak dependence. Using $P_ψ^N(4312)$ to calibrate the cutoff range, we further explore the spin assignments of $P_ψ^N(4440)$ and $P_ψ^N(4457)$. Our calculations favor the assignment where the lower-mass state $P_ψ^N(4440)$ carries higher spin $J = 3/2$ and the higher-mass state $P_ψ^N(4457)$ carries lower spin $J = 1/2$. In addition, the experimental widths of $P_{ψs}^Λ(4338)$ and $P_{ψs}^Λ(4459)$ can both be well reproduced under the molecular interpretation. We look forward to future experimental analyses with more accumulated data to clarify whether the lineshape of $P_{ψs}^Λ(4459)$ contains contributions from both spin-$1/2$ and spin-$3/2$ states.

hep-ph↗

arXiv2026

Formation of black holes from He stars

Massive He stars are potential candidates of type Ib/c supernova (SN) progenitors. Understanding their final fates remains a key issue in astrophysics. In this work, we investigate the evolution of He stars with initial masses from 5 $M_\odot$ to 65 $M_\odot$, focusing on the presupernova (pre-SN) core structures to assess their explodability. Our simulations indicate that the final core structure is determined by the CO core mass and the central 12C mass fraction at the end of core He burning, affecting the properties of central C-burning and the locations of convective shells. The location of the last convective C-burning shell sets the mass of the C-free core, constraining the iron core mass and compactness. We found that the final compactness and iron core mass exhibit non-monotonic behavior with initial mass, suggesting that the boundary between neutron star and black hole formation is not a simple mass threshold. This is due to core C/Ne burning becoming neutrino dominated. This process drives stronger core contraction, ultimately increasing the iron core mass and the final compactness. In contrast, earlier core Ne/O/Si ignition and shell mergers inhibit core contraction, reducing both the iron core mass and final compactness. We also discuss the effects of metallicity and overshooting on the pre-SN core structure. These factors potentially affect the explodability of progenitors.

astro-ph.SR↗

arXiv2026

LiFR-Seg: Anytime High-Frame-Rate Segmentation via Event-Guided Propagation

Dense semantic segmentation in dynamic environments is fundamentally limited by the low-frame-rate (LFR) nature of standard cameras, which creates critical perceptual gaps between frames. To solve this, we introduce Anytime Interframe Semantic Segmentation: a new task for predicting segmentation at any arbitrary time using only a single past RGB frame and a stream of asynchronous event data. This task presents a core challenge: how to robustly propagate dense semantic features using a motion field derived from sparse and often noisy event data, all while mitigating feature degradation in highly dynamic scenes. We propose LiFR-Seg, a novel framework that directly addresses these challenges by propagating deep semantic features through time. The core of our method is an uncertainty-aware warping process, guided by an event-driven motion field and its learned, explicit confidence. A temporal memory attention module further ensures coherence in dynamic scenarios. We validate our method on the DSEC dataset and a new high-frequency synthetic benchmark (SHF-DSEC) we contribute. Remarkably, our LFR system achieves performance (73.82% mIoU on DSEC) that is statistically indistinguishable from an HFR upper-bound (within 0.09%) that has full access to the target frame. This work presents a new, efficient paradigm for achieving robust, high-frame-rate perception with low-frame-rate hardware. Project Page: https://candy-crusher.github.io/LiFR_Seg_Proj/#; Code: https://github.com/Candy-Crusher/LiFR-Seg.git.

cs.CV↗

arXiv2026

SSR: Speculative Parallel Scaling Reasoning in Test-time

Large language models (LLMs) have achieved impressive results on multi-step mathematical reasoning, yet at the cost of high computational overhead. This challenge is particularly acute for test-time scaling methods such as parallel decoding, which increase answer diversity but scale poorly in efficiency. To address this efficiency-accuracy trade-off, we propose SSR (Speculative Parallel Scaling Reasoning), a training-free framework that leverages a key insight: by introducing speculative decoding at the step level, we can accelerate reasoning without sacrificing correctness. SSR integrates two components: a Selective Parallel Module (SPM) that identifies a small set of promising reasoning strategies via model-internal scoring, and Step-level Speculative Decoding (SSD), which enables efficient draft-target collaboration for fine-grained reasoning acceleration. Experiments on three mathematical benchmarks-AIME 2024, MATH-500, and LiveMathBench - demonstrate that SSR achieves strong gains over baselines. For instance, on LiveMathBench, SSR improves pass@1 accuracy by 13.84% while reducing computation to 80.5% of the baseline FLOPs. On MATH-500, SSR reduces compute to only 30% with no loss in accuracy.

cs.LG↗

arXiv2026

CrossHOI-Bench: A Unified Benchmark for HOI Evaluation across Vision-Language Models and HOI-Specific Methods

HOI detection has long been dominated by task-specific models, sometimes with early vision-language backbones such as CLIP. With the rise of large generative VLMs, a key question is whether standalone VLMs can perform HOI detection competitively against specialized HOI methods. Existing benchmarks such as HICO-DET require exact label matching under incomplete annotations, so any unmatched prediction is marked wrong. This unfairly penalizes valid outputs, especially from less constrained VLMs, and makes cross-paradigm comparison unreliable. To address this limitation, we introduce CrossHOI-Bench, a multiple-choice HOI benchmark with explicit positives and curated negatives, enabling unified and reliable evaluation of both VLMs and HOI-specific models. We further focus on challenging scenarios, such as multi-person scenes and fine-grained interaction distinctions, which are crucial for revealing real differences between the two paradigms. Experiments show that large VLMs achieve competitive, sometimes superior, zero-shot performance, yet they struggle with multiple concurrent actions and with correctly assigning interactions to the target person. Conversely, HOI-specific methods remain weaker in general HOI reasoning but demonstrate stronger multi-action recognition and more reliable identification of which person performs which action. These findings expose complementary strengths and weaknesses of VLMs and HOI-specific methods, which existing benchmarks fail to reveal due to incorrect penalization.

cs.CV↗

arXiv2026

DAPA: Distribution Aware Piecewise Activation Functions for On-Device Transformer Inference and Training

Non-linear activation functions play a pivotal role in on-device inference and training, as they not only consume substantial hardware resources but also impose a significant impact on system performance and energy efficiency. In this work, we propose Distribution-Aware Piecewise Activation (DAPA), a differentiable and hardware-friendly activation function for Transformer architectures by exploiting the distribution of pre-activation data. DAPA employs a non-uniform piecewise approximation that allocates finer segments to high-probability regions of the distribution, improving generalizability over prior piecewise linear methods. The resulting approximation is further quantized using Distribution-Weighted Mean Square Error to reduce latency and resource utilization for hardware deployment. Our HLS implementation demonstrates that DAPA speeds up GELU computation by 16$\times$ and decreases DSP utilization by 16$\times$ while maintaining comparable or better performance across vision Transformers and GPT-2 models.

cs.LG↗

arXiv2026

From Folding Mechanics to Robotic Function: A Unified Modeling Framework for Compliant Origami

Origami inspired architectures offer a powerful route toward lightweight, reconfigurable, and programmable robotic systems. Yet, a unified mechanics framework capable of seamlessly bridging rigid folding, elastic deformation, and stability driven transitions in compliant origami remains lacking. Here, we introduce a geometry consistent modeling framework based on discrete differential geometry (DDG) that unifies panel elasticity and crease rotation within a single variational formulation. By embedding crease panel coupling directly into a mid edge geometric discretization, the framework naturally captures rigid folding limits, distributed bending, multistability, and nonlinear dynamic snap through within one mechanically consistent structure. This unified description enables programmable control of stability and deformation across rigid and compliant regimes, allowing origami structures to transition from static folding mechanisms to active robotic modules. An implicit dynamic formulation incorporating gravity, contact, friction, and magnetic actuation further supports strongly coupled multiphysics simulations. Through representative examples spanning single fold bifurcation, deployable Miura membranes, bistable Waterbomb modules, and Kresling based crawling robots, we demonstrate how geometry driven mechanics directly informs robotic functionality. This work establishes discrete differential geometry as a foundational design language for intelligent origami robotics, enabling predictive modeling, stability programming, and mechanics guided robotic actuation within a unified computational platform.

cs.RO↗

arXiv2026

Enhanced Continual Learning of Vision-Language Models with Model Fusion

Vision-Language Models (VLMs) represent a significant breakthrough in artificial intelligence by integrating visual and textual modalities to achieve impressive zero-shot capabilities. However, VLMs are susceptible to catastrophic forgetting when sequentially fine-tuned on multiple downstream tasks. Existing continual learning methods for VLMs face various limitations, often relying on additional reference datasets, compromising zero-shot performance, or being restricted to parameter-efficient fine-tuning scenarios. In this paper, we propose a novel Continual Decoupling-Unifying (ConDU) approach that pioneers the use of model fusion for continual learning in VLMs. Specifically, ConDU maintains a unified model along with task triggers and prototype sets, employing an iterative process of decoupling task experts for previous tasks and unifying them with the task expert for the newly learned task. Additionally, we introduce an inference strategy for zero-shot scenarios by aggregating predictions from multiple decoupled task experts. Extensive experiments on the MTIL benchmark show that ConDU achieves up to a 2\% improvement in average performance across all seen tasks compared to state-of-the-art baselines, while also enhancing zero-shot capabilities relative to the original VLM. Our code is available at https://github.com/zhangzicong518/ConDU.

cs.CV↗

arXiv2026

Meta-cavity Quantum Electrodynamics

Cavity quantum electrodynamics (cQED) harnesses light-matter interactions to produce nonclassical light states. However, a fundamental challenge lies in simultaneously achieving Purcell enhancement and tailored wavefront control within a single cavity, due to conflicting resonator requirements. Here, we overcome this limitation by demonstrating triggered single-photon emission with customizable wavefronts from semiconductor quantum dots embedded in geometric-phase metacavities. These monolithic devices - only 200 nm thick - deliver Purcell-enhanced emission alongside spin-momentum-locked radiation, vortex beams, and holographic patterns. The meta-atom lattice provides high-Q optical confinement, while spatially modulated orientations enable efficient outcoupling of photons with designed states. This work establishes a new paradigm for intrinsically multiplexing metasurface-based wavefront shaping with cQED, enabling high-performance quantum light sources from subwavelength-scale monolithic platforms.

physics.optics↗

arXiv2026

Discovering Semantic Latent Structures in Psychological Scales: A Response-Free Pathway to Efficient Simplification

Psychological scale refinement traditionally relies on response-based methods such as factor analysis, item response theory, and network psychometrics to optimize item composition. Although rigorous, these approaches require large samples and may be constrained by data availability and cross-cultural comparability. Recent advances in natural language processing suggest that the semantic structure of questionnaire items may encode latent construct organization, offering a complementary response-free perspective. We introduce a topic-modeling framework that operationalizes semantic latent structure for scale simplification. Items are encoded using contextual sentence embeddings and grouped via density-based clustering to discover latent semantic factors without predefining their number. Class-based term weighting derives interpretable topic representations that approximate constructs and enable merging of semantically adjacent clusters. Representative items are selected using membership criteria within an integrated reduction pipeline. We benchmarked the framework across DASS, IPIP, and EPOCH, evaluating structural recovery, internal consistency, factor congruence, correlation preservation, and reduction efficiency. The proposed method recovered coherent factor-like groupings aligned with established constructs. Selected items reduced scale length by 60.5% on average while maintaining psychometric adequacy. Simplified scales showed high concordance with original factor structures and preserved inter-factor correlations, indicating that semantic latent organization provides a response-free approximation of measurement structure. Our framework formalizes semantic structure as an inspectable front-end for scale construction and reduction. To facilitate adoption, we provide a visualization-supported tool enabling one-click semantic analysis and structured simplification.

cs.CL↗