liveBook · Manning

Pareto frontier

Also called Pareto front

A Pareto frontier is the set of feasible solutions that are not dominated by any other solution across multiple objectives.

How 5 Manning books explain it

Bayesian Optimization in Action

A Pareto frontier is the boundary formed by solutions that are not dominated by any other feasible solution across all objectives.

How it is used
Measures progress in multiobjective Bayesian optimization by turning competing objective trade-offs into a frontier and dominated hypervolume.
How deep it goes
Defines dominance, visualizes the objective-space boundary, and connects it to hypervolume, while deferring hyperrectangle-based EHVI mathematics.
Examples
Uses two conflicting one-dimensional objective functions, dense-grid and random samples, objective-space plots, and EHVI comparisons.
What you can do after
Evaluate/understand multiobjective search results through nondominated trade-offs and hypervolume, and apply EHVI to seek frontier-extending queries.

Read how Bayesian Optimization in Action explains Pareto frontier →

Self-Improving Agents

A Pareto front is the set of non-dominated candidates in a multi-objective search, where improving one objective requires worsening another.

How it is used
Selects diverse prompt candidates when evaluation has multiple objectives rather than reducing every trade-off to one winner.
How deep it goes
Defines domination, works through five candidates, and implements a pairwise test; notes that a single-score front collapses to ranking.
Examples
Tests five quality–cost candidates in Python, then asks for a challenger that dominates a survivor and a candidate that joins the front.
What you can do after
Build it from scratch: compare scored candidates, discard dominated ones, and retain the remaining trade-offs for selection.

Read how Self-Improving Agents explains Pareto frontier →

LLM Evaluation and Alignment, The Foundational Ideas

The set of solutions for which no objective can improve without worsening at least one conflicting objective.

How it is used
Guides evaluation of open-ended AI tasks when automated, human, model-based, and production signals conflict.
How deep it goes
Defines optimal trade-offs and situates them among evaluation methods without developing a formal optimization procedure.
Examples
Uses BLEU-optimized chatbots and ROUGE-optimized summarizers to expose metric–user preference conflicts.
What you can do after
Evaluate systems across competing quality signals and interpret metric results against user preferences and production performance.

Read how LLM Evaluation and Alignment, The Foundational Ideas explains Pareto frontier →

Delivering Machine Learning Projects: From design to deployment

A Pareto front is the boundary formed by nondominated outcomes that represent the best available tradeoffs among multiple criteria.

How it is used
Supports model selection when multiple independent tests must be combined.
How deep it goes
Defines Pareto-efficient sets, demonstrates dominance with two tests, and extends the method to many tests before final judgment.
Examples
Uses imaginary models evaluated on hbi and rotm, including F's inclusion and G's exclusion from the Pareto set.
What you can do after
Evaluate/understand model candidates, narrow the selection pool, and document the judgment among remaining tradeoffs.

Read how Delivering Machine Learning Projects: From design to deployment explains Pareto frontier →

Building LLM Applications with DSPy

A Pareto front is a set of candidate solutions that are not uniformly outperformed across the objectives being evaluated.

How it is used
Guides candidate-prompt selection during GEPA optimization by retaining solutions that lead on at least one validation example.
How deep it goes
Defines prompt dominance and traces how candidate prompts enter or leave the front during optimization.
Examples
Compares two prompts over five validation examples, where one improves four scores but regresses on the fifth.
What you can do after
Evaluate prompt candidates per validation example and retain those that lead on at least one example.

Read how Building LLM Applications with DSPy explains Pareto frontier →

Also covered in

What to know first

Related concepts

Questions about Pareto frontier

What is Pareto frontier?

A Pareto frontier is the set of feasible solutions that are not dominated by any other solution across multiple objectives.

Which Manning books explain Pareto frontier?

Bayesian Optimization in Action, Self-Improving Agents, LLM Evaluation and Alignment, The Foundational Ideas, Delivering Machine Learning Projects: From design to deployment and Building LLM Applications with DSPy.

What should I know before learning Pareto frontier?

Manning books that teach Pareto frontier usually introduce hill climbing first.

What is the difference between Pareto frontier and hill climbing?

A Pareto frontier is the set of feasible solutions that are not dominated by any other solution across multiple objectives. Hill climbing is an iterative local-search optimization method that repeatedly moves from a candidate solution to a better neighboring solution.

What are the parts of Pareto frontier?

Pareto frontier includes nondominated solution.

What is Pareto frontier also called?

Pareto frontier is also called Pareto front.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.