Inferensys

Glossary

Recycling

An iterative refinement mechanism in AlphaFold2 where the model's initial predicted structure is fed back as input for multiple passes, progressively improving the accuracy of the final 3D coordinates.
ML engineer running AI model benchmarks, performance charts on multiple screens, late night home office setup.
ITERATIVE REFINEMENT

What is Recycling?

Recycling is a core iterative mechanism in AlphaFold2 where the model's initial predicted structure is fed back as input for multiple passes, progressively improving the accuracy of the final 3D coordinates.

Recycling is an iterative refinement mechanism in AlphaFold2 where the model's initial predicted 3D structure is fed back as input for multiple passes through the neural network. This process progressively improves the accuracy of the final atomic coordinates by allowing the model to refine its predictions based on its own previous outputs, effectively bootstrapping structural accuracy without requiring additional evolutionary information.

During each recycling iteration, the predicted pairwise distances and orientations from the previous pass are combined with the original multiple sequence alignment (MSA) and template features. This enables the Invariant Point Attention (IPA) module to resolve structural inconsistencies and improve the pLDDT confidence scores, typically converging within three to four cycles to produce a highly accurate protein structure.

Iterative Refinement

Key Characteristics of Recycling

Recycling in AlphaFold2 is a core architectural mechanism where the model's initial predicted structure is iteratively fed back as input, enabling progressive refinement of 3D coordinates over multiple passes.

01

Iterative Feedback Loop

Recycling transforms AlphaFold2 from a single-pass predictor into a recurrent architecture. The output pair representation and single representation from one iteration become the input for the next, allowing the model to refine its own predictions without external intervention. This loop is unrolled for a fixed number of iterations (typically 3-4) during both training and inference.

3-4
Typical Recycling Iterations
02

Gradient Flow Through Time

During training, gradients flow through all recycling iterations, effectively creating a deep computational pathway that learns to correct systematic errors. Key aspects:

  • The model learns to identify and fix stereochemical violations
  • Early iterations focus on global topology, later iterations on local geometry
  • Truncated backpropagation is used to manage memory constraints
03

Pair Representation Update

The pair representation—an N×N matrix encoding relationships between all residue pairs—is the primary carrier of information across recycling iterations. It is updated by:

  • Adding the output pair representation to the input via a residual connection
  • No learned gating or weighting is applied; the addition is direct
  • This allows the model to accumulate pairwise distance and orientation constraints incrementally
04

Single Representation Refinement

The single representation (MSA row-wise embeddings) is also recycled, but with a learned gating mechanism. The model computes a gated sum of the previous and current single representations, allowing it to selectively retain or overwrite per-residue information. This prevents the accumulation of noise while preserving useful structural signals.

05

Recycling Without MSA Enrichment

In AlphaFold-Multimer and newer variants, recycling operates without re-querying the MSA. The initial MSA embedding is computed once, and subsequent iterations refine the structure purely from the pair and single representations. This decoupling:

  • Reduces computational cost significantly
  • Demonstrates that recycling learns a structure-conditioned refinement independent of evolutionary signal
  • Enables faster inference for large complexes
06

Impact on Prediction Accuracy

Ablation studies show that removing recycling causes a significant drop in TM-score, particularly for:

  • Hard targets with few homologous sequences
  • Multi-domain proteins requiring correct inter-domain packing
  • Side-chain accuracy and rotamer recovery Recycling provides the largest accuracy gain after the Evoformer itself, making it indispensable for atomic-accuracy predictions.
~0.1-0.2
TM-score Improvement from Recycling
RECYCLING IN ALPHAFOLD2

Frequently Asked Questions

The recycling mechanism is a critical innovation in AlphaFold2 that enables iterative refinement of predicted protein structures. By feeding the model's output back as input for multiple passes, the architecture progressively resolves structural details that would be inaccessible in a single forward pass.

Recycling is an iterative refinement mechanism in AlphaFold2 where the model's predicted 3D protein structure is fed back as input for multiple successive passes through the neural network. During each recycling iteration, the pair representation—which encodes inter-residue relationships—and the initial single representation are updated with information from the previous cycle's output. The model uses the predicted backbone coordinates and pairwise distance distributions from the prior iteration to refine its internal representations. This process is repeated for a fixed number of cycles (typically 3-4), with each iteration progressively improving the accuracy of the final 3D coordinates. The key insight is that early iterations establish a coarse topological scaffold, while later iterations resolve fine-grained structural details like side-chain orientations and hydrogen bonding networks. The recycling mechanism is not a post-prediction refinement step but is integrated directly into the Evoformer architecture, allowing gradients to flow through all recycling iterations during training.

STRUCTURE PREDICTION REFINEMENT

Recycling vs. Other Refinement Strategies

Comparison of iterative recycling in AlphaFold2 against alternative protein structure refinement methodologies.

FeatureRecyclingEnergy MinimizationDiffusion Denoising

Core Mechanism

Iterative re-feeding of output as input

Gradient descent on physics-based force field

Iterative denoising of random coordinates

Input Requirement

Pair representation and initial backbone

Predicted or experimental structure

Random noise or template coordinates

Gradient Propagation

Learned Priors

Stereochemical Correction

Conformational Diversity

Single refined state

Single local minimum

Diverse ensemble generation

Typical Iterations

3-4 cycles

Thousands of steps

50-200 timesteps

Computational Cost per Step

Moderate

Low

High

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.