knn_regress

std.geometry.knn_regress · Level L3

k-nearest-neighbour regression: the mean value of the k points closest to q (ties by index). The ranks of the distances become a mask, so k can be an input.

(1/k)·Σ{ valuesᵢ : rank(‖Pᵢ − q‖²) < k }

Signature

knn_regress(q: f64[d], points: f64[m, d], values: f64[m], k: f64[]) → f64[]

Structure

The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.

qf64[d]pointsf64[m, d]valuesf64[m]kf64[]SubtractdiffMultiplysqReduceSumdistrankrLessnearMultiplypickedReduceSumtotalDivideyyf64[]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Equal to the reference mean of values at np.argsort(dist2)[:k] in exact rational arithmetic, on all 40 test cases.
  • All 40 float64 results inside the running error bound; the closest uses 50% of it.
  • Interpreter and NumPy backend return bit-identical results.
  • At float32 too: the 40 test cases rounded to float32, and 40 of them inside the running error bound at u = 2⁻²⁴; the closest uses 50% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
90%
largest error, in units in the last place
1.50

Identity

Calls
Called by
—
sha256:b252de30d878326b0632f690a58001683f69e499e91d128031b86d1167f585fa

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol
Ω:std.geometry.knn_regress · Ω:knn_regress
Pins
sha256:0a9530654b3cc670c7f8a4615e68b36f899867b9434f27039688f4f61938e3c7this graph and the 1 it reaches through calls
Evidence
sha256:9fd8d9f7fae1a3e458b3c82924fd86f1741873465c92eb26a0d71f7214c4ba05the hash of its verification record
Needs
no capability: a pure function

Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.

ΣEML 2026

Efficient New Language — a high-density semantic overlay for humans and AI agents.

This site’s demos run on the real EML toolchain, in your browser.

© 2026 EveMissLab (一言諾科技有限公司) / Neo.K. All rights reserved.