autograd-ts 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Eyas Ranjous
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,289 @@
+# autograd-ts
+
+A tiny Typescript library that implements **reverse-mode automatic differentiation** (autograd) and neural network training.
+
+The goal of the project is exploring the fundamental mechanism that allows neural networks to learn.
+
+At its core, a neural network is a system of interconnected computations.
+
+Producing an output is straightforward. However, learning requires determining how each value influenced that output and how those values should be adjusted when the prediction is wrong.
+
+This library explores the mechanism that makes that possible.
+
+---
+
+# Understanding Learning
+
+A neural network can make a prediction by evaluating a series of mathematical operations.
+
+For example, consider the simplified model:
+
+```text
+z = x * y + x
+```
+
+Here, x and y are inputs to the model and z is the resulting prediction.
+
+Given the inputs:
+
+```
+x = 2
+y = 3
+```
+
+the model produces:
+```
+z = 8
+```
+
+Suppose the expected value was:
+
+```text
+target = 10
+```
+
+Now we need to answer:
+
+```text
+1. Which values contributed to the error?
+2. How much did they contribute?
+3. How should they change?
+```
+
+For a simple expression this may seem manageable. For a neural network containing thousands or millions of parameters, it becomes a much more difficult problem.
+
+This leads to the central question behind the project:
+
+> When a neural network makes a prediction, how does it know which weights to adjust?
+
+A model must be able to trace a prediction back through the computations that produced it, measure how each value contributed to the final result, and determine how those values should change when the prediction is wrong.
+
+Modern machine learning systems solve this problem through a sequence of concepts that build on one another:
+
+```text
+Computation Graph
+        ↓
+Automatic Differentiation
+        ↓
+Backpropagation
+        ↓
+Gradient Descent
+        ↓
+Learning
+```
+
+---
+
+# Layer 1: Computation Graphs
+
+Everything begins with mathematical expressions.
+
+Consider:
+
+```text
+z = x * y + x
+```
+
+Expanded:
+
+```text
+a = x * y
+z = a + x
+```
+
+This expression can be represented as a directed acyclic graph (DAG):
+
+```text
+x -----------\
+              * ---> a ----\
+y -----------/             \
+                             + ---> z
+x -------------------------/
+```
+
+Each node represents a computed value.
+
+| Node | Meaning | Value |
+| ---- | ------- | ----- |
+| x    | Input   | 2     |
+| y    | Input   | 3     |
+| a    | x * y   | 6     |
+| z    | a + x   | 8     |
+
+Each edge represents a dependency relationship.
+
+```text
+x → a
+y → a
+a → z
+x → z
+```
+
+The graph gives us a structured representation of the computation.
+
+Once that structure exists, we can begin reasoning about how changes in one value affect others.
+
+---
+
+# Layer 2: Automatic Differentiation
+
+As we have the computation graph, we can now ask:
+
+> How much did each node contribute to the final output?
+
+For the expression:
+
+```text
+z = x * y + x
+```
+
+we want:
+
+```text
+∂z/∂x
+∂z/∂y
+```
+(∂ denotes a partial derivative).
+
+The autograd engine computes these derivatives automatically using reverse graph traversal and the chain rule.
+
+So after backpropagation they become:
+
+```text
+x.grad = 4
+y.grad = 2
+```
+
+These gradients measure how sensitive the final output is to each input.
+
+For example:
+
+```
+∂z/∂x = 4
+```
+
+which means that a small increase of 1 in x would increase z by approximately 4.
+
+This process is known as **reverse-mode automatic differentiation**, the same technique used by modern machine learning frameworks.
+
+---
+
+# Layer 3: Neural Networks
+
+Neural networks are built directly on top of the computation graph.
+
+A single neuron computes:
+
+```text
+w1*x1 + w2*x2 + b
+```
+
+which is simply a larger graph.
+
+```text
+x1 --*
+     |
+w1 --|
+
+x2 --*
+     + ---> tanh ---> output
+w2 --|
+
+b -------------|
+```
+
+The weights (`w1`, `w2`) and bias (`b`) are themselves graph nodes.
+
+The autograd engine computes gradients for those weights automatically.
+
+Nothing special is added for neural networks, the same graph and differentiation system powers everything.
+
+---
+
+# Layer 4: Learning
+
+Once gradients are available, training becomes possible.
+
+A typical training loop looks like:
+
+```text
+Forward Pass
+      ↓
+Compute Loss
+      ↓
+Backward Pass
+      ↓
+Update Weights
+      ↓
+Repeat
+```
+
+Over time the network adjusts its weights to reduce prediction error.
+
+This feedback loop is the mechanism that allows neural networks to learn.
+
+---
+
+# Project Scope
+
+Version 0.1.0 focuses on a minimal learning system.
+
+## Core Autograd Engine
+
+* Value
+* add
+* sub
+* mul
+* div
+* pow
+* tanh
+* relu
+* exp
+* backward
+
+## Neural Network Components
+
+* Neuron
+* Layer
+* MLP (Multi-Layer Perceptron)
+
+## Training Utilities
+
+* Mean Squared Error (MSE)
+* Stochastic Gradient Descent (SGD)
+
+## Examples
+```
+examples/
+├── basic.ts
+└── xor.ts
+```
+
+**Basic computation graph example**
+```
+z: 8
+dz/dx: 4
+dz/dy: 2
+```
+
+**XOR training example**
+```
+XOR Training
+epoch=0   loss=1.824531
+epoch=100 loss=0.712943
+epoch=200 loss=0.403817
+epoch=300 loss=0.182691
+epoch=400 loss=0.087432
+epoch=500 loss=0.041827
+epoch=600 loss=0.021554
+epoch=700 loss=0.012115
+epoch=800 loss=0.007083
+epoch=900 loss=0.004291
+
+XOR Predictions
+[0, 0] => 0.0213
+[0, 1] => 0.9834
+[1, 0] => 0.9772
+[1, 1] => 0.0189
+```
+---

