atlas

Research map / Architectures and efficiency / Attention and transformers

Tree Cross Attention

ICLR 2024 · Architectures and efficiency › Attention and transformers · approach: Transformer expressivity and circuits · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Tree Cross Attention (TCA), which organizes context tokens in a k-d tree and uses an RL-learned policy to retrieve only O(log N) nodes for cross attention, and ReTreever, an encoder plus TCA architecture for token-efficient inference.

Problem

Cross attention at inference scans all O(N) context tokens, while latent-bottleneck methods like Perceiver IO compress information into a fixed number of latents that may not suffice for high-intrinsic-dimensionality problems.

Approach

Organize context tokens as leaves of a balanced k-d tree with aggregated internal nodes, and learn a REINFORCE-trained tree-search policy (parameterized as attention over children) that selects a logarithmic set of nodes for cross attention, allowing non-differentiable rewards such as accuracy.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace Perceiver IO with TCA using the same token budgetCopy Task · Copy Task N=256accuracy: 15.2 ± 0.0 -> 100.0 ± 0.0Helped
replace Perceiver IO with ReTreever using the same token budgetGP Regression · GP Regression RBFlog-likelihood: 1.06 ± 0.05 -> 1.25 ± 0.02Helped
replace Perceiver IO with ReTreever using the same token budgetReTreever · CelebAlog-likelihood: 3.20 ± 0.01 -> 3.52 ± 0.01Helped
replace Perceiver IO with ReTreever using the same token budgetReTreever · EMNISTlog-likelihood: 1.25 ± 0.01 -> 1.30 ± 0.01Helped
replace Perceiver IO with ReTreever using the same token budgetReTreever · Human Activityaccuracy: 87.6 ± 0.3 -> 88.9 ± 0.4Helped
use accuracy rather than negative cross entropy as the RL reward (ablation)TCA · Copy Task N=1024accuracy: 80.3 ± 14.8 -> 99.6 ± 0.6Helped
organize the tree by image structure rather than randomly (ablation)ReTreever · CelebAlog-likelihood: 3.12 ± 0.02 -> 3.52 ± 0.01Helped
retrieve all tree leaves instead of a policy-selected subset (ablation)ReTreever · CelebAlog-likelihood: 3.52 ± 0.01 -> 3.77 ± 0.01Helped
retrieve all tree leaves instead of a policy-selected subset (ablation)ReTreever · GP Regression RBFlog-likelihood: 1.25 ± 0.02 -> 1.33 ± 0.02Helped
set the RL loss weight to 0.0 or 0.1 rather than 1.0 (ablation)ReTreever · Copy TaskaccuracyHurt
set the RL loss weight to 10.0 rather than 1.0 (ablation)ReTreever · Copy TaskaccuracyHurt
set the cross-attention loss weight to 0.0 or 0.1 rather than 1.0 (ablation)ReTreever · Copy Tasktraining stabilityHurt

Surprising findings

Limitations

Experimental setup

Datasets: Copy Task (synthetic palindromes) GP regression (synthetic RBF/Matern GP functions) CelebA EMNIST Human Activity

Benchmarks: Copy Task GP Regression (RBF, Matern 5/2) CelebA image completion EMNIST image completion Human Activity

Metrics: accuracy log-likelihood percent tokens used CPU/GPU runtime memory usage

Baselines: Perceiver IO Transformer + Cross Attention TNP-D LBANP CMANP mTAND-Enc

Builds on: Perceiver IO REINFORCE k-d tree

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy