agentdebugx 0.2.9__tar.gz → 0.2.10__tar.gz

{agentdebugx-0.2.9 → agentdebugx-0.2.10}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: agentdebugx
-Version: 0.2.9
+Version: 0.2.10
 Summary: Portable error analysis, tracing, and recovery framework for agentic AI systems. Import as `agentdebug`.
 License: MIT
 License-File: LICENSE

{agentdebugx-0.2.9 → agentdebugx-0.2.10}/docs/23_status_v0_2.md

@@ -23,6 +23,7 @@ the forward-looking plan; this doc is the rear-view mirror.
 | Attribution | `agentdebug.attribution.BinarySearchAttributor` | ✅ **new 0.2.3** | oracle-LLM logarithmic convergence + fallback + render elision |
 | Attribution | `agentdebug.attribution.CounterfactualAttributor` | ✅ **new 0.2.7** | scripted-rescue-prob ranking + candidate selection priority (findings → errors → tail) + dual fallback (no candidates / silent LLM) |
 | Attribution | `agentdebug.attribution.SBFLAttributor` (Tarantula / Ochiai / DStar) | ✅ **new 0.2.8** | signature design + ranking on synthetic corpus + 3 formulas + dual fallback + edge cases. Model-free: zero LLM cost at inference. |
+| Attribution | `agentdebug.attribution.EnsembleAttributor` (+ `AttributionBudget`) | ✅ **new 0.2.10** | Borda + Bayesian merge, weighted backends, walltime/backend-count budget, swallows backend exceptions, falls back when all empty, honest per-source provenance |
 | Recovery | `agentdebug.recovery.ReflexionSuggestion` | ✅ stable | per-finding + empty |
 | Recovery | `agentdebug.recovery.CriticRecoverer` + `VerifierSpec` registry | ✅ **new 0.2.3** | 5 family-matched verifier templates; dedup + custom-override |
 | Recovery | `agentdebug.recovery.SelfRefineLoop` | ✅ **new 0.2.9** | scripted-LLM happy + silent-LLM safe + multi-iter; per-finding generator→critic→refiner |
@@ -54,7 +55,6 @@ across 32 source files.
 | [07_attribution.md](./07_attribution.md) | `CounterfactualAttributor` — *real* replay variant | true re-rollout requires framework-specific replay surface; the v0.2.7 LLM-simulated variant ships now, the real-replay variant is gated on adapter support (LangGraph checkpointer / OpenHands rewind) | v0.4 |
 | [07_attribution.md](./07_attribution.md) | `SBFLAttributor` — *corpus* | shipped in 0.2.8 (`tarantula`/`ochiai`/`dstar`); awaiting paired-trace adoption to gather a useful corpus in production | corpus tooling deferred to v0.4 |
 | [07_attribution.md](./07_attribution.md) | `DeltaDebugAttributor` (Zeller) | same replay constraint | v0.3 |
-| [07_attribution.md](./07_attribution.md) | `EnsembleAttributor` | trivial once Counterfactual lands; awaits Counterfactual | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `LangGraphRewind` | depends on LangGraph checkpointer; ships when we have a real LangGraph user | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `SagaRollback` | needs compensation registry on tool definitions; new schema | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `MCTSBranchExploration` (LATS) | heavy; v2 feature | v2.0 |

{agentdebugx-0.2.9 → agentdebugx-0.2.10}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "agentdebugx"
-version = "0.2.9"
+version = "0.2.10"
 description = "Portable error analysis, tracing, and recovery framework for agentic AI systems. Import as `agentdebug`."
 authors = ["ULab @ UIUC <ulab@illinois.edu>"]
 license = "MIT"

{agentdebugx-0.2.9 → agentdebugx-0.2.10}/src/agentdebug/__init__.py

