agentdb 1.6.0 → 2.0.0-alpha.1

package/dist/malp/models/regressor.js

@@ -0,0 +1,229 @@
+/**
+ * MALP Regressor - Maximum Agreement Linear Program
+ *
+ * Linear regression that maximizes concordance correlation coefficient
+ * instead of minimizing squared error.
+ */
+import { calculateCCC } from '../core/ccc';
+import { MALPOptimizer } from '../core/optimizer';
+export const DEFAULT_MALP_CONFIG = {
+    learningRate: 0.01,
+    maxIterations: 1000,
+    tolerance: 1e-6,
+    momentum: 0.9,
+    adaptive: true,
+    verbose: false,
+    fitIntercept: true,
+    normalize: false,
+    regularization: 0.0
+};
+export class MALPRegressor {
+    weights = [];
+    intercept = 0;
+    optimizer;
+    config;
+    xMean = [];
+    xStd = [];
+    fitted = false;
+    constructor(config = {}) {
+        this.config = {
+            learningRate: config.learningRate ?? 0.01,
+            maxIterations: config.maxIterations ?? 1000,
+            tolerance: config.tolerance ?? 1e-6,
+            momentum: config.momentum ?? 0.9,
+            adaptive: config.adaptive ?? true,
+            verbose: config.verbose ?? false,
+            fitIntercept: config.fitIntercept ?? true,
+            normalize: config.normalize ?? false,
+            regularization: config.regularization ?? 0.0
+        };
+        this.optimizer = new MALPOptimizer({
+            learningRate: this.config.learningRate,
+            maxIterations: this.config.maxIterations,
+            tolerance: this.config.tolerance,
+            momentum: this.config.momentum,
+            adaptive: this.config.adaptive,
+            verbose: this.config.verbose
+        });
+    }
+    /**
+     * Fit MALP regressor to training data
+     * @param X Feature matrix (n_samples × n_features)
+     * @param y Target values (n_samples)
+     */
+    fit(X, y) {
+        if (X.length !== y.length) {
+            throw new Error(`Sample size mismatch: X has ${X.length}, y has ${y.length}`);
+        }
+        if (X.length === 0) {
+            throw new Error('Cannot fit with empty dataset');
+        }
+        // Normalize features if requested
+        let XProcessed = X;
+        if (this.config.normalize) {
+            const result = this.normalizeFeatures(X);
+            XProcessed = result.normalized;
+            this.xMean = result.mean;
+            this.xStd = result.std;
+        }
+        // Add intercept column if requested
+        if (this.config.fitIntercept) {
+            XProcessed = XProcessed.map(row => [1, ...row]);
+        }
+        // Optimize weights to maximize CCC
+        const optimResult = this.optimizer.optimize(XProcessed, y);
+        // Extract weights and intercept
+        if (this.config.fitIntercept) {
+            this.intercept = optimResult.weights[0];
+            this.weights = optimResult.weights.slice(1);
+        }
+        else {
+            this.intercept = 0;
+            this.weights = optimResult.weights;
+        }
+        this.fitted = true;
+        // Compute final metrics
+        const yPred = this.predict(X);
+        const metrics = this.computeMetrics(y, yPred);
+        return {
+            weights: this.weights,
+            intercept: this.intercept,
+            ccc: optimResult.finalCCC,
+            r2: metrics.r2,
+            rmse: metrics.rmse,
+            mae: metrics.mae,
+            iterations: optimResult.iterations,
+            converged: optimResult.converged
+        };
+    }
+    /**
+     * Predict target values for new data
+     * @param X Feature matrix (n_samples × n_features)
+     */
+    predict(X) {
+        if (!this.fitted) {
+            throw new Error('Model must be fitted before prediction');
+        }
+        if (X[0].length !== this.weights.length) {
+            throw new Error(`Feature dimension mismatch: expected ${this.weights.length}, got ${X[0].length}`);
+        }
+        return X.map(row => {
+            let xProcessed = row;
+            // Apply normalization if used during training
+            if (this.config.normalize) {
+                xProcessed = row.map((val, j) => (val - this.xMean[j]) / this.xStd[j]);
+            }
+            // Compute prediction
+            const prediction = xProcessed.reduce((sum, val, j) => sum + val * this.weights[j], this.intercept);
+            return prediction;
+        });
+    }
+    /**
+     * Score the model on test data
+     * @param X Feature matrix
+     * @param y True target values
+     * @returns CCC score
+     */
+    score(X, y) {
+        const yPred = this.predict(X);
+        const result = calculateCCC(yPred, y);
+        return result.ccc;
+    }
+    /**
+     * Get model coefficients
+     */
+    getCoefficients() {
+        if (!this.fitted) {
+            throw new Error('Model not fitted');
+        }
+        return {
+            weights: [...this.weights],
+            intercept: this.intercept
+        };
+    }
+    /**
+     * Normalize features (zero mean, unit variance)
+     */
+    normalizeFeatures(X) {
+        const nFeatures = X[0].length;
+        const mean = Array(nFeatures).fill(0);
+        const std = Array(nFeatures).fill(0);
+        // Compute means
+        for (const row of X) {
+            for (let j = 0; j < nFeatures; j++) {
+                mean[j] += row[j];
+            }
+        }
+        for (let j = 0; j < nFeatures; j++) {
+            mean[j] /= X.length;
+        }
+        // Compute standard deviations
+        for (const row of X) {
+            for (let j = 0; j < nFeatures; j++) {
+                std[j] += (row[j] - mean[j]) ** 2;
+            }
+        }
+        for (let j = 0; j < nFeatures; j++) {
+            std[j] = Math.sqrt(std[j] / X.length);
+            if (std[j] === 0)
+                std[j] = 1; // Prevent division by zero
+        }
+        // Normalize
+        const normalized = X.map(row => row.map((val, j) => (val - mean[j]) / std[j]));
+        return { normalized, mean, std };
+    }
+    /**
+     * Compute evaluation metrics
+     */
+    computeMetrics(yTrue, yPred) {
+        const n = yTrue.length;
+        const yMean = yTrue.reduce((sum, val) => sum + val, 0) / n;
+        let ssRes = 0;
+        let ssTot = 0;
+        let sumAbsError = 0;
+        for (let i = 0; i < n; i++) {
+            const error = yTrue[i] - yPred[i];
+            ssRes += error * error;
+            ssTot += (yTrue[i] - yMean) ** 2;
+            sumAbsError += Math.abs(error);
+        }
+        const r2 = 1 - (ssRes / ssTot);
+        const rmse = Math.sqrt(ssRes / n);
+        const mae = sumAbsError / n;
+        return { r2, rmse, mae };
+    }
+}
+/**
+ * Cross-validation for MALP regressor
+ */
+export function crossValidateMALP(X, y, nFolds = 5, config = {}) {
+    const n = X.length;
+    const foldSize = Math.floor(n / nFolds);
+    const scores = [];
+    for (let fold = 0; fold < nFolds; fold++) {
+        const testStart = fold * foldSize;
+        const testEnd = fold === nFolds - 1 ? n : testStart + foldSize;
+        // Split data
+        const XTrain = [...X.slice(0, testStart), ...X.slice(testEnd)];
+        const yTrain = [...y.slice(0, testStart), ...y.slice(testEnd)];
+        const XTest = X.slice(testStart, testEnd);
+        const yTest = y.slice(testStart, testEnd);
+        // Fit and score
+        const model = new MALPRegressor(config);
+        model.fit(XTrain, yTrain);
+        const score = model.score(XTest, yTest);
+        scores.push(score);
+    }
+    const meanCCC = scores.reduce((sum, s) => sum + s, 0) / nFolds;
+    const variance = scores.reduce((sum, s) => sum + (s - meanCCC) ** 2, 0) / nFolds;
+    const stdCCC = Math.sqrt(variance);
+    return { meanCCC, stdCCC, foldScores: scores };
+}
+/**
+ * Convenience function to fit a MALP model
+ */
+export function fitMALP(X, y, config = {}) {
+    const model = new MALPRegressor(config);
+    return model.fit(X, y);
+}
+//# sourceMappingURL=regressor.js.map