package/dist/core/Value.d.ts

@@ -0,0 +1,88 @@
+export type BackwardFn = () => void;
+interface ValueOptions {
+    prev?: Value[];
+    op?: string;
+    backward?: BackwardFn;
+}
+/**
+ * Scalar node in a computation graph supporting reverse-mode automatic differentiation.
+ */
+export declare class Value {
+    data: number;
+    grad: number;
+    private _prev;
+    private _op?;
+    private _backward;
+    /**
+     * Creates a new computation graph node.
+     * @param data Numeric value stored in this node.
+     * @param opts Internal metadata for graph construction.
+     */
+    constructor(data: number, opts?: ValueOptions);
+    /**
+     * Adds another value to this value.
+     * @param v Value or number to add.
+     * @returns New Value representing the sum.
+     */
+    add(v: Value | number): Value;
+    /**
+     * Multiplies this value by another.
+     * @param v Value or number to multiply.
+     * @returns New Value representing the product.
+     */
+    mul(v: Value | number): Value;
+    /**
+     * Raises this value to a numeric power.
+     * @param n Exponent.
+     * @returns New Value representing x^n.
+     */
+    pow(n: number): Value;
+    /**
+     * Applies the hyperbolic tangent activation.
+     * @returns New Value representing tanh(x).
+     */
+    tanh(): Value;
+    /**
+     * Applies the ReLU activation function.
+     * @returns New Value representing max(0, x).
+     */
+    relu(): Value;
+    /**
+     * Negates this value.
+     * @returns New Value representing -x.
+     */
+    neg(): Value;
+    /**
+     * Subtracts another value from this value.
+     * @param v Value or number to subtract.
+     * @returns New Value representing x - y.
+     */
+    sub(v: Value | number): Value;
+    /**
+     * Divides this value by another.
+     * @param v Value or number to divide by.
+     * @returns New Value representing x / y.
+     */
+    div(v: Value | number): Value;
+    /**
+     * Resets the gradient stored on this node.
+     */
+    zeroGrad(): void;
+    /**
+     * Performs reverse-mode automatic differentiation to compute gradients.
+     */
+    backward(): void;
+    /**
+     * Returns a human-readable representation of the Value.
+     * @returns String representation of this node.
+     */
+    toString(): string;
+}
+/**
+ * A helper for creating a Value from a number.
+ * @param n Numeric value.
+ * @returns Value
+ */
+export declare function val(n: number): Value;
+export {};
+//# sourceMappingURL=Value.d.ts.map

package/dist/core/Value.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Value.d.ts","sourceRoot":"","sources":["../../src/core/Value.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC;AAEpC,UAAU,YAAY;IACpB,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,UAAU,CAAC;CACvB;AAED;;GAEG;AACH,qBAAa,KAAK;IACT,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,SAAK;IAEhB,OAAO,CAAC,KAAK,CAAU;IACvB,OAAO,CAAC,GAAG,CAAC,CAAS;IACrB,OAAO,CAAC,SAAS,CAAa;IAE9B;;;;OAIG;gBACS,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,YAAY;IAO7C;;;;OAIG;IACI,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,KAAK;IAepC;;;;OAIG;IACI,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,KAAK;IAepC;;;;OAIG;IACI,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK;IAY5B;;;OAGG;IACI,IAAI,IAAI,KAAK;IAcpB;;;OAGG;IACI,IAAI,IAAI,KAAK;IAYpB;;;OAGG;IACI,GAAG,IAAI,KAAK;IAInB;;;;OAIG;IACI,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,KAAK;IAIpC;;;;OAIG;IACI,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,KAAK;IAKpC;;OAEG;IACI,QAAQ,IAAI,IAAI;IAIvB;;OAEG;IACI,QAAQ,IAAI,IAAI;IAyBvB;;;OAGG;IACI,QAAQ,IAAI,MAAM;CAG1B;AAED;;;;GAIG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAEpC"}

