Yu Chen

Boning Li, Yu Chen, Longbo Huang

Deciding which of two agents is stronger means playing games until skill outweighs luck, and every game costs money, model inference, or expert time. Since the number of games needed is unknown, fixed-budget evaluations either keep paying after the result is settled or stop before the agents can be told apart, while naive optional stopping with an ordinary confidence interval invalidates the stated level. We make such an evaluation stop as soon as its evidence suffices, with the guarantee intact. The Action-Informed Value Assessment Tool (AIVAT) reduces variance in imperfect-information games through conditional mean-zero corrections, by a median $54\times$ across 15 LLM agent configurations spanning 71,439 paired Heads-Up No-Limit Hold'em (HUNL) hands, but does not say when to stop. We combine AIVAT with continuously monitored Confidence Sequences (CSs) into anytime-valid AIVAT (AV-AIVAT), whose online value model learns only from past games so that no game scores its own correction. At the nominal 95\% level and a target precision of $\pm1$ Big Blind, raw outcomes need a median $74\times$ as many hands as AIVAT-corrected outcomes to stop under the Asymptotic CS (AsympCS). Exact finite-sample certification uses the Empirical-Bernstein CS (EB-CS), which needs an independently justified bound on corrected payoffs. We establish such a bound structurally for Leduc hold'em and characterize a width floor set by the CS's bet cap and that bound, which governs how much of a variance gain becomes earlier stopping; the descriptive HUNL EB-CS runs show a median $1.37\times$ stopping-time ratio. AV-AIVAT turns variance reduction into efficient, auditable early stopping while separating asymptotic screening from exact certification, so an evaluation can stop the moment its evidence suffices and hand a third party everything needed to recheck the verdict at that very stopping time.

Yu Chen, Gong Chen, Xiang Li

Providing assistance across diverse movements is a central objective of exoskeletons, and anatomical knowledge can enable responsive support that generalizes across tasks. However, anatomical assistance has mainly been studied for lower-limb exoskeletons, where periodic, weight-bearing motions impose lower demands on torque precision. Extending such assistance to complex, nonperiodic upper-limb movements remains challenging. This paper proposes Anatomical Torque with Passivity-Based Control (ATP) for safe upper-limb exoskeleton assistance. First, a scalable musculoskeletal simulation framework trains a unified reinforcement-learning muscle controller that generalizes across upper-limb movements and generates anatomical reference torques without complex biomechanical computations. Second, an online torque-refinement scheme adapts the reference to diverse movements, suppresses tendon-induced spikes, and incorporates a learned anomaly score for safe and comfortable assistance. Third, an interaction torque controller delivers assistance through a cable-driven compliant exoskeleton without constraining motion to predefined trajectories, while an energy tank preserves passivity with theoretical guarantees on torque tracking and system passivity. Simulations and real-world experiments show accurate tracking of long-duration motion sequences and generalization to real-time human movements. The controller achieves accurate torque tracking while preserving passivity and resumes tracking after energy-tank replenishment. An EMG study with five participants further shows reduced target-muscle activity during static and dynamic tasks compared with gravity compensation and open-loop assistance, with reductions of up to 48% relative to movement without the exoskeleton in a dynamic multi-joint task.

Wang Chen, Yu Chen, Xiang Wang et al.

Frame selection is essential for applying Large Multimodal Models (LMMs) to long videos due to severe frame redundancy and limited context windows. Since the appropriate frame budget varies with the downstream LMM, reasoning demands, and latency constraints, a practical selector should serve multiple budgets. However, existing methods typically optimize an isolated frame subset for each predefined budget: when the budget changes, previously selected evidence may be replaced rather than progressively augmented. Ranking frames by a fixed score would allow prefix reuse across budgets, but it ignores the distinct roles of different ranking positions. In this paper, we formulate long-video frame selection as a Matryoshka ranking problem: constructing a single priority sequence whose small prefixes concentrate query-conditioned evidence, while progressively larger prefixes preserve this evidence and add broader temporal context. Efficiently constructing such a ranking is itself challenging, as densely sampling long videos and evaluating frame-query relevance incurs substantial overhead. We therefore introduce Matryoshka Evidence-to-Context (MEC) Frame Selection, a training-free framework that builds a reusable sparse video index, discovers candidates through sparse probing and local zooming, and greedily constructs a position-adaptive ranking: early positions emphasize evidence; later positions progressively favor temporal coverage while preserving visual diversity. A single ranking can thus be truncated to any target budget without rerunning the selector. Across four benchmarks and six frame budgets, MEC improves average accuracy over uniform sampling by 3.77 percentage points, matches strong state-of-the-art selectors, and reduces end-to-end selection latency by 47.37-51.19%.