agentic-qe 2.6.0 → 2.6.2

package/dist/routing/ComplexityClassifier.d.ts

@@ -0,0 +1,266 @@
+/**
+ * ComplexityClassifier - ML-Based Task Complexity Classification
+ *
+ * Uses machine learning techniques to classify task complexity for optimal LLM routing.
+ * Improves upon heuristic-based classification with learning from routing outcomes.
+ *
+ * Features:
+ * - Feature extraction from LLM completion options
+ * - Weighted scoring with trainable parameters
+ * - Learning from routing history and outcomes
+ * - Confidence scoring for classification decisions
+ * - Persistent memory integration for cross-session learning
+ *
+ * @module routing/ComplexityClassifier
+ * @version 1.0.0
+ */
+import { LLMCompletionOptions } from '../providers/ILLMProvider';
+/**
+ * Task complexity levels
+ */
+export declare enum TaskComplexity {
+    SIMPLE = "simple",// Pattern matching, simple Q&A (< 500 chars, < 200 tokens)
+    MODERATE = "moderate",// Standard reasoning (< 3000 chars, < 1000 tokens)
+    COMPLEX = "complex",// Deep reasoning, code generation (< 10000 chars, < 4000 tokens)
+    VERY_COMPLEX = "very_complex"
+}
+/**
+ * Extracted features from task
+ */
+export interface TaskFeatures {
+    /** Total character count in messages */
+    contentLength: number;
+    /** Estimated token count */
+    estimatedTokenCount: number;
+    /** Number of messages in conversation */
+    messageCount: number;
+    /** Has code blocks (``` patterns) */
+    hasCodeBlocks: boolean;
+    /** Keyword complexity score (0-1) */
+    keywordComplexity: number;
+    /** Prompt entropy - vocabulary diversity (0-1) */
+    promptEntropy: number;
+    /** Context window usage percentage (0-1) */
+    contextWindowUsage: number;
+    /** Has multimodal content (images, etc.) */
+    hasMultimodal: boolean;
+    /** Requested max tokens */
+    requestedMaxTokens: number;
+    /** System prompt complexity (0-1) */
+    systemPromptComplexity: number;
+}
+/**
+ * Routing history entry for learning
+ */
+export interface RoutingHistoryEntry {
+    /** Extracted features from the task */
+    features: TaskFeatures;
+    /** Complexity classification that was selected */
+    selectedComplexity: TaskComplexity;
+    /** Actual outcome after execution */
+    actualOutcome: {
+        /** Whether the request succeeded */
+        success: boolean;
+        /** Actual latency in milliseconds */
+        latency: number;
+        /** Actual cost in dollars */
+        cost: number;
+        /** Provider used */
+        provider?: 'local' | 'cloud';
+        /** Any error message */
+        error?: string;
+    };
+    /** Timestamp of the routing decision */
+    timestamp: Date;
+}
+/**
+ * Trainable weights for feature scoring
+ */
+interface FeatureWeights {
+    contentLength: number;
+    tokenCount: number;
+    messageCount: number;
+    codeBlocks: number;
+    keywordComplexity: number;
+    promptEntropy: number;
+    contextWindowUsage: number;
+    multimodal: number;
+    systemPrompt: number;
+}
+/**
+ * Complexity classification thresholds
+ */
+interface ComplexityThresholds {
+    simple: number;
+    moderate: number;
+    complex: number;
+    veryComplex: number;
+}
+/**
+ * Configuration for ComplexityClassifier
+ */
+export interface ComplexityClassifierConfig {
+    /** Enable debug logging */
+    debug?: boolean;
+    /** Enable learning from outcomes */
+    enableLearning?: boolean;
+    /** Learning rate for weight updates (0-1) */
+    learningRate?: number;
+    /** Maximum history entries to store */
+    maxHistorySize?: number;
+    /** Initial feature weights */
+    initialWeights?: Partial<FeatureWeights>;
+    /** Initial complexity thresholds */
+    initialThresholds?: Partial<ComplexityThresholds>;
+}
+/**
+ * ComplexityClassifier - ML-based task complexity classification
+ *
+ * Classifies LLM tasks into complexity levels using feature extraction
+ * and trainable weighted scoring. Learns from routing outcomes to improve
+ * classification accuracy over time.
+ *
+ * @example
+ * ```typescript
+ * const classifier = new ComplexityClassifier({
+ *   enableLearning: true,
+ *   learningRate: 0.1
+ * });
+ *
+ * const complexity = classifier.classifyTask(options);
+ * // After execution
+ * classifier.recordOutcome({
+ *   features: classifier.extractFeatures(options),
+ *   selectedComplexity: complexity,
+ *   actualOutcome: { success: true, latency: 1500, cost: 0.001 }
+ * });
+ * ```
+ */
+export declare class ComplexityClassifier {
+    private readonly logger;
+    private readonly config;
+    private weights;
+    private thresholds;
+    private routingHistory;
+    private classificationCount;
+    private confidenceScores;
+    constructor(config?: ComplexityClassifierConfig);
+    /**
+     * Classify task complexity using ML-based feature extraction and scoring
+     *
+     * @param options - LLM completion options to analyze
+     * @returns Classified complexity level
+     */
+    classifyTask(options: LLMCompletionOptions): TaskComplexity;
+    /**
+     * Extract features from LLM completion options
+     *
+     * @param options - LLM completion options
+     * @returns Extracted task features
+     */
+    extractFeatures(options: LLMCompletionOptions): TaskFeatures;
+    /**
+     * Record routing outcome for learning
+     *
+     * @param entry - Routing history entry with outcome
+     */
+    recordOutcome(entry: RoutingHistoryEntry): void;
+    /**
+     * Get classification confidence (0-1)
+     *
+     * Confidence is based on:
+     * - How clearly the score falls into a complexity bucket
+     * - Historical accuracy of similar classifications
+     *
+     * @returns Confidence score (0-1)
+     */
+    getClassificationConfidence(): number;
+    /**
+     * Get current feature weights
+     *
+     * @returns Current feature weights
+     */
+    getWeights(): FeatureWeights;
+    /**
+     * Get current complexity thresholds
+     *
+     * @returns Current thresholds
+     */
+    getThresholds(): ComplexityThresholds;
+    /**
+     * Get routing history
+     *
+     * @returns Copy of routing history
+     */
+    getHistory(): RoutingHistoryEntry[];
+    /**
+     * Get classification statistics
+     *
+     * @returns Statistics about classifications and learning
+     */
+    getStatistics(): {
+        totalClassifications: number;
+        historySize: number;
+        averageConfidence: number;
+        successRate: number;
+        complexityDistribution: Record<TaskComplexity, number>;
+    };
+    /**
+     * Extract all text content from messages
+     */
+    private extractAllContent;
+    /**
+     * Calculate keyword complexity score (0-1)
+     *
+     * Analyzes presence of complex technical keywords and patterns
+     */
+    private calculateKeywordComplexity;
+    /**
+     * Calculate prompt entropy (vocabulary diversity)
+     *
+     * Higher entropy = more diverse vocabulary = potentially more complex
+     */
+    private calculatePromptEntropy;
+    /**
+     * Calculate system prompt complexity
+     */
+    private calculateSystemPromptComplexity;
+    /**
+     * Calculate weighted complexity score (0-1)
+     */
+    private calculateComplexityScore;
+    /**
+     * Convert complexity score to complexity level
+     */
+    private scoreToComplexity;
+    /**
+     * Calculate confidence for a classification
+     */
+    private calculateConfidence;
+    /**
+     * Update weights based on routing outcome (gradient descent style)
+     */
+    private updateWeightsFromOutcome;
+    /**
+     * Increment complexity level
+     */
+    private incrementComplexity;
+    /**
+     * Decrement complexity level
+     */
+    private decrementComplexity;
+    /**
+     * Adjust weights to better match expected complexity
+     */
+    private adjustWeights;
+    /**
+     * Convert complexity to target score for learning
+     */
+    private complexityToTargetScore;
+    /**
+     * Normalize weights to sum to 1.0
+     */
+    private normalizeWeights;
+}
+export {};
+//# sourceMappingURL=ComplexityClassifier.d.ts.map