package/dist/core/Value.js

@@ -0,0 +1,167 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Value = void 0;
+exports.val = val;
+/**
+ * Scalar node in a computation graph supporting reverse-mode automatic differentiation.
+ */
+class Value {
+    /**
+     * Creates a new computation graph node.
+     * @param data Numeric value stored in this node.
+     * @param opts Internal metadata for graph construction.
+     */
+    constructor(data, opts) {
+        this.grad = 0;
+        this.data = data;
+        this._prev = opts?.prev ?? [];
+        this._op = opts?.op;
+        this._backward = opts?.backward ?? (() => { });
+    }
+    /**
+     * Adds another value to this value.
+     * @param v Value or number to add.
+     * @returns New Value representing the sum.
+     */
+    add(v) {
+        const o = v instanceof Value ? v : val(v);
+        const out = new Value(this.data + o.data, {
+            prev: [this, o],
+            op: '+',
+            backward: () => {
+                this.grad += out.grad;
+                o.grad += out.grad;
+            },
+        });
+        return out;
+    }
+    /**
+     * Multiplies this value by another.
+     * @param v Value or number to multiply.
+     * @returns New Value representing the product.
+     */
+    mul(v) {
+        const o = v instanceof Value ? v : val(v);
+        const out = new Value(this.data * o.data, {
+            prev: [this, o],
+            op: '*',
+            backward: () => {
+                this.grad += o.data * out.grad;
+                o.grad += this.data * out.grad;
+            },
+        });
+        return out;
+    }
+    /**
+     * Raises this value to a numeric power.
+     * @param n Exponent.
+     * @returns New Value representing x^n.
+     */
+    pow(n) {
+        const out = new Value(this.data ** n, {
+            prev: [this],
+            op: `pow(${n})`,
+            backward: () => {
+                this.grad += n * this.data ** (n - 1) * out.grad;
+            },
+        });
+        return out;
+    }
+    /**
+     * Applies the hyperbolic tangent activation.
+     * @returns New Value representing tanh(x).
+     */
+    tanh() {
+        const t = Math.tanh(this.data);
+        const out = new Value(t, {
+            prev: [this],
+            op: 'tanh',
+            backward: () => {
+                this.grad += (1 - t * t) * out.grad;
+            },
+        });
+        return out;
+    }
+    /**
+     * Applies the ReLU activation function.
+     * @returns New Value representing max(0, x).
+     */
+    relu() {
+        const out = new Value(this.data > 0 ? this.data : 0, {
+            prev: [this],
+            op: 'relu',
+            backward: () => {
+                this.grad += (this.data > 0 ? 1 : 0) * out.grad;
+            },
+        });
+        return out;
+    }
+    /**
+     * Negates this value.
+     * @returns New Value representing -x.
+     */
+    neg() {
+        return this.mul(-1);
+    }
+    /**
+     * Subtracts another value from this value.
+     * @param v Value or number to subtract.
+     * @returns New Value representing x - y.
+     */
+    sub(v) {
+        return this.add(v instanceof Value ? v.neg() : -v);
+    }
+    /**
+     * Divides this value by another.
+     * @param v Value or number to divide by.
+     * @returns New Value representing x / y.
+     */
+    div(v) {
+        const o = v instanceof Value ? v : val(v);
+        return this.mul(o.pow(-1));
+    }
+    /**
+     * Resets the gradient stored on this node.
+     */
+    zeroGrad() {
+        this.grad = 0;
+    }
+    /**
+     * Performs reverse-mode automatic differentiation to compute gradients.
+     */
+    backward() {
+        const topo = [];
+        const visited = new Set();
+        const buildTopo = (v) => {
+            if (visited.has(v))
+                return;
+            visited.add(v);
+            for (const parent of v._prev) {
+                buildTopo(parent);
+            }
+            topo.push(v);
+        };
+        buildTopo(this);
+        this.grad = 1;
+        for (let i = topo.length - 1; i >= 0; i--) {
+            topo[i]._backward();
+        }
+    }
+    /**
+     * Returns a human-readable representation of the Value.
+     * @returns String representation of this node.
+     */
+    toString() {
+        return `Value(data=${this.data}, grad=${this.grad})`;
+    }
+}
+exports.Value = Value;
+/**
+ * A helper for creating a Value from a number.
+ * @param n Numeric value.
+ * @returns Value
+ */
+function val(n) {
+    return new Value(n);
+}
+//# sourceMappingURL=Value.js.map

