PerAct-L: Linear Self-Attention Mechanism For Computational Optimization of Robotic Transformer

In this study, we propose PerAct-L, an enhanced version of the PerAct robot manipulation model based on the Perceiver IO architecture, specifically designed to reduce its computational complexity. PerAct-L incorporates a linear low-rank self-attention mechanism that projects the Key and Value matrices into a fixed low-dimensional space. This approach reduces the time complexity of the attention operation from O(N²) to O(N<sub>k</sub>), effectively lowering both computational requirements and memory usage. Experiments conducted in the RLBench environment show that PerAct-L improves the success rate by 13.6 % over the original PerAct model when performing the complex &quotPut Item in Drawer&quot task. Additionally, in a previously unseen environment with an expanded rotation range, it achieves a performance gain of 12.8 %. Further analysis of the latent vector activation distribution after cross-attention reveals that PerAct-L tends to distribute information more evenly. This suggests that computational optimization contributes to enhanced representational diversity and robustness in manipulation. These findings validate that low-rank attention mechanisms can not only improve real-time performance and adaptability but also enhance expressivity, demonstrating the structural scalability and practical potential of PerAct-L.

Authors

Publication Details

Journal
Journal of Korea Multimedia Society
Published
2025-08-31
DOI
https://doi.org/10.9717/kmms.2025.28.8.1179
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PerAct-L: Linear Self-Attention Mechanism For Computational Optimization of Robotic Transformer

Taekjin Jang, Hoyoung Song, Hyun-Seok Kim, Seong-Hwan Kim et al.
Journal of Korea Multimedia Society
Advanced Control Systems Optimization
article

PerAct-L: Linear Self-Attention Mechanism For Computational Optimization of Robotic Transformer

Taekjin Jang, Hoyoung Song, Hyun-Seok Kim, Seong-Hwan Kim, Yejin Lee, Young-Lim Choi
article en

Abstract

In this study, we propose PerAct-L, an enhanced version of the PerAct robot manipulation model based on the Perceiver IO architecture, specifically designed to reduce its computational complexity. PerAct-L incorporates a linear low-rank self-attention mechanism that projects the Key and Value matrices into a fixed low-dimensional space. This approach reduces the time complexity of the attention operation from O(N²) to O(N<sub>k</sub>), effectively lowering both computational requirements and memory usage. Experiments conducted in the RLBench environment show that PerAct-L improves the success rate by 13.6 % over the original PerAct model when performing the complex &quotPut Item in Drawer&quot task. Additionally, in a previously unseen environment with an expanded rotation range, it achieves a performance gain of 12.8 %. Further analysis of the latent vector activation distribution after cross-attention reveals that PerAct-L tends to distribute information more evenly. This suggests that computational optimization contributes to enhanced representational diversity and robustness in manipulation. These findings validate that low-rank attention mechanisms can not only improve real-time performance and adaptability but also enhance expressivity, demonstrating the structural scalability and practical potential of PerAct-L.

Journal of Korea Multimedia SocietyVol. 28(8)
Openalex Percentile: Top 69%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.