{ "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.10636", "title": "D-SLR: The Disjoint Row-Sparse plus Low-Rank Decomposition", "summary": "D-SLR replaces truncated SVD as the default matrix compression method for reconstruction tasks, decomposing a matrix into a low-rank component plus disjoint verbatim-stored rows selected after the fact against an error or parameter budget. It costs three SVDs total, requires no iterative solver or regularization tuning, and includes a computable a-posteriori lower bound certifying the potential gain of alternative configurations. It can fail when the data lacks a disjoint row-sparse-plus-low-rank structure, when the SVD cost is prohibitive for very large matrices, or when downstream consumers of the compressed matrix cannot accommodate the two-component format.", "rationale": "The method is a drop-in replacement requiring only standard SVD computation on a single GPU, but its practical benefit for the reader's specific embedding tables or weight matrices must be validated against simpler baselines at the target compression ratio.", "technique": "Disjoint row-sparse plus low-rank matrix decomposition", "family": "esparsidade_e_poda", "recommendation": "testar", "published": "2026-10-07", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.10636", "independent_implementations": 1, "total_implementations": 2, "stars": 4, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "D-SLR replaces truncated SVD as the default matrix compression method for reconstruction tasks, decomposing a matrix into a low-rank component plus disjoint verbatim-stored rows selected after the fact against an error or parameter budget. It costs three SVDs total, requires no iterative solver or regularization tuning, and includes a computable a-posteriori lower bound certifying the potential gain of alternative configurations. It can fail when the data lacks a disjoint row-sparse-plus-low-rank structure, when the SVD cost is prohibitive for very large matrices, or when downstream consumers of the compressed matrix cannot accommodate the two-component format.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.10636", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Closed-form decomposition that improves on or exactly matches truncated SVD reconstruction error at every rank and stored-row count, demonstrated on LLM embedding tables, network traffic, and hyperspectral images; no numerical factor is reported in the abstract.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.10636", "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": "" }