liveBook · Manning

Scaling loop

As explained in Sutskever's List

A scaling loop is a feedback pattern in which architectural improvements make larger computations more productive and larger computations increase the payoff of the architecture.

A scaling loop forms when an architecture turns larger computations into richer learned representations—and those larger computations, in turn, increase the architecture’s value. In deep networks, residual connections help stabilize signal flow, allowing architectural improvements to support larger models and larger models to make those improvements more rewarding. section 3.8

This feedback pattern is not simply “more compute wins.” A support vector machine can use more compute to solve its optimization more precisely, but it has no depth to increase and no equivalent scaling loop. The broader lesson is to invest in methods that reliably improve as compute grows, rather than assuming compute alone drives progress. section 3.8

How Sutskever's List covers it

How deep it goes
Explains how residual connections stabilize signal flow and contrasts deep-network scaling with SVM optimization.
Examples
Uses residual connections, support vector machines, and AlexNet’s contrast with handcrafted SIFT features.
What you can do after
Evaluate whether an architecture can reliably convert additional compute into richer learned representations.
How it connects
Connects residual connections and gradient-based deep learning with the Bitter Lesson and support vector machines.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.