liveBook · Manning

Smoothness

Smoothness is the property of changing gradually, so nearby inputs produce similar outputs without discontinuities or abrupt changes.

How 2 Manning books explain it

Geometry for Programmers

Smoothness is the degree to which a mathematical function or geometric object lacks discontinuities, sharp joins, or abrupt changes in direction.

How it is used
Guides the design and evaluation of continuous, smooth, and curvy piecewise or parametric curves.
How deep it goes
Explains continuity orders, derivative matching, curvature, cubic construction, and tangent normalization, stopping short of formal proofs.
Examples
Uses piecewise parabolas, joined line-like pieces, cubic contour segments, and normalized or exaggerated tangent vectors.
What you can do after
Build smooth piecewise curves by matching endpoint values and derivatives, then control tangent magnitudes to avoid contour artifacts.

Read how Geometry for Programmers explains smoothness →

Bayesian Optimization in Action

Smoothness is the property that nearby or similar inputs produce correlated and therefore similar function values.

How it is used
Models correlated objective values in Gaussian processes and guides covariance-function choices for optimization.
How deep it goes
Explains nearby-point correlation, posterior behavior, covariance control, length scales, ARD, and Matérn smoothness without deriving kernels.
Examples
Uses observations at 3 with nearby points 2.9 and 3.1, plus conditioned GP prediction plots and a Forrester-function dataset.
What you can do after
Apply covariance functions and length-scale choices to control GP smoothness and interpret local uncertainty.

Read how Bayesian Optimization in Action explains smoothness →

Related concepts

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.