hinge

std.loss.hinge · Level L0

Hinge loss for labels ±1 and real-valued scores.

(1/n)·Σᵢ max(0, 1 − yᵢ·sᵢ)

Signature

hinge(s: f64[n], y: f64[n]) → 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.

sf64[n]yf64[n]1.0MultiplyysSubtractmarginRelurMeanllf64[]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Equal to the reference np.mean(np.maximum(0, 1 - y * s)) in exact rational arithmetic, on all 40 test cases.
  • All 40 float64 results inside the running error bound; the closest uses 45% 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 35% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
88%
largest error, in units in the last place
1.35

Identity

Calls
—
Called by
—
sha256:530faf33747c57aee5507435132f8f4d2c9b8a69eb021f8503a85daf0650e0ee

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

Control handle

Symbol
Ω:std.loss.hinge · Ω:hinge
Pins
sha256:b18d534f0439128c57198a54ee5a2da42f3f232a7b739b36a2c9c4a37583a351this graph alone
Evidence
sha256:85e6de1c0e5986112a7b7977a71f15594bf25c601bc76288c1ee5071eee4d3d0the 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.