liveBook · Manning

Mean error

As explained in Geometry for Programmers

Mean error is the average magnitude or signed difference between modeled values and reference values over an evaluation set.

Mean error summarizes how far modeled values typically fall from reference values across an evaluation set. For a polynomial sine approximation, the mean error exceeds 0.003, even though interpolation points have zero error. section 7.1.2

The average alone does not show where errors occur: they are unevenly distributed, and missed derivative behavior can make a circle generated from the model visibly imperfect. section 7.1.2

Comparing sine approximations

Polynomial interpolation produces mean error above 0.003, whereas a Maclaurin-series model reaches relative error as low as 0.000018 and produces a much smoother circle. section 7.1.2

How Geometry for Programmers covers it

How deep it goes
Compares measured approximation errors and their visual consequences, but does not develop a formal error-analysis framework.
Examples
Uses interpolated and Maclaurin sine models, generated circles, interpolation points, and close-up visual comparisons.
What it assumes
Assumes familiarity with modeled functions, interpolation points, polynomial approximations, and basic derivatives.
What you can do after
Evaluate approximation precision and recognize when an average error hides uneven or visually important defects.
How it connects
Connects mean error with polynomial interpolation, Maclaurin series, derivatives, tangent lines, and relative error.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Geometry for Programmers. The section links point to the parts of the book it draws on.