moflo 4.8.31 → 4.8.33

package/src/@claude-flow/neural/dist/algorithms/dqn.js

@@ -0,0 +1,303 @@
+/**
+ * Deep Q-Network (DQN)
+ *
+ * Implements DQN with enhancements:
+ * - Experience replay
+ * - Target network
+ * - Double DQN (optional)
+ * - Dueling architecture (optional)
+ * - Epsilon-greedy exploration
+ *
+ * Performance Target: <10ms per update step
+ */
+/**
+ * Default DQN configuration
+ */
+export const DEFAULT_DQN_CONFIG = {
+    algorithm: 'dqn',
+    learningRate: 0.0001,
+    gamma: 0.99,
+    entropyCoef: 0,
+    valueLossCoef: 1,
+    maxGradNorm: 10,
+    epochs: 1,
+    miniBatchSize: 32,
+    bufferSize: 10000,
+    explorationInitial: 1.0,
+    explorationFinal: 0.01,
+    explorationDecay: 10000,
+    targetUpdateFreq: 100,
+    doubleDQN: true,
+    duelingNetwork: false,
+};
+/**
+ * DQN Algorithm Implementation
+ */
+export class DQNAlgorithm {
+    config;
+    // Q-network weights
+    qWeights;
+    targetWeights;
+    // Optimizer state
+    qMomentum;
+    // Replay buffer (circular)
+    buffer = [];
+    bufferIdx = 0;
+    // Exploration
+    epsilon;
+    stepCount = 0;
+    // Number of actions
+    numActions = 4;
+    inputDim = 768;
+    // Statistics
+    updateCount = 0;
+    avgLoss = 0;
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_DQN_CONFIG, ...config };
+        this.epsilon = this.config.explorationInitial;
+        // Initialize Q-network (2 hidden layers)
+        this.qWeights = this.initializeNetwork();
+        this.targetWeights = this.copyNetwork(this.qWeights);
+        this.qMomentum = this.qWeights.map(w => new Float32Array(w.length));
+    }
+    /**
+     * Add experience from trajectory
+     */
+    addExperience(trajectory) {
+        for (let i = 0; i < trajectory.steps.length; i++) {
+            const step = trajectory.steps[i];
+            const nextStep = i < trajectory.steps.length - 1
+                ? trajectory.steps[i + 1]
+                : null;
+            const experience = {
+                state: step.stateBefore,
+                action: this.hashAction(step.action),
+                reward: step.reward,
+                nextState: step.stateAfter,
+                done: nextStep === null,
+            };
+            // Add to circular buffer
+            if (this.buffer.length < this.config.bufferSize) {
+                this.buffer.push(experience);
+            }
+            else {
+                this.buffer[this.bufferIdx] = experience;
+            }
+            this.bufferIdx = (this.bufferIdx + 1) % this.config.bufferSize;
+        }
+    }
+    /**
+     * Perform DQN update
+     * Target: <10ms
+     */
+    update() {
+        const startTime = performance.now();
+        if (this.buffer.length < this.config.miniBatchSize) {
+            return { loss: 0, epsilon: this.epsilon };
+        }
+        // Sample mini-batch
+        const batch = this.sampleBatch();
+        // Compute TD targets
+        let totalLoss = 0;
+        const gradients = this.qWeights.map(w => new Float32Array(w.length));
+        for (const exp of batch) {
+            // Current Q-values
+            const qValues = this.forward(exp.state, this.qWeights);
+            const currentQ = qValues[exp.action];
+            // Target Q-value
+            let targetQ;
+            if (exp.done) {
+                targetQ = exp.reward;
+            }
+            else {
+                if (this.config.doubleDQN) {
+                    // Double DQN: use online network to select action, target to evaluate
+                    const nextQOnline = this.forward(exp.nextState, this.qWeights);
+                    const bestAction = this.argmax(nextQOnline);
+                    const nextQTarget = this.forward(exp.nextState, this.targetWeights);
+                    targetQ = exp.reward + this.config.gamma * nextQTarget[bestAction];
+                }
+                else {
+                    // Standard DQN
+                    const nextQ = this.forward(exp.nextState, this.targetWeights);
+                    targetQ = exp.reward + this.config.gamma * Math.max(...nextQ);
+                }
+            }
+            // TD error
+            const tdError = targetQ - currentQ;
+            const loss = tdError * tdError;
+            totalLoss += loss;
+            // Accumulate gradients
+            this.accumulateGradients(gradients, exp.state, exp.action, tdError);
+        }
+        // Apply gradients
+        this.applyGradients(gradients, batch.length);
+        // Update target network periodically
+        this.stepCount++;
+        if (this.stepCount % this.config.targetUpdateFreq === 0) {
+            this.targetWeights = this.copyNetwork(this.qWeights);
+        }
+        // Decay exploration
+        this.epsilon = Math.max(this.config.explorationFinal, this.config.explorationInitial - this.stepCount / this.config.explorationDecay);
+        this.updateCount++;
+        this.avgLoss = totalLoss / batch.length;
+        const elapsed = performance.now() - startTime;
+        if (elapsed > 10) {
+            console.warn(`DQN update exceeded target: ${elapsed.toFixed(2)}ms > 10ms`);
+        }
+        return {
+            loss: this.avgLoss,
+            epsilon: this.epsilon,
+        };
+    }
+    /**
+     * Get action using epsilon-greedy
+     */
+    getAction(state, explore = true) {
+        if (explore && Math.random() < this.epsilon) {
+            return Math.floor(Math.random() * this.numActions);
+        }
+        const qValues = this.forward(state, this.qWeights);
+        return this.argmax(qValues);
+    }
+    /**
+     * Get Q-values for a state
+     */
+    getQValues(state) {
+        return this.forward(state, this.qWeights);
+    }
+    /**
+     * Get statistics
+     */
+    getStats() {
+        return {
+            updateCount: this.updateCount,
+            bufferSize: this.buffer.length,
+            epsilon: this.epsilon,
+            avgLoss: this.avgLoss,
+            stepCount: this.stepCount,
+        };
+    }
+    // ==========================================================================
+    // Private Methods
+    // ==========================================================================
+    initializeNetwork() {
+        // Simple 2-layer network: input -> hidden -> output
+        const hiddenDim = 64;
+        const weights = [];
+        // Layer 1: input_dim -> hidden
+        const w1 = new Float32Array(this.inputDim * hiddenDim);
+        const scale1 = Math.sqrt(2 / this.inputDim);
+        for (let i = 0; i < w1.length; i++) {
+            w1[i] = (Math.random() - 0.5) * scale1;
+        }
+        weights.push(w1);
+        // Layer 2: hidden -> num_actions
+        const w2 = new Float32Array(hiddenDim * this.numActions);
+        const scale2 = Math.sqrt(2 / hiddenDim);
+        for (let i = 0; i < w2.length; i++) {
+            w2[i] = (Math.random() - 0.5) * scale2;
+        }
+        weights.push(w2);
+        return weights;
+    }
+    copyNetwork(weights) {
+        return weights.map(w => new Float32Array(w));
+    }
+    forward(state, weights) {
+        const hiddenDim = 64;
+        // Layer 1: ReLU(W1 * x)
+        const hidden = new Float32Array(hiddenDim);
+        for (let h = 0; h < hiddenDim; h++) {
+            let sum = 0;
+            for (let i = 0; i < Math.min(state.length, this.inputDim); i++) {
+                sum += state[i] * weights[0][i * hiddenDim + h];
+            }
+            hidden[h] = Math.max(0, sum); // ReLU
+        }
+        // Layer 2: W2 * hidden (no activation for Q-values)
+        const output = new Float32Array(this.numActions);
+        for (let a = 0; a < this.numActions; a++) {
+            let sum = 0;
+            for (let h = 0; h < hiddenDim; h++) {
+                sum += hidden[h] * weights[1][h * this.numActions + a];
+            }
+            output[a] = sum;
+        }
+        return output;
+    }
+    accumulateGradients(gradients, state, action, tdError) {
+        const hiddenDim = 64;
+        // Forward pass to get hidden activations
+        const hidden = new Float32Array(hiddenDim);
+        for (let h = 0; h < hiddenDim; h++) {
+            let sum = 0;
+            for (let i = 0; i < Math.min(state.length, this.inputDim); i++) {
+                sum += state[i] * this.qWeights[0][i * hiddenDim + h];
+            }
+            hidden[h] = Math.max(0, sum);
+        }
+        // Gradient for layer 2 (only for selected action)
+        for (let h = 0; h < hiddenDim; h++) {
+            gradients[1][h * this.numActions + action] += hidden[h] * tdError;
+        }
+        // Gradient for layer 1 (backprop through ReLU)
+        for (let h = 0; h < hiddenDim; h++) {
+            if (hidden[h] > 0) { // ReLU gradient
+                const grad = tdError * this.qWeights[1][h * this.numActions + action];
+                for (let i = 0; i < Math.min(state.length, this.inputDim); i++) {
+                    gradients[0][i * hiddenDim + h] += state[i] * grad;
+                }
+            }
+        }
+    }
+    applyGradients(gradients, batchSize) {
+        const lr = this.config.learningRate / batchSize;
+        const beta = 0.9;
+        for (let layer = 0; layer < gradients.length; layer++) {
+            for (let i = 0; i < gradients[layer].length; i++) {
+                // Gradient clipping
+                const grad = Math.max(Math.min(gradients[layer][i], this.config.maxGradNorm), -this.config.maxGradNorm);
+                // Momentum update
+                this.qMomentum[layer][i] = beta * this.qMomentum[layer][i] + (1 - beta) * grad;
+                this.qWeights[layer][i] += lr * this.qMomentum[layer][i];
+            }
+        }
+    }
+    sampleBatch() {
+        const batch = [];
+        const indices = new Set();
+        while (indices.size < this.config.miniBatchSize && indices.size < this.buffer.length) {
+            indices.add(Math.floor(Math.random() * this.buffer.length));
+        }
+        for (const idx of indices) {
+            batch.push(this.buffer[idx]);
+        }
+        return batch;
+    }
+    hashAction(action) {
+        let hash = 0;
+        for (let i = 0; i < action.length; i++) {
+            hash = (hash * 31 + action.charCodeAt(i)) % this.numActions;
+        }
+        return hash;
+    }
+    argmax(values) {
+        let maxIdx = 0;
+        let maxVal = values[0];
+        for (let i = 1; i < values.length; i++) {
+            if (values[i] > maxVal) {
+                maxVal = values[i];
+                maxIdx = i;
+            }
+        }
+        return maxIdx;
+    }
+}
+/**
+ * Factory function
+ */
+export function createDQN(config) {
+    return new DQNAlgorithm(config);
+}
+//# sourceMappingURL=dqn.js.map