package/dist/core/Value.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Value.js","sourceRoot":"","sources":["../../src/core/Value.ts"],"names":[],"mappings":";;;AAsMA,kBAEC;AAhMD;;GAEG;AACH,MAAa,KAAK;IAQhB;;;;OAIG;IACH,YAAY,IAAY,EAAE,IAAmB;QAXtC,SAAI,GAAG,CAAC,CAAC;QAYd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG,GAAG,IAAI,EAAE,EAAE,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,IAAI,EAAE,QAAQ,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAiB;QAC1B,MAAM,CAAC,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE1C,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE;YACxC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YACf,EAAE,EAAE,GAAG;YACP,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;gBACtB,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;YACrB,CAAC;SACF,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAiB;QAC1B,MAAM,CAAC,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE1C,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE;YACxC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YACf,EAAE,EAAE,GAAG;YACP,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;gBAC/B,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YACjC,CAAC;SACF,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;YACpC,IAAI,EAAE,CAAC,IAAI,CAAC;YACZ,EAAE,EAAE,OAAO,CAAC,GAAG;YACf,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;YACnD,CAAC;SACF,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE/B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,EAAE;YACvB,IAAI,EAAE,CAAC,IAAI,CAAC;YACZ,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;YACtC,CAAC;SACF,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;YACnD,IAAI,EAAE,CAAC,IAAI,CAAC;YACZ,EAAE,EAAE,MAAM;YACV,QAAQ,EAAE,GAAG,EAAE;gBACb,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;YAClD,CAAC;SACF,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAiB;QAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAiB;QAC1B,MAAM,CAAC,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChB,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,MAAM,IAAI,GAAY,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAS,CAAC;QAEjC,MAAM,SAAS,GAAG,CAAC,CAAQ,EAAQ,EAAE;YACnC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO;YAE3B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEf,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC7B,SAAS,CAAC,MAAM,CAAC,CAAC;YACpB,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC,CAAC;QAEF,SAAS,CAAC,IAAI,CAAC,CAAC;QAEhB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,CAAC,CAAE,CAAC,SAAS,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;OAGG;IACI,QAAQ;QACb,OAAO,cAAc,IAAI,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI,GAAG,CAAC;IACvD,CAAC;CACF;AApLD,sBAoLC;AAED;;;;GAIG;AACH,SAAgB,GAAG,CAAC,CAAS;IAC3B,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,2 @@
+export { Value, val } from './core/Value';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC"}

package/dist/index.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.val = exports.Value = void 0;
+var Value_1 = require("./core/Value");
+Object.defineProperty(exports, "Value", { enumerable: true, get: function () { return Value_1.Value; } });
+Object.defineProperty(exports, "val", { enumerable: true, get: function () { return Value_1.val; } });
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,sCAA0C;AAAjC,8FAAA,KAAK,OAAA;AAAE,4FAAA,GAAG,OAAA"}

package/dist/nn/Layer.d.ts

@@ -0,0 +1,27 @@
+import { Value } from '../core/Value';
+import { Activation } from './Neuron';
+/**
+ * Fully connected layer containing multiple neurons.
+ */
+export declare class Layer {
+    private neurons;
+    /**
+     * Creates a layer of neurons.
+     * @param inputSize Number of inputs per neuron.
+     * @param outputSize Number of neurons in the layer.
+     * @param activation Activation function used by each neuron.
+     */
+    constructor(inputSize: number, outputSize: number, activation?: Activation);
+    /**
+     * Computes outputs for all neurons in the layer.
+     * @param inputs Input values.
+     * @returns Layer outputs.
+     */
+    forward(inputs: Value[]): Value[];
+    /**
+     * Returns all trainable parameters in the layer.
+     * @returns Flattened list of neuron parameters.
+     */
+    parameters(): Value[];
+}
+//# sourceMappingURL=Layer.d.ts.map

package/dist/nn/Layer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Layer.d.ts","sourceRoot":"","sources":["../../src/nn/Layer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AACtC,OAAO,EAAE,UAAU,EAAU,MAAM,UAAU,CAAC;AAE9C;;GAEG;AACH,qBAAa,KAAK;IAChB,OAAO,CAAC,OAAO,CAAW;IAE1B;;;;;OAKG;gBACS,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,GAAE,UAAmB;IAOlF;;;;OAIG;IACI,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE;IAIxC;;;OAGG;IACI,UAAU,IAAI,KAAK,EAAE;CAG7B"}