package/dist/malp/models/regressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regressor.js","sourceRoot":"","sources":["../../../src/malp/models/regressor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,YAAY,EAAa,MAAM,aAAa,CAAC;AACtD,OAAO,EAAE,aAAa,EAAoC,MAAM,mBAAmB,CAAC;AAWpF,MAAM,CAAC,MAAM,mBAAmB,GAAkC;IAChE,YAAY,EAAE,IAAI;IAClB,aAAa,EAAE,IAAI;IACnB,SAAS,EAAE,IAAI;IACf,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,IAAI;IACd,OAAO,EAAE,KAAK;IACd,YAAY,EAAE,IAAI;IAClB,SAAS,EAAE,KAAK;IAChB,cAAc,EAAE,GAAG;CACpB,CAAC;AAaF,MAAM,OAAO,aAAa;IAChB,OAAO,GAAa,EAAE,CAAC;IACvB,SAAS,GAAW,CAAC,CAAC;IACtB,SAAS,CAAgB;IACzB,MAAM,CAAgC;IACtC,KAAK,GAAa,EAAE,CAAC;IACrB,IAAI,GAAa,EAAE,CAAC;IACpB,MAAM,GAAY,KAAK,CAAC;IAEhC,YAAY,SAA8B,EAAE;QAC1C,IAAI,CAAC,MAAM,GAAG;YACZ,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,IAAI;YACzC,aAAa,EAAE,MAAM,CAAC,aAAa,IAAI,IAAI;YAC3C,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI;YACnC,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,GAAG;YAChC,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,IAAI;YACjC,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,KAAK;YAChC,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,IAAI;YACzC,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,KAAK;YACpC,cAAc,EAAE,MAAM,CAAC,cAAc,IAAI,GAAG;SAC7C,CAAC;QAEF,IAAI,CAAC,SAAS,GAAG,IAAI,aAAa,CAAC;YACjC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;YACtC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;YACxC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;YAChC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ;YAC9B,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ;YAC9B,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;SAC7B,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,CAAa,EAAE,CAAW;QAC5B,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC,MAAM,WAAW,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAChF,CAAC;QAED,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACnD,CAAC;QAED,kCAAkC;QAClC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACzC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;QACzB,CAAC;QAED,oCAAoC;QACpC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7B,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,mCAAmC;QACnC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAE3D,gCAAgC;QAChC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,wBAAwB;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAE9C,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,GAAG,EAAE,WAAW,CAAC,QAAQ;YACzB,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,IAAI,EAAE,OAAO,CAAC,IAAI;YAClB,GAAG,EAAE,OAAO,CAAC,GAAG;YAChB,UAAU,EAAE,WAAW,CAAC,UAAU;YAClC,SAAS,EAAE,WAAW,CAAC,SAAS;SACjC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,CAAa;QACnB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CACb,wCAAwC,IAAI,CAAC,OAAO,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAClF,CAAC;QACJ,CAAC;QAED,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,IAAI,UAAU,GAAG,GAAG,CAAC;YAErB,8CAA8C;YAC9C,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;gBAC1B,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAC9B,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CACrC,CAAC;YACJ,CAAC;YAED,qBAAqB;YACrB,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC5C,IAAI,CAAC,SAAS,CACf,CAAC;YAEF,OAAO,UAAU,CAAC;QACpB,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,CAAa,EAAE,CAAW;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,eAAe;QACb,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;QACtC,CAAC;QACD,OAAO;YACL,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;YAC1B,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAa;QAKrC,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAErC,gBAAgB;QAChB,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QACtB,CAAC;QAED,8BAA8B;QAC9B,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,2BAA2B;QAC3D,CAAC;QAED,YAAY;QACZ,MAAM,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAC9C,CAAC;QAEF,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAe,EAAE,KAAe;QAKrD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAE3D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAClC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC;YACvB,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACjC,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,WAAW,GAAG,CAAC,CAAC;QAE5B,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IAC3B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,CAAa,EACb,CAAW,EACX,SAAiB,CAAC,EAClB,SAA8B,EAAE;IAMhC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IACxC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,GAAG,QAAQ,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,QAAQ,CAAC;QAE/D,aAAa;QACb,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE1C,gBAAgB;QAChB,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;QACxC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;IAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;IACjF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAEnC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CACrB,CAAa,EACb,CAAW,EACX,SAA8B,EAAE;IAEhC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC"}