package/src/@claude-flow/neural/dist/algorithms/index.js

@@ -0,0 +1,74 @@
+/**
+ * RL Algorithms Index
+ *
+ * Exports all reinforcement learning algorithm implementations.
+ */
+// PPO - Proximal Policy Optimization
+export { PPOAlgorithm, createPPO, DEFAULT_PPO_CONFIG, } from './ppo.js';
+// DQN - Deep Q-Network
+export { DQNAlgorithm, createDQN, DEFAULT_DQN_CONFIG, } from './dqn.js';
+// A2C - Advantage Actor-Critic
+export { A2CAlgorithm, createA2C, DEFAULT_A2C_CONFIG, } from './a2c.js';
+// Decision Transformer
+export { DecisionTransformer, createDecisionTransformer, DEFAULT_DT_CONFIG, } from './decision-transformer.js';
+// Q-Learning (Tabular)
+export { QLearning, createQLearning, DEFAULT_QLEARNING_CONFIG, } from './q-learning.js';
+// SARSA
+export { SARSAAlgorithm, createSARSA, DEFAULT_SARSA_CONFIG, } from './sarsa.js';
+// Curiosity-Driven Exploration
+export { CuriosityModule, createCuriosity, DEFAULT_CURIOSITY_CONFIG, } from './curiosity.js';
+import { createPPO, DEFAULT_PPO_CONFIG } from './ppo.js';
+import { createDQN, DEFAULT_DQN_CONFIG } from './dqn.js';
+import { createA2C, DEFAULT_A2C_CONFIG } from './a2c.js';
+import { createDecisionTransformer, DEFAULT_DT_CONFIG } from './decision-transformer.js';
+import { createQLearning, DEFAULT_QLEARNING_CONFIG } from './q-learning.js';
+import { createSARSA, DEFAULT_SARSA_CONFIG } from './sarsa.js';
+import { createCuriosity, DEFAULT_CURIOSITY_CONFIG } from './curiosity.js';
+/**
+ * Create an RL algorithm by name
+ */
+export function createAlgorithm(algorithm, config) {
+    // Use type assertions since config is validated by algorithm switch
+    switch (algorithm) {
+        case 'ppo':
+            return createPPO(config);
+        case 'dqn':
+            return createDQN(config);
+        case 'a2c':
+            return createA2C(config);
+        case 'decision-transformer':
+            return createDecisionTransformer(config);
+        case 'q-learning':
+            return createQLearning(config);
+        case 'sarsa':
+            return createSARSA(config);
+        case 'curiosity':
+            return createCuriosity(config);
+        default:
+            throw new Error(`Unknown algorithm: ${algorithm}`);
+    }
+}
+/**
+ * Get default configuration for an algorithm
+ */
+export function getDefaultConfig(algorithm) {
+    switch (algorithm) {
+        case 'ppo':
+            return { ...DEFAULT_PPO_CONFIG };
+        case 'dqn':
+            return { ...DEFAULT_DQN_CONFIG };
+        case 'a2c':
+            return { ...DEFAULT_A2C_CONFIG };
+        case 'decision-transformer':
+            return { ...DEFAULT_DT_CONFIG };
+        case 'q-learning':
+            return { ...DEFAULT_QLEARNING_CONFIG };
+        case 'sarsa':
+            return { ...DEFAULT_SARSA_CONFIG };
+        case 'curiosity':
+            return { ...DEFAULT_CURIOSITY_CONFIG };
+        default:
+            throw new Error(`Unknown algorithm: ${algorithm}`);
+    }
+}
+//# sourceMappingURL=index.js.map