package/dist/nn/Layer.js

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Layer = void 0;
+const Neuron_1 = require("./Neuron");
+/**
+ * Fully connected layer containing multiple neurons.
+ */
+class Layer {
+    /**
+     * Creates a layer of neurons.
+     * @param inputSize Number of inputs per neuron.
+     * @param outputSize Number of neurons in the layer.
+     * @param activation Activation function used by each neuron.
+     */
+    constructor(inputSize, outputSize, activation = "tanh") {
+        this.neurons = Array.from({ length: outputSize }, () => new Neuron_1.Neuron(inputSize, activation));
+    }
+    /**
+     * Computes outputs for all neurons in the layer.
+     * @param inputs Input values.
+     * @returns Layer outputs.
+     */
+    forward(inputs) {
+        return this.neurons.map((neuron) => neuron.forward(inputs));
+    }
+    /**
+     * Returns all trainable parameters in the layer.
+     * @returns Flattened list of neuron parameters.
+     */
+    parameters() {
+        return this.neurons.flatMap((neuron) => neuron.parameters());
+    }
+}
+exports.Layer = Layer;
+//# sourceMappingURL=Layer.js.map

package/dist/nn/Layer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Layer.js","sourceRoot":"","sources":["../../src/nn/Layer.ts"],"names":[],"mappings":";;;AACA,qCAA8C;AAE9C;;GAEG;AACH,MAAa,KAAK;IAGhB;;;;;OAKG;IACH,YAAY,SAAiB,EAAE,UAAkB,EAAE,aAAyB,MAAM;QAChF,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,IAAI,CACvB,EAAE,MAAM,EAAE,UAAU,EAAE,EACtB,GAAG,EAAE,CAAC,IAAI,eAAM,CAAC,SAAS,EAAE,UAAU,CAAC,CACxC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,MAAe;QAC5B,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED;;;OAGG;IACI,UAAU;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;IAC/D,CAAC;CACF;AAhCD,sBAgCC"}

package/dist/nn/MLP.d.ts

@@ -0,0 +1,37 @@
+import { Value } from '../core/Value';
+import { Activation } from './Neuron';
+/**
+ * Multi-layer perceptron composed of one or more fully connected layers.
+ */
+export declare class MLP {
+    private layers;
+    /**
+     * Creates a multi-layer perceptron.
+     * @param inputSize Number of input features.
+     * @param layerSizes Output size of each layer.
+     * @param options Network activation configuration.
+     */
+    constructor(inputSize: number, layerSizes: number[], options?: {
+        hiddenActivation?: Activation;
+        outputActivation?: Activation;
+    });
+    /**
+     * Runs a forward pass through the network.
+     * @param inputs Input feature values.
+     * @returns Network predictions.
+     */
+    forward(inputs: number[]): Value[];
+    /**
+     * Runs a forward pass through the network.
+     * @param inputs Input feature values.
+     * @returns Network predictions.
+     */
+    parameters(): Value[];
+    /**
+     * Runs a forward pass through the network.
+     * @param inputs Input feature values.
+     * @returns Network predictions.
+     */
+    zeroGrad(): void;
+}
+//# sourceMappingURL=MLP.d.ts.map

package/dist/nn/MLP.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MLP.d.ts","sourceRoot":"","sources":["../../src/nn/MLP.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAO,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAGtC;;GAEG;AACH,qBAAa,GAAG;IACd,OAAO,CAAC,MAAM,CAAU;IAExB;;;;;OAKG;gBAED,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAAE,EACpB,OAAO,CAAC,EAAE;QACR,gBAAgB,CAAC,EAAE,UAAU,CAAC;QAC9B,gBAAgB,CAAC,EAAE,UAAU,CAAC;KAC/B;IA0BH;;;;OAIG;IACI,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE;IAUzC;;;;OAIG;IACI,UAAU,IAAI,KAAK,EAAE;IAI5B;;;;OAIG;IACI,QAAQ,IAAI,IAAI;CAKxB"}

package/dist/nn/MLP.js