package/dist/malp/reasoningbank_validator.d.ts

@@ -0,0 +1,187 @@
+/**
+ * MALP Pattern Validator for ReasoningBank
+ *
+ * TypeScript integration for concordance-based pattern quality assessment
+ * and automatic pruning of low-quality patterns.
+ */
+import type { Vector } from './core/linalg';
+/**
+ * Agreement level classification based on CCC value
+ */
+export declare enum AgreementLevel {
+    Poor = "Poor",
+    Moderate = "Moderate",
+    Substantial = "Substantial",
+    AlmostPerfect = "AlmostPerfect"
+}
+/**
+ * Pattern quality metrics based on concordance
+ */
+export interface PatternQuality {
+    /** Concordance Correlation Coefficient (-1 to 1) */
+    ccc: number;
+    /** Number of observations used */
+    sampleSize: number;
+    /** Agreement level classification */
+    agreementLevel: AgreementLevel;
+    /** Timestamp of assessment */
+    assessedAt: number;
+    /** Additional quality metrics */
+    metrics: QualityMetrics;
+}
+/**
+ * Additional quality metrics for pattern validation
+ */
+export interface QualityMetrics {
+    /** Pearson correlation coefficient */
+    correlation: number;
+    /** Mean prediction error */
+    meanError: number;
+    /** Standard deviation of errors */
+    stdError: number;
+    /** Location shift component */
+    locationShift: number;
+    /** Scale shift component */
+    scaleShift: number;
+    /** Precision (correlation component) */
+    precision: number;
+    /** Accuracy (bias correction component) */
+    accuracy: number;
+}
+/**
+ * Pruning statistics from pattern bank optimization
+ */
+export interface PruningStats {
+    /** Total patterns evaluated */
+    totalEvaluated: number;
+    /** Number pruned (removed) */
+    prunedCount: number;
+    /** Number retained */
+    retainedCount: number;
+    /** Average CCC of retained patterns */
+    avgRetainedCcc: number;
+    /** Average CCC of pruned patterns */
+    avgPrunedCcc: number;
+    /** Threshold used for pruning */
+    threshold: number;
+}
+/**
+ * Cache statistics for quality assessments
+ */
+export interface CacheStats {
+    /** Total cached assessments */
+    totalCached: number;
+    /** Distribution by agreement level */
+    agreementDistribution: Record<AgreementLevel, number>;
+}
+/**
+ * Pattern interface (minimal required fields)
+ */
+export interface Pattern {
+    id: string;
+    successScore?: number;
+    [key: string]: any;
+}
+/**
+ * Default minimum CCC threshold (0.90 = 90% agreement)
+ */
+export declare const DEFAULT_MIN_CCC = 0.9;
+/**
+ * MALP Pattern Validator for ReasoningBank
+ *
+ * Provides concordance-based quality assessment and automatic pruning
+ * to maintain high-quality pattern banks.
+ */
+export declare class MALPPatternValidator {
+    private minCccThreshold;
+    private autoPrune;
+    private qualityCache;
+    /**
+     * Create a new MALP pattern validator
+     *
+     * @param minCccThreshold - Minimum CCC threshold (default: 0.90)
+     */
+    constructor(minCccThreshold?: number);
+    /**
+     * Validate pattern utility using concordance correlation
+     *
+     * @param pattern - Pattern to validate
+     * @param observed - Observed/actual values
+     * @param predicted - Predicted values from pattern
+     * @returns Pattern quality assessment
+     */
+    validatePatternUtility(pattern: Pattern, observed: Vector, predicted: Vector): PatternQuality;
+    /**
+     * Optimize pattern bank by pruning low-quality patterns
+     *
+     * @param patterns - Patterns to evaluate
+     * @returns Tuple of [retained patterns, pruning statistics]
+     */
+    optimizePatternBank(patterns: Pattern[]): [Pattern[], PruningStats];
+    /**
+     * Get quality assessment for a specific pattern
+     *
+     * @param patternId - Pattern ID
+     * @returns Quality assessment if available
+     */
+    getPatternQuality(patternId: string): PatternQuality | undefined;
+    /**
+     * Clear the quality cache
+     */
+    clearCache(): void;
+    /**
+     * Get cache statistics
+     *
+     * @returns Statistics about cached quality assessments
+     */
+    getCacheStats(): CacheStats;
+    /**
+     * Set minimum CCC threshold
+     *
+     * @param threshold - New threshold (0-1)
+     */
+    setMinCccThreshold(threshold: number): void;
+    /**
+     * Get current minimum CCC threshold
+     */
+    getMinCccThreshold(): number;
+    /**
+     * Enable or disable auto-pruning
+     *
+     * @param enabled - Whether to enable auto-pruning
+     */
+    setAutoPrune(enabled: boolean): void;
+    /**
+     * Check if auto-pruning is enabled
+     */
+    isAutoPruneEnabled(): boolean;
+    /**
+     * Classify agreement level based on CCC value
+     *
+     * @param ccc - Concordance correlation coefficient
+     * @returns Agreement level classification
+     */
+    private classifyAgreement;
+    /**
+     * Get human-readable interpretation of a CCC value
+     *
+     * @param ccc - Concordance correlation coefficient
+     * @returns Human-readable interpretation
+     */
+    static interpretCCC(ccc: number): string;
+}
+/**
+ * Create a default MALP validator instance
+ */
+export declare function createDefaultValidator(): MALPPatternValidator;
+/**
+ * Utility function to validate a single pattern
+ *
+ * @param pattern - Pattern to validate
+ * @param observed - Observed values
+ * @param predicted - Predicted values
+ * @param threshold - Minimum CCC threshold (default: 0.90)
+ * @returns true if pattern meets quality threshold
+ */
+export declare function validatePattern(pattern: Pattern, observed: Vector, predicted: Vector, threshold?: number): boolean;
+//# sourceMappingURL=reasoningbank_validator.d.ts.map

package/dist/malp/reasoningbank_validator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reasoningbank_validator.d.ts","sourceRoot":"","sources":["../../src/malp/reasoningbank_validator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAE5C;;GAEG;AACH,oBAAY,cAAc;IACxB,IAAI,SAAS;IACb,QAAQ,aAAa;IACrB,WAAW,gBAAgB;IAC3B,aAAa,kBAAkB;CAChC;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,oDAAoD;IACpD,GAAG,EAAE,MAAM,CAAC;IACZ,kCAAkC;IAClC,UAAU,EAAE,MAAM,CAAC;IACnB,qCAAqC;IACrC,cAAc,EAAE,cAAc,CAAC;IAC/B,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,iCAAiC;IACjC,OAAO,EAAE,cAAc,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,sCAAsC;IACtC,WAAW,EAAE,MAAM,CAAC;IACpB,4BAA4B;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,mCAAmC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,+BAA+B;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB,2CAA2C;IAC3C,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,+BAA+B;IAC/B,cAAc,EAAE,MAAM,CAAC;IACvB,8BAA8B;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,sBAAsB;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,uCAAuC;IACvC,cAAc,EAAE,MAAM,CAAC;IACvB,qCAAqC;IACrC,YAAY,EAAE,MAAM,CAAC;IACrB,iCAAiC;IACjC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,+BAA+B;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,sCAAsC;IACtC,qBAAqB,EAAE,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;CACvD;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;CACpB;AAED;;GAEG;AACH,eAAO,MAAM,eAAe,MAAO,CAAC;AAEpC;;;;;GAKG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,YAAY,CAA8B;IAElD;;;;OAIG;gBACS,eAAe,GAAE,MAAwB;IAMrD;;;;;;;OAOG;IACH,sBAAsB,CACpB,OAAO,EAAE,OAAO,EAChB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,GAChB,cAAc;IAwCjB;;;;;OAKG;IACH,mBAAmB,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,EAAE,YAAY,CAAC;IAiDnE;;;;;OAKG;IACH,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAIhE;;OAEG;IACH,UAAU,IAAI,IAAI;IAIlB;;;;OAIG;IACH,aAAa,IAAI,UAAU;IAkB3B;;;;OAIG;IACH,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IAI3C;;OAEG;IACH,kBAAkB,IAAI,MAAM;IAI5B;;;;OAIG;IACH,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI;IAIpC;;OAEG;IACH,kBAAkB,IAAI,OAAO;IAI7B;;;;;OAKG;IACH,OAAO,CAAC,iBAAiB;IAczB;;;;;OAKG;IACH,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;CAGzC;AAED;;GAEG;AACH,wBAAgB,sBAAsB,IAAI,oBAAoB,CAE7D;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,OAAO,EAChB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,SAAS,GAAE,MAAwB,GAClC,OAAO,CAIT"}