package/src/@claude-flow/neural/dist/algorithms/ppo.js

@@ -0,0 +1,331 @@
+/**
+ * Proximal Policy Optimization (PPO)
+ *
+ * Implements PPO algorithm for stable policy learning with:
+ * - Clipped surrogate objective
+ * - GAE (Generalized Advantage Estimation)
+ * - Value function clipping
+ * - Entropy bonus
+ *
+ * Performance Target: <10ms per update step
+ */
+/**
+ * Default PPO configuration
+ */
+export const DEFAULT_PPO_CONFIG = {
+    algorithm: 'ppo',
+    learningRate: 0.0003,
+    gamma: 0.99,
+    entropyCoef: 0.01,
+    valueLossCoef: 0.5,
+    maxGradNorm: 0.5,
+    epochs: 4,
+    miniBatchSize: 64,
+    clipRange: 0.2,
+    clipRangeVf: null,
+    targetKL: 0.01,
+    gaeLambda: 0.95,
+};
+/**
+ * PPO Algorithm Implementation
+ */
+export class PPOAlgorithm {
+    config;
+    // Policy network weights (simplified linear model for speed)
+    policyWeights;
+    valueWeights;
+    // Optimizer state
+    policyMomentum;
+    valueMomentum;
+    // Experience buffer
+    buffer = [];
+    // Statistics
+    updateCount = 0;
+    totalLoss = 0;
+    approxKL = 0;
+    clipFraction = 0;
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_PPO_CONFIG, ...config };
+        // Initialize weights (768 input dim, simplified)
+        const dim = 768;
+        this.policyWeights = new Float32Array(dim);
+        this.valueWeights = new Float32Array(dim);
+        this.policyMomentum = new Float32Array(dim);
+        this.valueMomentum = new Float32Array(dim);
+        // Xavier initialization
+        const scale = Math.sqrt(2 / dim);
+        for (let i = 0; i < dim; i++) {
+            this.policyWeights[i] = (Math.random() - 0.5) * scale;
+            this.valueWeights[i] = (Math.random() - 0.5) * scale;
+        }
+    }
+    /**
+     * Add experience from trajectory
+     */
+    addExperience(trajectory) {
+        if (trajectory.steps.length === 0)
+            return;
+        // Compute values for each step
+        const values = trajectory.steps.map(step => this.computeValue(step.stateAfter));
+        // Compute advantages using GAE
+        const advantages = this.computeGAE(trajectory.steps.map(s => s.reward), values);
+        // Compute returns
+        const returns = this.computeReturns(trajectory.steps.map(s => s.reward));
+        // Add to buffer
+        for (let i = 0; i < trajectory.steps.length; i++) {
+            const step = trajectory.steps[i];
+            this.buffer.push({
+                state: step.stateAfter,
+                action: this.hashAction(step.action),
+                reward: step.reward,
+                value: values[i],
+                logProb: this.computeLogProb(step.stateAfter, step.action),
+                advantage: advantages[i],
+                return_: returns[i],
+            });
+        }
+    }
+    /**
+     * Perform PPO update
+     * Target: <10ms
+     */
+    update() {
+        const startTime = performance.now();
+        if (this.buffer.length < this.config.miniBatchSize) {
+            return { policyLoss: 0, valueLoss: 0, entropy: 0 };
+        }
+        // Normalize advantages
+        const advantages = this.buffer.map(e => e.advantage);
+        const advMean = advantages.reduce((a, b) => a + b, 0) / advantages.length;
+        const advStd = Math.sqrt(advantages.reduce((a, b) => a + (b - advMean) ** 2, 0) / advantages.length) + 1e-8;
+        for (const exp of this.buffer) {
+            exp.advantage = (exp.advantage - advMean) / advStd;
+        }
+        let totalPolicyLoss = 0;
+        let totalValueLoss = 0;
+        let totalEntropy = 0;
+        let totalClipFrac = 0;
+        let totalKL = 0;
+        let numUpdates = 0;
+        // Multiple epochs
+        for (let epoch = 0; epoch < this.config.epochs; epoch++) {
+            // Shuffle buffer
+            this.shuffleBuffer();
+            // Process mini-batches
+            for (let i = 0; i < this.buffer.length; i += this.config.miniBatchSize) {
+                const batch = this.buffer.slice(i, i + this.config.miniBatchSize);
+                if (batch.length < this.config.miniBatchSize / 2)
+                    continue;
+                const result = this.updateMiniBatch(batch);
+                totalPolicyLoss += result.policyLoss;
+                totalValueLoss += result.valueLoss;
+                totalEntropy += result.entropy;
+                totalClipFrac += result.clipFrac;
+                totalKL += result.kl;
+                numUpdates++;
+                // Early stopping if KL too high
+                if (result.kl > this.config.targetKL * 1.5) {
+                    break;
+                }
+            }
+        }
+        // Clear buffer
+        this.buffer = [];
+        this.updateCount++;
+        const elapsed = performance.now() - startTime;
+        if (elapsed > 10) {
+            console.warn(`PPO update exceeded target: ${elapsed.toFixed(2)}ms > 10ms`);
+        }
+        return {
+            policyLoss: numUpdates > 0 ? totalPolicyLoss / numUpdates : 0,
+            valueLoss: numUpdates > 0 ? totalValueLoss / numUpdates : 0,
+            entropy: numUpdates > 0 ? totalEntropy / numUpdates : 0,
+        };
+    }
+    /**
+     * Get action from policy
+     */
+    getAction(state) {
+        const logits = this.computeLogits(state);
+        const probs = this.softmax(logits);
+        const action = this.sampleAction(probs);
+        return {
+            action,
+            logProb: Math.log(probs[action] + 1e-8),
+            value: this.computeValue(state),
+        };
+    }
+    /**
+     * Get statistics
+     */
+    getStats() {
+        return {
+            updateCount: this.updateCount,
+            bufferSize: this.buffer.length,
+            avgLoss: this.updateCount > 0 ? this.totalLoss / this.updateCount : 0,
+            approxKL: this.approxKL,
+            clipFraction: this.clipFraction,
+        };
+    }
+    // ==========================================================================
+    // Private Methods
+    // ==========================================================================
+    computeValue(state) {
+        let value = 0;
+        for (let i = 0; i < Math.min(state.length, this.valueWeights.length); i++) {
+            value += state[i] * this.valueWeights[i];
+        }
+        return value;
+    }
+    computeLogits(state) {
+        // Simplified: 4 discrete actions
+        const numActions = 4;
+        const logits = new Float32Array(numActions);
+        for (let a = 0; a < numActions; a++) {
+            for (let i = 0; i < Math.min(state.length, this.policyWeights.length); i++) {
+                logits[a] += state[i] * this.policyWeights[i] * (1 + a * 0.1);
+            }
+        }
+        return logits;
+    }
+    computeLogProb(state, action) {
+        const logits = this.computeLogits(state);
+        const probs = this.softmax(logits);
+        const actionIdx = this.hashAction(action);
+        return Math.log(probs[actionIdx] + 1e-8);
+    }
+    hashAction(action) {
+        // Simple hash to action index (0-3)
+        let hash = 0;
+        for (let i = 0; i < action.length; i++) {
+            hash = (hash * 31 + action.charCodeAt(i)) % 4;
+        }
+        return hash;
+    }
+    softmax(logits) {
+        const max = Math.max(...logits);
+        const exps = new Float32Array(logits.length);
+        let sum = 0;
+        for (let i = 0; i < logits.length; i++) {
+            exps[i] = Math.exp(logits[i] - max);
+            sum += exps[i];
+        }
+        for (let i = 0; i < exps.length; i++) {
+            exps[i] /= sum;
+        }
+        return exps;
+    }
+    sampleAction(probs) {
+        const r = Math.random();
+        let cumSum = 0;
+        for (let i = 0; i < probs.length; i++) {
+            cumSum += probs[i];
+            if (r < cumSum)
+                return i;
+        }
+        return probs.length - 1;
+    }
+    computeGAE(rewards, values) {
+        const advantages = new Array(rewards.length).fill(0);
+        let lastGae = 0;
+        for (let t = rewards.length - 1; t >= 0; t--) {
+            const nextValue = t < rewards.length - 1 ? values[t + 1] : 0;
+            const delta = rewards[t] + this.config.gamma * nextValue - values[t];
+            lastGae = delta + this.config.gamma * this.config.gaeLambda * lastGae;
+            advantages[t] = lastGae;
+        }
+        return advantages;
+    }
+    computeReturns(rewards) {
+        const returns = new Array(rewards.length).fill(0);
+        let cumReturn = 0;
+        for (let t = rewards.length - 1; t >= 0; t--) {
+            cumReturn = rewards[t] + this.config.gamma * cumReturn;
+            returns[t] = cumReturn;
+        }
+        return returns;
+    }
+    shuffleBuffer() {
+        for (let i = this.buffer.length - 1; i > 0; i--) {
+            const j = Math.floor(Math.random() * (i + 1));
+            [this.buffer[i], this.buffer[j]] = [this.buffer[j], this.buffer[i]];
+        }
+    }
+    updateMiniBatch(batch) {
+        let policyLoss = 0;
+        let valueLoss = 0;
+        let entropy = 0;
+        let clipFrac = 0;
+        let kl = 0;
+        const policyGrad = new Float32Array(this.policyWeights.length);
+        const valueGrad = new Float32Array(this.valueWeights.length);
+        for (const exp of batch) {
+            // Current policy
+            const logits = this.computeLogits(exp.state);
+            const probs = this.softmax(logits);
+            const newLogProb = Math.log(probs[exp.action] + 1e-8);
+            const currentValue = this.computeValue(exp.state);
+            // Ratio for PPO
+            const ratio = Math.exp(newLogProb - exp.logProb);
+            // Clipped surrogate objective
+            const surr1 = ratio * exp.advantage;
+            const surr2 = Math.max(Math.min(ratio, 1 + this.config.clipRange), 1 - this.config.clipRange) * exp.advantage;
+            const policyLossI = -Math.min(surr1, surr2);
+            policyLoss += policyLossI;
+            // Track clipping
+            if (Math.abs(ratio - 1) > this.config.clipRange) {
+                clipFrac++;
+            }
+            // KL divergence approximation
+            kl += (exp.logProb - newLogProb);
+            // Value loss
+            let valueLossI;
+            if (this.config.clipRangeVf !== null) {
+                const valuePred = currentValue;
+                const valueClipped = exp.value + Math.max(Math.min(valuePred - exp.value, this.config.clipRangeVf), -this.config.clipRangeVf);
+                const vf1 = (valuePred - exp.return_) ** 2;
+                const vf2 = (valueClipped - exp.return_) ** 2;
+                valueLossI = Math.max(vf1, vf2);
+            }
+            else {
+                valueLossI = (currentValue - exp.return_) ** 2;
+            }
+            valueLoss += valueLossI;
+            // Entropy
+            let entropyI = 0;
+            for (const p of probs) {
+                if (p > 0)
+                    entropyI -= p * Math.log(p);
+            }
+            entropy += entropyI;
+            // Compute gradients (simplified)
+            for (let i = 0; i < Math.min(exp.state.length, policyGrad.length); i++) {
+                policyGrad[i] += exp.state[i] * policyLossI * 0.01;
+                valueGrad[i] += exp.state[i] * valueLossI * 0.01;
+            }
+        }
+        // Apply gradients with momentum
+        const lr = this.config.learningRate;
+        const beta = 0.9;
+        for (let i = 0; i < this.policyWeights.length; i++) {
+            this.policyMomentum[i] = beta * this.policyMomentum[i] + (1 - beta) * policyGrad[i];
+            this.policyWeights[i] -= lr * this.policyMomentum[i];
+            this.valueMomentum[i] = beta * this.valueMomentum[i] + (1 - beta) * valueGrad[i];
+            this.valueWeights[i] -= lr * this.valueMomentum[i];
+        }
+        return {
+            policyLoss: policyLoss / batch.length,
+            valueLoss: valueLoss / batch.length,
+            entropy: entropy / batch.length,
+            clipFrac: clipFrac / batch.length,
+            kl: kl / batch.length,
+        };
+    }
+}
+/**
+ * Factory function
+ */
+export function createPPO(config) {
+    return new PPOAlgorithm(config);
+}
+//# sourceMappingURL=ppo.js.map