Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yiqiao Wang 0005

dblp:379/6095 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
attention mechanism
0.812024
Gated Slot Attention for Efficient Linear-Time Sequence Modeling · NeurIPS 2024
Machine learning › Deep learning architectures and training › sequence modeling
efficient sequence modeling
0.812024
Gated Slot Attention for Efficient Linear-Time Sequence Modeling · NeurIPS 2024
Machine learning › Deep learning architectures and training › attention mechanism › efficient attention
linear attention
0.812024
Gated Slot Attention for Efficient Linear-Time Sequence Modeling · NeurIPS 2024
Machine learning › Deep learning architectures and training
sequence modeling
0.812024
Gated Slot Attention for Efficient Linear-Time Sequence Modeling · NeurIPS 2024
Machine learning › Deep learning architectures and training
transformer
0.212024
Gated Slot Attention for Efficient Linear-Time Sequence Modeling · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

softmax attention · 0.8gating mechanism · 0.8
YearPublicationVenuePosition
2024 Gated Slot Attention for Efficient Linear-Time Sequence Modeling
abstract
Linear attention Transformers and their gated variants, celebrated for enabling parallel training and efficient recurrent inference, still fall short in recall-intensive tasks compared to traditional Transformers and demand significant resources for training from scratch. This paper introduces Gated Slot Attention (GSA), which enhances Attention with Bounded-memory-Control (ABC) by incorporating a gating mechanism inspired by Gated Linear Attention (GLA). Essentially, GSA comprises a two-layer GLA linked via $\operatorname{softmax}$, utilizing context-aware memory reading and adaptive forgetting to improve memory capacity while maintaining compact recurrent state size. This design greatly enhances both training and inference efficiency through GLA's hardware-efficient training algorithm and reduced state size. Additionally, retaining the $\operatorname{softmax}$ operation is particularly beneficial in ``finetuning pretrained Transformers to RNNs'' (T2R) settings, reducing the need for extensive training from scratch. Extensive experiments confirm GSA's superior performance in scenarios requiring in-context recall and in T2R settings.
Yu Zhang 0092, Rui-Jie Zhu 0003, Yue Zhang 0004, Leyang Cui, Yiqiao Wang 0005, Bolun Wang, Freda Shi, Bailin Wang, Wei Bi, Peng Zhou 0017, Guohong Fu
NeurIPS6