arXiv subjects

Bing Li

Publications and source records attributed to Bing Li.

At least 55 records · Page 3Linked to original sources

arXiv2026

VClare: Resolving Imperfect Specifications in LLM-Based Verilog Generation

Large language models (LLMs) have demonstrated promising capabilities in generating Verilog code from natural language specifications. However, human-written specifications often contain semantic imperfections such as vagueness, contradictions, and incompleteness, which can significantly degrade the quality of hardware design generated by LLMs. In this paper, we present the first systematic study of imperfect specifications and propose an automated framework {VClare} to repair them to enhance the quality of resulting Verilog design. The proposed framework explores two complementary repair paradigms. The \textit{Spec-Level Repair} conducts LLM-driven inconsistency mining directly on the specification texts, while the \textit{Sim-Level Repair} employs simulation-based behavioral clustering with optional test-time inconsistency arbitration. In addition, we propose two new benchmark datasets with systematically injected specification defects. The first benchmark dataset is derived from the VerilogEval-human benchmark targeting single-module tasks, while the other benchmark dataset is derived from the ComplexVDB dataset and contains 53 multi-module tasks that reflect more realistic engineering scenarios. For single-module tasks, the {VClare} framework can repair the imperfections in the specifications effectively and thus enhance the pass rate of the generated Verilog design by 12.7\%, while for the multi-module tasks this enhancement can reach 13.7\%, demonstrating the capabilities of specification repair by {VClare} as well as further potential of LLMs in front-end hardware design.\footnote{The two benchmark datasets are released at https://anonymous.4open.science/r/VClare/.

cs.AR↗

arXiv2026

Dimension drop for intersections of Cantor sets

Let $E\subset \mathbb{R}$ be a self-similar set generated by a homogeneous iterated function system $Φ$ with contraction ratio $ρ\in (0,1)$. Assume that $Φ$ satisfies the open set condition and $\dim_{\rm H}E<1$. Let $f$ be a $C^1$-diffeomorphism on $\mathbb{R}$. We prove that if $\log|f'(x)|/\logρ\not\in\mathbb{Q}$ for every $x\in E\cap f^{-1}(E)$, then the upper Minkowski dimension of $f(E)\cap E$ is strictly less than the Hausdorff dimension of $E$. We also establish a quantitative dimension drop result when $E$ is a missing-digit set and $f$ is an affine map with rational slope satisfying a certain arithmetic condition. Based on these results and a result of Shmerkin [Ann. of Math., 2019], we obtain characterizations of $γ$ in various contexts such that $\overline{\dim}_{\rm M}\left((γE+α)\cap E\right)<\dim_{\rm H}E$ for every $α\in\mathbb{R}$.

math.CA↗

arXiv2026

SequenceFI: Non-intrusive Temporal Fault Injection for Microservice Systems

Fault injection is widely used to evaluate the resilience of microservice systems, where client requests often span multiple services and execution stages. Existing request-level techniques usually control where and what faults are injected, but not when they are activated within a distributed execution. This limitation makes it difficult to reproduce timing-dependent failures, such as failures after state-changing side effects, order-sensitive concurrent responses, and partial failures among repeated downstream calls. This paper presents SequenceFI, a non-intrusive framework for temporal fault injection in microservice systems. SequenceFI observes message-level send and receive events, propagates compact temporal evidence along request executions, and triggers faults only when occurrence-sensitive temporal guards are satisfied. It further synthesizes temporal guards from traces, reducing the need for exhaustive enumeration of temporal fault-injection configurations, while requiring no modifications to application code or serialization libraries. We implement SequenceFI on Kubernetes and evaluate it on four widely used microservice benchmarks. Across nine temporal-fault scenarios and 450 valid trials, SequenceFI achieves 100.0\% temporal success without premature or multiple injections, finds effective configurations in one attempt on average, and reduces aggregate end-to-end search time by 95.91\% compared with H-Random.

cs.SE↗

arXiv2026

End-to-end Conditional Diffusion for Realistic and Controllable Visual Traffic Scenario Generation

Generating closed-loop traffic scenarios that are both realistic and controllable is crucial for evaluating autonomous driving systems, especially under rare safety-critical interactions. Existing learning-based methods often struggle to balance controllability and realism, offering either limited fine-grained control over traffic behavior or controllable scenarios at the expense of behavioral plausibility. This paper presents E2E-CDiff, an end-to-end conditional diffusion framework for controllable and realistic scenario generation. Conditioned on front-view visual observations, E2E-CDiff jointly denoises future motion states and executable low-level controls for route-interacting background vehicles. This unified state-action generation mitigates the planning-control mismatch in conventional two-stage trajectory-then-controller pipelines. Differentiable guidance further regulates speed, enforces drivable-area compliance, and supports collision-avoidance or collision-seeking behaviors, enabling both naturalistic and safety-critical scenario generation. Experiments on Bench2Drive show that E2E-CDiff achieves a favorable controllability-realism trade-off compared with representative reinforcement- and imitation-learning baselines, while its collision-guided variant induces challenging interactions across multiple autonomous driving systems. E2E-CDiff also performs competitively as a learning-based ego planner, demonstrating the generality of end-to-end state-action diffusion.

cs.RO↗

arXiv2026

A Comprehensive Survey on Video Scene Parsing:Advances, Challenges, and Prospects

Video Scene Parsing (VSP) studies dense video understanding, where every pixel in each frame must be segmented, each region must be named, and each object identity must remain coherent over time. This survey reviews recent progress in VSP across five tasks, spanning Video Semantic Segmentation (VSS), Video Instance Segmentation (VIS), Video Panoptic Segmentation (VPS), Video Tracking \& Segmentation (VTS), and Open-Vocabulary Video Segmentation (OVVS). We organize the literature as one architectural arc, running from hand-crafted motion and appearance cues through fully convolutional, attention-based and query-based designs to recent foundation-model approaches, and we trace how each family models temporal context, preserves identity, and balances accuracy against efficiency. We then compare the datasets, metrics and benchmark trends that shape current evaluation. Beyond cataloguing methods, we foreground the design trade-offs and recurring failure modes that cut across the field, namely temporal flicker, occlusion-induced identity switches, long-tail categories, and the annotation--capacity--latency tension. We close with open directions towards robust, efficient and open-world VSP systems.

cs.CV↗

arXiv2026

Gaussian Mixture Modeling for Event-Aware Visual Allocation in Long Video Understanding

Large Vision-Language Models (LVLMs) face significant challenges in long video understanding due to the excessive computational cost and information loss associated with uniform sampling. Existing keyframe selection methods often treat video frames as atomic entities and allocate visual budgets equally, thereby overlooking high-level semantic structures and introducing substantial redundancy. To address these limitations, we propose GMM-EVA (Gaussian Mixture Modeling for Event-Aware Visual Allocation), which leverages Gaussian Mixture Models to model event-level structure from discrete frame-wise observations. A differentiated allocation strategy is then applied to preserve one primary high-resolution keyframe per event for high-fidelity detail, while utilizing lower-resolution secondary keyframes to maintain temporal context and optimize token budgets. GMM-EVA is a training-free, plug-and-play framework that generalizes robustly across various relevance measures and downstream LVLMs. Extensive experiments on multiple long video benchmarks demonstrate that our method significantly outperforms uniform sampling. Notably, GMM-EVA achieves comparable performance to baseline selection methods while utilizing only approximately half of the visual token budget, highlighting its superior efficiency and effectiveness.

cs.CV↗

arXiv2026

SPORT: Structure-Aware Prototype Disentanglement for Incomplete Multi-View Clustering

Prototype-based Incomplete Multi-view Clustering has recently attracted increasing attention by exploiting prototypes as semantic anchors for missing-view imputation. However, existing approaches are still limited in three aspects. First, they typically focus on enforcing cross-view prototype consistency, while ignoring view-specific information embedded in prototypes, thus limiting multi-view expressiveness. Second, most methods rely on instance-level contrastive learning that only aligns paired samples across views, failing to preserve cluster-level relational structures. Third, missing-view imputation is usually performed using global prototypes alone, without considering local geometric neighborhood structures, leading to inaccurate recovery of missing representations. To address these limitations, we propose a novel framework termed Structure-aware PrOtotype disentanglement foR incomplete multi-view clusTering (SPORT), which explicitly disentangles shared and view-specific components of prototypes while preserving cluster-level relational structures. Specifically, we decouple prototypes into orthogonal shared and view-specific components, aligning only shared components to capture consensus semantics while de-correlating view-specific components to preserve complementary information. Meanwhile, a structure-aware contrastive learning mechanism is incorporated to explicitly model cluster-level relationships during cross-view representation learning. Furthermore, a hybrid imputation strategy integrates global prototype matching with local neighborhood matching, enabling joint exploitation of semantic prototypes and manifold structures for missing-view recovery. Extensive experiments on six benchmark datasets show that SPORT achieves superior performance over state-of-the-art methods under various missing rates.

cs.CV↗

arXiv2026

LLM for EDA in Front-End Design: Challenges and Opportunities

As chip complexity increases and time-to-market pressures grow, front-end design has become a critical bottleneck in chip development. Recently, Large Language Models (LLMs) have shown great potential in Electronic Design Automation (EDA). Beyond specification understanding, LLMs show the potential to serve as a unified intelligent interface for hardware description language (HDL) generation, testbench construction, and design space exploration. The rise of agentic AI, represented by pioneering systems such as OpenClaw, offers a strategic roadmap for the next generation EDA. From this perspective, this paper discusses the evolution of EDA from localized assistance to autonomous agentic execution. Then, we review representative advances of LLMs in front-end design, focusing on key tasks such as circuit and testbench generation from a shared specification, as well as design quality improvement in established workflows such as high-level synthesis. Finally, we discuss the key challenges and limitations of integrating LLMs into EDA, and outline future opportunities for advancing LLM-enabled front-end design, offering a systematic perspective for researchers interested in leveraging agentic AI technologies for EDA.

cs.ET↗

arXiv2026

CyberSelf: Embodied Self-Distancing for Emotional Support in Virtual Reality

Self-distancing is an effective emotion regulation strategy; however, it may fail during personal crises due to its cognitive demands. Virtual Reality (VR) provides a novel approach to externalizing psychological distance by enabling embodied self-representation. In this paper, we present CyberSelf, a VR system for emotional support that integrates a visually self-resembling avatar, a cloned self-voice, and Large Language Model (LLM)-driven real-time dialogue. The system enables users to engage in multi-turn conversations with their self-representations in immersive VR, enabling embodied self-distancing while maintaining a strong sense of self-relevance. We evaluated CyberSelf in a short-term study that compares three levels of self-representation richness (Text, Text+Voice, and Text+Voice+Appearance). The results demonstrated robust pre-post improvements across affective and coping measures, specifically increased valence, arousal, hope, and resilience, as well as reduced anxiety and simulator sickness. Richer representations increased conversational engagement, and full embodiment produced the strongest physiological indicators of emotional regulation. A subsequent four-week long-term study demonstrated that these benefits are both sustainable and cumulative. Additionally, users rated the reconstructed avatar and the cloned voice as highly recognizable and acceptable. Collectively, these findings suggest that embodied, self-resembling conversational agents provide a viable mechanism for externalizing self-distancing and supporting emotional regulation in VR.

cs.HC↗

arXiv2026

Towards Accurate and Fast Clinical Body Composition: A Resource-Efficient Hierarchical Segmentation Framework for Multi-Source CT

Background: Automated 3D segmentation of muscles and adipose tissue from CT is vital for body composition analysis, but multi-source data heterogeneity and high CPU memory demands hinder clinical deployment. Methods: We propose a coarse-to-fine hierarchical framework to segment ten tissue structures. Efficiency is optimized using Dynamic Spacing and Anisotropic Patching, a Group Inference mechanism for low-memory sliding-window processing, and Topology-Aware Asymmetric Resampling for fast post-processing. Results: The framework was trained on 1,558 CT volumes from seven public and two private datasets, and evaluated on an independent test cohort (N=105), per-structure Dice coefficients ranged from 0.924 to 0.982. Eight major structures met the +-10% relative error clinical acceptance limit. On a 12-core CPU workstation, the GPU-free pipeline averaged 44.5 seconds per volume with 4.73 GB peak memory. Conclusion: This framework balances accuracy and efficiency, enabling robust, large-scale body composition analysis on standard CPU workstations.

eess.IV↗

arXiv2026

MMAgent-R$^2$: Learning to Rerank and Reject for Agentic mRAG

Knowledge-based Visual Question Answering (KB-VQA) requires models to retrieve visual entities matching the query image from large-scale encyclopedic knowledge bases and answer related questions. Existing multimodal Retrieval Augmented Generation (mRAG) methods rely on global visual features to match candidate entities, yet when the knowledge base contains numerous visually similar entities, the retriever struggles to distinguish them, populating the candidate set with visually similar but factually mismatched distractors. Since subsequent processing steps such as noise filtering are also confined to this fixed candidate set, errors from failed retrieval inevitably propagate to the final answer. To address these challenges, we propose MMAgent-R$^2$, an agentic mRAG framework that integrates visual reranking and active rejection as its internal verification mechanism. Visual reranking directly compares query and candidate images, capturing discriminative details beyond textual descriptions to precisely identify the target entity among similar candidates; active rejection discards unreliable results and retrieves additional candidates when no confident match is found, moving beyond the fixed candidate pool. We design a composite reward function with step-level verification rewards and achieve joint optimization of external retrieval, internal verification, and answer generation via GRPO training. Experiments on InfoSeek, E-VQA, and MMhops demonstrate that \ours{} achieves state-of-the-art performance, with particularly notable advantages in challenging retrieval scenarios and complex multi-image multi-hop reasoning tasks.

cs.CV↗

arXiv2026

On Sharpened Convergence Rate of Generalized Sliced Inverse Regression for Nonlinear Sufficient Dimension Reduction

Generalized Sliced Inverse Regression (GSIR) is one of the most important methods for nonlinear sufficient dimension reduction. As shown in Li and Song (2017), it enjoys a convergence rate that is independent of the dimension of the predictor, thus avoiding the curse of dimensionality. In this paper we establish an improved convergence rate of GSIR under additional mild eigenvalue decay rate and smoothness conditions. Our convergence rate can be made arbitrarily close to $n^{-1/3}$ under appropriate decay rate and smoothness parameters. As a comparison, the rate of Li and Song (2017) is $n^{-1/4}$ under the best conditions. This improvement is significant because, for example, in a semiparametric estimation problem involving an infinite-dimensional nuisance parameter, the convergence rate of the estimator of the nuisance parameter is often required to be faster than $n^{-1/4}$ to guarantee desired semiparametric properties such as asymptotic efficiency. This can be achieved by the improved convergence rate, but not by the original rate. The sharpened convergence rate can also be established for GSIR in more general settings, such as functional sufficient dimension reduction.

math.ST↗

arXiv2026

Traceable Fault Diagnosis for Battery Energy Storage Systems via Retrieval-Augmented Multi-Agent O&M Assistant

Large-scale battery energy storage systems (BESSs) require O&M decisions that combine alarms, cell-level measurements, device topology, diagnostic tables, historical cases, and maintenance documents. Monitoring platforms can flag threshold violations, but they often cannot explain whether voltage inconsistency, resistance drift, short-circuit risk, capacity divergence, or thermal abnormality needs intervention. This digest presents a traceable BESS fault-diagnosis assistant that uses retrieval-augmented multi-agent reasoning to connect operational data, domain knowledge, visual evidence, and report generation. Reliability is improved through BESS-specific task routing, schema-constrained natural-language database access, hybrid text-image retrieval, and evidence-based answer synthesis. Preliminary internal evaluation is reported for routing, database access, and diagnostic reasoning.

cs.AI↗

arXiv2026

Metric results for dyadic approximation on the middle-third Cantor set

Let $C$ be the middle-third Cantor set and $μ$ be the Cantor-Lebesgue measure on $C$. A conjecture of Velani states that $μ(W_2(τ))=0$ if $τ>1$ and $μ(W_2(τ))=1$ if $0<τ\leq 1$, where $W_2(τ)=\left\{x\in[0,1]: \|2^nx\| \frac{1}γ-\frac{1-γ}{3-γ}\,(\approx 1.429)$ and $0<τ<\fracγ{12}\,(\approx 0.052)$, where $γ=\frac{\log2}{\log3}$ is the Hausdorff dimension of $C$. This improves the known results on both the null part ($τ>\frac{1}γ-\frac{0.078(1-γ)}{γ(2-γ)}\approx 1.552$, due to Allen, Baker, Chow, and Yu (2023)) and the full measure part ($0<τ\leq 0.01$, due to Baker (2025)). Our key innovation is to establish the estimate \[\sum_{n=1}^{N}|\widehatμ(h2^n)|^2\ll N^{1-γ}\] and its consequences: \[ \sum_{n=1}^{N}|\widehatμ(h2^n)|\ll N^{1-\fracγ{2}},\quad \sum_{n=1}^{N}n^{- σ}|\widehatμ(h2^n)|\ll_σ N^{1-\fracγ{2}-σ},\] where $0<σ<1-\fracγ{2}$, and all estimates are uniform in $h\in\mathbb{Z}\setminus\{0\}$. For the full measure part, our approach also generalizes to self-similar measures on a class of missing-digit sets.

math.NT↗

arXiv2026

CompressKV: Semantic-Retrieval-Guided KV-Cache Compression for Resource-Efficient Long-Context LLM Inference

Long-context large language model (LLM) inference is increasingly constrained by the memory footprint and decoding cost of key-value (KV) caches, limiting sustainable deployment on resource-constrained hardware. Existing KV cache eviction methods typically apply heuristic token scoring over all heads in GQA-based LLMs. These methods ignore the different functionalities of attention heads, leading to the eviction of critical tokens and thus degrading the performance of LLMs. To address this issue, we propose CompressKV, a resource-efficient KV-cache compression framework for GQA-based LLMs. Instead of aggregating attention scores from all heads, CompressKV identifies Semantic Retrieval Heads (SRHs) that capture both the initial and final tokens of a prompt and semantically important mid-context evidence, and uses them to select tokens whose KV pairs should be retained. Furthermore, CompressKV allocates cache budgets across layers according to offline estimates of layer-wise eviction error. Experiments on LongBench and Needle-in-a-Haystack show that CompressKV consistently outperforms existing KV-cache eviction methods across memory budgets. Notably, it preserves over 97\% of full-cache performance using only 3\% of the KV cache on LongBench question-answering tasks and achieves 90\% accuracy with just 0.7\% KV storage on Needle-in-a-Haystack. These results demonstrate an improved resource--performance trade-off for long-context LLM inference. Our code is publicly available at: https://github.com/TUDa-HWAI/CompressKV

cs.AI↗

arXiv2026

A Test for Treatment Heterogeneity under a Distributional Difference-in-Difference Framework

We develop a novel distributional Difference-in-Differences (DiD) framework to capture treatment heterogeneity across outcome distributions. By leveraging optimal transport, we use the control group to estimate the untreated distributional drift from the pre- to post-treatment period and apply it to the treated group's pre-treatment baseline, constructing a counterfactual distribution under the assumption of no treatment effect. We frame the null hypothesis as a distributional equality between the transported counterfactual distribution and the observed treated post-treatment distribution, and test it using a maximum mean discrepancy statistic in a reproducing kernel Hilbert space (RKHS). The resulting nonparametric omnibus test is sensitive to changes in location, scale, shape, and tail behavior. Under the null, we derive the asymptotic Gaussian quadratic-form limit of the test statistic, while under local alternatives, we provide a unified characterization of power that establishes its Pitman local power and moderate-deviation consistency. Our theory reveals how detectability is shaped by the interaction between transport-induced drift and RKHS geometry. Simulations and an application to the Card--Krueger minimum-wage data demonstrate that the proposed method identifies key distributional treatment effects missed by classical mean-based DiD.

stat.ME↗

arXiv2026

MetaResearcher: Scaling Deep Research via Self-Reflective Reinforcement Learning in Adversarial Virtual Environments

Deep research agents have demonstrated remarkable capabilities in autonomous information gathering and synthesis, yet their training remains constrained by the static nature of simulated environments, the limits of fact-retrieval-only task designs, and the inefficiency of outcome-based reinforcement learning. In this work, we propose MetaResearcher, a novel framework that scales deep research agent training across four synergistic dimensions. First, we introduce an Evolving Virtual World that injects temporal dynamics and adversarial misinformation into the training environment, forcing agents to develop source credibility assessment and temporal conflict resolution skills. Second, we design Discovery-Oriented Tasks -- including hypothesis generation and contradiction resolution -- that transcend simple fact retrieval and push agents toward genuine research behaviors. Third, we propose a Self-Reflective Meta-Reward mechanism within the GRPO framework that jointly optimizes for answer correctness, search path efficiency, reflection depth, and tool call diversity, directly addressing the repetitive action loop problem observed in prior work. Fourth, we introduce a Heterogeneous Multi-Agent Swarm architecture comprising specialized Scout, Filter, and Synthesizer models that learn collaborative research strategies through coordinated reinforcement learning. Built upon the LiteResearcher infrastructure, MetaResearcher requires zero marginal API cost for training while targeting substantial improvements in both benchmark performance (GAIA, Xbench-DS) and epistemic robustness under adversarial conditions. We present the complete framework design, training methodology, and planned experimental validation.

cs.AI↗

arXiv2026

Gap reopening as a possible signature of coupling between Majorana zero modes in Sn-(Bi,Sb)2(Te,S)3-based Josephson trijunctions

In the past two decades, enormous efforts have been made to search for possible platforms and schemes to implement topological quantum computation (TQC). In exploring the Fu-Kane scheme of TQC based on Josephson trijunctions constructed on topological insulators, the predicted Majorana phase diagram of an individual trijunction has already been verified experimentally. If Majorana zero modes indeed exist in this kind of trijunction, coupling between them in multiple trijunction devices should be further expected. In this study, we fabricated Josephson devices containing two adjacent Josephson trijunctions on the surface of Sn-(Bi, Sb)2(Te, S)3 and observed a possible signature of the coupling effect manifesting as the reopening of a minigap in both trijunctions where a closure would otherwise be expected if the trijunctions existed individually. While alternative interpretations cannot be fully ruled out, our findings provide experimental support for the validity of the Fu-Kane theory and provide further motivation for advancing the TQC scheme proposed by Fu and Kane.

cond-mat.supr-con↗