{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "A self-hosted model uses more compute or memory than your workload can justify.",
    "change": "Check for a usable pruned checkpoint and runtime support before attempting model surgery.",
    "baseline": "The original unpruned model at the same precision, context, and load.",
    "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": "Task quality, actual GPU memory, serving throughput, and preparation cost.",
    "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.25721",
  "title": "Corrected Block Sparse Spectral Optimization: Exact Models, Finite Identification, and Local Dynamics",
  "summary": "Replaces dense PCA and the ambiguous standard block generalized-power sparse-PCA formulation with a primal-derived soft-threshold objective (A-SQ), a safeguarded Riemannian ascent with proven convergence, finite support identification, and post-identification refitting via power iteration. Cost is modest: Stiefel updates and thresholding on covariance-scale data run on a single GPU or CPU, with added implementation complexity for tie-breaking, zero-response columns, and mask-before-refit conventions. It can fail when the strict threshold-margin assumption does not hold, delaying or preventing support identification, and the quality gains are dataset-specific additive AMI improvements rather than guaranteed uplifts on arbitrary workloads.",
  "rationale": "The method is computationally cheap and theoretically cleaned up, but its benefit is workload-dependent feature interpretability and clustering quality, so it merits small-scale validation on the reader's own representation or tabular data before production adoption.",
  "technique": "Corrected block sparse spectral PCA (A-SQ)",
  "family": "esparsidade_e_poda",
  "recommendation": "testar",
  "published": "2026-10-19",
  "as_of": "2026-10-25",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.25721",
  "independent_implementations": 1,
  "total_implementations": 2,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Replaces dense PCA and the ambiguous standard block generalized-power sparse-PCA formulation with a primal-derived soft-threshold objective (A-SQ), a safeguarded Riemannian ascent with proven convergence, finite support identification, and post-identification refitting via power iteration. Cost is modest: Stiefel updates and thresholding on covariance-scale data run on a single GPU or CPU, with added implementation complexity for tie-breaking, zero-response columns, and mask-before-refit conventions. It can fail when the strict threshold-margin assumption does not hold, delaying or preventing support identification, and the quality gains are dataset-specific additive AMI improvements rather than guaranteed uplifts on arbitrary workloads.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.25721",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "On three scRNA datasets, A-SQ improves cluster-recovery AMI over dense PCA by +0.023 to +0.044 at matched sparsity; on GPT-2 and ViT representation panels it matches dense PCA reconstruction while improving monosemanticity and class specialisation.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.25721",
      "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": ""
}