package/dist/malp/reasoningbank_validator.js

@@ -0,0 +1,246 @@
+/**
+ * MALP Pattern Validator for ReasoningBank
+ *
+ * TypeScript integration for concordance-based pattern quality assessment
+ * and automatic pruning of low-quality patterns.
+ */
+import { computeCCC, interpretCCC } from './core/ccc';
+/**
+ * Agreement level classification based on CCC value
+ */
+export var AgreementLevel;
+(function (AgreementLevel) {
+    AgreementLevel["Poor"] = "Poor";
+    AgreementLevel["Moderate"] = "Moderate";
+    AgreementLevel["Substantial"] = "Substantial";
+    AgreementLevel["AlmostPerfect"] = "AlmostPerfect";
+})(AgreementLevel || (AgreementLevel = {}));
+/**
+ * Default minimum CCC threshold (0.90 = 90% agreement)
+ */
+export const DEFAULT_MIN_CCC = 0.90;
+/**
+ * MALP Pattern Validator for ReasoningBank
+ *
+ * Provides concordance-based quality assessment and automatic pruning
+ * to maintain high-quality pattern banks.
+ */
+export class MALPPatternValidator {
+    minCccThreshold;
+    autoPrune;
+    qualityCache;
+    /**
+     * Create a new MALP pattern validator
+     *
+     * @param minCccThreshold - Minimum CCC threshold (default: 0.90)
+     */
+    constructor(minCccThreshold = DEFAULT_MIN_CCC) {
+        this.minCccThreshold = Math.max(0, Math.min(1, minCccThreshold));
+        this.autoPrune = true;
+        this.qualityCache = new Map();
+    }
+    /**
+     * Validate pattern utility using concordance correlation
+     *
+     * @param pattern - Pattern to validate
+     * @param observed - Observed/actual values
+     * @param predicted - Predicted values from pattern
+     * @returns Pattern quality assessment
+     */
+    validatePatternUtility(pattern, observed, predicted) {
+        if (observed.length !== predicted.length) {
+            throw new Error(`Vector length mismatch: observed=${observed.length}, predicted=${predicted.length}`);
+        }
+        if (observed.length < 2) {
+            throw new Error('Need at least 2 samples to compute CCC');
+        }
+        // Compute concordance correlation coefficient
+        const { ccc, components } = computeCCC(observed, predicted);
+        // Classify agreement level
+        const agreementLevel = this.classifyAgreement(ccc);
+        // Create quality assessment
+        const quality = {
+            ccc,
+            sampleSize: observed.length,
+            agreementLevel,
+            assessedAt: Date.now(),
+            metrics: {
+                correlation: components.rho,
+                meanError: components.muX - components.muY,
+                stdError: Math.abs(components.sigmaX - components.sigmaY),
+                locationShift: components.locationShift,
+                scaleShift: components.scaleShift,
+                precision: components.precision,
+                accuracy: components.accuracy,
+            },
+        };
+        // Cache the assessment
+        this.qualityCache.set(pattern.id, quality);
+        return quality;
+    }
+    /**
+     * Optimize pattern bank by pruning low-quality patterns
+     *
+     * @param patterns - Patterns to evaluate
+     * @returns Tuple of [retained patterns, pruning statistics]
+     */
+    optimizePatternBank(patterns) {
+        const totalEvaluated = patterns.length;
+        const retained = [];
+        const prunedCccs = [];
+        const retainedCccs = [];
+        for (const pattern of patterns) {
+            const quality = this.qualityCache.get(pattern.id);
+            if (quality) {
+                // Use cached quality assessment
+                if (quality.ccc >= this.minCccThreshold) {
+                    retainedCccs.push(quality.ccc);
+                    retained.push(pattern);
+                }
+                else {
+                    prunedCccs.push(quality.ccc);
+                }
+            }
+            else {
+                // No quality data - use success_score as fallback
+                // This maintains backward compatibility with existing 93% confidence system
+                const successScore = pattern.successScore ?? 0;
+                if (successScore >= 0.93) {
+                    // 93% success ≈ 0.90 CCC threshold
+                    retainedCccs.push(successScore);
+                    retained.push(pattern);
+                }
+                else {
+                    prunedCccs.push(successScore);
+                }
+            }
+        }
+        const stats = {
+            totalEvaluated,
+            prunedCount: prunedCccs.length,
+            retainedCount: retained.length,
+            avgRetainedCcc: retainedCccs.length > 0
+                ? retainedCccs.reduce((a, b) => a + b, 0) / retainedCccs.length
+                : 0,
+            avgPrunedCcc: prunedCccs.length > 0
+                ? prunedCccs.reduce((a, b) => a + b, 0) / prunedCccs.length
+                : 0,
+            threshold: this.minCccThreshold,
+        };
+        return [retained, stats];
+    }
+    /**
+     * Get quality assessment for a specific pattern
+     *
+     * @param patternId - Pattern ID
+     * @returns Quality assessment if available
+     */
+    getPatternQuality(patternId) {
+        return this.qualityCache.get(patternId);
+    }
+    /**
+     * Clear the quality cache
+     */
+    clearCache() {
+        this.qualityCache.clear();
+    }
+    /**
+     * Get cache statistics
+     *
+     * @returns Statistics about cached quality assessments
+     */
+    getCacheStats() {
+        const distribution = {
+            [AgreementLevel.Poor]: 0,
+            [AgreementLevel.Moderate]: 0,
+            [AgreementLevel.Substantial]: 0,
+            [AgreementLevel.AlmostPerfect]: 0,
+        };
+        for (const quality of this.qualityCache.values()) {
+            distribution[quality.agreementLevel]++;
+        }
+        return {
+            totalCached: this.qualityCache.size,
+            agreementDistribution: distribution,
+        };
+    }
+    /**
+     * Set minimum CCC threshold
+     *
+     * @param threshold - New threshold (0-1)
+     */
+    setMinCccThreshold(threshold) {
+        this.minCccThreshold = Math.max(0, Math.min(1, threshold));
+    }
+    /**
+     * Get current minimum CCC threshold
+     */
+    getMinCccThreshold() {
+        return this.minCccThreshold;
+    }
+    /**
+     * Enable or disable auto-pruning
+     *
+     * @param enabled - Whether to enable auto-pruning
+     */
+    setAutoPrune(enabled) {
+        this.autoPrune = enabled;
+    }
+    /**
+     * Check if auto-pruning is enabled
+     */
+    isAutoPruneEnabled() {
+        return this.autoPrune;
+    }
+    /**
+     * Classify agreement level based on CCC value
+     *
+     * @param ccc - Concordance correlation coefficient
+     * @returns Agreement level classification
+     */
+    classifyAgreement(ccc) {
+        const absCcc = Math.abs(ccc);
+        if (absCcc < 0.90) {
+            return AgreementLevel.Poor;
+        }
+        else if (absCcc < 0.95) {
+            return AgreementLevel.Moderate;
+        }
+        else if (absCcc < 0.99) {
+            return AgreementLevel.Substantial;
+        }
+        else {
+            return AgreementLevel.AlmostPerfect;
+        }
+    }
+    /**
+     * Get human-readable interpretation of a CCC value
+     *
+     * @param ccc - Concordance correlation coefficient
+     * @returns Human-readable interpretation
+     */
+    static interpretCCC(ccc) {
+        return interpretCCC(ccc);
+    }
+}
+/**
+ * Create a default MALP validator instance
+ */
+export function createDefaultValidator() {
+    return new MALPPatternValidator(DEFAULT_MIN_CCC);
+}
+/**
+ * Utility function to validate a single pattern
+ *
+ * @param pattern - Pattern to validate
+ * @param observed - Observed values
+ * @param predicted - Predicted values
+ * @param threshold - Minimum CCC threshold (default: 0.90)
+ * @returns true if pattern meets quality threshold
+ */
+export function validatePattern(pattern, observed, predicted, threshold = DEFAULT_MIN_CCC) {
+    const validator = new MALPPatternValidator(threshold);
+    const quality = validator.validatePatternUtility(pattern, observed, predicted);
+    return quality.ccc >= threshold;
+}
+//# sourceMappingURL=reasoningbank_validator.js.map