We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We propose a novel method to sparsify attention in the Transformer model by learning to select the most-informative token representations during the training process, thus focusing on the task-specific parts of an input. A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust trainable top-$k$ operator. Our experiments on a challenging long document summarization task show that even our simple baseline performs comparably to the current SOTA, and with trainable pooling, we can retain its top quality, while being $1.8\times$ faster during training, $4.5\times$ faster during inference, and up to $13\times$ more computationally efficient in the decoder.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2009.05169")
get_code_for_paper("2009.05169")
have("2009.05169")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2009.05169.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2009.05169)
Connect an agent — have() is free.