agentdb 1.0.12 → 1.1.0

package/dist/plugins/implementations/adversarial-training.mjs

@@ -1,404 +0,0 @@
-/**
- * Adversarial Training Plugin
- *
- * Implements robust learning through adversarial examples generation
- * and training, improving model resilience to perturbations.
- *
- * Key features:
- * - FGSM (Fast Gradient Sign Method)
- * - PGD (Projected Gradient Descent) attacks
- * - Adversarial augmentation
- * - Certified defense mechanisms
- * - Robustness evaluation
- */
-import { BasePlugin } from '../base-plugin.mjs';
-/**
- * Adversarial Training Plugin Implementation
- */
-export class AdversarialTrainingPlugin extends BasePlugin {
-    constructor(config) {
-        super();
-        this.name = 'adversarial-training';
-        this.version = '1.0.0';
-        this.experiences = [];
-        this.attackType = 'fgsm';
-        this.epsilon = 0.1; // Attack strength
-        this.alpha = 0.01; // Step size for iterative attacks
-        this.iterations = 40; // PGD iterations
-        // Training parameters
-        this.adversarialRatio = 0.5; // Mix of clean vs adversarial
-        this.certifiedDefense = false;
-        // Robustness tracking
-        this.robustnessScores = [];
-        this.adversarialExamples = [];
-        if (config) {
-            this.attackType = config.attackType || 'fgsm';
-            this.epsilon = config.epsilon || 0.1;
-            this.alpha = config.alpha || 0.01;
-            this.iterations = config.iterations || 40;
-            this.adversarialRatio = config.adversarialRatio || 0.5;
-        }
-        // Mark as initialized for in-memory operation
-        this.initialized = true;
-    }
-    /**
-     * Override to skip initialization check for in-memory operation
-     */
-    checkInitialized() {
-        // No-op for adversarial training - operates in-memory
-    }
-    /**
-     * Override selectAction to provide base implementation
-     */
-    async selectAction(state, context) {
-        // Simple default action selection
-        const stateArray = Array.isArray(state) ? state : [state];
-        const stateSum = stateArray.reduce((a, b) => a + b, 0);
-        const value = Math.tanh(stateSum / stateArray.length);
-        return {
-            id: String(Math.floor(Math.abs(value) * 10)),
-            embedding: stateArray,
-            confidence: Math.abs(value),
-        };
-    }
-    /**
-     * Override to store experiences in-memory without vectorDB
-     */
-    async storeExperience(experience) {
-        this.experiences.push(experience);
-    }
-    /**
-     * Override to retrieve from local experiences
-     */
-    async retrieveSimilar(state, k) {
-        return this.experiences.slice(0, k).map((exp, idx) => ({
-            id: exp.id || `exp-${idx}`,
-            embedding: exp.state,
-            metadata: exp,
-            score: 1.0 - (idx * 0.1),
-        }));
-    }
-    /**
-     * Generate adversarial example using FGSM
-     */
-    async generateFGSM(state, target) {
-        // Ensure state is array
-        const stateArray = Array.isArray(state) ? state : [state];
-        // Handle zero epsilon case - no perturbation
-        if (this.epsilon === 0) {
-            return {
-                original: stateArray,
-                adversarial: [...stateArray],
-                perturbation: new Array(stateArray.length).fill(0),
-                confidence: 0,
-                attackType: 'fgsm',
-            };
-        }
-        // Compute gradient of loss with respect to input
-        const gradient = await this.computeGradient(stateArray, target);
-        // Apply FGSM: x_adv = x + epsilon * sign(grad)
-        const adversarial = stateArray.map((x, i) => {
-            const sign = gradient[i] > 0 ? 1 : -1;
-            return x + this.epsilon * sign;
-        });
-        const perturbation = adversarial.map((x, i) => x - stateArray[i]);
-        return {
-            original: stateArray,
-            adversarial: this.clipToValid(adversarial),
-            perturbation,
-            confidence: 0,
-            attackType: 'fgsm',
-        };
-    }
-    /**
-     * Generate adversarial example using PGD
-     */
-    async generatePGD(state, target) {
-        // Ensure state is array
-        const stateArray = Array.isArray(state) ? state : [state];
-        // Handle zero epsilon case - no perturbation
-        if (this.epsilon === 0) {
-            return {
-                original: stateArray,
-                adversarial: [...stateArray],
-                perturbation: new Array(stateArray.length).fill(0),
-                confidence: 0,
-                attackType: 'pgd',
-            };
-        }
-        let adversarial = [...stateArray];
-        // Iterative FGSM with projection
-        for (let i = 0; i < this.iterations; i++) {
-            const gradient = await this.computeGradient(adversarial, target);
-            // Update with gradient step
-            adversarial = adversarial.map((x, idx) => {
-                const sign = gradient[idx] > 0 ? 1 : -1;
-                return x + this.alpha * sign;
-            });
-            // Project back to epsilon ball around original
-            adversarial = this.projectToEpsilonBall(adversarial, stateArray, this.epsilon);
-            adversarial = this.clipToValid(adversarial);
-        }
-        const perturbation = adversarial.map((x, i) => x - stateArray[i]);
-        return {
-            original: stateArray,
-            adversarial,
-            perturbation,
-            confidence: 0,
-            attackType: 'pgd',
-        };
-    }
-    /**
-     * Generate adversarial example using DeepFool
-     */
-    async generateDeepFool(state, target) {
-        // Ensure state is array
-        const stateArray = Array.isArray(state) ? state : [state];
-        let adversarial = [...stateArray];
-        const maxIterations = 50;
-        for (let i = 0; i < maxIterations; i++) {
-            // Get predictions for all classes
-            const predictions = await this.multiClassPredict(adversarial);
-            // Find closest decision boundary
-            const sorted = predictions
-                .map((p, idx) => ({ prob: p, class: idx }))
-                .sort((a, b) => b.prob - a.prob);
-            const currentClass = sorted[0].class;
-            const nextClass = sorted[1].class;
-            // If misclassified, stop
-            if (currentClass !== Math.floor(target)) {
-                break;
-            }
-            // Compute minimum perturbation to cross boundary
-            const w = await this.computeDecisionBoundary(adversarial, currentClass, nextClass);
-            const f = sorted[0].prob - sorted[1].prob;
-            const perturbation = w.map((wi) => (f / (this.l2Norm(w) ** 2 + 1e-8)) * wi);
-            adversarial = adversarial.map((x, idx) => x + perturbation[idx]);
-        }
-        const finalPerturbation = adversarial.map((x, i) => x - stateArray[i]);
-        return {
-            original: stateArray,
-            adversarial: this.clipToValid(adversarial),
-            perturbation: finalPerturbation,
-            confidence: 0,
-            attackType: 'deepfool',
-        };
-    }
-    /**
-     * Compute gradient of loss with respect to input
-     */
-    async computeGradient(state, target) {
-        // Ensure state is valid array
-        if (!state || !Array.isArray(state) || state.length === 0) {
-            return [0];
-        }
-        const epsilon = 1e-5;
-        const gradient = new Array(state.length).fill(0);
-        for (let i = 0; i < state.length; i++) {
-            // Finite difference approximation
-            const statePlus = [...state];
-            statePlus[i] += epsilon;
-            const stateMinus = [...state];
-            stateMinus[i] -= epsilon;
-            const predPlus = (await this.selectAction(statePlus)).confidence || 0;
-            const predMinus = (await this.selectAction(stateMinus)).confidence || 0;
-            gradient[i] = (predPlus - predMinus) / (2 * epsilon);
-        }
-        return gradient;
-    }
-    /**
-     * Multi-class predictions (simplified)
-     */
-    async multiClassPredict(state) {
-        const numClasses = 10;
-        const predictions = new Array(numClasses).fill(0);
-        for (let i = 0; i < numClasses; i++) {
-            predictions[i] = Math.random();
-        }
-        // Normalize
-        const sum = predictions.reduce((a, b) => a + b, 0);
-        return predictions.map(p => p / sum);
-    }
-    /**
-     * Compute decision boundary between two classes
-     */
-    async computeDecisionBoundary(state, class1, class2) {
-        const gradient = new Array(state.length).fill(0);
-        for (let i = 0; i < state.length; i++) {
-            gradient[i] = (class1 - class2) * Math.random() * 0.1;
-        }
-        return gradient;
-    }
-    /**
-     * Project adversarial example to epsilon ball
-     */
-    projectToEpsilonBall(adversarial, original, epsilon) {
-        const perturbation = adversarial.map((x, i) => x - original[i]);
-        const norm = this.l2Norm(perturbation);
-        if (norm > epsilon) {
-            return adversarial.map((x, i) => original[i] + (perturbation[i] / norm) * epsilon);
-        }
-        return adversarial;
-    }
-    /**
-     * L2 norm of vector
-     */
-    l2Norm(vec) {
-        return Math.sqrt(vec.reduce((sum, x) => sum + x * x, 0));
-    }
-    /**
-     * Clip values to valid range [0, 1]
-     */
-    clipToValid(vec) {
-        return vec.map((x) => Math.max(0, Math.min(1, x)));
-    }
-    /**
-     * Generate adversarial example
-     */
-    async generateAdversarialExample(state, target) {
-        switch (this.attackType) {
-            case 'fgsm':
-                return this.generateFGSM(state, target);
-            case 'pgd':
-                return this.generatePGD(state, target);
-            case 'deepfool':
-                return this.generateDeepFool(state, target);
-            default:
-                return this.generateFGSM(state, target);
-        }
-    }
-    /**
-     * Train with adversarial examples
-     */
-    async train(options) {
-        const startTime = Date.now();
-        const epochs = options?.epochs || 50;
-        const batchSize = options?.batchSize || 32;
-        let totalLoss = 0;
-        let cleanLoss = 0;
-        let advLoss = 0;
-        let experiencesProcessed = 0;
-        for (let epoch = 0; epoch < epochs; epoch++) {
-            // Retrieve batch of experiences from local storage
-            const experiences = await this.retrieveSimilar(new Array(128).fill(0), batchSize);
-            // Split into clean and adversarial training
-            const numAdversarial = Math.floor(experiences.length * this.adversarialRatio);
-            // Train on clean examples
-            for (let i = 0; i < experiences.length - numAdversarial; i++) {
-                const exp = experiences[i].metadata;
-                const prediction = await this.selectAction(exp.state);
-                const loss = Math.pow(prediction.confidence - exp.reward, 2);
-                cleanLoss += loss;
-                totalLoss += loss;
-                experiencesProcessed++;
-            }
-            // Generate and train on adversarial examples
-            for (let i = experiences.length - numAdversarial; i < experiences.length; i++) {
-                const exp = experiences[i].metadata;
-                // Generate adversarial example
-                const advExample = await this.generateAdversarialExample(exp.state, exp.reward);
-                this.adversarialExamples.push(advExample);
-                // Train on adversarial example
-                const prediction = await this.selectAction(advExample.adversarial);
-                const loss = Math.pow(prediction.confidence - exp.reward, 2);
-                advLoss += loss;
-                totalLoss += loss;
-                experiencesProcessed++;
-            }
-            // Evaluate robustness
-            if (epoch % 10 === 0) {
-                const robustness = await this.evaluateRobustness(experiences.slice(0, 10).map(e => e.metadata));
-                this.robustnessScores.push(robustness);
-            }
-        }
-        const duration = Date.now() - startTime;
-        return {
-            loss: totalLoss / Math.max(1, experiencesProcessed),
-            cleanLoss: cleanLoss / Math.max(1, experiencesProcessed - this.adversarialExamples.length),
-            adversarialLoss: advLoss / Math.max(1, this.adversarialExamples.length),
-            experiencesProcessed,
-            duration,
-            robustnessScore: this.robustnessScores[this.robustnessScores.length - 1] || 0,
-            adversarialExamplesGenerated: this.adversarialExamples.length,
-        };
-    }
-    /**
-     * Evaluate model robustness
-     */
-    async evaluateRobustness(testExamples) {
-        let correctClean = 0;
-        let correctAdv = 0;
-        for (const exp of testExamples) {
-            // Clean prediction
-            const cleanPred = await this.selectAction(exp.state);
-            if (cleanPred.confidence > 0.5) {
-                correctClean++;
-            }
-            // Adversarial prediction
-            const advExample = await this.generateAdversarialExample(exp.state, exp.reward);
-            const advPred = await this.selectAction(advExample.adversarial);
-            if (advPred.confidence > 0.5) {
-                correctAdv++;
-            }
-        }
-        // Robustness score is ratio of adversarial accuracy to clean accuracy
-        const cleanAcc = correctClean / testExamples.length;
-        const advAcc = correctAdv / testExamples.length;
-        return cleanAcc > 0 ? advAcc / cleanAcc : 0;
-    }
-    /**
-     * Get adversarial training statistics
-     */
-    getAdversarialStats() {
-        const avgRobustness = this.robustnessScores.length > 0
-            ? this.robustnessScores.reduce((a, b) => a + b, 0) / this.robustnessScores.length
-            : 0;
-        const avgPerturbNorm = this.adversarialExamples.length > 0
-            ? this.adversarialExamples.reduce((sum, ex) => sum + this.l2Norm(ex.perturbation), 0) / this.adversarialExamples.length
-            : 0;
-        return {
-            attackType: this.attackType,
-            epsilon: this.epsilon,
-            examplesGenerated: this.adversarialExamples.length,
-            averageRobustness: avgRobustness,
-            avgPerturbationNorm: avgPerturbNorm,
-        };
-    }
-    /**
-     * Test model against specific attack
-     */
-    async testAgainstAttack(samples, attackType) {
-        if (samples.length === 0) {
-            return {
-                cleanAccuracy: 0,
-                robustAccuracy: 0,
-                avgPerturbation: 0,
-            };
-        }
-        const previousAttack = this.attackType;
-        this.attackType = attackType;
-        let cleanCorrect = 0;
-        let advCorrect = 0;
-        let totalPerturbation = 0;
-        for (const sample of samples) {
-            // Handle both Vector[] and {state, label}[] formats
-            const state = Array.isArray(sample) ? sample : sample.state;
-            const cleanPred = await this.selectAction(state);
-            if (cleanPred.confidence > 0.5) {
-                cleanCorrect++;
-            }
-            const advExample = await this.generateAdversarialExample(state, 1.0);
-            const advPred = await this.selectAction(advExample.adversarial);
-            if (advPred.confidence > 0.5) {
-                advCorrect++;
-            }
-            totalPerturbation += this.l2Norm(advExample.perturbation);
-        }
-        this.attackType = previousAttack;
-        return {
-            cleanAccuracy: cleanCorrect / samples.length,
-            robustAccuracy: advCorrect / samples.length,
-            avgPerturbation: totalPerturbation / samples.length,
-        };
-    }
-}

