{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "You already need task-specific training and want to reduce its memory or compute cost.",
    "change": "Change only the training technique on a small controlled run after checking prerequisites.",
    "baseline": "Your current training recipe with the same model, data split, and evaluation.",
    "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": "Held-out quality, peak memory, training time, and full compute cost to the target quality.",
    "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.09196",
  "title": "Exact Dynamics and Finite-Sample Trajectory Recovery of Linear Recursive Feature Machines",
  "summary": "Linear RFM replaces a trained neural network's representation-learning stage with an alternating loop of ridge-regularized linear fits and average-gradient-outer-product feature updates, all computable with closed-form linear algebra on CPU or a single small GPU. The cost is multiple full-data least-squares solves plus repeated d-by-d AGOP accumulations, which scales poorly with input dimension and sample count and provides only linear-model expressivity over learned features. It can fail when the low-rank teacher and isotropic sub-Gaussian input assumptions do not hold, and its real-data evidence is illustrative rather than benchmarked against tuned baselines.",
  "rationale": "The method is cheap enough for constrained infrastructure and theoretically characterized, but its production value on the reader's tasks is unproven and must be validated against standard baselines before adoption.",
  "technique": "Linear recursive feature machines for feature learning",
  "family": "treino_eficiente",
  "recommendation": "testar",
  "published": "2026-10-06",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.09196",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Linear RFM replaces a trained neural network's representation-learning stage with an alternating loop of ridge-regularized linear fits and average-gradient-outer-product feature updates, all computable with closed-form linear algebra on CPU or a single small GPU. The cost is multiple full-data least-squares solves plus repeated d-by-d AGOP accumulations, which scales poorly with input dimension and sample count and provides only linear-model expressivity over learned features. It can fail when the low-rank teacher and isotropic sub-Gaussian input assumptions do not hold, and its real-data evidence is illustrative rather than benchmarked against tuned baselines.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.09196",
      "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": ""
}