Search arXiv⌕ Search

arXiv subjects

Wenxi Hong

Publications and source records attributed to Wenxi Hong.

3 recordsLinked to original sources

CereVLA: Cerebellum-Inspired Consequence-Aware Residual Governance for Efficient Vision-Language-Action Execution

Action-chunked vision-language-action (VLA) policies improve inference efficiency, but limited feedback within committed action chunks can lead to accumulated execution errors. Residual adaptation can correct such deviations without retraining the VLA; however, existing corrections are typically optimized for reference-action consistency without explicitly considering their downstream consequences. To address this limitation, we present Cerebellum-Inspired Consequence-Aware Residual Governance (CereVLA), a unified framework that integrates lightweight residual refinement and predictive consequence evaluation into frozen VLA execution. Corrective actions are first generated by flow-based residual refinement, and their short- and interval-horizon consequences are then evaluated by a recurrent state-space model and a history-aware classifier. Residual corrections predicted to be unfavorable are selectively suppressed by a lightweight governor. Comparisons with state-of-the-art methods on LIBERO-10 and LIBERO-GOAL demonstrate the effectiveness of CereVLA. On SO-101, CereVLA increases task success from 57.5% to 90.0% and reduces mean control steps by 19.6% among successful trials, relative to the frozen SmolVLA baseline.

cs.CV↗

Spectral radius and signless Laplacian spectral radius of strongly connected digraphs

Let D be a strongly connected digraph and A(D) be the adjacency matrix of D. Let diag(D) be the diagonal matrix with outdegrees of the vertices of D and Q(D) = diag(D) + A(D) be the signless Laplacian matrix of D. The spectral radius of Q(D) is called the signless Laplacian spectral radius of D, denoted by q(D). In this paper, we give sharp bound on q(D) with outdegree sequence and compare the bound with some known bounds, establish some sharp upper or lower bound on q(D) with some given parameter such as clique number, girth or vertex connectivity, and characterize the corresponding extremal digraph or proposed open problem. In addition, we also determine the unique digraph which achieves the minimum (or maximum), the second minimum (or maximum), the third minimum, the fourth minimum spectral radius and signless Laplacian spectral radius among all strongly connected digraphs, and answer the open problem proposed by Lin-Shu [H.Q. Lin, J.L. Shu, A note on the spectral characterization of strongly connected bicyclic digraphs, Linear Algebra Appl. 436 (2012) 2524{2530].

math.CO↗

Some sharp bounds on the distance signless Laplacian spectral radius of graphs

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the sharp upper bounds of the spectral radius of a nonnegative matrix, then apply these theorems to signless Laplacian matrices and the distance signless Laplacian matrices to obtain some sharp bounds on the spectral radius, respectively. We also proposed a known result about the sharp bound of the signless Laplacian spectral radius has a defect.

math.CO↗