mini-jstorch 1.4.2 → 1.4.3

package/README.md

@@ -6,7 +6,7 @@ A lightweight JavaScript neural network library for rapid frontend AI experiment
 
 Mini-JSTorch is a high-performance, minimalist JavaScript library for building neural networks. It runs efficiently in both frontend and backend environments, including low-end devices. The library enables quick experimentation and learning in AI without compromising stability, accuracy, or training reliability.
 
-This release, **version 1.4.3**, we introduces **learning rate schedulers**, improved testing/demo templates, and other minor enhancements.
+This release, **version 1.4.3**, We make `Matrix Utils` now can be used in others Files.
 
 ---
 
@@ -33,7 +33,7 @@ This release, **version 1.4.3**, we introduces **learning rate schedulers**, imp
 - **Activations:** ReLU, Sigmoid, Tanh, LeakyReLU, GELU, Mish, SiLU, ELU  
 - **Loss Functions:** MSELoss, CrossEntropyLoss
 - **Optimizers:** Adam, SGD  
-- **Schedulers:** StepLR, LambdaLR  
+- **Schedulers:** StepLR, LambdaLR  , ReduceLROnPlateau
 - **Regularization:** Dropout, BatchNorm2D  
 - **Utilities:** zeros, randomMatrix, softmax, crossEntropy, dot, addMatrices, reshape, stack, flatten, eye, concat  
 - **Model Container:** Sequential (for stacking layers with forward/backward passes)  
@@ -133,4 +133,24 @@ node tests/scheduler.js
 
 # License
 
-**MIT © 2025 Rizal**
+`MIT License`
+
+**Copyright (c) 2025 rizal-editors**
+
+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/package.json

@@ -1,6 +1,6 @@
 {
   "name": "mini-jstorch",
-  "version": "1.4.2",
+  "version": "1.4.3",
   "type": "module", 
   "description": "A lightweight JavaScript neural network library for rapid frontend AI experimentation on low-resource devices Inspired by PyTorch.",
   "main": "index.js",

package/src/MainEngine.js

@@ -1,17 +1,77 @@
+/*!
+ * Project: mini-jstorch
+ * File: MainEngine.js
+ * Author: M. Rizal H. (Actual Author Name)
+ * License: MIT
+ * Copyright (C) 2025 M. Rizal H.
+ *
+ * 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.
+ */
 
-// OFFICIAL MINI-JSTORCH ENGINE
-// LICENSED UNDER MIT LICENSE
-// MIT (C) Rizal 2025
 
 // ---------------------- Utilities ----------------------
-function zeros(rows, cols) { return Array.from({length:rows},()=>Array(cols).fill(0)); }
-function ones(rows, cols) { return Array.from({length:rows},()=>Array(cols).fill(1)); }
-function randomMatrix(rows, cols, scale=0.1){ return Array.from({length:rows},()=>Array.from({length:cols},()=> (Math.random()*2-1)*scale)); }
-function transpose(matrix){ return matrix[0].map((_,i)=>matrix.map(row=>row[i])); }
-function addMatrices(a,b){ return a.map((row,i)=>row.map((v,j)=>v+(b[i] && b[i][j]!==undefined?b[i][j]:0))); }
-function dot(a,b){ const res=zeros(a.length,b[0].length); for(let i=0;i<a.length;i++) for(let j=0;j<b[0].length;j++) for(let k=0;k<a[0].length;k++) res[i][j]+=a[i][k]*b[k][j]; return res; }
-function softmax(x){ const m=Math.max(...x); const exps=x.map(v=>Math.exp(v-m)); const s=exps.reduce((a,b)=>a+b,0); return exps.map(v=>v/s); }
-function crossEntropy(pred,target){ const eps=1e-12; return -target.reduce((sum,t,i)=>sum+t*Math.log(pred[i]+eps),0); }
+export function zeros(rows, cols) { 
+    return Array.from({length:rows},()=>Array(cols).fill(0)); 
+}
+
+export function ones(rows, cols) { 
+    return Array.from({length:rows},()=>Array(cols).fill(1)); 
+}
+
+export function randomMatrix(rows, cols, scale=0.1){ 
+    return Array.from({length:rows},()=>
+        Array.from({length:cols},()=> (Math.random()*2-1)*scale)
+    ); 
+}
+
+export function transpose(matrix){ 
+    return matrix[0].map((_,i)=>matrix.map(row=>row[i])); 
+}
+
+export function addMatrices(a,b){ 
+    return a.map((row,i)=>
+        row.map((v,j)=>v+(b[i] && b[i][j]!==undefined?b[i][j]:0))
+    ); 
+}
+
+export function dot(a,b){ 
+    const res=zeros(a.length,b[0].length); 
+    for(let i=0;i<a.length;i++) 
+        for(let j=0;j<b[0].length;j++) 
+            for(let k=0;k<a[0].length;k++) 
+                res[i][j]+=a[i][k]*b[k][j]; 
+    return res; 
+}
+
+export function softmax(x){ 
+    const m=Math.max(...x); 
+    const exps=x.map(v=>Math.exp(v-m)); 
+    const s=exps.reduce((a,b)=>a+b,0); 
+    return exps.map(v=>v/s); 
+}
+
+export function crossEntropy(pred,target){ 
+    const eps=1e-12; 
+    return -target.reduce((sum,t,i)=>sum+t*Math.log(pred[i]+eps),0); 
+}
+/* Not Added more Utils yet. (this patch not MINOR)
+   Just make it Public to other files. */ 
 
 // ---------------------- Tensor ----------------------
 export class Tensor {
@@ -243,6 +303,7 @@ export class StepLR {
 
     get_lr() {
         return this.optimizer.lr;
+		/* Do nothing else */
     }
 }
 
@@ -261,6 +322,7 @@ export class LambdaLR {
 
     get_lr() {
         return this.optimizer.lr;
+		/* Do nothing else */
     }
 }
 
@@ -573,6 +635,7 @@ export function saveModel(model){
     if(!(model instanceof Sequential)) throw new Error("saveModel supports only Sequential");
     const weights=model.layers.map(layer=>({weights:layer.W||null,biases:layer.b||null}));
     return JSON.stringify(weights);
+	/* Didn't expect this to work */
 }
 
 export function loadModel(model,json){
@@ -582,6 +645,7 @@ export function loadModel(model,json){
         if(layer.W && weights[i].weights) layer.W=weights[i].weights;
         if(layer.b && weights[i].biases) layer.b=weights[i].biases;
     });
+	/* Didn't expect this to work */
 }
 
 // ---------------------- Advanced Utils ----------------------
@@ -590,10 +654,10 @@ export function stack(tensors){ return tensors.map(t=>t.data); }
 export function eye(n){ return Array.from({length:n},(_,i)=>Array.from({length:n},(_,j)=>i===j?1:0)); }
 export function concat(a,b,axis=0){ /* concat along axis */ if(axis===0) return [...a,...b]; if(axis===1) return a.map((row,i)=>[...row,...b[i]]); }
 export function reshape(tensor, rows, cols) {
-    let flat = tensor.data.flat(); // flatten
+    let flat = tensor.data.flat(); // flatten first
     if(flat.length < rows*cols) throw new Error("reshape size mismatch");
     const out = Array.from({length: rows}, (_, i) =>
         flat.slice(i*cols, i*cols + cols)
     );
     return out;
-}
+}