agentic-qe 3.7.9 → 3.7.11

package/assets/patterns/adr-051-embedding-patterns.json

@@ -1,147 +1,147 @@
-{
-  "namespace": "adr-051/embedding-patterns",
-  "description": "ONNX Embeddings Integration Patterns from ADR-051",
-  "created": "2026-01-20",
-  "patterns": [
-    {
-      "key": "embeddings-local-generation",
-      "pattern": "Local ONNX Embeddings Generation",
-      "description": "Generate text embeddings locally without external API calls",
-      "models_supported": [
-        "all-MiniLM-L6-v2 (fast, 384-dim)",
-        "all-mpnet-base-v2 (accurate, 768-dim)"
-      ],
-      "generation_process": {
-        "tokenization": "BPE tokenization for input text",
-        "forward_pass": "ONNX runtime inference",
-        "pooling": "Mean pooling of token embeddings",
-        "normalization": "L2 normalization for cosine similarity"
-      },
-      "performance_characteristics": {
-        "latency_per_text": "5-50ms (L6) to 20-100ms (mpnet)",
-        "throughput": "100-1000 embeddings/second",
-        "memory_footprint": "50-200MB model + cache",
-        "cpu_intensive": "Can use GPU acceleration if available"
-      },
-      "quality_metrics": {
-        "semantic_accuracy": "0.85-0.92 correlation with GT",
-        "dimensionality": "384 or 768 dims",
-        "normalized": "Unit sphere for cosine distance"
-      },
-      "successRate": 0.94,
-      "lastUpdated": "2026-01-20"
-    },
-    {
-      "key": "embeddings-lru-cache",
-      "pattern": "LRU Cache Strategy for Embeddings",
-      "description": "Efficient caching of generated embeddings to avoid redundant computation",
-      "cache_architecture": {
-        "cache_type": "LRU (Least Recently Used eviction)",
-        "default_size": "256-1024 entries",
-        "configurable": "Adjust for memory constraints"
-      },
-      "cache_key_strategy": {
-        "primary_key": "SHA256(text)",
-        "collision_rate": "<0.001 (negligible)",
-        "metadata": "Timestamp, model_id, norm_status"
-      },
-      "eviction_policy": {
-        "least_recently_used": "Remove oldest unused entries",
-        "time_to_live": "Optional TTL for staleness",
-        "size_limit": "Enforce max memory footprint"
-      },
-      "hit_ratio_expectations": {
-        "typical_workload": "60-80% cache hit rate",
-        "repeated_queries": "80-95% hit rate",
-        "cold_start": "0% until warmed"
-      },
-      "optimization_techniques": [
-        "Batch embedding for multiple texts",
-        "Predictive prefetching of similar queries",
-        "Compression of cached embeddings",
-        "Distributed cache for multi-agent systems"
-      ],
-      "memory_efficiency": "4x speedup with minimal memory overhead",
-      "successRate": 0.96,
-      "lastUpdated": "2026-01-20"
-    },
-    {
-      "key": "embeddings-hyperbolic-space",
-      "pattern": "Hyperbolic Space for Hierarchical Data",
-      "description": "Use Poincaré ball model for embeddings with hierarchical relationships",
-      "hyperbolic_geometry": {
-        "model": "Poincaré ball",
-        "curvature": "Negative (typically -1)",
-        "distance_metric": "Poincaré distance",
-        "property": "Exponential volume growth captures hierarchies naturally"
-      },
-      "use_cases": [
-        "Taxonomies (file hierarchies, class inheritance)",
-        "Knowledge graphs with parent-child relationships",
-        "Organization structures",
-        "Tree-like data representations",
-        "Ontologies"
-      ],
-      "conversion_process": {
-        "euclidean_to_hyperbolic": "Transform via exponential map",
-        "poincare_projection": "Project to Poincaré ball boundary",
-        "bidirectional": "Can convert back to Euclidean"
-      },
-      "distance_computation": {
-        "poincare_distance": "d(x,y) = arccosh(...) - efficient for hierarchies",
-        "advantages": "Better representation of tree structures",
-        "computational_cost": "Slightly higher than Euclidean"
-      },
-      "similarity_metrics": {
-        "poincare": "Best for hierarchical data",
-        "euclidean": "Used for intermediate euclidean embeddings",
-        "mixed": "Combine metrics based on data type"
-      },
-      "memory_efficiency": "Fewer dimensions needed to capture hierarchy",
-      "successRate": 0.9,
-      "lastUpdated": "2026-01-20"
-    },
-    {
-      "key": "embeddings-similarity-metrics",
-      "pattern": "Multi-Metric Similarity for Different Data Types",
-      "description": "Use appropriate similarity metrics for different embedding spaces",
-      "metrics_overview": {
-        "cosine_similarity": {
-          "formula": "cos(angle) = (a·b) / (||a|| ||b||)",
-          "range": "[-1, 1]",
-          "best_for": "Normalized embeddings, angle-based similarity",
-          "computational_complexity": "O(n)",
-          "use_case": "General purpose text similarity"
-        },
-        "euclidean_distance": {
-          "formula": "sqrt(sum((a_i - b_i)^2))",
-          "range": "[0, inf)",
-          "best_for": "Raw embeddings, geometric distance",
-          "computational_complexity": "O(n)",
-          "use_case": "Cluster-based similarity"
-        },
-        "poincare_distance": {
-          "formula": "arccosh(1 + 2*D/(1-||x||^2)(1-||y||^2))",
-          "range": "[0, inf)",
-          "best_for": "Hyperbolic embeddings, hierarchies",
-          "computational_complexity": "O(n) with overhead",
-          "use_case": "Taxonomies, knowledge graphs"
-        }
-      },
-      "selection_strategy": {
-        "step_1": "Identify embedding space type",
-        "step_2": "Choose metric for space",
-        "step_3": "Apply threshold for similarity",
-        "step_4": "Aggregate scores if combining metrics"
-      },
-      "threshold_tuning": {
-        "cosine": ">0.7 typically indicates similarity",
-        "euclidean": "<0.5 for normalized 384-dim vectors",
-        "poincare": "<1.0 for meaningful hierarchy"
-      },
-      "hybrid_approach": "Combine metrics for ensemble similarity",
-      "successRate": 0.93,
-      "lastUpdated": "2026-01-20"
-    }
-  ]
-}
+{
+  "namespace": "adr-051/embedding-patterns",
+  "description": "ONNX Embeddings Integration Patterns from ADR-051",
+  "created": "2026-01-20",
+  "patterns": [
+    {
+      "key": "embeddings-local-generation",
+      "pattern": "Local ONNX Embeddings Generation",
+      "description": "Generate text embeddings locally without external API calls",
+      "models_supported": [
+        "all-MiniLM-L6-v2 (fast, 384-dim)",
+        "all-mpnet-base-v2 (accurate, 768-dim)"
+      ],
+      "generation_process": {
+        "tokenization": "BPE tokenization for input text",
+        "forward_pass": "ONNX runtime inference",
+        "pooling": "Mean pooling of token embeddings",
+        "normalization": "L2 normalization for cosine similarity"
+      },
+      "performance_characteristics": {
+        "latency_per_text": "5-50ms (L6) to 20-100ms (mpnet)",
+        "throughput": "100-1000 embeddings/second",
+        "memory_footprint": "50-200MB model + cache",
+        "cpu_intensive": "Can use GPU acceleration if available"
+      },
+      "quality_metrics": {
+        "semantic_accuracy": "0.85-0.92 correlation with GT",
+        "dimensionality": "384 or 768 dims",
+        "normalized": "Unit sphere for cosine distance"
+      },
+      "successRate": 0.94,
+      "lastUpdated": "2026-01-20"
+    },
+    {
+      "key": "embeddings-lru-cache",
+      "pattern": "LRU Cache Strategy for Embeddings",
+      "description": "Efficient caching of generated embeddings to avoid redundant computation",
+      "cache_architecture": {
+        "cache_type": "LRU (Least Recently Used eviction)",
+        "default_size": "256-1024 entries",
+        "configurable": "Adjust for memory constraints"
+      },
+      "cache_key_strategy": {
+        "primary_key": "SHA256(text)",
+        "collision_rate": "<0.001 (negligible)",
+        "metadata": "Timestamp, model_id, norm_status"
+      },
+      "eviction_policy": {
+        "least_recently_used": "Remove oldest unused entries",
+        "time_to_live": "Optional TTL for staleness",
+        "size_limit": "Enforce max memory footprint"
+      },
+      "hit_ratio_expectations": {
+        "typical_workload": "60-80% cache hit rate",
+        "repeated_queries": "80-95% hit rate",
+        "cold_start": "0% until warmed"
+      },
+      "optimization_techniques": [
+        "Batch embedding for multiple texts",
+        "Predictive prefetching of similar queries",
+        "Compression of cached embeddings",
+        "Distributed cache for multi-agent systems"
+      ],
+      "memory_efficiency": "4x speedup with minimal memory overhead",
+      "successRate": 0.96,
+      "lastUpdated": "2026-01-20"
+    },
+    {
+      "key": "embeddings-hyperbolic-space",
+      "pattern": "Hyperbolic Space for Hierarchical Data",
+      "description": "Use Poincaré ball model for embeddings with hierarchical relationships",
+      "hyperbolic_geometry": {
+        "model": "Poincaré ball",
+        "curvature": "Negative (typically -1)",
+        "distance_metric": "Poincaré distance",
+        "property": "Exponential volume growth captures hierarchies naturally"
+      },
+      "use_cases": [
+        "Taxonomies (file hierarchies, class inheritance)",
+        "Knowledge graphs with parent-child relationships",
+        "Organization structures",
+        "Tree-like data representations",
+        "Ontologies"
+      ],
+      "conversion_process": {
+        "euclidean_to_hyperbolic": "Transform via exponential map",
+        "poincare_projection": "Project to Poincaré ball boundary",
+        "bidirectional": "Can convert back to Euclidean"
+      },
+      "distance_computation": {
+        "poincare_distance": "d(x,y) = arccosh(...) - efficient for hierarchies",
+        "advantages": "Better representation of tree structures",
+        "computational_cost": "Slightly higher than Euclidean"
+      },
+      "similarity_metrics": {
+        "poincare": "Best for hierarchical data",
+        "euclidean": "Used for intermediate euclidean embeddings",
+        "mixed": "Combine metrics based on data type"
+      },
+      "memory_efficiency": "Fewer dimensions needed to capture hierarchy",
+      "successRate": 0.9,
+      "lastUpdated": "2026-01-20"
+    },
+    {
+      "key": "embeddings-similarity-metrics",
+      "pattern": "Multi-Metric Similarity for Different Data Types",
+      "description": "Use appropriate similarity metrics for different embedding spaces",
+      "metrics_overview": {
+        "cosine_similarity": {
+          "formula": "cos(angle) = (a·b) / (||a|| ||b||)",
+          "range": "[-1, 1]",
+          "best_for": "Normalized embeddings, angle-based similarity",
+          "computational_complexity": "O(n)",
+          "use_case": "General purpose text similarity"
+        },
+        "euclidean_distance": {
+          "formula": "sqrt(sum((a_i - b_i)^2))",
+          "range": "[0, inf)",
+          "best_for": "Raw embeddings, geometric distance",
+          "computational_complexity": "O(n)",
+          "use_case": "Cluster-based similarity"
+        },
+        "poincare_distance": {
+          "formula": "arccosh(1 + 2*D/(1-||x||^2)(1-||y||^2))",
+          "range": "[0, inf)",
+          "best_for": "Hyperbolic embeddings, hierarchies",
+          "computational_complexity": "O(n) with overhead",
+          "use_case": "Taxonomies, knowledge graphs"
+        }
+      },
+      "selection_strategy": {
+        "step_1": "Identify embedding space type",
+        "step_2": "Choose metric for space",
+        "step_3": "Apply threshold for similarity",
+        "step_4": "Aggregate scores if combining metrics"
+      },
+      "threshold_tuning": {
+        "cosine": ">0.7 typically indicates similarity",
+        "euclidean": "<0.5 for normalized 384-dim vectors",
+        "poincare": "<1.0 for meaningful hierarchy"
+      },
+      "hybrid_approach": "Combine metrics for ensemble similarity",
+      "successRate": 0.93,
+      "lastUpdated": "2026-01-20"
+    }
+  ]
+}