@@ -11,11 +11,13 @@ See ``docs/14_api_reference.md`` for the full public surface and
 from agentdebug.analyzers import HeuristicAnalyzer
 from agentdebug.attribution import (
     AllAtOnceAttributor,
+    AttributionBudget,
     AttributionResult,
     Attributor,
     BinarySearchAttributor,
     Blame,
     CounterfactualAttributor,
+    EnsembleAttributor,
     HeuristicAttributor,
     SBFLAttributor,
     StepByStepAttributor,
@@ -65,6 +67,7 @@ __all__ = [
     'Attributor',
     'Blame',
     'BusEvent',
+    'AttributionBudget',
     'AutoManualRules',
     'BinarySearchAttributor',
     'CascadeFrame',
@@ -73,6 +76,7 @@ __all__ = [
     'DEFAULT_VERIFIERS',
     'Detector',
     'DetectorConfig',
+    'EnsembleAttributor',
     'RepeatedStateDetector',
     'RepeatedToolCallDetector',
     'SBFLAttributor',
@@ -104,4 +108,4 @@ __all__ = [
     'get_failure_mode',
 ]
 
-__version__ = '0.2.9'
+__version__ = '0.2.10'

{agentdebugx-0.2.9 → agentdebugx-0.2.10}/src/agentdebug/attribution.py

@@ -19,7 +19,7 @@ from __future__ import annotations
 
 import logging
 from dataclasses import dataclass, field
-from typing import Any, Dict, List, Optional, Protocol, cast
+from typing import Any, Dict, List, Optional, Protocol, Tuple, cast
 
 
 # Forward decl so BinarySearchAttributor.attribute can reference _EllipsisEvent
@@ -936,8 +936,217 @@ def _suspiciousness(
     return float((ef ** dstar_exponent) / denom)
 
 
+@dataclass
+class AttributionBudget:
+    """Optional cap on ensemble cost."""
+
+    max_backends: Optional[int] = None     # short-circuit after N successful backends
+    max_seconds: Optional[float] = None    # walltime cap; remaining backends skipped
+
+    def exceeded(
+        self, *, completed: int, elapsed_s: float,
+    ) -> bool:
+        if self.max_backends is not None and completed >= self.max_backends:
+            return True
+        if self.max_seconds is not None and elapsed_s >= self.max_seconds:
+            return True
+        return False
+
+
+class EnsembleAttributor:
+    """Compose any subset of attributors into a single ranked result.
+
+    Two merge strategies:
+
+      * ``"borda"`` (default) — each backend's ranked list contributes
+        Borda points (top hypothesis = N, next = N-1, …). Steps are
+        ranked by total points × backend weight; ties broken by primary
+        confidence × weight.
+      * ``"bayesian"`` — combine confidences as 1 - ∏(1 - w_i × c_i)
+        across backends that nominated the same (event_id, step_index).
+        Treats each backend as an independent noisy classifier; good when
+        backends are heterogeneous and confidences are well-calibrated.
+
+    Provenance is HONEST: every output ``Blame.sources`` lists every
+    backend that contributed; the rationale aggregates source-by-source
+    so the UI can show which backends agreed.
+
+    Pair with ``AttributionBudget`` to cap wall-clock or backend count
+    when running expensive backends (e.g., BinarySearch + Counterfactual)
+    alongside cheap ones (Heuristic + SBFL).
+    """
+
+    id = 'ensemble'
+
+    def __init__(
+        self,
+        backends: List[Attributor],
+        *,
+        weights: Optional[Dict[str, float]] = None,
+        merge: str = 'borda',
+        top_k: int = 5,
+        budget: Optional[AttributionBudget] = None,
+        fallback: Optional[Attributor] = None,
+    ) -> None:
+        if not backends:
+            raise ValueError('EnsembleAttributor requires at least one backend')
+        if merge not in {'borda', 'bayesian'}:
+            raise ValueError(
+                f"Unknown merge strategy {merge!r}; use 'borda' or 'bayesian'"
+            )
+        self.backends = list(backends)
+        self.weights = weights or {b.id: 1.0 for b in backends}
+        self.merge = merge
+        self.top_k = top_k
+        self.budget = budget
+        self.fallback: Attributor = fallback or HeuristicAttributor()
+
+    def attribute(
+        self,
+        trajectory: AgentTrajectory,
+        findings: List[FailureFinding],
+    ) -> AttributionResult:
+        import time as _time
+
+        per_backend: List[Tuple[str, AttributionResult]] = []
+        started = _time.perf_counter()
+        for backend in self.backends:
+            if self.budget and self.budget.exceeded(
+                completed=len(per_backend),
+                elapsed_s=_time.perf_counter() - started,
+            ):
+                LOG.debug('ensemble budget hit; stopping early')
+                break
+            try:
+                result = backend.attribute(trajectory, findings)
+            except Exception as exc:  # pragma: no cover - defensive
+                LOG.warning('ensemble backend %s raised: %s', backend.id, exc)
+                continue
+            per_backend.append((backend.id, result))
+
+        # Any backend produced hypotheses? Otherwise fall back.
+        if not any(r.hypotheses for _id, r in per_backend):
+            return self.fallback.attribute(trajectory, findings)
+
+        if self.merge == 'borda':
+            merged = self._merge_borda(per_backend)
+        else:
+            merged = self._merge_bayesian(per_backend)
+
+        merged = merged[: self.top_k]
+        elapsed_ms = int((_time.perf_counter() - started) * 1000)
+        return AttributionResult(
+            method=self.id,
+            hypotheses=merged,
+            elapsed_ms=elapsed_ms,
+            raw={
+                'merge': self.merge,
+                'backends_run': [bid for bid, _ in per_backend],
+                'weights': dict(self.weights),
+                'budget_exceeded': bool(
+                    self.budget
+                    and self.budget.exceeded(
+                        completed=len(per_backend),
+                        elapsed_s=_time.perf_counter() - started,
+                    )
+                ),
+            },
+        )
+
+    # ---- merge strategies ----
+
+    def _merge_borda(
+        self, per_backend: List[Tuple[str, AttributionResult]],
+    ) -> List[Blame]:
+        # Aggregator keyed by canonical step identity.
+        agg: Dict[Tuple[Optional[str], Optional[int]], _MergeRow] = {}
+        for backend_id, result in per_backend:
+            w = self.weights.get(backend_id, 1.0)
+            n = len(result.hypotheses)
+            for rank, h in enumerate(result.hypotheses):
+                key = (h.span_id, h.step_index)
+                row = agg.setdefault(key, _MergeRow(span_id=h.span_id,
+                                                   step_index=h.step_index))
+                # Borda points: top = N, next = N-1, … last = 1
+                row.borda_points += (n - rank) * w
+                row.weighted_conf_sum += w * h.confidence
+                row.weight_sum += w
+                row.sources.add(backend_id)
+                if h.agent_name and not row.agent_name:
+                    row.agent_name = h.agent_name
+                if h.rationale and backend_id not in row.rationales:
+                    row.rationales[backend_id] = h.rationale
+                row.evidence.extend(h.evidence)
+        ranked = sorted(
+            agg.values(),
+            key=lambda r: (-r.borda_points, -r.weighted_conf_sum),
+        )
+        return [self._row_to_blame(r) for r in ranked]
+
+    def _merge_bayesian(
+        self, per_backend: List[Tuple[str, AttributionResult]],
+    ) -> List[Blame]:
+        agg: Dict[Tuple[Optional[str], Optional[int]], _MergeRow] = {}
+        for backend_id, result in per_backend:
+            w = self.weights.get(backend_id, 1.0)
+            for h in result.hypotheses:
+                key = (h.span_id, h.step_index)
+                row = agg.setdefault(key, _MergeRow(span_id=h.span_id,
+                                                   step_index=h.step_index))
+                # P(no source supports) *= (1 - w*c)
+                effective = max(0.0, min(1.0, w * h.confidence))
+                row.bayesian_not_pos *= (1.0 - effective)
+                row.weighted_conf_sum += w * h.confidence
+                row.weight_sum += w
+                row.sources.add(backend_id)
+                if h.agent_name and not row.agent_name:
+                    row.agent_name = h.agent_name
+                if h.rationale and backend_id not in row.rationales:
+                    row.rationales[backend_id] = h.rationale
+                row.evidence.extend(h.evidence)
+        ranked = sorted(
+            agg.values(),
+            key=lambda r: (-(1.0 - r.bayesian_not_pos), -r.weighted_conf_sum),
+        )
+        return [self._row_to_blame(r) for r in ranked]
+
+    def _row_to_blame(self, row: '_MergeRow') -> Blame:
+        if self.merge == 'borda':
+            # Confidence = weighted average of backend confidences (cap at 1).
+            conf = min(1.0, row.weighted_conf_sum / max(row.weight_sum, 1e-9))
+        else:
+            conf = max(0.0, min(1.0, 1.0 - row.bayesian_not_pos))
+        rationale = '; '.join(
+            f'{bid}: {txt[:140]}' for bid, txt in row.rationales.items()
+        ) or 'ensemble agreement'
+        return Blame(
+            span_id=row.span_id,
+            step_index=row.step_index,
+            agent_name=row.agent_name,
+            confidence=conf,
+            rationale=rationale,
+            evidence=list(dict.fromkeys(row.evidence)),  # dedupe preserve order
+            sources=sorted(row.sources),
+        )
+
+
+@dataclass
+class _MergeRow:
+    span_id: Optional[str]
+    step_index: Optional[int]
+    agent_name: Optional[str] = None
+    borda_points: float = 0.0
+    bayesian_not_pos: float = 1.0
+    weighted_conf_sum: float = 0.0
+    weight_sum: float = 0.0
+    sources: set[str] = field(default_factory=set)
+    rationales: Dict[str, str] = field(default_factory=dict)
+    evidence: List[str] = field(default_factory=list)
+
+
 __all__ = [
-    'Attributor', 'Blame', 'AttributionResult',
-    'HeuristicAttributor', 'AllAtOnceAttributor', 'StepByStepAttributor',
-    'BinarySearchAttributor', 'CounterfactualAttributor', 'SBFLAttributor',
+    'AllAtOnceAttributor', 'AttributionBudget', 'AttributionResult',
+    'Attributor', 'BinarySearchAttributor', 'Blame',
+    'CounterfactualAttributor', 'EnsembleAttributor', 'HeuristicAttributor',
+    'SBFLAttributor', 'StepByStepAttributor',
 ]