package/dist/routing/ComplexityClassifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ComplexityClassifier.d.ts","sourceRoot":"","sources":["../../src/routing/ComplexityClassifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAGjE;;GAEG;AACH,oBAAY,cAAc;IACxB,MAAM,WAAW,CAAS,2DAA2D;IACrF,QAAQ,aAAa,CAAK,mDAAmD;IAC7E,OAAO,YAAY,CAAO,iEAAiE;IAC3F,YAAY,iBAAiB;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,wCAAwC;IACxC,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,yCAAyC;IACzC,YAAY,EAAE,MAAM,CAAC;IACrB,qCAAqC;IACrC,aAAa,EAAE,OAAO,CAAC;IACvB,qCAAqC;IACrC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IACtB,4CAA4C;IAC5C,kBAAkB,EAAE,MAAM,CAAC;IAC3B,4CAA4C;IAC5C,aAAa,EAAE,OAAO,CAAC;IACvB,2BAA2B;IAC3B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,qCAAqC;IACrC,sBAAsB,EAAE,MAAM,CAAC;CAChC;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,uCAAuC;IACvC,QAAQ,EAAE,YAAY,CAAC;IACvB,kDAAkD;IAClD,kBAAkB,EAAE,cAAc,CAAC;IACnC,qCAAqC;IACrC,aAAa,EAAE;QACb,oCAAoC;QACpC,OAAO,EAAE,OAAO,CAAC;QACjB,qCAAqC;QACrC,OAAO,EAAE,MAAM,CAAC;QAChB,6BAA6B;QAC7B,IAAI,EAAE,MAAM,CAAC;QACb,oBAAoB;QACpB,QAAQ,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC;QAC7B,wBAAwB;QACxB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,CAAC;IACF,wCAAwC;IACxC,SAAS,EAAE,IAAI,CAAC;CACjB;AAED;;GAEG;AACH,UAAU,cAAc;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,UAAU,oBAAoB;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,0BAA0B;IACzC,2BAA2B;IAC3B,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,oCAAoC;IACpC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,6CAA6C;IAC7C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,uCAAuC;IACvC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,8BAA8B;IAC9B,cAAc,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IACzC,oCAAoC;IACpC,iBAAiB,CAAC,EAAE,OAAO,CAAC,oBAAoB,CAAC,CAAC;CACnD;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuC;IAC9D,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,cAAc,CAAwB;IAC9C,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,gBAAgB,CAAW;gBAEvB,MAAM,GAAE,0BAA+B;IAgDnD;;;;;OAKG;IACH,YAAY,CAAC,OAAO,EAAE,oBAAoB,GAAG,cAAc;IA+B3D;;;;;OAKG;IACH,eAAe,CAAC,OAAO,EAAE,oBAAoB,GAAG,YAAY;IAgD5D;;;;OAIG;IACH,aAAa,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI;IA4B/C;;;;;;;;OAQG;IACH,2BAA2B,IAAI,MAAM;IAUrC;;;;OAIG;IACH,UAAU,IAAI,cAAc;IAI5B;;;;OAIG;IACH,aAAa,IAAI,oBAAoB;IAIrC;;;;OAIG;IACH,UAAU,IAAI,mBAAmB,EAAE;IAInC;;;;OAIG;IACH,aAAa,IAAI;QACf,oBAAoB,EAAE,MAAM,CAAC;QAC7B,WAAW,EAAE,MAAM,CAAC;QACpB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,WAAW,EAAE,MAAM,CAAC;QACpB,sBAAsB,EAAE,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;KACxD;IA0BD;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAoBzB;;;;OAIG;IACH,OAAO,CAAC,0BAA0B;IAoClC;;;;OAIG;IACH,OAAO,CAAC,sBAAsB;IA4B9B;;OAEG;IACH,OAAO,CAAC,+BAA+B;IAevC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAoChC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAazB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAgC3B;;OAEG;IACH,OAAO,CAAC,wBAAwB;IA2BhC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAW3B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAW3B;;OAEG;IACH,OAAO,CAAC,aAAa;IAqDrB;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAa/B;;OAEG;IACH,OAAO,CAAC,gBAAgB;CASzB"}