package/assets/patterns/adr-051-integration-summary.json

@@ -1,62 +1,62 @@
-{
-  "pattern": "ADR-051 Complete Integration Architecture",
-  "namespace": "adr-051/summary",
-  "created": "2026-01-20",
-  "version": "1.0",
-  "description": "End-to-end integration of all four components: Agent Booster, Model Router, ONNX Embeddings, ReasoningBank",
-  "components": [
-    "Agent Booster (WASM transforms)",
-    "Model Router (5-tier complexity)",
-    "ONNX Embeddings (local generation)",
-    "ReasoningBank (trajectory learning)"
-  ],
-  "integration_flow": {
-    "phase_1_receive": "Task arrives at coordinator",
-    "phase_2_analyze": "Calculate complexity score and collect embeddings",
-    "phase_3_route": "Model router checks booster eligibility first, then selects model tier",
-    "phase_4_execute": "Execute via Agent Booster (WASM) or model tier (API)",
-    "phase_5_record": "Track trajectory in ReasoningBank with quality score",
-    "phase_6_learn": "Extract patterns, apply quality gates, share with agents"
-  },
-  "performance_outcomes": {
-    "simple_transforms": "<1ms via booster ($0 cost)",
-    "avg_task_latency": "2-5s with intelligent routing",
-    "cost_savings": "40-60% reduction vs naive routing",
-    "quality_improvement": "5-15% better outcomes with learned patterns"
-  },
-  "reliability_characteristics": {
-    "fallback_layers": "Booster → Model tier → Human review",
-    "error_recovery": "Retry with degraded model if needed",
-    "quality_threshold": "Reject low-confidence results",
-    "audit_trail": "Full trajectory logging for compliance"
-  },
-  "scaling_properties": {
-    "multi_agent": "Distributed across swarm",
-    "knowledge_sharing": "Patterns propagate via gossip protocol",
-    "adaptive_routing": "Learns optimal paths over time",
-    "load_distribution": "Auto-scale based on demand"
-  },
-  "deployment_checklist": [
-    "Agent Booster WASM module deployed",
-    "Model router API integrated",
-    "ONNX embedding service running",
-    "ReasoningBank trajectory database initialized",
-    "Quality gate thresholds configured",
-    "Pattern storage and retrieval working",
-    "Cross-agent sharing channels open",
-    "Monitoring and metrics collection active"
-  ],
-  "key_patterns": {
-    "booster_patterns": "14 files in .agentic-qe/patterns/adr-051-booster-patterns.json",
-    "router_patterns": "3 files in .agentic-qe/patterns/adr-051-router-patterns.json",
-    "embedding_patterns": "4 files in .agentic-qe/patterns/adr-051-embedding-patterns.json",
-    "reasoning_patterns": "4 files in .agentic-qe/patterns/adr-051-reasoning-patterns.json"
-  },
-  "successRate": 0.92,
-  "lastUpdated": "2026-01-20",
-  "implementation_status": "Production Ready",
-  "cross_session_learning_enabled": true,
-  "pattern_retrieval_strategy": "Load from JSON files in .agentic-qe/patterns/ on session start",
-  "pattern_update_strategy": "Append new patterns, maintain version history",
-  "memory_coordination_notes": "All patterns stored persistently for multi-session learning and agent coordination"
-}
+{
+  "pattern": "ADR-051 Complete Integration Architecture",
+  "namespace": "adr-051/summary",
+  "created": "2026-01-20",
+  "version": "1.0",
+  "description": "End-to-end integration of all four components: Agent Booster, Model Router, ONNX Embeddings, ReasoningBank",
+  "components": [
+    "Agent Booster (WASM transforms)",
+    "Model Router (5-tier complexity)",
+    "ONNX Embeddings (local generation)",
+    "ReasoningBank (trajectory learning)"
+  ],
+  "integration_flow": {
+    "phase_1_receive": "Task arrives at coordinator",
+    "phase_2_analyze": "Calculate complexity score and collect embeddings",
+    "phase_3_route": "Model router checks booster eligibility first, then selects model tier",
+    "phase_4_execute": "Execute via Agent Booster (WASM) or model tier (API)",
+    "phase_5_record": "Track trajectory in ReasoningBank with quality score",
+    "phase_6_learn": "Extract patterns, apply quality gates, share with agents"
+  },
+  "performance_outcomes": {
+    "simple_transforms": "<1ms via booster ($0 cost)",
+    "avg_task_latency": "2-5s with intelligent routing",
+    "cost_savings": "40-60% reduction vs naive routing",
+    "quality_improvement": "5-15% better outcomes with learned patterns"
+  },
+  "reliability_characteristics": {
+    "fallback_layers": "Booster → Model tier → Human review",
+    "error_recovery": "Retry with degraded model if needed",
+    "quality_threshold": "Reject low-confidence results",
+    "audit_trail": "Full trajectory logging for compliance"
+  },
+  "scaling_properties": {
+    "multi_agent": "Distributed across swarm",
+    "knowledge_sharing": "Patterns propagate via gossip protocol",
+    "adaptive_routing": "Learns optimal paths over time",
+    "load_distribution": "Auto-scale based on demand"
+  },
+  "deployment_checklist": [
+    "Agent Booster WASM module deployed",
+    "Model router API integrated",
+    "ONNX embedding service running",
+    "ReasoningBank trajectory database initialized",
+    "Quality gate thresholds configured",
+    "Pattern storage and retrieval working",
+    "Cross-agent sharing channels open",
+    "Monitoring and metrics collection active"
+  ],
+  "key_patterns": {
+    "booster_patterns": "14 files in .agentic-qe/patterns/adr-051-booster-patterns.json",
+    "router_patterns": "3 files in .agentic-qe/patterns/adr-051-router-patterns.json",
+    "embedding_patterns": "4 files in .agentic-qe/patterns/adr-051-embedding-patterns.json",
+    "reasoning_patterns": "4 files in .agentic-qe/patterns/adr-051-reasoning-patterns.json"
+  },
+  "successRate": 0.92,
+  "lastUpdated": "2026-01-20",
+  "implementation_status": "Production Ready",
+  "cross_session_learning_enabled": true,
+  "pattern_retrieval_strategy": "Load from JSON files in .agentic-qe/patterns/ on session start",
+  "pattern_update_strategy": "Append new patterns, maintain version history",
+  "memory_coordination_notes": "All patterns stored persistently for multi-session learning and agent coordination"
+}