{ "schema_version": 1, "builder_plan": { "scenario": "Start with one repeated product task that has a measurable failure or cost.", "change": "Read the methods and identify one change you can isolate in that workflow.", "baseline": "Your current implementation on the same held-out tasks.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Successful outcomes, response time, human rework, and total cost per successful task.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2610.17980", "title": "Exact power indices for plurality-voting ensembles", "summary": "ENPOWER replaces Monte Carlo sampling approximations of Shapley/Banzhaf values for plurality-voting ensembles with exact closed-form and generating-function algorithms, applied to ensemble pruning and prompt-based ensembling of vision-language models. Cost is low: it is a post-hoc combinatorial computation requiring no GPU training, only the base classifiers' predictions, with polynomial-time complexity that grows with class count and ensemble size. It can fail when the plurality-voting-with-random-tie-breaking model does not match the production aggregation rule (e.g., weighted or soft voting), and attribution-driven pruning may remove classifiers whose value depends on correlated errors that power indices do not capture.", "rationale": "It is a cheap, exact, training-free attribution tool that fits constrained infrastructure, but its production value for pruning and prompt ensembling must be validated on the reader's specific ensemble before adoption.", "technique": "Exact Shapley/Banzhaf attribution for voting ensembles", "family": "outro", "recommendation": "testar", "published": "2026-10-13", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.17980", "independent_implementations": 0, "total_implementations": 1, "stars": 0, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "ENPOWER replaces Monte Carlo sampling approximations of Shapley/Banzhaf values for plurality-voting ensembles with exact closed-form and generating-function algorithms, applied to ensemble pruning and prompt-based ensembling of vision-language models. Cost is low: it is a post-hoc combinatorial computation requiring no GPU training, only the base classifiers' predictions, with polynomial-time complexity that grows with class count and ensemble size. It can fail when the plurality-voting-with-random-tie-breaking model does not match the production aggregation rule (e.g., weighted or soft voting), and attribution-driven pruning may remove classifiers whose value depends on correlated errors that power indices do not capture.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.17980", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "ENPOWER computes exact Banzhaf and Shapley power indices in linear time for binary and low-degree polynomial time for multiclass plurality-voting ensembles, replacing intractable exact computation or Monte Carlo approximation.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.17980", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }