SearcharxivSearch

arXiv subjects

Junfei Guo

Publications and source records attributed to Junfei Guo.

3 recordsLinked to original sources

FabriMAE I Trust Myself? Self-Evaluating VLA Action Generation with Markov Attention Entropy

Vision-Language-Action models (VLAs) integrate visual perception, language instruction, and action generation into end-to-end policies across heterogeneous architectures. However, enabling VLAs to self-evaluate their action generation reliability without external supervision remains a major challenge. Existing methods either rely on expert annotations or estimate uncertainty only from output statistics, largely ignoring internal signals. In this work, we observe that internal visual modality entropy exhibits consistent distinctions between successful and failed tasks across heterogeneous VLAs. Although VLAs' architectures differ in their action generation, we show that they share a common latent action generation abstraction evolving under visual perception, language instruction, and state input, which we formulate as a Conditional Generative Markov Chain. Based on this formulation, we propose MAE (Markov Attention Entropy), a self-evaluation framework that directly converts internal attention signals into architecture-aware reliability scores, and introduce LIBERO-Reflect, a 4,000-episode benchmark combining 2,000 standard episodes and 2,000 challenging episodes across four subsets. Extensive experiments across heterogeneous VLA architectures and diverse scenarios show that MAE consistently outperforms state-of-the-art baselines on AUPR, AUROC, and FPR@95. We further instantiate FabriMAE for verifier-free test-time action selection, showing that MAE-guided multiple sampling improves PI-family robustness on LIBERO-Plus with small observed runtime overhead.

cs.AI

FabriVLA: A Lightweight Vision-Language-Action Model with Conformal Action Chunk Uncertainty

Vision-Language-Action (VLA) models have become a leading paradigm for general purpose robotic manipulation, but their computational cost and limited uncertainty awareness hinder practical deployment. We present FabriVLA, a lightweight VLA that fuses shallow and intermediate VLM layers to preserve fine-grained visual features, and gates self-attention among action tokens so that its flow matching head admits inter step structure only as far as training warrants. Trained end-to-end in a single stage, FabriVLA reaches a state-of-the-art 90.0\% average success on Meta-World MT50 with only 0.88B parameters. We further introduce Joint Conformal Action Chunk Calibration (JCAC), a post-training method that augments a frozen policy with a lightweight residual scale head. From a single policy query, JCAC turns a learned elementwise error scale into a set that covers the whole executed action prefix at a user chosen confidence level, 3.3$\times$ tighter in mean radius than an unconditional conformal set. On LIBERO-Safety, these bounds rank rollouts by risk before execution, supporting risk ranked review. Together, FabriVLA and JCAC provide a lightweight and auditable framework for multi-task manipulation with calibrated action uncertainty.

cs.RO

State-Robust Nash Predictions In Population Games

This paper introduces state-robust equilibrium (SRE), a local validity test for Nash predictions in finite-strategy population games when the payoff-relevant aggregate state may be misspecified. The reported prescription and payoff map are held fixed; only the state used to evaluate payoff comparisons varies. SRE is equivalent to local best-response invariance, absence of structural exposure, and validity along every vanishing interior aggregate-state error. In affine games, the tangent-cone, normal-cone, and linear-program tests characterize exposure and identify the exposing population, the pure strategy, and the aggregate-state direction. The main implication is a sharp negative result: robust mixing requires local payoff identity on the support; in generic affine games, SRE reduce to strict pure Nash equilibria, although weak boundary equilibria can survive through feasible-set protection. In affine games with polyhedral local uncertainty regions, the same inequalities yield a deterministic finite diagnostic for reported-state validity.

econ.TH