Clicked Gallery

What is Sequential Attention?

Highlighted from a real engineering doc. Explained by Clicked.

Used in a sentence

Engineering Notes · AI Systems

With Sequential Attention the team trained on 50 of the 784 columns and the model's accuracy barely moved.

The reader highlighted one word in the docs. Clicked explained the technical term β€œSequential Attention” in simple terms:

Explained in three depths

Same facts, different vibe β€” Slang mode 😎

The Clicked way

●○○

Overview

Sequential Attention is a method from Google Research for deciding which columns of a dataset a model should be trained on. A dataset is a table: each row is one example, and each column is one thing recorded about it. In one of Google's tests the rows were images of handwritten digits and the columns were the 784 pixels, each holding how bright that pixel was. Training on all 784 works, but many pixels say the same thing, and a model trained on fewer columns is smaller and faster. Sequential Attention finds the useful ones with a trial training run. The model learns a score for each of the 784 columns, the top-scoring column is kept, training continues, the scores shift, and the next column is kept. After 50 picks the trial model is thrown away and a clean model is trained on those 50 columns only. It still got the digit right 95.6% of the time.
●○○

Overview

Sequential Attention is Google's way of working out which columns of a dataset are worth training a model on, before you train the one that counts. A dataset is a table, rows are examples, columns are the things recorded about each one. Google's digit test: 784 columns, one per pixel, and most of them are telling the model what the pixel next door already said. Rank all 784 once and keep the top 50 and you get a list of twins. So Sequential Attention runs a practice training first. The model learns a score per column, the top column is kept, training rolls on, the scores shift, the next column is kept. Fifty picks, then the practice model goes in the bin along with 734 columns (784 minus 50), and a fresh model is trained on the 50 that stayed. 😎

A quick take β€” often all you need.

●●○

Detail

Sequential Attention is a method from Google Research for deciding which columns of a dataset a model should be trained on. A dataset is a table. Each row is one example, each column is one thing recorded about it, and in this field a column is called a feature. Choosing which columns to train on is feature selection, and it matters because a model trained on fewer columns is smaller, faster, needs less data collected, and shows which columns it relies on. In one of Google's tests the rows were images of handwritten digits and the columns were the 784 pixels, each holding a brightness, with the aim of keeping 50. The difficulty is that a column's worth depends on which others are in. Two pixels that always brighten together are each useful alone and worthless together. Scoring each column once and keeping the top 50 ignores that and keeps pairs. Trying every column with a fresh training run catches it but costs 784 runs for the first pick, 783 for the second, down to 735 for the fiftieth, 37,975 in all. Sequential Attention does it in one trial run. The model is trained with one extra score per column, learned along with everything else and squashed so the 784 scores add up to 1. The column with the top score is kept. Training continues with that pick fixed, and the scores settle again, lower for any column that now only repeats a kept one. After 50 picks the trial model is discarded, and a clean model with no scoring part is trained on the 50 columns alone. That model still got the digit right 95.6% of the time, matching or beating the other selection methods tested. The scores are a kind of attention, the same idea as the attention in a transformer, which weighs words against each other, borrowed here to weigh columns. Nothing in the method is about pixels: any table of columns can be trimmed this way. No method can promise the best 50 in general, and this one is only proven to behave well for the simplest kind of model. It is not distillation or quantization, which shrink a model after training. This decides what the model is trained on in the first place.
●●○

Detail

Sequential Attention is Google's method for settling which columns of a dataset the real model gets trained on, by running a practice training first. A dataset is a table: rows are examples, columns are what's recorded about each, and a column is a feature in the trade. Picking the columns is feature selection, and it's worth doing because a model raised on fewer columns is smaller, quicker, cheaper to feed, and you can see what it actually leans on. Google's digit test had 784 columns, one per pixel, and the job was to keep 50. You can't spot the useful 50 by eye, because what a column is worth changes with the company it keeps. Two pixels that light up in step are each handy on their own and pointless as a pair, so one ranking of all 784 with the top 50 kept lands you a list of twins. Giving each column its own training run would sort the twins out, at tens of thousands of runs. Sequential Attention does it with one practice run. The model trains with a dial per column, 784 dials squeezed to total 1, and the top dial's column is kept. Training carries on with that pick locked, the dials move, the twins' dials drop, and the next column is kept. Fifty picks, practice model binned, and a fresh model without dials is trained on the 50. That model named the right digit 95.6% of the time, level with or ahead of the alternatives. The dials are attention in the transformer sense, where words size each other up, pointed at columns instead. And the pixels are beside the point: Google also ran it on a click-prediction table with 39 columns and over 3 billion rows. No guarantee it finds the perfect 50, mind, and the maths that backs it up only covers the plainest models. It isn't distillation or quantization either, which slim a model down after training. This decides the model's diet before training starts. 😎

Want more? One click digs deeper.

●●●

Analogy

Sequential Attention is a method for deciding which columns of a dataset a model should be trained on, found by a trial run that keeps the most useful column, re-scores the rest, and keeps the next. Packing a suitcase under an airline weight limit works the same way. The careful packer puts in the single most useful item, then asks what adds the most given what is already in. After one warm jacket goes in, a second jacket adds almost nothing, so it stays on the bed. The lazy packer ranks each item by usefulness once and takes the top 20, and three jackets make the cut, because each one scored high on its own. The items are the columns, the question of what adds most given what is packed is the re-scoring after each pick, and the three jackets are the duplicate columns a one-time ranking keeps. The match ends here: a packer judges by eye, while Sequential Attention trains a model to judge, and once a column is in it stays in.
●●●

Analogy

Sequential Attention is Google's way of choosing the columns a model gets trained on, by trying them in a practice run, keeping the most useful, re-scoring the rest, and keeping the next. Picking a pub trivia team of 4 is the same idea. The smart way: take your sharpest mate first, then ask who covers what she doesn't, so the next pick is the one who knows sport, then music, then flags. The lazy way: rank everyone by how clever they are and take the top 4, and you turn up with four people who all know history and nobody who knows the 1998 World Cup. Your friends are the columns, who adds most given who's already in is the re-scoring, and the four historians are the duplicates a one-time ranking leaves you with. Where it breaks: you can argue your mate onto the team, while the model re-scores on its own and never swaps anyone out once they're in. 😎

Unfamiliar concept? A real-world example makes it click β€” fresh analogies on tap.

AI explanations may contain errors · Not professional advice

Formal definition β€” The same term, explained the usual way

Sequential Attention is a greedy feature-selection algorithm for neural networks (Yasuda et al., ICLR 2023) that selects a subset of input features within a single training run. It attaches a trainable attention weight to each candidate feature, applies a softmax over the unselected features, and at each step permanently selects the feature with the largest weight before continuing to train with the selected set fixed, so that subsequent weights reflect marginal gain conditional on prior selections; a model is then trained on the selected subset. The authors show it is equivalent to Orthogonal Matching Pursuit (OMP) for linear regression, which carries provable guarantees. On MNIST with k = 50 of 784 features it reports 0.956 accuracy against 0.937 for Group LASSO and 0.912 for OMP, and it scales to the Criteo click-prediction dataset of 39 features and over three billion examples. A February 2026 Google Research post extends the mechanism (SequentialAttention++) to block sparsification and embedding-dimension tuning, without published figures.

Want Clicked to explain terms like “Sequential Attention” directly in your browser β€” including on PDFs?

Add to Chrome β€” Free

50 free Explanations · No credit card required