liveBook · Manning

Global optimum

A global optimum is a feasible point or solution whose objective value is at least as favorable as that of every other point or solution in the domain.

How 6 Manning books explain it

Grokking AI Algorithms, Second Edition

A global minimum is the lowest value of an objective function over its entire domain.

How it is used
Frames optimization as searching for the best solution across a search space rather than settling for a local best.
How deep it goes
Defines global and local bests and illustrates a minimum on a curve, without a formal proof.
Examples
Uses a restaurant analogy, a pepper-spiciness curve, the Booth function, and a drone-material ratio.
What you can do after
Evaluate whether a particle swarm reaches a known global minimum using the Booth function.

Read how Grokking AI Algorithms, Second Edition explains global optimum →

Data Without Labels

A global minimum is a point whose objective value is no greater than that of every point in the domain.

How it is used
Frames optimization as minimizing error or loss while maximizing predictive accuracy.
How deep it goes
Explains global and local minima through iterative gradient descent, random initialization, and convergence behavior.
Examples
Uses a mountain descent analogy, gradient-descent loss minimization, and repeated k-means runs as concrete illustrations.
What you can do after
Diagnose/debug with it by recognizing when optimization may have stopped at a local rather than global minimum.

Read how Data Without Labels explains global optimum →

Natural Language Processing in Action, Second Edition

A global minimum is a parameter setting with the lowest objective value over the entire domain under consideration.

How it is used
Explains what neural-network optimization seeks when adjusting weights to reduce training error.
How deep it goes
Defines the optimum through error surfaces, then distinguishes it from local minima and discusses stochastic search strategies.
Examples
Uses skiing, convex bowls, mean squared error, training batches, and neural-network initialization to illustrate optimization paths.
What you can do after
Apply stochastic gradient descent by reshuffling examples and tuning the learning rate while recognizing local-minimum limitations.

Read how Natural Language Processing in Action, Second Edition explains global optimum →

Optimization Algorithms: AI techniques for design, planning, and control problems

A feasible point whose objective-function value is at least as high as that of every candidate in the domain.

How it is used
Frames optimization as the search for the best feasible objective value across a candidate space.
How deep it goes
Defines global and local minima mathematically, then stops short of prescribing a guaranteed solving algorithm.
Examples
Uses a feasible landscape containing global, strong local, and weak local minima, alongside local and random search behavior.
What you can do after
Evaluate/understand whether a candidate is globally best, locally best, merely feasible, or near-optimal.

Read how Optimization Algorithms: AI techniques for design, planning, and control problems explains global optimum →

Advanced Algorithms and Data Structures

A minimum is a point or value at which a function is no greater than the function values in the relevant neighborhood or domain.

How it is used
Tunes the number of Bloom filter hash functions to reduce the false-positive ratio.
How deep it goes
Derives an exact stationary-point formula using logarithms and derivatives, but skips the detailed second-derivative verification.
Examples
Uses the formula k = ln(2)·m/n and discusses rounding k to an integer.
What you can do after
Evaluate the optimal Bloom filter hash-function count from fixed element and storage capacities.

Read how Advanced Algorithms and Data Structures explains global optimum →

Build AI Drug Discovery Pipelines

A global minimum is a point at which a function attains its lowest value over its entire domain.

How it is used
Uses global optimization to explain why gradient descent can train logistic regression for cytochrome P450 inhibition.
How deep it goes
Explains convexity, learning-rate stability, update count, and the absence of a closed-form solution.
Examples
Compares binary cross-entropy losses for predicted probabilities 0.3 and 0.8 when the true class is 1.
What you can do after
Apply gradient descent to minimize a convex binary cross-entropy cost under suitable learning-rate and update conditions.

Read how Build AI Drug Discovery Pipelines explains global optimum →

Also covered in

What to know first

Related concepts

Questions about global optimum

What is global optimum?

A global optimum is a feasible point or solution whose objective value is at least as favorable as that of every other point or solution in the domain.

Which Manning books explain global optimum?

Grokking AI Algorithms, Second Edition, Data Without Labels, Natural Language Processing in Action, Second Edition, Optimization Algorithms: AI techniques for design, planning, and control problems, Advanced Algorithms and Data Structures and Build AI Drug Discovery Pipelines.

What should I know before learning global optimum?

Manning books that teach global optimum usually introduce language model, optimization, objective function and linear regression first.

What is the difference between global optimum and local optimum?

A global optimum is a feasible point or solution whose objective value is at least as favorable as that of every other point or solution in the domain. A local optimum is a feasible point whose objective value is no worse than that of sufficiently nearby feasible points, though a better point may exist elsewhere.

What is global optimum a kind of?

Global optimum is a kind of optimal solution. An optimal solution is a feasible solution that achieves the best objective value among the alternatives considered.

What is global optimum part of?

Global optimum is part of search space. A search space is the set of possible states, choices, configurations, or candidate solutions that may be considered when exploring or solving a problem.

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.