{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_voxels","feature":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","contains":"claim voxels + source edges","slug":"nogo-n01","urls":{"read":"https://miscsubjects.com/api/articles/nogo-n01/voxels","write":"https://miscsubjects.com/api/protocol/claim"},"how_to_use":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","write":"https://miscsubjects.com/api/protocol/claim","imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/nogo-n01/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"constitution","name":"Article constitution","what":"Binding rules: required article slots, claim/source rules, ontology anti-sprawl.","urls":{"read":"https://miscsubjects.com/api/articles/constitution","read_md":"https://miscsubjects.com/api/articles/constitution?format=markdown"}},{"id":"sources_ledger","name":"Source ledger","what":"Hash-chained cited sources; verify integrity at GET .../sources.","urls":{"read":"https://miscsubjects.com/api/articles/nogo-n01/sources","write":"https://miscsubjects.com/api/protocol/sources"}},{"id":"claim_post","name":"Claim post protocol","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by.","urls":{"read":"https://miscsubjects.com/api/articles/nogo-n01/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","why":"Every feature is auditable collective intelligence","how":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/nogo-n01/voxels","write":"https://miscsubjects.com/api/protocol/claim"},"imessage":null,"router":null,"related":[{"id":"constitution","what":"Binding rules: required article slots, claim/source rules, ontology anti-sprawl."},{"id":"sources_ledger","what":"Hash-chained cited sources; verify integrity at GET .../sources."},{"id":"claim_post","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by."}],"not_medical_advice":true},"slug":"nogo-n01","voxels":[{"id":"c1","text":"No optimization algorithm dominates every problem. Averaged across all possible worlds, every optimizer performs equally.","tier":"system","section":"The Claim","status":"active","source_ids":["s1"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"}],"why_material":"This is the core No-Free-Lunch theorem statement, proved mathematically by Wolpert and Macready."},{"id":"c2","text":"Averaged across every possible cost function, every algorithm scores the same. A neural network has the same average performance as random search.","tier":"system","section":"The Logic","status":"active","source_ids":["s1"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"}],"why_material":"Direct consequence of the NFL theorem proof."},{"id":"c3","text":"Performance is conserved like energy and momentum. The advantage on one problem hides a debt on problems never tested.","tier":"system","section":"The Logic","status":"active","source_ids":[],"source_status":"derived","posted_by":null,"who_claims":null,"edges":[],"why_material":"Conceptual corollary of the NFL theorem — performance conservation across problem landscapes."},{"id":"c4","text":"Stochastic gradient descent excels on smooth loss surfaces but drowns in rugged terrain.","tier":"system","section":"The Logic","status":"active","source_ids":[],"source_status":"derived","posted_by":null,"who_claims":null,"edges":[],"why_material":"Domain-specificity example: SGD is a specialist, not a universal optimizer."},{"id":"c5","text":"Evolutionary algorithms thrive on discontinuity but crawl on smooth gradients.","tier":"system","section":"The Logic","status":"active","source_ids":[],"source_status":"derived","posted_by":null,"who_claims":null,"edges":[],"why_material":"Domain-specificity example: evolutionary algorithms are specialists for discontinuous landscapes."},{"id":"c6","text":"The No-Free-Lunch theorem was proved by David Wolpert and William Macready in 1997 and published in IEEE Transactions on Evolutionary Computation.","tier":"system","section":"The Evidence","status":"active","source_ids":["s1"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"}],"why_material":"Historical fact establishing provenance of the theorem."},{"id":"c7","text":"Machine learning inductive bias is domain-specific: a transformer masters language but fails at protein folding.","tier":"system","section":"The Evidence","status":"active","source_ids":[],"source_status":"derived","posted_by":null,"who_claims":null,"edges":[],"why_material":"Empirical illustration of NFL in modern ML — success is local to the training distribution."},{"id":"c8","text":"Natural selection optimized humans for savannas, not universally. Put humans underwater and they die.","tier":"system","section":"The Evidence","status":"active","source_ids":[],"source_status":"derived","posted_by":null,"who_claims":null,"edges":[],"why_material":"Biological illustration: evolution itself is a local optimizer, not a universal one."},{"id":"c9","text":"Renaissance Technologies' Medallion fund prints money in specific market regimes because its edge is specialization, not universalism.","tier":"system","section":"The Evidence","status":"active","source_ids":[],"source_status":"derived","posted_by":null,"who_claims":null,"edges":[],"why_material":"Finance illustration: the most successful quantitative fund is a domain specialist."},{"id":"c10","text":"The theorem assumes uniform averaging over all possible problems. Real problems cluster and share structure, which is the escape hatch for practical success.","tier":"system","section":"The Uncertainty","status":"active","source_ids":["s1"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"}],"why_material":"Critical caveat: NFL applies to the uniform average, not the structured subset of problems we encounter in practice."},{"id":"c11","text":"A single algorithm dominating every possible cost function uniformly would falsify the No-Free-Lunch theorem.","tier":"system","section":"The Falsifier","status":"active","source_ids":["s1"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"}],"why_material":"The falsification condition is explicit in the theorem: uniform dominance is mathematically forbidden."}],"sources":[{"id":"s1","type":"review","url":"https://ieeexplore.ieee.org/document/585893","title":"No Free Lunch Theorems for Optimization","quote":"No Free Lunch Theorems for Optimization","summary":"Wolpert and Macready (1997) proved mathematically that averaged over all possible cost functions, every optimization algorithm performs equally.","claim_ids":["c1","c2","c6"],"hash":"0a607ab4032ed2e04da7e83df282865eb40fd7139e580a9a4839abbe943738e3","prev":"genesis"}],"edges":[{"from":"c1","type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"},{"from":"c2","type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"},{"from":"c6","type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"},{"from":"c10","type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"},{"from":"c11","type":"supported_by","target":"s1","source_type":"review","hash":"0a607ab4032ed2e0"}],"counts":{"voxels":11,"sources":1,"edges":5},"constitution_url":"/api/articles/constitution","ontology_url":"/api/articles/ontology","system_map_url":"/api/articles/system-map","claim_post":"POST /api/protocol/claim"}