Evidence-ledger draft

Open Problems in Would Explore The Scaling: An Evidence-Ledger Investigation — Claim ledger

CSV-backed claim ledger tying paper claims to paper IDs and evidence status.

paper_idclaimclaim_statusevidence_statussource_depthsource_quotepage_or_sectiontaxonomy_fitaudit_status
2602.07488v2We provide the first such theory in the case of data-limited scaling laws.supportedhas evidence rowfull-textOverall, this work unravels, for the first time, adi- rectlink between the shape of neural scaling laws and the statistical structure of language itself. 1.1.16in-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2509.24882v2We provide a sharp characterization of the excess risk achieved by empirical risk minimization for both diagonal linear networks and quadratic networks in the regime n, d≫ 1 with p≥d, under a power-law design for the target function and varying regularization strength λ.supportedhas evidence rowfull-textTogether, these results provide a comprehensive theoretical and empirical understanding of scaling laws for feature learning in simple network models. 1.2 Further Relevant work Scaling laws —A large body of work has studied scaling laws in the lazy regime, where the features remain fixed.1.1 Main Resultsin-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2605.26248v1A functional form that accurately models and extrapolates the scaling behaviors of deep neural networks as multiple dimensions all vary simultaneously.supportedhas evidence rowfull-textWhen compared to other functional forms for neural scaling, this functional form yields extrapolationsof scaling behavior that are considerably more accurate on this set. 1 INTRODUCTION Training today’s state-of-the-art neural networks requires significant amounts of computational resources and training data.1in-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2411.17691v2We reveal that low-bit quantization favors undertrained LLMs but suffers from significant quantization-induced degradation (QiD) when applied to fully trained LLMs.supportedhas evidence rowfull-textThe contributions of this work are threefold: •We reveal that low-bit quantization favors undertrained LLMs but suffers from significant quantization-induced degradation (QiD) when applied to fully trained LLMs.Abstractin-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2602.02593v1We propose a unified framework that conceptualizes learning as the progressive advancement of an Effective Frontier k⋆ in the rank space.preliminary-linkedhas evidence rowfull-textTheorem 3.3(Universal Scaling Principle). Under Assumption 2.1 ∼2.2, if a resource R induces a effective frontier k⋆(R)(Definition 3.2), the reducible loss scales as: ∆L(R)≍k ⋆(R)−(α−1).Section 3in-scope: LLM extractor confirmed direction matchneeds work; filled but source-depth unclear; report=audit_report.md