@@ -0,0 +1,61 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MLP = void 0;
+const Value_1 = require("../core/Value");
+const Layer_1 = require("./Layer");
+/**
+ * Multi-layer perceptron composed of one or more fully connected layers.
+ */
+class MLP {
+    /**
+     * Creates a multi-layer perceptron.
+     * @param inputSize Number of input features.
+     * @param layerSizes Output size of each layer.
+     * @param options Network activation configuration.
+     */
+    constructor(inputSize, layerSizes, options) {
+        if (layerSizes.length === 0) {
+            throw new Error('MLP must have at least one layer');
+        }
+        const hiddenActivation = options?.hiddenActivation ?? 'tanh';
+        const outputActivation = options?.outputActivation ?? 'none';
+        const sizes = [inputSize, ...layerSizes];
+        this.layers = [];
+        for (let i = 0; i < layerSizes.length; i++) {
+            const isOutputLayer = i === layerSizes.length - 1;
+            this.layers.push(new Layer_1.Layer(sizes[i], sizes[i + 1], isOutputLayer ? outputActivation : hiddenActivation));
+        }
+    }
+    /**
+     * Runs a forward pass through the network.
+     * @param inputs Input feature values.
+     * @returns Network predictions.
+     */
+    forward(inputs) {
+        let output = inputs.map((input) => (0, Value_1.val)(input));
+        for (const layer of this.layers) {
+            output = layer.forward(output);
+        }
+        return output;
+    }
+    /**
+     * Runs a forward pass through the network.
+     * @param inputs Input feature values.
+     * @returns Network predictions.
+     */
+    parameters() {
+        return this.layers.flatMap((layer) => layer.parameters());
+    }
+    /**
+     * Runs a forward pass through the network.
+     * @param inputs Input feature values.
+     * @returns Network predictions.
+     */
+    zeroGrad() {
+        for (const parameter of this.parameters()) {
+            parameter.zeroGrad();
+        }
+    }
+}
+exports.MLP = MLP;
+//# sourceMappingURL=MLP.js.map

package/dist/nn/MLP.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MLP.js","sourceRoot":"","sources":["../../src/nn/MLP.ts"],"names":[],"mappings":";;;AAAA,yCAA2C;AAE3C,mCAAgC;AAEhC;;GAEG;AACH,MAAa,GAAG;IAGd;;;;;OAKG;IACH,YACE,SAAiB,EACjB,UAAoB,EACpB,OAGC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,gBAAgB,GAAG,OAAO,EAAE,gBAAgB,IAAI,MAAM,CAAC;QAC7D,MAAM,gBAAgB,GAAG,OAAO,EAAE,gBAAgB,IAAI,MAAM,CAAC;QAE7D,MAAM,KAAK,GAAG,CAAC,SAAS,EAAE,GAAG,UAAU,CAAC,CAAC;QAEzC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,aAAa,GAAG,CAAC,KAAK,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;YAElD,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,IAAI,aAAK,CACP,KAAK,CAAC,CAAC,CAAE,EACT,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,EACb,aAAa,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,gBAAgB,CACpD,CACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,MAAgB;QAC7B,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,WAAG,EAAC,KAAK,CAAC,CAAC,CAAC;QAE/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,UAAU;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,QAAQ;QACb,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,QAAQ,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;CACF;AA3ED,kBA2EC"}

package/dist/nn/Neuron.d.ts

@@ -0,0 +1,31 @@
+import { Value } from '../core/Value';
+export type Activation = 'tanh' | 'relu' | 'none';
+/**
+ * Fully connected neuron with trainable weights and bias.
+ */
+export declare class Neuron {
+    /** Trainable weights applied to each input feature. */
+    private weights;
+    /** Trainable bias added to the weighted sum. */
+    private bias;
+    /** Activation function applied to the neuron output. */
+    private activation;
+    /**
+     * Creates a neuron with randomly initialized weights.
+     * @param inputSize Number of expected input features.
+     * @param activation Activation function applied to the output.
+     */
+    constructor(inputSize: number, activation?: Activation);
+    /**
+     * Computes the neuron output for a given set of inputs.
+     * @param inputs Input values.
+     * @returns Activated neuron output.
+     */
+    forward(inputs: Value[]): Value;
+    /**
+     * Returns all trainable parameters of the neuron.
+     * @returns Weights and bias.
+     */
+    parameters(): Value[];
+}
+//# sourceMappingURL=Neuron.d.ts.map

package/dist/nn/Neuron.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Neuron.d.ts","sourceRoot":"","sources":["../../src/nn/Neuron.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAO,MAAM,eAAe,CAAC;AAE3C,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAElD;;GAEG;AACH,qBAAa,MAAM;IACjB,uDAAuD;IACvD,OAAO,CAAC,OAAO,CAAU;IAEzB,gDAAgD;IAChD,OAAO,CAAC,IAAI,CAAQ;IAEpB,wDAAwD;IACxD,OAAO,CAAC,UAAU,CAAa;IAE/B;;;;OAIG;gBACS,SAAS,EAAE,MAAM,EAAE,UAAU,GAAE,UAAmB;IAM9D;;;;OAIG;IACI,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK;IAmBtC;;;OAGG;IACI,UAAU,IAAI,KAAK,EAAE;CAG7B"}

