liveBook · Manning

Agent

As explained in Evolutionary Deep Learning: Genetic algorithms and neural networks

An agent is a persistent candidate solution represented by a vector whose components are modified during differential evolution.

An agent is a persistent candidate solution encoded as a fixed-size vector. Differential evolution modifies its components rather than creating offspring, allowing each candidate to survive across generations. section 4.5.1

During differential evolution, three randomly selected agents produce a trial agent for a target. Each changed component uses a scaled difference: y[i] = a[i] + F × (b[i] − c[i]). The trial replaces the target when its fitness is better. section 4.5.1 section 5.6.1

A DE agent typically participates in this workflow:

  • Represent parameters or a candidate solution as a vector with a fixed dimensionality. section 4.5.1
  • Sample three population members, clone the target, and choose at least one component for modification. section 4.5.1 section 5.6.1
  • Use the crossover rate to modify additional components, evaluate the trial, and retain the fitter candidate. section 4.5.1 section 5.6.1

DEAP representation

A DEAP implementation represents an agent as an array of floating-point values with an attached minimization fitness. The toolbox initializes vector components, builds populations, and randomly selects three agents. Typical parameters include dimensionality, crossover rate, scaling factor, population size, and generation count. section 4.5.1 section 5.6.1

Figure 4.11 The DE workflow for producing new agents

Use the workflow diagram to trace how three sampled agents produce a trial vector and how fitness determines replacement. section 4.5.1

Agents can approximate polynomial, absolute, and step functions, and can encode hyperparameters for optimization. In reinforcement learning, related agents can represent evolving networks, although sparse rewards may fail on complex environments such as lunar lander. section 4.5.1 section 11.4

How Evolutionary Deep Learning: Genetic algorithms and neural networks covers it

How deep it goes
Explains vector representation, three-agent mutation, crossover, fitness replacement, and practical limitations without deriving convergence theory.
Examples
Uses function approximation, DEAP vectors, hyperparameter searches, Gym environments, and a customized lunar-lander NEAT solver.
What it assumes
Assumes vector-based fitness optimization and introduces the agent as a persistent alternative to offspring-producing evolutionary candidates.
What you can do after
Apply it via DEAP to construct, mutate, evaluate, and replace candidate vectors in differential-evolution experiments.
How it connects
Connects agents with differential evolution, particle swarm optimization, genetic algorithms, fitness, crossover, reinforcement learning, and hyperparameter optimization.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Evolutionary Deep Learning: Genetic algorithms and neural networks. The section links point to the parts of the book it draws on.