Iterative Learning Control (ILC) is a control technique that refines the input signal for a repetitive process by utilizing the tracking error from the preceding trial. Unlike feedback controllers that react to real-time disturbances, ILC is a feedforward strategy that anticipates and pre-compensates for deterministic, repeating errors, achieving perfect tracking over successive iterations.
Glossary
Iterative Learning Control (ILC)

What is Iterative Learning Control (ILC)?
A feedforward control methodology that improves the tracking performance of systems executing repetitive tasks by learning from the error history of previous iterations.
The algorithm updates the control input using a learning function, typically a P-type (proportional to error) or D-type (proportional to error derivative) law, applied to the stored error trajectory. A Q-filter is often incorporated to ensure robust convergence by suppressing learning at high frequencies where model uncertainty could cause transient growth, making it ideal for precision manufacturing and robotics.
Key Features of Iterative Learning Control
Iterative Learning Control (ILC) exploits the repetition inherent in batch processes to achieve perfect tracking. By learning from the error history of previous trials, it constructs a feedforward signal that pre-compensates for predictable disturbances.
The Repetition Assumption
ILC fundamentally requires a finite-duration, repetitive task. The system must reset to identical initial conditions before each trial. This is distinct from adaptive control, which handles continuously varying references. In DPD, this maps perfectly to the transmission of standardized communication frames where the preamble and pilot sequences are known and repeatable.
Feedforward Error Compensation
Unlike feedback controllers that react to current errors, ILC computes a feedforward signal for the next iteration. The learning law updates the input trajectory based on the error trajectory from the previous run:
- P-type ILC: Updates proportional to the previous error.
- D-type ILC: Updates proportional to the error derivative.
- Q-filter: A low-pass filter applied to the error to ensure monotonic convergence and reject high-frequency noise that could destabilize the learning process.
Monotonic Convergence vs. Asymptotic Stability
A critical distinction in ILC design. Asymptotic stability guarantees the error goes to zero as iterations approach infinity, but the error may grow catastrophically large in early iterations. Monotonic convergence ensures the error norm strictly decreases at every iteration. This is enforced by designing the learning gain such that the induced operator norm is less than one, a condition often analyzed in the frequency domain.
Arimoto-Type ILC
The foundational D-type learning law proposed by Suguru Arimoto in 1984. The update law is:
u_{k+1}(t) = u_k(t) + Γ * d/dt[e_k(t)]
where Γ is the learning gain matrix. This formulation proved that a robot manipulator could achieve perfect tracking without an accurate dynamic model, relying solely on the derivative of the tracking error from the previous trial.
Norm-Optimal ILC (NOILC)
A model-based optimization framework that computes the input update by minimizing a quadratic cost function:
J = ||e_{k+1}||^2_Q + ||u_{k+1} - u_k||^2_R
The R matrix penalizes aggressive input changes, while Q penalizes tracking error. This framework naturally handles non-minimum phase systems and allows explicit tuning of the robustness-to-convergence-speed tradeoff, making it suitable for precision DPD coefficient refinement.
ILC in Digital Predistortion
In DPD systems, ILC refines the predistorter coefficients across repeated transmission frames. The process:
- Trial k: Transmit a frame, capture the PA output, compute the error between desired linear output and actual output.
- Update: Adjust DPD coefficients using the error trajectory.
- Trial k+1: Transmit with updated predistorter. This bypasses the model extraction step entirely, directly tuning the predistorter to minimize the observed nonlinear distortion without requiring an explicit PA behavioral model.
Frequently Asked Questions
Explore the core mechanisms, convergence properties, and practical implementation trade-offs of Iterative Learning Control for repetitive systems.
Iterative Learning Control (ILC) is a feedforward control methodology that improves the transient response of a system executing a repetitive task by updating the control input signal based on the error trajectory recorded from previous iterations. Unlike feedback controllers that react to errors in real-time, ILC exploits the repetition to anticipate and preemptively cancel repeating disturbances. The algorithm stores the error signal e_k(t) = y_d(t) - y_k(t) over the entire finite trial duration, then processes it through a learning function L and a robustness filter Q to generate an updated input for the next trial: u_{k+1}(t) = Q[u_k(t) + L[e_k(t)]]. This process converges to the inverse dynamics of the system, effectively inverting the plant model without requiring an explicit parametric model, making it highly effective for nonlinear systems like power amplifiers where exact physical models are difficult to derive.
ILC vs. Real-Time Adaptive Control
Distinguishing the operational domains, feedback mechanisms, and convergence properties of Iterative Learning Control versus real-time adaptive algorithms like RLS and LMS.
| Feature | Iterative Learning Control (ILC) | Recursive Least Squares (RLS) | Least Mean Squares (LMS) |
|---|---|---|---|
Operational Domain | Repetitive, finite-duration tasks | Continuous, time-varying streams | Continuous, time-varying streams |
Update Mechanism | Trial-to-trial (batch iteration) | Sample-by-sample (recursive) | Sample-by-sample (stochastic) |
Primary Objective | Perfect transient tracking | Minimize steady-state MSE | Minimize steady-state MSE |
Convergence Speed | Exponential in iteration domain | Fast (O(N^2) complexity) | Slow (O(N) complexity) |
Memory Requirement | Stores full error trajectory | Stores correlation matrix | Minimal state storage |
Handles Non-Repeatable Disturbances | |||
Typical Misadjustment | Approaches zero with iterations | 2-5% | 5-15% |
Numerical Complexity per Sample | Offline batch processing | High (matrix inversion) | Low (scalar update) |
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Iterative Learning Control relies on a synergy of estimation theory, adaptive filtering, and system identification. The following concepts form the mathematical backbone for implementing ILC in digital predistortion systems.
System Identification
The field of building mathematical models of dynamic systems from measured input-output data. In the context of ILC, accurate system identification is critical for establishing the nominal plant model used to design the learning filter and ensure monotonic convergence of the error trajectory. Without a reliable model, the learning update can amplify non-repetitive disturbances.
Convergence Rate
A measure of how quickly the tracking error approaches zero over successive iterations. The convergence rate in ILC is governed by the learning gain matrix and the condition number of the plant model. A high convergence rate reduces the number of iterations needed to meet spectral mask requirements, but aggressive gains can lead to transient growth and instability in the presence of model uncertainty.
Forgetting Factor
A scalar parameter that exponentially weights recent error information more heavily than past iterations. In robust ILC designs, a forgetting factor prevents the unbounded accumulation of non-repetitive noise in the learned control signal. This is essential for DPD applications where thermal memory effects and environmental drift cause the power amplifier characteristics to shift slowly over time.
Mean Squared Error (MSE)
The expected value of the squared difference between the desired linear output and the actual power amplifier output. ILC algorithms typically minimize the iteration-domain MSE by updating the predistorter input based on the error trajectory from the previous cycle. The steady-state MSE floor is limited by stochastic disturbances and quantization noise in the feedback path.
Regularization Parameter
A scalar added to the diagonal of the learning matrix to improve numerical stability when the plant model is ill-conditioned. In ILC, regularization prevents aggressive control updates that would amplify high-frequency noise. This is particularly important for wideband DPD systems where the power amplifier exhibits deep gain compression at band edges, leading to near-singular Jacobian matrices.
Kalman Filter
An optimal recursive state estimator that can be interpreted as a norm-optimal ILC framework when extended to the iteration domain. Kalman-based ILC formulations provide a principled way to balance learning from past errors against sensitivity to measurement noise. The framework naturally incorporates time-varying system dynamics, making it suitable for tracking thermal drift in GaN power amplifiers.

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.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us