package/dist/nn/Neuron.js

@@ -0,0 +1,50 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Neuron = void 0;
+const Value_1 = require("../core/Value");
+/**
+ * Fully connected neuron with trainable weights and bias.
+ */
+class Neuron {
+    /**
+     * Creates a neuron with randomly initialized weights.
+     * @param inputSize Number of expected input features.
+     * @param activation Activation function applied to the output.
+     */
+    constructor(inputSize, activation = 'tanh') {
+        this.weights = Array.from({ length: inputSize }, () => (0, Value_1.val)(randomWeight()));
+        this.bias = (0, Value_1.val)(0);
+        this.activation = activation;
+    }
+    /**
+     * Computes the neuron output for a given set of inputs.
+     * @param inputs Input values.
+     * @returns Activated neuron output.
+     */
+    forward(inputs) {
+        if (inputs.length !== this.weights.length) {
+            throw new Error(`Expected ${this.weights.length} inputs, received ${inputs.length}`);
+        }
+        let output = this.bias;
+        for (let i = 0; i < this.weights.length; i++) {
+            output = output.add(this.weights[i].mul(inputs[i]));
+        }
+        if (this.activation === 'tanh')
+            return output.tanh();
+        if (this.activation === 'relu')
+            return output.relu();
+        return output;
+    }
+    /**
+     * Returns all trainable parameters of the neuron.
+     * @returns Weights and bias.
+     */
+    parameters() {
+        return [...this.weights, this.bias];
+    }
+}
+exports.Neuron = Neuron;
+function randomWeight() {
+    return Math.random() * 2 - 1;
+}
+//# sourceMappingURL=Neuron.js.map

package/dist/nn/Neuron.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Neuron.js","sourceRoot":"","sources":["../../src/nn/Neuron.ts"],"names":[],"mappings":";;;AAAA,yCAA2C;AAI3C;;GAEG;AACH,MAAa,MAAM;IAUjB;;;;OAIG;IACH,YAAY,SAAiB,EAAE,aAAyB,MAAM;QAC5D,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,IAAA,WAAG,EAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QAC5E,IAAI,CAAC,IAAI,GAAG,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,MAAe;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CACb,YAAY,IAAI,CAAC,OAAO,CAAC,MAAM,qBAAqB,MAAM,CAAC,MAAM,EAAE,CACpE,CAAC;QACJ,CAAC;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;QACrD,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;QAErD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,UAAU;QACf,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;CACF;AApDD,wBAoDC;AAED,SAAS,YAAY;IACnB,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;AAC/B,CAAC"}

package/dist/nn/index.d.ts

@@ -0,0 +1,6 @@
+export { Value, val } from '../core/Value';
+export { MLP } from './MLP';
+export { mse } from './loss';
+export { sgd } from './optim';
+export type { Activation } from './Neuron';
+//# sourceMappingURL=index.d.ts.map

package/dist/nn/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/nn/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAC5B,OAAO,EAAE,GAAG,EAAE,MAAM,QAAQ,CAAC;AAC7B,OAAO,EAAE,GAAG,EAAE,MAAM,SAAS,CAAC;AAC9B,YAAY,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC"}

package/dist/nn/index.js

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sgd = exports.mse = exports.MLP = exports.val = exports.Value = void 0;
+var Value_1 = require("../core/Value");
+Object.defineProperty(exports, "Value", { enumerable: true, get: function () { return Value_1.Value; } });
+Object.defineProperty(exports, "val", { enumerable: true, get: function () { return Value_1.val; } });
+var MLP_1 = require("./MLP");
+Object.defineProperty(exports, "MLP", { enumerable: true, get: function () { return MLP_1.MLP; } });
+var loss_1 = require("./loss");
+Object.defineProperty(exports, "mse", { enumerable: true, get: function () { return loss_1.mse; } });
+var optim_1 = require("./optim");
+Object.defineProperty(exports, "sgd", { enumerable: true, get: function () { return optim_1.sgd; } });
+//# sourceMappingURL=index.js.map

package/dist/nn/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/nn/index.ts"],"names":[],"mappings":";;;AAAA,uCAA2C;AAAlC,8FAAA,KAAK,OAAA;AAAE,4FAAA,GAAG,OAAA;AAEnB,6BAA4B;AAAnB,0FAAA,GAAG,OAAA;AACZ,+BAA6B;AAApB,2FAAA,GAAG,OAAA;AACZ,iCAA8B;AAArB,4FAAA,GAAG,OAAA"}

