Skip to content

Author

Benyuan Yang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Aug 2026

Multi-Scale BiMamba with Test-Time Adaptation for Motor Imagery Classification

Hybrid brain-computer interfaces combining electroencephalography and functional near-infrared spectroscopy utilize neurovascular coupling to improve decoding. Current fusion strategies rely on shallow aggregation or complex attention, which struggle to capture complex temporal dynamics and complex dependencies in long sequences. Moreover, static models lack online calibration for sensor failures or non-stationary noise, causing significant performance drops. We propose the Multi-Scale Bidirectional Mamba with Test-Time Adaptation (MS-BiM-TTA) framework. The architecture employs a multi-scale frontend for heterogeneous feature extraction and bidirectional state-space models for efficient long-range intra-modal and inter-modal modeling with linear complexity. To ensure robustness, a customized test-time adaptation workflow utilizes two-level entropy filtering for update safety and mutual information sharing for autonomous representation reconstruction. Results show that MS-BiM-TTA significantly enhances accuracy and demonstrates superior resilience to modality missingness in both binary and fine-grained tasks.

Ziyang Bao, Mingseng Guo, Botao Jin et al. · 0 citations
#artificial intelligence Preprint Sep 2026

GeoPAR: Large-Scale Multi-Agent Combinatorial Optimization with Geometry-Guided Parallel Autoregressive Learning

Multi-agent combinatorial optimization problems are notoriously challenging due to their NP-hard nature. Recent parallel autoregressive neural solvers improve inference efficiency by allowing agents to make decisions simultaneously, but their performance often degrades on large-scale instances. This is largely attributable to weak modeling of local geometric structures and the fact that conflicting task selections are handled only after action generation. To address these limitations, we propose GeoPAR, a geometry-guided parallel autoregressive reinforcement learning framework for scalable multi-agent combinatorial optimization. GeoPAR integrates three key components: (1) a projection-window sparse geometry mechanism that builds lightweight local candidate neighborhoods through multi-directional projections, (2) sparse edge-biased attention that injects these geometric relations into node representations, and (3) cache-guided conflict-aware assignment that reuses the geometric cache during decoding to suppress duplicate selections of exclusive tasks. Experiments on heterogeneous vehicle routing and open multi-depot pickup-and-delivery problems show that GeoPAR improves large-scale zero-shot generalization while substantially reducing rollout steps and maintaining efficient inference.

Wenjie Wu, Zepeng Jia, Jia-Ying Tang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.