{ "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.10630", "title": "Phase-HDC: Replacing Optimizer History with Gradient Thresholds in Discrete Phase Learning", "summary": "Phase-HDC replaces the optimizer's gradient history (Adam moments) with a memoryless rule that moves each low-bit angle at most one step against the current gradient's sign only when the gradient exceeds a threshold. The cost is an average loss of roughly five accuracy points versus float32 Adam, and the savings are reported as logical state counts rather than measured hardware memory. The method applies only to hyperdimensional classifiers with low-bit quantized phase parameters, and it can fail where the five-point accuracy gap is unacceptable or where the model family itself does not fit the task.", "rationale": "The storage reduction is substantial but the technique is restricted to discrete phase-memory HDC models, a model family the reader does not currently operate, and the accuracy penalty against full-precision Adam limits its production value outside that niche.", "technique": "Memoryless threshold updates for discrete phase models", "family": "treino_eficiente", "recommendation": "observar", "published": "2026-10-07", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.10630", "independent_implementations": 0, "total_implementations": 1, "stars": 4, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "Phase-HDC replaces the optimizer's gradient history (Adam moments) with a memoryless rule that moves each low-bit angle at most one step against the current gradient's sign only when the gradient exceeds a threshold. The cost is an average loss of roughly five accuracy points versus float32 Adam, and the savings are reported as logical state counts rather than measured hardware memory. The method applies only to hyperdimensional classifiers with low-bit quantized phase parameters, and it can fail where the five-point accuracy gap is unacceptable or where the model family itself does not fit the task.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.10630", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Stores 16-23x less optimizer state than float32 Adam and 4-6x less than 8-bit Adam, with three times less storage than 6-bit-moment Adam at matched accuracy, while costing on average about five accuracy points against float32 Adam across eleven datasets.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.10630", "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": "" }