package/dist/nn/loss.d.ts

@@ -0,0 +1,9 @@
+import { Value } from '../core/Value';
+/**
+ * Computes mean squared error between predictions and targets.
+ * @param predictions Model predictions.
+ * @param targets Expected values.
+ * @returns Scalar loss value.
+ */
+export declare function mse(predictions: Value[], targets: number[]): Value;
+//# sourceMappingURL=loss.d.ts.map

package/dist/nn/loss.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loss.d.ts","sourceRoot":"","sources":["../../src/nn/loss.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAO,MAAM,eAAe,CAAC;AAE3C;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAelE"}

package/dist/nn/loss.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mse = mse;
+const Value_1 = require("../core/Value");
+/**
+ * Computes mean squared error between predictions and targets.
+ * @param predictions Model predictions.
+ * @param targets Expected values.
+ * @returns Scalar loss value.
+ */
+function mse(predictions, targets) {
+    if (predictions.length !== targets.length) {
+        throw new Error(`Expected ${predictions.length} targets, received ${targets.length}`);
+    }
+    let loss = (0, Value_1.val)(0);
+    for (let i = 0; i < predictions.length; i++) {
+        const diff = predictions[i].sub(targets[i]);
+        loss = loss.add(diff.pow(2));
+    }
+    return loss.div(predictions.length);
+}
+//# sourceMappingURL=loss.js.map

package/dist/nn/loss.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loss.js","sourceRoot":"","sources":["../../src/nn/loss.ts"],"names":[],"mappings":";;AAQA,kBAeC;AAvBD,yCAA2C;AAE3C;;;;;GAKG;AACH,SAAgB,GAAG,CAAC,WAAoB,EAAE,OAAiB;IACzD,IAAI,WAAW,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CACb,YAAY,WAAW,CAAC,MAAM,sBAAsB,OAAO,CAAC,MAAM,EAAE,CACrE,CAAC;IACJ,CAAC;IAED,IAAI,IAAI,GAAG,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC;IAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;AACtC,CAAC"}

package/dist/nn/optim.d.ts

@@ -0,0 +1,8 @@
+import { Value } from '../core/Value';
+/**
+ * Updates parameters using stochastic gradient descent.
+ * @param parameters Trainable parameters.
+ * @param learningRate Optimization step size.
+ */
+export declare function sgd(parameters: Value[], learningRate: number): void;
+//# sourceMappingURL=optim.d.ts.map

package/dist/nn/optim.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"optim.d.ts","sourceRoot":"","sources":["../../src/nn/optim.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAEtC;;;;GAIG;AACH,wBAAgB,GAAG,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,YAAY,EAAE,MAAM,GAAG,IAAI,CAInE"}

package/dist/nn/optim.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sgd = sgd;
+/**
+ * Updates parameters using stochastic gradient descent.
+ * @param parameters Trainable parameters.
+ * @param learningRate Optimization step size.
+ */
+function sgd(parameters, learningRate) {
+    for (const parameter of parameters) {
+        parameter.data -= learningRate * parameter.grad;
+    }
+}
+//# sourceMappingURL=optim.js.map

package/dist/nn/optim.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"optim.js","sourceRoot":"","sources":["../../src/nn/optim.ts"],"names":[],"mappings":";;AAOA,kBAIC;AATD;;;;GAIG;AACH,SAAgB,GAAG,CAAC,UAAmB,EAAE,YAAoB;IAC3D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,SAAS,CAAC,IAAI,IAAI,YAAY,GAAG,SAAS,CAAC,IAAI,CAAC;IAClD,CAAC;AACH,CAAC"}

package/package.json

@@ -0,0 +1,35 @@
+{
+  "name": "autograd-ts",
+  "version": "0.1.0",
+  "description": "A tiny reverse-mode automatic differentiation engine in TypeScript",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "files": ["dist", "README.md", "LICENSE"],
+  "scripts": {
+    "build": "tsc",
+    "dev": "vitest run tests/value.test.ts",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "prepublishOnly": "npm run build && npm run test"
+  },
+  "keywords": [
+    "autograd",
+    "machine-learning",
+    "neural-networks",
+    "automatic-differentiation",
+    "typescript"
+  ],
+  "author": "Eyas Ranjous <eyas.ranjous@gmail.com>",
+  "license": "MIT",
+  "devDependencies": {
+    "@types/node": "^20.0.0",
+    "typescript": "^5.3.0",
+    "vitest": "^2.0.0"
+  }
+}