umap-gpu 0.2.10 → 0.2.11

package/README.md

@@ -1,3 +1,5 @@
+# ⚠️ NOT READY YET | WORK IN PROGRESS ⚠️
+
 # umap-gpu
 
 UMAP dimensionality reduction with WebGPU-accelerated SGD and HNSW approximate nearest neighbors.

package/dist/index.js

@@ -1,29 +1,29 @@
 var H = Object.defineProperty;
-var V = (e, t, r) => t in e ? H(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
-var G = (e, t, r) => V(e, typeof t != "symbol" ? t + "" : t, r);
+var V = (e, n, r) => n in e ? H(e, n, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[n] = r;
+var G = (e, n, r) => V(e, typeof n != "symbol" ? n + "" : n, r);
 import { loadHnswlib as C } from "hnswlib-wasm";
-async function Y(e, t, r = {}) {
-  const { M: s = 16, efConstruction: n = 200, efSearch: p = 50 } = r, f = await C(), d = e[0].length, c = e.length, a = new f.HierarchicalNSW("l2", d, "");
-  a.initIndex(c, s, n, 200), a.setEfSearch(Math.max(p, t)), a.addItems(e, !1);
+async function Y(e, n, r = {}) {
+  const { M: s = 16, efConstruction: t = 200, efSearch: p = 50 } = r, f = await C(), l = e[0].length, c = e.length, a = new f.HierarchicalNSW("l2", l, "");
+  a.initIndex(c, s, t, 200), a.setEfSearch(Math.max(p, n)), a.addItems(e, !1);
   const o = [], i = [];
   for (let h = 0; h < c; h++) {
-    const l = a.searchKnn(e[h], t + 1, void 0), u = l.neighbors.map((g, m) => ({ idx: g, dist: l.distances[m] })).filter(({ idx: g }) => g !== h).slice(0, t);
+    const d = a.searchKnn(e[h], n + 1, void 0), u = d.neighbors.map((g, m) => ({ idx: g, dist: d.distances[m] })).filter(({ idx: g }) => g !== h).slice(0, n);
     o.push(u.map(({ idx: g }) => g)), i.push(u.map(({ dist: g }) => g));
   }
   return { indices: o, distances: i };
 }
-async function Q(e, t, r = {}) {
-  const { M: s = 16, efConstruction: n = 200, efSearch: p = 50 } = r, f = await C(), d = e[0].length, c = e.length, a = new f.HierarchicalNSW("l2", d, "");
-  a.initIndex(c, s, n, 200), a.setEfSearch(Math.max(p, t)), a.addItems(e, !1);
+async function Q(e, n, r = {}) {
+  const { M: s = 16, efConstruction: t = 200, efSearch: p = 50 } = r, f = await C(), l = e[0].length, c = e.length, a = new f.HierarchicalNSW("l2", l, "");
+  a.initIndex(c, s, t, 200), a.setEfSearch(Math.max(p, n)), a.addItems(e, !1);
   const o = [], i = [];
-  for (let l = 0; l < c; l++) {
-    const u = a.searchKnn(e[l], t + 1, void 0), g = u.neighbors.map((m, w) => ({ idx: m, dist: u.distances[w] })).filter(({ idx: m }) => m !== l).slice(0, t);
+  for (let d = 0; d < c; d++) {
+    const u = a.searchKnn(e[d], n + 1, void 0), g = u.neighbors.map((m, w) => ({ idx: m, dist: u.distances[w] })).filter(({ idx: m }) => m !== d).slice(0, n);
     o.push(g.map(({ idx: m }) => m)), i.push(g.map(({ dist: m }) => m));
   }
   return { knn: { indices: o, distances: i }, index: {
-    searchKnn(l, u) {
+    searchKnn(d, u) {
       const g = [], m = [];
-      for (const w of l) {
+      for (const w of d) {
         const b = a.searchKnn(w, u, void 0), y = b.neighbors.map((v, x) => ({ idx: v, dist: b.distances[x] })).sort((v, x) => v.dist - x.dist).slice(0, u);
         g.push(y.map(({ idx: v }) => v)), m.push(y.map(({ dist: v }) => v));
       }
@@ -31,59 +31,59 @@ async function Q(e, t, r = {}) {
     }
   } };
 }
-function D(e, t, r, s = 1) {
-  const n = e.length, { sigmas: p, rhos: f } = L(t, r), d = [], c = [], a = [];
-  for (let i = 0; i < n; i++)
+function D(e, n, r, s = 1) {
+  const t = e.length, { sigmas: p, rhos: f } = L(n, r), l = [], c = [], a = [];
+  for (let i = 0; i < t; i++)
     for (let h = 0; h < e[i].length; h++) {
-      const l = t[i][h], u = l <= f[i] ? 1 : Math.exp(-((l - f[i]) / p[i]));
-      d.push(i), c.push(e[i][h]), a.push(u);
+      const d = n[i][h], u = d <= f[i] ? 1 : Math.exp(-((d - f[i]) / p[i]));
+      l.push(i), c.push(e[i][h]), a.push(u);
     }
-  return { ...X(d, c, a, n, s), nVertices: n };
+  return { ...X(l, c, a, t, s), nVertices: t };
 }
-function J(e, t, r) {
-  const s = e.length, { sigmas: n, rhos: p } = L(t, r), f = [], d = [], c = [];
+function J(e, n, r) {
+  const s = e.length, { sigmas: t, rhos: p } = L(n, r), f = [], l = [], c = [];
   for (let a = 0; a < s; a++)
     for (let o = 0; o < e[a].length; o++) {
-      const i = t[a][o], h = i <= p[a] ? 1 : Math.exp(-((i - p[a]) / n[a]));
-      f.push(a), d.push(e[a][o]), c.push(h);
+      const i = n[a][o], h = i <= p[a] ? 1 : Math.exp(-((i - p[a]) / t[a]));
+      f.push(a), l.push(e[a][o]), c.push(h);
     }
   return {
     rows: new Float32Array(f),
-    cols: new Float32Array(d),
+    cols: new Float32Array(l),
     vals: new Float32Array(c),
     nVertices: s
   };
 }
-function L(e, t) {
-  const s = e.length, n = new Float32Array(s), p = new Float32Array(s);
+function L(e, n) {
+  const s = e.length, t = new Float32Array(s), p = new Float32Array(s);
   for (let f = 0; f < s; f++) {
-    const d = e[f];
-    p[f] = d.find((h) => h > 0) ?? 0;
+    const l = e[f];
+    p[f] = l.find((h) => h > 0) ?? 0;
     let c = 0, a = 1 / 0, o = 1;
-    const i = Math.log2(t);
+    const i = Math.log2(n);
     for (let h = 0; h < 64; h++) {
-      let l = 0;
-      for (let u = 1; u < d.length; u++)
-        l += Math.exp(-Math.max(0, d[u] - p[f]) / o);
-      if (Math.abs(l - i) < 1e-5) break;
-      l > i ? (a = o, o = (c + a) / 2) : (c = o, o = a === 1 / 0 ? o * 2 : (c + a) / 2);
+      let d = 0;
+      for (let u = 0; u < l.length; u++)
+        d += Math.exp(-Math.max(0, l[u] - p[f]) / o);
+      if (Math.abs(d - i) < 1e-5) break;
+      d > i ? (a = o, o = (c + a) / 2) : (c = o, o = a === 1 / 0 ? o * 2 : (c + a) / 2);
     }
-    n[f] = o;
+    t[f] = o;
   }
-  return { sigmas: n, rhos: p };
+  return { sigmas: t, rhos: p };
 }
-function X(e, t, r, s, n) {
+function X(e, n, r, s, t) {
   const p = /* @__PURE__ */ new Map();
   for (let a = 0; a < e.length; a++)
-    p.set(e[a] * s + t[a], r[a]);
-  const f = [], d = [], c = [];
+    p.set(e[a] * s + n[a], r[a]);
+  const f = [], l = [], c = [];
   for (const [a, o] of p) {
-    const i = Math.floor(a / s), h = a % s, l = p.get(h * s + i) ?? 0, u = o + l - o * l, g = o * l;
-    f.push(i), d.push(h), c.push(n * u + (1 - n) * g);
+    const i = Math.floor(a / s), h = a % s, d = p.get(h * s + i) ?? 0, u = o + d - o * d, g = o * d;
+    f.push(i), l.push(h), c.push(t * u + (1 - t) * g);
   }
   return {
     rows: new Float32Array(f),
-    cols: new Float32Array(d),
+    cols: new Float32Array(l),
     vals: new Float32Array(c)
   };
 }
@@ -158,6 +158,7 @@ fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
     let diff = embedding[i * nc + d] - embedding[j * nc + d];
     let grad = clip(grad_coeff_attr * diff, -4.0, 4.0);
     embedding[i * nc + d] += params.alpha * grad;
+    embedding[j * nc + d] -= params.alpha * grad;
   }
 
   epoch_of_next_sample[edge_idx] += epochs_per_sample[edge_idx];
@@ -202,9 +203,9 @@ class W {
     G(this, "pipeline");
   }
   async init() {
-    const t = await navigator.gpu.requestAdapter();
-    if (!t) throw new Error("WebGPU not supported");
-    this.device = await t.requestDevice(), this.pipeline = this.device.createComputePipeline({
+    const n = await navigator.gpu.requestAdapter();
+    if (!n) throw new Error("WebGPU not supported");
+    this.device = await n.requestDevice(), this.pipeline = this.device.createComputePipeline({
       layout: "auto",
       compute: {
         module: this.device.createShaderModule({ code: Z }),
@@ -225,13 +226,13 @@ class W {
    * @param params      - UMAP curve parameters and repulsion settings
    * @returns Optimized embedding as Float32Array
    */
-  async optimize(t, r, s, n, p, f, d, c, a) {
+  async optimize(n, r, s, t, p, f, l, c, a) {
     const { device: o } = this, i = r.length, h = this.makeBuffer(
-      t,
+      n,
       GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC
-    ), l = this.makeBuffer(r, GPUBufferUsage.STORAGE), u = this.makeBuffer(s, GPUBufferUsage.STORAGE), g = this.makeBuffer(n, GPUBufferUsage.STORAGE), m = new Float32Array(i).fill(0), w = this.makeBuffer(m, GPUBufferUsage.STORAGE), b = new Float32Array(i);
+    ), d = this.makeBuffer(r, GPUBufferUsage.STORAGE), u = this.makeBuffer(s, GPUBufferUsage.STORAGE), g = this.makeBuffer(t, GPUBufferUsage.STORAGE), m = new Float32Array(i).fill(0), w = this.makeBuffer(m, GPUBufferUsage.STORAGE), b = new Float32Array(i);
     for (let _ = 0; _ < i; _++)
-      b[_] = n[_] / c.negativeSampleRate;
+      b[_] = t[_] / c.negativeSampleRate;
     const y = this.makeBuffer(b, GPUBufferUsage.STORAGE), v = new Uint32Array(i);
     for (let _ = 0; _ < i; _++)
       v[_] = Math.random() * 4294967295 | 0;
@@ -239,14 +240,14 @@ class W {
       size: 40,
       usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST
     });
-    for (let _ = 0; _ < d; _++) {
-      const F = 1 - _ / d, A = new ArrayBuffer(40), M = new Uint32Array(A), N = new Float32Array(A);
-      M[0] = i, M[1] = p, M[2] = f, M[3] = _, M[4] = d, N[5] = F, N[6] = c.a, N[7] = c.b, N[8] = c.gamma, M[9] = c.negativeSampleRate, o.queue.writeBuffer(B, 0, A);
+    for (let _ = 0; _ < l; _++) {
+      const F = 1 - _ / l, A = new ArrayBuffer(40), M = new Uint32Array(A), N = new Float32Array(A);
+      M[0] = i, M[1] = p, M[2] = f, M[3] = _, M[4] = l, N[5] = F, N[6] = c.a, N[7] = c.b, N[8] = c.gamma, M[9] = c.negativeSampleRate, o.queue.writeBuffer(B, 0, A);
       const S = o.createBindGroup({
         layout: this.pipeline.getBindGroupLayout(0),
         entries: [
           { binding: 0, resource: { buffer: g } },
-          { binding: 1, resource: { buffer: l } },
+          { binding: 1, resource: { buffer: d } },
           { binding: 2, resource: { buffer: u } },
           { binding: 3, resource: { buffer: h } },
           { binding: 4, resource: { buffer: w } },
@@ -255,47 +256,47 @@ class W {
           { binding: 7, resource: { buffer: x } }
         ]
       }), O = o.createCommandEncoder(), U = O.beginComputePass();
-      U.setPipeline(this.pipeline), U.setBindGroup(0, S), U.dispatchWorkgroups(Math.ceil(i / 256)), U.end(), o.queue.submit([O.finish()]), _ % 10 === 0 && (await o.queue.onSubmittedWorkDone(), a == null || a(_, d));
+      U.setPipeline(this.pipeline), U.setBindGroup(0, S), U.dispatchWorkgroups(Math.ceil(i / 256)), U.end(), o.queue.submit([O.finish()]), _ % 10 === 0 && (await o.queue.onSubmittedWorkDone(), a == null || a(_, l));
     }
     const E = o.createBuffer({
-      size: t.byteLength,
+      size: n.byteLength,
       usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
     }), R = o.createCommandEncoder();
-    R.copyBufferToBuffer(h, 0, E, 0, t.byteLength), o.queue.submit([R.finish()]), await E.mapAsync(GPUMapMode.READ);
+    R.copyBufferToBuffer(h, 0, E, 0, n.byteLength), o.queue.submit([R.finish()]), await E.mapAsync(GPUMapMode.READ);
     const k = new Float32Array(E.getMappedRange().slice(0));
-    return E.unmap(), h.destroy(), l.destroy(), u.destroy(), g.destroy(), w.destroy(), y.destroy(), x.destroy(), B.destroy(), E.destroy(), k;
+    return E.unmap(), h.destroy(), d.destroy(), u.destroy(), g.destroy(), w.destroy(), y.destroy(), x.destroy(), B.destroy(), E.destroy(), k;
   }
-  makeBuffer(t, r) {
+  makeBuffer(n, r) {
     const s = this.device.createBuffer({
-      size: t.byteLength,
+      size: n.byteLength,
       usage: r,
       mappedAtCreation: !0
     });
-    return t instanceof Float32Array ? new Float32Array(s.getMappedRange()).set(t) : new Uint32Array(s.getMappedRange()).set(t), s.unmap(), s;
+    return n instanceof Float32Array ? new Float32Array(s.getMappedRange()).set(n) : new Uint32Array(s.getMappedRange()).set(n), s.unmap(), s;
   }
 }
 function q(e) {
   return Math.max(-4, Math.min(4, e));
 }
-function z(e, t, r, s, n, p, f, d) {
-  const { a: c, b: a, gamma: o = 1, negativeSampleRate: i = 5 } = f, h = t.rows.length, l = new Uint32Array(t.rows), u = new Uint32Array(t.cols), g = new Float32Array(h).fill(0), m = new Float32Array(h);
+function z(e, n, r, s, t, p, f, l) {
+  const { a: c, b: a, gamma: o = 1, negativeSampleRate: i = 5 } = f, h = n.rows.length, d = new Uint32Array(n.rows), u = new Uint32Array(n.cols), g = new Float32Array(h).fill(0), m = new Float32Array(h);
   for (let w = 0; w < h; w++)
     m[w] = r[w] / i;
   for (let w = 0; w < p; w++) {
-    d == null || d(w, p);
+    l == null || l(w, p);
     const b = 1 - w / p;
     for (let y = 0; y < h; y++) {
       if (g[y] > w) continue;
-      const v = l[y], x = u[y];
+      const v = d[y], x = u[y];
       let B = 0;
-      for (let _ = 0; _ < n; _++) {
-        const F = e[v * n + _] - e[x * n + _];
+      for (let _ = 0; _ < t; _++) {
+        const F = e[v * t + _] - e[x * t + _];
         B += F * F;
       }
       const E = Math.pow(B, a), R = -2 * c * a * (B > 0 ? E / B : 0) / (c * E + 1);
-      for (let _ = 0; _ < n; _++) {
-        const F = e[v * n + _] - e[x * n + _], A = q(R * F);
-        e[v * n + _] += b * A, e[x * n + _] -= b * A;
+      for (let _ = 0; _ < t; _++) {
+        const F = e[v * t + _] - e[x * t + _], A = q(R * F);
+        e[v * t + _] += b * A, e[x * t + _] -= b * A;
       }
       g[y] += r[y];
       const k = m[y] > 0 ? Math.floor(r[y] / m[y]) : 0;
@@ -303,14 +304,14 @@ function z(e, t, r, s, n, p, f, d) {
         const F = Math.floor(Math.random() * s);
         if (F === v) continue;
         let A = 0;
-        for (let S = 0; S < n; S++) {
-          const O = e[v * n + S] - e[F * n + S];
+        for (let S = 0; S < t; S++) {
+          const O = e[v * t + S] - e[F * t + S];
           A += O * O;
         }
         const M = Math.pow(A, a), N = 2 * o * a / ((1e-3 + A) * (c * M + 1));
-        for (let S = 0; S < n; S++) {
-          const O = e[v * n + S] - e[F * n + S], U = q(N * O);
-          e[v * n + S] += b * U;
+        for (let S = 0; S < t; S++) {
+          const O = e[v * t + S] - e[F * t + S], U = q(N * O);
+          e[v * t + S] += b * U;
         }
       }
       m[y] += r[y] / i;
@@ -318,23 +319,23 @@ function z(e, t, r, s, n, p, f, d) {
   }
   return e;
 }
-function $(e, t, r, s, n, p, f, d, c, a) {
-  const { a: o, b: i, gamma: h = 1, negativeSampleRate: l = 5 } = c, u = r.rows.length, g = new Uint32Array(r.rows), m = new Uint32Array(r.cols), w = new Float32Array(u).fill(0), b = new Float32Array(u);
+function $(e, n, r, s, t, p, f, l, c, a) {
+  const { a: o, b: i, gamma: h = 1, negativeSampleRate: d = 5 } = c, u = r.rows.length, g = new Uint32Array(r.rows), m = new Uint32Array(r.cols), w = new Float32Array(u).fill(0), b = new Float32Array(u);
   for (let y = 0; y < u; y++)
-    b[y] = s[y] / l;
-  for (let y = 0; y < d; y++) {
-    const v = 1 - y / d;
+    b[y] = s[y] / d;
+  for (let y = 0; y < l; y++) {
+    const v = 1 - y / l;
     for (let x = 0; x < u; x++) {
       if (w[x] > y) continue;
       const B = g[x], E = m[x];
       let R = 0;
       for (let A = 0; A < f; A++) {
-        const M = e[B * f + A] - t[E * f + A];
+        const M = e[B * f + A] - n[E * f + A];
         R += M * M;
       }
       const k = Math.pow(R, i), _ = -2 * o * i * (R > 0 ? k / R : 0) / (o * k + 1);
       for (let A = 0; A < f; A++) {
-        const M = e[B * f + A] - t[E * f + A];
+        const M = e[B * f + A] - n[E * f + A];
         e[B * f + A] += v * q(_ * M);
       }
       w[x] += s[x];
@@ -344,46 +345,46 @@ function $(e, t, r, s, n, p, f, d, c, a) {
         if (M === E) continue;
         let N = 0;
         for (let U = 0; U < f; U++) {
-          const P = e[B * f + U] - t[M * f + U];
+          const P = e[B * f + U] - n[M * f + U];
           N += P * P;
         }
         const S = Math.pow(N, i), O = 2 * h * i / ((1e-3 + N) * (o * S + 1));
         for (let U = 0; U < f; U++) {
-          const P = e[B * f + U] - t[M * f + U];
+          const P = e[B * f + U] - n[M * f + U];
           e[B * f + U] += v * q(O * P);
         }
       }
-      b[x] += s[x] / l;
+      b[x] += s[x] / d;
     }
   }
   return e;
 }
-function K() {
+function j() {
   return typeof navigator < "u" && !!navigator.gpu;
 }
-async function ae(e, t = {}, r) {
+async function ae(e, n = {}, r) {
   const {
     nComponents: s = 2,
-    nNeighbors: n = 15,
+    nNeighbors: t = 15,
     minDist: p = 0.1,
     spread: f = 1,
-    hnsw: d = {}
-  } = t, c = t.nEpochs ?? (e.length > 1e4 ? 200 : 500);
+    hnsw: l = {}
+  } = n, c = n.nEpochs ?? (e.length > 1e4 ? 200 : 500);
   console.time("knn");
-  const { indices: a, distances: o } = await Y(e, n, {
-    M: d.M ?? 16,
-    efConstruction: d.efConstruction ?? 200,
-    efSearch: d.efSearch ?? 50
+  const { indices: a, distances: o } = await Y(e, t, {
+    M: l.M ?? 16,
+    efConstruction: l.efConstruction ?? 200,
+    efSearch: l.efSearch ?? 50
   });
   console.timeEnd("knn"), console.time("fuzzy-set");
-  const i = D(a, o, n);
+  const i = D(a, o, t);
   console.timeEnd("fuzzy-set");
-  const { a: h, b: l } = j(p, f), u = I(i.vals, c), g = e.length, m = new Float32Array(g * s);
+  const { a: h, b: d } = K(p, f), u = I(i.vals, c), g = e.length, m = new Float32Array(g * s);
   for (let b = 0; b < m.length; b++)
     m[b] = Math.random() * 20 - 10;
   console.time("sgd");
   let w;
-  if (K())
+  if (j())
     try {
       const b = new W();
       await b.init(), w = await b.optimize(
@@ -394,34 +395,34 @@ async function ae(e, t = {}, r) {
         g,
         s,
         c,
-        { a: h, b: l, gamma: 1, negativeSampleRate: 5 },
+        { a: h, b: d, gamma: 1, negativeSampleRate: 5 },
         r
       );
     } catch (b) {
-      console.warn("WebGPU SGD failed, falling back to CPU:", b), w = z(m, i, u, g, s, c, { a: h, b: l }, r);
+      console.warn("WebGPU SGD failed, falling back to CPU:", b), w = z(m, i, u, g, s, c, { a: h, b: d }, r);
     }
   else
-    w = z(m, i, u, g, s, c, { a: h, b: l }, r);
+    w = z(m, i, u, g, s, c, { a: h, b: d }, r);
   return console.timeEnd("sgd"), w;
 }
-function j(e, t) {
-  if (Math.abs(t - 1) < 1e-6 && Math.abs(e - 0.1) < 1e-6)
+function K(e, n) {
+  if (Math.abs(n - 1) < 1e-6 && Math.abs(e - 0.1) < 1e-6)
     return { a: 1.9292, b: 0.7915 };
-  if (Math.abs(t - 1) < 1e-6 && Math.abs(e - 0) < 1e-6)
+  if (Math.abs(n - 1) < 1e-6 && Math.abs(e - 0) < 1e-6)
     return { a: 1.8956, b: 0.8006 };
-  if (Math.abs(t - 1) < 1e-6 && Math.abs(e - 0.5) < 1e-6)
+  if (Math.abs(n - 1) < 1e-6 && Math.abs(e - 0.5) < 1e-6)
     return { a: 1.5769, b: 0.8951 };
-  const r = ee(e, t);
-  return { a: te(e, t, r), b: r };
+  const r = ee(e, n);
+  return { a: ne(e, n, r), b: r };
 }
-function ee(e, t) {
-  return 1 / (t * 1.2);
+function ee(e, n) {
+  return 1 / (n * 1.2);
 }
-function te(e, t, r) {
+function ne(e, n, r) {
   return e < 1e-6 ? 1.8956 : (1 / (1 + 1e-3) - 1) / -Math.pow(e, 2 * r);
 }
 class re {
-  constructor(t = {}) {
+  constructor(n = {}) {
     G(this, "_nComponents");
     G(this, "_nNeighbors");
     G(this, "_minDist");
@@ -434,8 +435,8 @@ class re {
     G(this, "embedding", null);
     G(this, "_hnswIndex", null);
     G(this, "_nTrain", 0);
-    this._nComponents = t.nComponents ?? 2, this._nNeighbors = t.nNeighbors ?? 15, this._minDist = t.minDist ?? 0.1, this._spread = t.spread ?? 1, this._nEpochs = t.nEpochs, this._hnswOpts = t.hnsw ?? {};
-    const { a: r, b: s } = j(this._minDist, this._spread);
+    this._nComponents = n.nComponents ?? 2, this._nNeighbors = n.nNeighbors ?? 15, this._minDist = n.minDist ?? 0.1, this._spread = n.spread ?? 1, this._nEpochs = n.nEpochs, this._hnswOpts = n.hnsw ?? {};
+    const { a: r, b: s } = K(this._minDist, this._spread);
     this._a = r, this._b = s;
   }
   /**
@@ -444,42 +445,42 @@ class re {
    * index so that transform() can project new points later.
    * Returns `this` for chaining.
    */
-  async fit(t, r) {
-    const s = t.length, n = this._nEpochs ?? (s > 1e4 ? 200 : 500), { M: p = 16, efConstruction: f = 200, efSearch: d = 50 } = this._hnswOpts;
+  async fit(n, r) {
+    const s = n.length, t = this._nEpochs ?? (s > 1e4 ? 200 : 500), { M: p = 16, efConstruction: f = 200, efSearch: l = 50 } = this._hnswOpts;
     console.time("knn");
-    const { knn: c, index: a } = await Q(t, this._nNeighbors, {
+    const { knn: c, index: a } = await Q(n, this._nNeighbors, {
       M: p,
       efConstruction: f,
-      efSearch: d
+      efSearch: l
     });
     this._hnswIndex = a, this._nTrain = s, console.timeEnd("knn"), console.time("fuzzy-set");
     const o = D(c.indices, c.distances, this._nNeighbors);
     console.timeEnd("fuzzy-set");
-    const i = I(o.vals, n), h = new Float32Array(s * this._nComponents);
-    for (let l = 0; l < h.length; l++)
-      h[l] = Math.random() * 20 - 10;
-    if (console.time("sgd"), K())
+    const i = I(o.vals, t), h = new Float32Array(s * this._nComponents);
+    for (let d = 0; d < h.length; d++)
+      h[d] = Math.random() * 20 - 10;
+    if (console.time("sgd"), j())
       try {
-        const l = new W();
-        await l.init(), this.embedding = await l.optimize(
+        const d = new W();
+        await d.init(), this.embedding = await d.optimize(
           h,
           new Uint32Array(o.rows),
           new Uint32Array(o.cols),
           i,
           s,
           this._nComponents,
-          n,
+          t,
           { a: this._a, b: this._b, gamma: 1, negativeSampleRate: 5 },
           r
         );
-      } catch (l) {
-        console.warn("WebGPU SGD failed, falling back to CPU:", l), this.embedding = z(h, o, i, s, this._nComponents, n, {
+      } catch (d) {
+        console.warn("WebGPU SGD failed, falling back to CPU:", d), this.embedding = z(h, o, i, s, this._nComponents, t, {
           a: this._a,
           b: this._b
         }, r);
       }
     else
-      this.embedding = z(h, o, i, s, this._nComponents, n, {
+      this.embedding = z(h, o, i, s, this._nComponents, t, {
         a: this._a,
         b: this._b
       }, r);
@@ -496,12 +497,12 @@ class re {
    *   returned embedding to [0, 1].  The stored training embedding is never
    *   mutated.  Defaults to `false`.
    */
-  async transform(t, r = !1) {
+  async transform(n, r = !1) {
     if (!this._hnswIndex || !this.embedding)
       throw new Error("UMAP.transform() must be called after fit()");
-    const s = t.length, n = this._nEpochs ?? (this._nTrain > 1e4 ? 200 : 500), p = Math.max(100, Math.floor(n / 4)), f = this._hnswIndex.searchKnn(t, this._nNeighbors), d = J(f.indices, f.distances, this._nNeighbors), c = new Uint32Array(d.rows), a = new Uint32Array(d.cols), o = new Float32Array(s), i = new Float32Array(s * this._nComponents);
+    const s = n.length, t = this._nEpochs ?? (this._nTrain > 1e4 ? 200 : 500), p = Math.max(100, Math.floor(t / 4)), f = this._hnswIndex.searchKnn(n, this._nNeighbors), l = J(f.indices, f.distances, this._nNeighbors), c = new Uint32Array(l.rows), a = new Uint32Array(l.cols), o = new Float32Array(s), i = new Float32Array(s * this._nComponents);
     for (let u = 0; u < c.length; u++) {
-      const g = c[u], m = a[u], w = d.vals[u];
+      const g = c[u], m = a[u], w = l.vals[u];
       o[g] += w;
       for (let b = 0; b < this._nComponents; b++)
         i[g * this._nComponents + b] += w * this.embedding[m * this._nComponents + b];
@@ -513,10 +514,10 @@ class re {
       else
         for (let g = 0; g < this._nComponents; g++)
           i[u * this._nComponents + g] = Math.random() * 20 - 10;
-    const h = I(d.vals, p), l = $(
+    const h = I(l.vals, p), d = $(
       i,
       this.embedding,
-      d,
+      l,
       h,
       s,
       this._nTrain,
@@ -524,7 +525,7 @@ class re {
       p,
       { a: this._a, b: this._b }
     );
-    return r ? T(l, s, this._nComponents) : l;
+    return r ? T(d, s, this._nComponents) : d;
   }
   /**
    * Convenience method equivalent to `fit(vectors)` followed by
@@ -535,37 +536,37 @@ class re {
    *   returned embedding to [0, 1].  `this.embedding` is never mutated.
    *   Defaults to `false`.
    */
-  async fit_transform(t, r, s = !1) {
-    return await this.fit(t, r), s ? T(this.embedding, t.length, this._nComponents) : this.embedding;
+  async fit_transform(n, r, s = !1) {
+    return await this.fit(n, r), s ? T(this.embedding, n.length, this._nComponents) : this.embedding;
   }
 }
-function T(e, t, r) {
+function T(e, n, r) {
   const s = new Float32Array(e.length);
-  for (let n = 0; n < r; n++) {
+  for (let t = 0; t < r; t++) {
     let p = 1 / 0, f = -1 / 0;
-    for (let c = 0; c < t; c++) {
-      const a = e[c * r + n];
+    for (let c = 0; c < n; c++) {
+      const a = e[c * r + t];
       a < p && (p = a), a > f && (f = a);
     }
-    const d = f - p;
-    for (let c = 0; c < t; c++)
-      s[c * r + n] = d > 0 ? (e[c * r + n] - p) / d : 0;
+    const l = f - p;
+    for (let c = 0; c < n; c++)
+      s[c * r + t] = l > 0 ? (e[c * r + t] - p) / l : 0;
   }
   return s;
 }
-function I(e, t) {
+function I(e, n) {
   let r = -1 / 0;
-  for (let n = 0; n < e.length; n++)
-    e[n] > r && (r = e[n]);
+  for (let t = 0; t < e.length; t++)
+    e[t] > r && (r = e[t]);
   const s = new Float32Array(e.length);
-  for (let n = 0; n < e.length; n++) {
-    const p = e[n] / r;
-    s[n] = p > 0 ? t / p : -1;
+  for (let t = 0; t < e.length; t++) {
+    const p = e[t] / r;
+    s[t] = p > 0 ? n / p : -1;
   }
   return s;
 }
 export {
   re as UMAP,
   ae as fit,
-  K as isWebGPUAvailable
+  j as isWebGPUAvailable
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "umap-gpu",
-  "version": "0.2.10",
+  "version": "0.2.11",
   "description": "UMAP with HNSW kNN and WebGPU-accelerated SGD",
   "type": "module",
   "main": "dist/index.js",