Text Classification
syfox
decision-engine
decision-making
decision-model
structured-prediction
system-one
si-substrate
intent-classification
routing
abstention
uncertainty-quantification
selective-prediction
hebbian
energy-based-model
associative-memory
no-transformer
no-neural-network
no-pattern-matching
moderation
spam-detection
multilingual
File size: 32,512 Bytes
d61eb28 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 | // ============================================================================
// SyFox — distvec.hpp (v3.7.0, Move 1 of the AI-agent limit analysis)
// ---------------------------------------------------------------------------
// THE REPRESENTATION ESCAPE. The readout-side analysis of the fabric was
// precise: the bag-of-words lane fabric is hand-written by the tokenizer,
// and every node inherits that one choice — maximally sparse, and an unseen
// word is a dark node. The 1990s answer (Levy & Goldberg 2014; Deerwester
// et al. 1990 LSA), and it is NOT neural: PPMI + truncated SVD over the
// co-occurrence structure.
//
// What this file does, end to end, deterministic, zero dependencies:
// 1. PPMI TRANSFORM — the symmetric Hebbian lane fabric IS the
// co-occurrence observation w(a,b) (lane weight = accumulated binding
// mass between the two concepts). Pointwise mutual information
// pmi = log( P(a,b) / P(a)P(b) ), clipped at 0 (PPMI), drops hub
// pollution the raw counts carry: "the" co-occurs with everything,
// and PPMI makes it pay through the marginal.
// 2. TRUNCATED SVD — subspace (block power) iteration on the symmetric
// PPMI matrix W: X <- orth(W X), fixed iteration count, deterministic
// hash initialization, modified Gram-Schmidt re-orthonormalization.
// Rayleigh quotients give the eigenvalues (W symmetric => its
// eigendecomposition IS its SVD); node vectors = U * Sigma^beta
// (beta = 0.5, the Levy&Goldberg context-distributional scaling).
// Every content node gets a dense k-dim vector — "emollient" lands
// near "soothing" because they share contexts, with nobody labeling
// either. This is a different OBJECT than the untyped multiset the
// multiset-invariance theorem quantifies over — the scope escape.
// 3. RESONANCE EDGES — the semantic-resonance edges are re-selected from
// the dense space (cos >= theta, top-k). The SETTLE physics is
// untouched: edges are the same mechanism v3.2 shipped (sources leak
// sem_coupling of retained energy along resonance edges, energy
// conserved); only the EDGE SET is chosen by a representation that
// actually generalizes. Small fabrics get the exact O(n^2) scan;
// large fabrics get deterministic 2-hop lane candidates (pairs with
// no lane-co-occurrence path have PPMI cosine ~0 by construction —
// the standard inverted-index argument for embedding top-k).
//
// Scope: representation + fabric construction, NOT dynamics. decay 0.82 /
// diffusion 0.45 / dual-channel readout / Hebbian learning are untouched.
// Persistence: a magic-guarded 'DSTV' tail in substrate.bin (vectors only;
// the edges ride the existing SEM4 tail). Fabrics without the tail are
// bit-identical to v3.6 — the replay contract.
//
// Determinism contract: fixed iteration count (no convergence tolerance —
// the approximation is the contract), hash-based initialization, MGS in
// fixed column order, ties broken by (score desc, id asc). Same fabric,
// same binary -> same vectors bit for bit.
// ============================================================================
#pragma once
#include "si_substrate.hpp"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <string>
#include <utility>
#include <vector>
#if defined(_OPENMP)
#include <omp.h>
#endif
namespace si {
namespace dist {
struct DistConfig {
int dims = 300; // k: target embedding dimensionality
int iterations = 5; // subspace iterations (fixed, deterministic)
float beta = 0.5f; // vector = U * Sigma^beta
bool drop_first = true; // drop the Perron axis (see svd_embeddings)
// v3.7.1 SCALING FIX: the exact neighbour scan is O(n^2 * k) — measured
// on this tree it IS the superlinear curve (76 s @ 5,595 nodes, 156 s @
// 7,985, ~O(n^1.9); extrapolation: ~15 h at 94,773). The cap drops from
// 8000 to 2000 (exact cost there: 4M pairs x k, about a second); larger
// fabrics use the deterministic 2-hop lane closure, whose semantics are
// already documented above this size ("pairs with no lane path have PPMI
// cosine ~0 by construction"). Disclosed behaviour change for fabrics in
// (2000, 8000] nodes: they move from the exact path to the 2-hop path.
std::size_t exact_scan_max = 2000; // n below this: exact top-k neighbour scan
std::size_t cand_top_t = 32; // large fabrics: top-T lanes expand 2-hop candidates
float edge_theta = 0.50f; // min cosine for a resonance edge (= sem_theta)
int edge_k = 6; // resonance edges per node (= sem_neighbors)
};
// ----------------------------------------------------------------------------
// PPMI CSR over the lane fabric. Rows = nodes; entries = PPMI(a,b) > 0.
// Built from for_each_lane (public surface): each directed lane visited once,
// both directions exist (bind() is symmetric), so row sums are the marginals.
// ----------------------------------------------------------------------------
struct Ppmi {
std::vector<std::size_t> off; // n+1
std::vector<NodeId> dst;
std::vector<float> val;
std::vector<float> row_sum; // marginal of each node
double total = 0.0;
};
inline Ppmi build_ppmi(const Substrate& s) {
const std::size_t n = s.node_count();
Ppmi p;
p.off.assign(n + 1, 0);
p.row_sum.assign(n, 0.0f);
// pass 1: marginals (directed lanes; each undirected pair counted twice
// overall, which cancels in the PMI ratio exactly as in Levy&Goldberg)
s.for_each_lane([&](NodeId a, NodeId, float w) {
p.row_sum[a] += w;
p.total += static_cast<double>(w);
});
// pass 2: count surviving entries per source row, then fill. Entries of a
// row stay in for_each_lane visit order (ascending insertion order of the
// per-source lane vector) — deterministic.
std::vector<std::size_t> count(n, 0);
s.for_each_lane([&](NodeId a, NodeId b, float w) {
if (a == b || w <= 0.0f || p.row_sum[a] <= 0.0f || p.row_sum[b] <= 0.0f) return;
const double pmi =
std::log((static_cast<double>(w) * p.total)
/ (static_cast<double>(p.row_sum[a]) * static_cast<double>(p.row_sum[b])));
if (pmi > 0.0) ++count[a];
});
for (std::size_t i = 0; i < n; ++i) p.off[i + 1] = p.off[i] + count[i];
p.dst.resize(p.off[n]);
p.val.resize(p.off[n]);
std::vector<std::size_t> cur(p.off.begin(), p.off.end() - 1);
s.for_each_lane([&](NodeId a, NodeId b, float w) {
if (a == b || w <= 0.0f || p.row_sum[a] <= 0.0f || p.row_sum[b] <= 0.0f) return;
const double pmi =
std::log((static_cast<double>(w) * p.total)
/ (static_cast<double>(p.row_sum[a]) * static_cast<double>(p.row_sum[b])));
if (pmi <= 0.0) return;
const std::size_t kk = cur[a]++;
p.dst[kk] = b;
p.val[kk] = static_cast<float>(pmi);
});
return p;
}
// ----------------------------------------------------------------------------
// Orthonormalization, in-place, COLUMNS d = 0..k-1 of a COLUMN-MAJOR k*n
// working matrix (row d = basis vector d, contiguous over the n nodes).
//
// v3.7.1 SCALING FIX. The v3.7.0 version worked on an n*k ROW-MAJOR matrix:
// every dot/axpy walked memory with stride k, and each (column, previous)
// pair launched TWO OpenMP parallel regions — at k=375 that is ~840k regions
// per call across 6 calls, with worst-case cache behaviour. The blocked
// "twice is enough" Gram-Schmidt here (BCGS2; the stability standard for
// block orthogonalization) makes every inner loop a contiguous pass and
// needs O(k/BLOCK) regions per call:
// per block of BLOCK columns:
// 1. cross-project the block against ALL finished columns (two passes —
// the second is the reorthogonalization that restores MGS-grade
// orthogonality; classical "twice is enough" rule),
// 2. MGS-orthonormalize WITHIN the block (serial: BLOCK^2/2 pairs x n
// contiguous dots — small),
// 3. cross-project again, within-block MGS again (pass 2),
// 4. normalize; a column that still collapses gets the SAME deterministic
// canonical-basis rank repair as v3.7.0 (serial, rare).
// Columns are processed in ascending block order (fixed); all reductions are
// plain per-entry loops over contiguous memory under schedule(static) —
// fixed summation order, deterministic.
// ----------------------------------------------------------------------------
inline void mgs_orthonormalize_cm(std::vector<float>& X, std::size_t n, std::size_t k);
// serial within-block MGS used by the blocked driver below: orthonormalizes
// columns [d0, d1) of the cm matrix against each other (normalizing as it
// goes). Returns the set of column indices that collapsed (rank repair).
inline void mgs_block_serial(std::vector<float>& X, std::size_t n,
std::size_t d0, std::size_t d1,
std::vector<std::size_t>& collapsed) {
collapsed.clear();
for (std::size_t d = d0; d < d1; ++d) {
float* col_d = &X[d * n];
for (std::size_t pr = d0; pr < d; ++pr) {
const float* col_p = &X[pr * n];
float dot = 0.0f;
for (std::size_t i = 0; i < n; ++i) dot += col_p[i] * col_d[i];
for (std::size_t i = 0; i < n; ++i) col_d[i] -= dot * col_p[i];
}
float n2 = 0.0f;
for (std::size_t i = 0; i < n; ++i) n2 += col_d[i] * col_d[i];
if (n2 <= 1e-12f) { collapsed.push_back(d); continue; }
const float inv = 1.0f / std::sqrt(n2);
for (std::size_t i = 0; i < n; ++i) col_d[i] *= inv;
}
}
inline void mgs_orthonormalize_cm(std::vector<float>& X, std::size_t n, std::size_t k) {
const std::size_t BLOCK = 32;
for (std::size_t b0 = 0; b0 < k; b0 += BLOCK) {
const std::size_t b1 = std::min(k, b0 + BLOCK);
// two (cross-project -> within-block MGS) passes: BCGS2
for (int pass = 0; pass < 2; ++pass) {
// cross-projection against finished columns [0, b0): for each
// finished row pr and block row d, dot = <pr, d>; then
// col_d -= dot * col_pr. Both stages are contiguous per-entry
// loops; ONE parallel region per stage over (pr, d) / d.
if (b0 > 0) {
std::vector<float> G(b0 * (b1 - b0), 0.0f);
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t aa = 0; aa < static_cast<std::ptrdiff_t>(b0); ++aa) {
const float* col_a = &X[static_cast<std::size_t>(aa) * n];
for (std::size_t d = b0; d < b1; ++d) {
const float* col_d = &X[d * n];
float dot = 0.0f;
for (std::size_t i = 0; i < n; ++i) dot += col_a[i] * col_d[i];
G[static_cast<std::size_t>(aa) * (b1 - b0) + (d - b0)] = dot;
}
}
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t dd = 0; dd < static_cast<std::ptrdiff_t>(b1 - b0); ++dd) {
const std::size_t d = b0 + static_cast<std::size_t>(dd);
float* col_d = &X[d * n];
for (std::size_t aa = 0; aa < b0; ++aa) {
const float g = G[aa * (b1 - b0) + static_cast<std::size_t>(dd)];
if (g == 0.0f) continue;
const float* col_a = &X[aa * n];
for (std::size_t i = 0; i < n; ++i) col_d[i] -= g * col_a[i];
}
}
}
std::vector<std::size_t> collapsed;
mgs_block_serial(X, n, b0, b1, collapsed);
// RANK REPAIR (measured necessity, unchanged from v3.7.0): the
// ±1 hash basis can be singular for small n — a collapsed column
// stays zero forever (W·0 = 0) and the subspace silently loses
// rank. Replace it deterministically: the first canonical basis
// vector whose residual against ALL finished columns is
// well-conditioned. (Serial: repair is rare and small.)
for (const std::size_t d : collapsed) {
float* col_d = &X[d * n];
for (std::size_t r = 0; r < n; ++r) {
for (std::size_t i = 0; i < n; ++i)
col_d[i] = (i == r) ? 1.0f : 0.0f;
for (std::size_t pr = 0; pr < d; ++pr) {
const float* col_p = &X[pr * n];
float dot = 0.0f;
for (std::size_t i = 0; i < n; ++i) dot += col_p[i] * col_d[i];
for (std::size_t i = 0; i < n; ++i) col_d[i] -= dot * col_p[i];
}
float n2r = 0.0f;
for (std::size_t i = 0; i < n; ++i) n2r += col_d[i] * col_d[i];
if (n2r > 1e-6f) {
const float inv = 1.0f / std::sqrt(n2r);
for (std::size_t i = 0; i < n; ++i) col_d[i] *= inv;
break;
}
}
}
}
}
}
// ----------------------------------------------------------------------------
// Jacobi eigenvalue decomposition of a small symmetric k x k matrix
// (row-major, destroyed on exit). Deterministic: cyclic sweep order p<q,
// convergence when the off-diagonal norm drops below 1e-12 (or 60 sweeps).
// Returns eigenvalues (unsorted) and the eigenvector matrix as COLUMNS.
// ----------------------------------------------------------------------------
inline void jacobi_eigen(std::vector<float>& A, std::size_t k,
std::vector<float>& evals, std::vector<float>& evecs) {
evecs.assign(k * k, 0.0f);
for (std::size_t i = 0; i < k; ++i) evecs[i * k + i] = 1.0f;
for (int sweep = 0; sweep < 60; ++sweep) {
double off = 0.0;
for (std::size_t p = 0; p < k; ++p)
for (std::size_t q = p + 1; q < k; ++q)
off += static_cast<double>(A[p * k + q]) * static_cast<double>(A[p * k + q]);
if (off < 1e-20) break;
for (std::size_t p = 0; p < k; ++p) {
for (std::size_t q = p + 1; q < k; ++q) {
const float apq = A[p * k + q];
if (std::fabs(apq) < 1e-12f) continue;
const double app = A[p * k + p], aqq = A[q * k + q];
const double theta = (aqq - app) / (2.0 * static_cast<double>(apq));
const double t = (theta >= 0.0 ? 1.0 : -1.0)
/ (std::fabs(theta) + std::sqrt(theta * theta + 1.0));
const double c = 1.0 / std::sqrt(t * t + 1.0);
const double s = t * c;
for (std::size_t i = 0; i < k; ++i) { // two-sided rotation
const float aip = A[i * k + p], aiq = A[i * k + q];
A[i * k + p] = static_cast<float>(c * aip - s * aiq);
A[i * k + q] = static_cast<float>(s * aip + c * aiq);
}
for (std::size_t j = 0; j < k; ++j) {
const float apj = A[p * k + j], aqj = A[q * k + j];
A[p * k + j] = static_cast<float>(c * apj - s * aqj);
A[q * k + j] = static_cast<float>(s * apj + c * aqj);
}
for (std::size_t i = 0; i < k; ++i) { // eigenvector update
const float vip = evecs[i * k + p], viq = evecs[i * k + q];
evecs[i * k + p] = static_cast<float>(c * vip - s * viq);
evecs[i * k + q] = static_cast<float>(s * vip + c * viq);
}
}
}
}
evals.resize(k);
for (std::size_t d = 0; d < k; ++d) evals[d] = A[d * k + d];
}
// ----------------------------------------------------------------------------
// Subspace iteration: the PSD truncation of the symmetric PPMI matrix.
// X <- orth(W X), `iterations` times, from a deterministic ±1 hash basis,
// iterated in a slightly OVERSAMPLED subspace (k + pad — standard randomized-
// SVD practice) so degenerate ±|lambda| pairs cannot crowd a wanted direction
// out of the basis (measured: the 2x2 block [[0,a],[a,0]] has eigvals +a and
// -a of equal magnitude; without padding the iteration can return only the
// -a direction and an anti-aligned embedding pair results).
//
// RAYLEIGH-RITZ: after the walk, the k x k projection R = X^T W X is
// eigendecomposed with CYCLIC JACOBI and X is rotated by the Ritz vectors.
// Plain subspace iteration never separates a degenerate +a/-a pair (their
// |lambda| gap is zero) — the SPACE converges but individual columns keep
// mixing the pair, which zeroes their Rayleigh quotients (measured). The
// Ritz rotation resolves the space into true eigenvectors exactly.
//
// SELECTION is PSD: Ritz values rank ALGEBRAIC descending, only theta > 0
// directions are kept, scaled by theta^beta. Negative directions of a PPMI
// matrix encode mutual-avoidance (anti-correlation) — a different relation
// than the resonance the edge set needs. For a SYMMETRIC matrix the
// eigendecomposition IS the SVD; positive columns of U are exactly the
// singular vectors of the PSD part.
//
// drop_first: the largest-theta axis of a nonnegative matrix is the Perron
// vector — strictly positive, proportional to each word's total PPMI mass,
// i.e. a FREQUENCY axis (how much a word occurs, not what it means). It
// dominates every cosine at low k and collapses block structure onto the
// all-positive direction. LSA practice drops it; the engine already encodes
// the frequency axis separately (omega_semantic / semantic_freq).
//
// Vectors come back row-major (n*k_out) with k_out = min(cfg.dims, n);
// eigvals[d] publishes the theta behind each output column (0 for the
// zeroed Perron slot and any unfilled slot — the effective rank, honestly).
// ----------------------------------------------------------------------------
inline void svd_embeddings(const Substrate& s, const Ppmi& p, const DistConfig& cfg,
std::vector<float>& vecs, std::vector<float>& eigvals) {
const std::size_t n = s.node_count();
const std::size_t k_out = std::min<std::size_t>(static_cast<std::size_t>(std::max(1, cfg.dims)), n);
vecs.assign(n * k_out, 0.0f);
eigvals.assign(k_out, 0.0f);
if (n == 0 || p.val.empty()) return;
// working subspace width. Small fabrics (n <= 512) get the FULL space:
// the Rayleigh-Ritz projection is then an EXACT eigendecomposition and
// the iteration count is irrelevant — this is what keeps thin-spectrum
// fabrics (few positive directions) from losing dims to under-convergence.
// Large fabrics iterate the oversampled subspace k_out + pad; only the
// top positive directions are selected anyway, and those converge fast.
const std::size_t pad = std::max<std::size_t>(4, k_out / 4);
const std::size_t k = (n <= 512) ? n : std::min(n, k_out + pad);
// deterministic ±1 initialization, orthonormalized. The raw FNV bit is
// NOT enough: high bits of the plain FNV-1a chain correlate for short
// ASCII inputs (measured: every init column collapsed onto one pattern
// and MGS zeroed the subspace), so the hash runs through the splitmix64
// finalizer first — a fixed, dependency-free bit mixer.
//
// v3.7.1 SCALING: the per-node FNV string hash is computed ONCE (n hashes
// instead of n*k string walks — at 94k nodes x 375 dims that was ~500M
// char operations), and each column seeds from mix(base_hash, d) through
// the same finalizer. The resulting ±1 pattern differs from v3.7.0's
// per-(node,dim) string seed (disclosed: tests pin determinism and
// roundtrip, never absolute vector values). Working basis X is now
// COLUMN-MAJOR k*n (row d contiguous over nodes) so every kernel below
// is a contiguous pass.
std::vector<float> X(k * n, 0.0f);
{
std::vector<std::uint64_t> base(n);
for (std::size_t i = 0; i < n; ++i) {
std::uint64_t h = 1469598103934665603ull;
for (unsigned char c : s.concept_of(static_cast<NodeId>(i))) {
h ^= c; h *= 1099511628211ull;
}
base[i] = h;
}
for (std::size_t d = 0; d < k; ++d) {
float* col = &X[d * n];
for (std::size_t i = 0; i < n; ++i) {
std::uint64_t h = base[i]
^ (0x9E3779B97F4A7C15ull * static_cast<std::uint64_t>(d + 1));
h ^= h >> 33; h *= 0xff51afd7ed558ccdull;
h ^= h >> 33; h *= 0xc4ceb9fe1a85ec53ull;
h ^= h >> 33;
col[i] = ((h >> 56) & 1u) ? 1.0f : -1.0f;
}
}
}
mgs_orthonormalize_cm(X, n, k);
// fixed-iteration subspace walk with TWO buffers (no aliasing):
// Y = W X (read basis, write scratch), then X = orth(Y).
// v3.7.1: column d of Y gathers X's row d through the CSR targets —
// k sequential contiguous passes over the CSR arrays (O(E*k) total,
// same FLOPs, no strided scatter).
std::vector<float> Y(k * n, 0.0f);
for (int it = 0; it < cfg.iterations; ++it) {
std::fill(Y.begin(), Y.end(), 0.0f);
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t dd = 0; dd < static_cast<std::ptrdiff_t>(k); ++dd) {
const std::size_t d = static_cast<std::size_t>(dd);
const float* xd = &X[d * n];
float* yd = &Y[d * n];
for (std::size_t i = 0; i < n; ++i) {
const std::size_t b = p.off[i], e = p.off[i + 1];
if (b == e) continue;
float acc = 0.0f;
for (std::size_t t = b; t < e; ++t) acc += p.val[t] * xd[p.dst[t]];
yd[i] = acc;
}
}
X.swap(Y);
mgs_orthonormalize_cm(X, n, k);
}
// RAYLEIGH-RITZ: R = X^T W X (k x k symmetric), Jacobi-eigendecomposed,
// and the basis rotated by the Ritz vectors. This is what separates the
// degenerate pairs the plain walk cannot.
std::vector<float> ritz_vals, ritz_vecs;
{
std::vector<float> Z(k * n, 0.0f);
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t dd = 0; dd < static_cast<std::ptrdiff_t>(k); ++dd) {
const std::size_t d = static_cast<std::size_t>(dd);
const float* xd = &X[d * n];
float* zd = &Z[d * n];
for (std::size_t i = 0; i < n; ++i) {
const std::size_t b = p.off[i], e = p.off[i + 1];
if (b == e) continue;
float acc = 0.0f;
for (std::size_t t = b; t < e; ++t) acc += p.val[t] * xd[p.dst[t]];
zd[i] = acc;
}
}
// v3.7.1: R's entries are contiguous cm dots; parallel over rows a,
// upper triangle only (symmetric by W) — same values, fixed order.
std::vector<float> R(k * k, 0.0f);
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t aa = 0; aa < static_cast<std::ptrdiff_t>(k); ++aa) {
const std::size_t a = static_cast<std::size_t>(aa);
const float* xa = &X[a * n];
for (std::size_t b2 = a; b2 < k; ++b2) {
const float* zb = &Z[b2 * n];
float ssum = 0.0f;
for (std::size_t i = 0; i < n; ++i) ssum += xa[i] * zb[i];
R[a * k + b2] = ssum;
R[b2 * k + a] = ssum;
}
}
jacobi_eigen(R, k, ritz_vals, ritz_vecs);
// rotate the basis: X <- X * S (n*k times k*k). v3.7.1: done through
// row-major temporaries so the GEMM inner loop is contiguous; the
// two transposes are O(n*k) gathers.
std::vector<float> Xrm(n * k, 0.0f), A(n * k, 0.0f);
for (std::size_t d = 0; d < k; ++d) {
const float* xd = &X[d * n];
for (std::size_t i = 0; i < n; ++i) Xrm[i * k + d] = xd[i];
}
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t ii = 0; ii < static_cast<std::ptrdiff_t>(n); ++ii) {
const std::size_t i = static_cast<std::size_t>(ii);
const float* xrow = &Xrm[i * k];
float* arow = &A[i * k];
for (std::size_t d = 0; d < k; ++d) {
float ssum = 0.0f;
for (std::size_t j = 0; j < k; ++j)
ssum += xrow[j] * ritz_vecs[j * k + d];
arow[d] = ssum;
}
}
for (std::size_t d = 0; d < k; ++d) {
float* xd = &X[d * n];
for (std::size_t i = 0; i < n; ++i) xd[i] = A[i * k + d];
}
}
// PSD selection: Ritz values ALGEBRAIC descending (positive directions
// first — negative directions of a PPMI matrix encode mutual avoidance,
// not resonance), keep theta > 0, skip the Perron/frequency axis, fill
// k_out output columns; unfilled slots stay zero (effective rank,
// published honestly through eigvals).
std::vector<std::size_t> order(k);
for (std::size_t d = 0; d < k; ++d) order[d] = d;
std::stable_sort(order.begin(), order.end(), [&](std::size_t a, std::size_t b) {
return ritz_vals[a] > ritz_vals[b];
});
std::size_t out_d = 0;
bool perron_skipped = false;
const bool drop_perron = cfg.drop_first;
for (std::size_t t = 0; t < k && out_d < k_out; ++t) {
const std::size_t src = order[t];
if (ritz_vals[src] <= 1e-8f) break; // PSD part exhausted
if (drop_perron && !perron_skipped) { perron_skipped = true; continue; }
const float scale = std::pow(ritz_vals[src], cfg.beta);
const float* xsrc = &X[src * n];
for (std::size_t i = 0; i < n; ++i) {
const bool iso_row = (p.off[i + 1] == p.off[i]);
vecs[i * k_out + out_d] =
iso_row ? 0.0f : xsrc[i] * scale;
}
eigvals[out_d] = ritz_vals[src];
++out_d;
}
// any unfilled slots stay zero: effective rank is visible in eigvals
}
// ----------------------------------------------------------------------------
// Resonance-edge selection in the dense space.
// small fabrics (n <= exact_scan_max): exact scan over all pairs;
// large fabrics: per node, expand the top-T lane neighbours' own top-T
// lanes as candidates (2-hop closure), dedupe, then cosine-filter.
// Returns the CSR (offs n+1, edges (target, cos)) in the SEM4-tail format.
// Per-row independent -> OMP over rows; ties break by (cos desc, id asc).
// ----------------------------------------------------------------------------
inline void build_edges(const Substrate& s, const std::vector<float>& vecs,
std::size_t k, const DistConfig& cfg,
std::vector<std::pair<NodeId, float>>& edges,
std::vector<std::size_t>& offs) {
const std::size_t n = s.node_count();
offs.assign(n + 1, 0);
edges.clear();
if (n == 0 || k == 0 || vecs.size() < n * k) return;
const std::size_t kmax = static_cast<std::size_t>(std::max(1, cfg.edge_k));
const float theta = cfg.edge_theta;
// v3.7.1: node norms computed ONCE (the exact scan previously recomputed
// each row's norm n times inside cos_at — n^3/2 redundant multiplies at
// the sizes where the scan runs).
std::vector<float> inv_norm(n, 0.0f);
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t ii = 0; ii < static_cast<std::ptrdiff_t>(n); ++ii) {
const std::size_t i = static_cast<std::size_t>(ii);
float na2 = 0.0f;
for (std::size_t d = 0; d < k; ++d) na2 += vecs[i * k + d] * vecs[i * k + d];
inv_norm[i] = (na2 > 1e-12f) ? (1.0f / std::sqrt(na2)) : 0.0f;
}
auto cos_at = [&](std::size_t i, std::size_t j) -> float {
const float ia = inv_norm[i], ib = inv_norm[j];
if (ia <= 0.0f || ib <= 0.0f) return 0.0f; // dark node: no resonance
const float* a = &vecs[i * k];
const float* b = &vecs[j * k];
float dot = 0.0f;
for (std::size_t d = 0; d < k; ++d) dot += a[d] * b[d];
return dot * ia * ib;
};
auto better = [](const std::pair<float, NodeId>& x, const std::pair<float, NodeId>& y) {
return x.first != y.first ? x.first > y.first : x.second < y.second;
};
// per-node candidate sets (exact scan or 2-hop closure)
std::vector<std::vector<std::pair<float, NodeId>>> per(n);
#if defined(_OPENMP)
#pragma omp parallel for schedule(static)
#endif
for (std::ptrdiff_t ii = 0; ii < static_cast<std::ptrdiff_t>(n); ++ii) {
const std::size_t i = static_cast<std::size_t>(ii);
if (inv_norm[i] <= 0.0f) continue; // dark node: no resonance
std::vector<std::pair<float, NodeId>> best;
auto push = [&](std::size_t j) {
if (j == i) return;
const float c = cos_at(i, j);
if (c < theta) return;
if (best.size() < kmax) {
best.emplace_back(c, static_cast<NodeId>(j));
std::sort(best.begin(), best.end(), better);
} else if (better({c, static_cast<NodeId>(j)}, best.back())) {
best.back() = {c, static_cast<NodeId>(j)};
std::sort(best.begin(), best.end(), better);
}
};
if (n <= cfg.exact_scan_max) {
for (std::size_t j = 0; j < n; ++j) push(j);
} else {
// deterministic 2-hop closure: own lanes (top-T by weight), then
// each neighbour's top-T lanes. Duplicates deduped via the
// `best` bound (a repeated candidate can only re-enter if it
// beats the tail, which keeps the result identical).
std::vector<std::pair<NodeId, float>> mine;
s.lanes_of(static_cast<NodeId>(i), mine);
std::sort(mine.begin(), mine.end(), [](const auto& x, const auto& y) {
return x.second != y.second ? x.second > y.second : x.first < y.first;
});
if (mine.size() > cfg.cand_top_t) mine.resize(cfg.cand_top_t);
std::vector<std::pair<NodeId, float>> second;
for (const auto& l1 : mine) {
push(static_cast<std::size_t>(l1.first));
std::vector<std::pair<NodeId, float>> nb;
s.lanes_of(l1.first, nb);
std::sort(nb.begin(), nb.end(), [](const auto& x, const auto& y) {
return x.second != y.second ? x.second > y.second : x.first < y.first;
});
if (nb.size() > cfg.cand_top_t) nb.resize(cfg.cand_top_t);
for (const auto& l2 : nb) second.push_back(l2);
}
for (const auto& l2 : second) push(static_cast<std::size_t>(l2.first));
}
per[i] = std::move(best);
}
std::size_t running = 0;
for (std::size_t i = 0; i < n; ++i) {
offs[i] = running;
running += per[i].size();
}
offs[n] = running;
edges.reserve(running);
for (std::size_t i = 0; i < n; ++i)
for (const auto& pr : per[i]) edges.emplace_back(pr.second, pr.first);
}
// ----------------------------------------------------------------------------
// One-call build: PPMI -> SVD -> edges, installed on the substrate.
// Vectors persist via the DSTV tail; edges replace the SEM4 resonance set.
// ----------------------------------------------------------------------------
inline void build_field(Substrate& s, const DistConfig& cfg) {
Ppmi p = build_ppmi(s);
std::vector<float> vecs, eigvals;
svd_embeddings(s, p, cfg, vecs, eigvals);
const std::size_t k = eigvals.size();
std::vector<std::pair<NodeId, float>> edges;
std::vector<std::size_t> offs;
build_edges(s, vecs, k, cfg, edges, offs);
s.set_distvecs(std::move(vecs), static_cast<int>(k));
s.set_semantic_edges(std::move(edges), std::move(offs));
}
} // namespace dist
} // namespace si
|