package/dist/plugins/implementations/curriculum-learning.d.ts

@@ -1,132 +0,0 @@
-/**
- * Curriculum Learning Plugin
- *
- * Implements structured learning where the model progressively tackles
- * increasingly difficult tasks, mimicking human learning.
- *
- * Key features:
- * - Automatic difficulty estimation
- * - Dynamic curriculum generation
- * - Self-paced learning
- * - Task sequencing based on prerequisites
- * - Competence-based progression
- */
-import { BasePlugin } from '../base-plugin';
-import { Action, Context, Experience, TrainOptions, TrainingMetrics, Vector } from '../learning-plugin.interface';
-/**
- * Task difficulty metrics
- */
-interface TaskDifficulty {
-    taskId: string;
-    complexity: number;
-    estimatedLoss: number;
-    successRate: number;
-    prerequisites: string[];
-}
-/**
- * Curriculum stage
- */
-interface CurriculumStage {
-    stage: number;
-    name: string;
-    minCompetence: number;
-    tasks: string[];
-    completed: boolean;
-}
-/**
- * Curriculum Learning Plugin Implementation
- */
-export declare class CurriculumLearningPlugin extends BasePlugin {
-    name: string;
-    version: string;
-    private experiences;
-    private curriculum;
-    private currentStage;
-    private taskDifficulties;
-    private competence;
-    private strategy;
-    private minSuccessRate;
-    private competenceThreshold;
-    private difficultyWindow;
-    constructor(config?: Partial<any>);
-    /**
-     * Override to skip initialization check for in-memory operation
-     */
-    protected checkInitialized(): void;
-    /**
-     * Override selectAction to provide base implementation
-     */
-    selectAction(state: Vector, context?: Context): Promise<Action>;
-    /**
-     * Override to store experiences in-memory without vectorDB
-     */
-    storeExperience(experience: Experience): Promise<void>;
-    /**
-     * Override to retrieve from local experiences
-     */
-    retrieveSimilar(state: number[], k: number): Promise<import('../..').SearchResult<Experience>[]>;
-    /**
-     * Initialize curriculum stages
-     */
-    private initializeCurriculum;
-    /**
-     * Estimate task difficulty from experiences
-     */
-    private estimateTaskDifficulty;
-    /**
-     * Infer prerequisite tasks based on complexity
-     */
-    private inferPrerequisites;
-    /**
-     * Select next task based on current competence
-     */
-    private selectNextTask;
-    /**
-     * Self-paced task selection
-     */
-    private selectSelfPacedTask;
-    /**
-     * Automatic task selection using competence-based heuristic
-     */
-    private selectAutomaticTask;
-    /**
-     * Curriculum-based task selection
-     */
-    private selectCurriculumTask;
-    /**
-     * Check if task prerequisites are met
-     */
-    private arePrerequisitesMet;
-    /**
-     * Get current overall competence
-     */
-    private getCurrentCompetence;
-    /**
-     * Update competence for a task
-     */
-    private updateCompetence;
-    /**
-     * Train with curriculum learning
-     */
-    train(options?: TrainOptions): Promise<TrainingMetrics>;
-    /**
-     * Get curriculum progress
-     */
-    getCurriculumProgress(): {
-        currentStage: number;
-        totalStages: number;
-        competence: number;
-        tasksCompleted: number;
-        totalTasks: number;
-    };
-    /**
-     * Add custom curriculum stage
-     */
-    addCurriculumStage(stage: Omit<CurriculumStage, 'completed'>): void;
-    /**
-     * Get task difficulties
-     */
-    getTaskDifficulties(): Map<string, TaskDifficulty>;
-}
-export {};
-//# sourceMappingURL=curriculum-learning.d.ts.map

package/dist/plugins/implementations/curriculum-learning.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"curriculum-learning.d.ts","sourceRoot":"","sources":["../../../src/plugins/implementations/curriculum-learning.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EACL,MAAM,EACN,OAAO,EACP,UAAU,EACV,YAAY,EACZ,eAAe,EACf,MAAM,EACP,MAAM,8BAA8B,CAAC;AAEtC;;GAEG;AACH,UAAU,cAAc;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED;;GAEG;AACH,UAAU,eAAe;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,SAAS,EAAE,OAAO,CAAC;CACpB;AAWD;;GAEG;AACH,qBAAa,wBAAyB,SAAQ,UAAU;IACtD,IAAI,SAAyB;IAC7B,OAAO,SAAW;IAElB,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,YAAY,CAAa;IACjC,OAAO,CAAC,gBAAgB,CAA0C;IAClE,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,QAAQ,CAAmC;IAGnD,OAAO,CAAC,cAAc,CAAe;IACrC,OAAO,CAAC,mBAAmB,CAAe;IAC1C,OAAO,CAAC,gBAAgB,CAAe;gBAE3B,MAAM,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC;IAejC;;OAEG;IACH,SAAS,CAAC,gBAAgB,IAAI,IAAI;IAIlC;;OAEG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAYrE;;OAEG;IACG,eAAe,CAAC,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAe5D;;OAEG;IACG,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC;IAStG;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAiC5B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAgC9B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAY1B;;OAEG;IACH,OAAO,CAAC,cAAc;IAiBtB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAkB3B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAyB3B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAyB5B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAY3B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAS5B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAYxB;;OAEG;IACG,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,eAAe,CAAC;IA2D7D;;OAEG;IACH,qBAAqB,IAAI;QACvB,YAAY,EAAE,MAAM,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;QACpB,UAAU,EAAE,MAAM,CAAC;QACnB,cAAc,EAAE,MAAM,CAAC;QACvB,UAAU,EAAE,MAAM,CAAC;KACpB;IAcD;;OAEG;IACH,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,eAAe,EAAE,WAAW,CAAC,GAAG,IAAI;IAOnE;;OAEG;IACH,mBAAmB,IAAI,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC;CAGnD"}