跳到主要内容
AI News HubLIVE
来源内容 · 翻译待补全5 分钟阅读

待翻译:Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks

文章摘要

AI 服务暂时不可用,以下为来源摘要,待恢复后补全翻译:arXiv:2610.20678v1 Announce Type: new Abstract: We study what spectral summaries and scalar learning curves reveal about centered quadratic networks. We construct analytic positive input densities with exactly Gaussian one- and two-coordinate marginals. Their complete fourth-moment operators are intertwined by an orthogonal map fixing the entire diagonal teacher algebra, so the corresponding anchored spectral measures agree. For selected common teachers with a nonzero cycle invariant, their factorized loss curves differ because the map does not preserve matrix multiplication. Cycle length $r$, which can be arbitrarily large, gives $O(\varepsilon^r)$ contrast uniformly in training time for each fixed construction. For a supplied pair, noisy scalar loss queries r…

来源arXiv Machine Learning作者: Dekun Yang
待翻译:Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks
报告错误

纠错通道尚未开通,可先复制下方文章信息留存。

查看更正说明
直接读正文

AI 服务暂时不可用,以下为来源正文,待恢复后补全翻译。

[Submitted on 14 Oct 2026] Title:Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks View a PDF of the paper titled Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks, by Dekun Yang View PDF HTML (experimental) Abstract:We study what spectral summaries and scalar learning curves reveal about centered quadratic networks. We construct analytic positive input densities with exactly Gaussian one- and two-coordinate marginals. Their complete fourth-moment operators are intertwined by an orthogonal map fixing the entire diagonal teacher algebra, so the corresponding anchored spectral measures agree. For selected common teachers with a nonzero cycle invariant, their factorized loss curves differ because the map does not preserve matrix multiplication. Cycle length $r$, which can be arbitrarily large, gives $O(\varepsilon^r)$ contrast uniformly in training time for each fixed construction. For a supplied pair, noisy scalar loss queries require order $\varepsilon^{-2r}$ observations, while bounded initialization interventions with scalar gradient readouts require order $\varepsilon^{-2}$. A shared-input score, equal to a paired-gradient difference, attains the optimal input-sample exponent without knowing the teacher. An explicit family of diverging auxiliary teacher scales instead admits a nonzero finite limiting contrast at coupling $1/\log L$. Conversely, for Gaussian inputs and a rationally independent teacher spectrum, one exact scalar loss curve identifies the initial predictor up to sign conjugation. Within this rationally independent class, with nonzero diagonal inverse-state error in every coordinate and calibrated time and loss scales, it also identifies the unknown teacher spectrum and active dimension, modulo simultaneous rotations. For fixed dimension and distinct unordered teacher sums, dimension-minimal exact observations give generic joint local recovery. Finite exact global bounds hold for a known teacher and, on the active class, under a blind dimension cap. Exact certificates and full-weight replay verify the construction; numerical inverse checks reveal severe ill-conditioning. Comments: 37 pages, 2 figures. Code and synthetic data provided as ancillary material Subjects: Machine Learning (cs.LG); Machine Learning (stat.ML) Cite as: arXiv:2610.20678 [cs.LG] (or arXiv:2610.20678v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2610.20678 arXiv-issued DOI via DataCite (pending registration) Submission history From: Dekun Yang [view email] [v1] Wed, 14 Oct 2026 16:01:20 UTC (335 KB) Full-text links: Access Paper: View a PDF of the paper titled Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks, by Dekun Yang View PDF HTML (experimental) TeX Source view license Ancillary-file links: Ancillary files (details): neural_information_sculpting_v12/ARCHIVE_README.txt neural_information_sculpting_v12/FILE_MANIFEST.json neural_information_sculpting_v12/geometry_response_extension/protocols/baseline.json neural_information_sculpting_v12/geometry_response_extension/protocols/research_protocol.md neural_information_sculpting_v12/geometry_response_extension/results/amplification_check.json neural_information_sculpting_v12/geometry_response_extension/results/analytic_realization_check.json neural_information_sculpting_v12/geometry_response_extension/results/blind_identifiability_check.json neural_information_sculpting_v12/geometry_response_extension/results/finite_time_probe.json neural_information_sculpting_v12/geometry_response_extension/results/gh3_exact_witness.json neural_information_sculpting_v12/geometry_response_extension/results/identifiability_check.json neural_information_sculpting_v12/geometry_response_extension/results/lp_dual_certificate.json neural_information_sculpting_v12/geometry_response_extension/results/moment_feasibility.json neural_information_sculpting_v12/geometry_response_extension/results/scalar_intervention_check.json neural_information_sculpting_v12/geometry_response_extension/results/smooth_realization_check.json neural_information_sculpting_v12/geometry_response_extension/results/teacher_grid.json neural_information_sculpting_v12/geometry_response_extension/results/validation_geometry.json neural_information_sculpting_v12/geometry_response_extension/results/validation_geometry.npz.b64 neural_information_sculpting_v12/geometry_response_extension/src/certify_moment_optimum.py neural_information_sculpting_v12/geometry_response_extension/src/check_amplification.py neural_information_sculpting_v12/geometry_response_extension/src/check_analytic_realization.py neural_information_sculpting_v12/geometry_response_extension/src/check_blind_identifiability.py neural_information_sculpting_v12/geometry_response_extension/src/check_identifiability.py neural_information_sculpting_v12/geometry_response_extension/src/check_scalar_interventions.py neural_information_sculpting_v12/geometry_response_extension/src/check_smooth_realization.py neural_information_sculpting_v12/geometry_response_extension/src/explore_teacher_scales.py neural_information_sculpting_v12/geometry_response_extension/src/moment_feasibility.py neural_information_sculpting_v12/geometry_response_extension/src/validate_geometry.py neural_information_sculpting_v12/isospectral_training_extension/protocols/isospectral_discrete_gradient_v1.json neural_information_sculpting_v12/isospectral_training_extension/protocols/isospectral_discrete_gradient_v1.sha256 neural_information_sculpting_v12/isospectral_training_extension/protocols/isospectral_original_training_v1.json neural_information_sculpting_v12/isospectral_training_extension/protocols/isospectral_original_training_v1.sha256 neural_information_sculpting_v12/isospectral_training_extension/src/discrete.py neural_information_sculpting_v12/isospectral_training_extension/src/isospectral.py neural_information_sculpting_v12/isospectral_training_extension/src/run_discrete.py neural_information_sculpting_v12/isospectral_training_extension/src/validate_isospectral.py neural_information_sculpting_v12/isospectral_training_extension/tests/test_isospectral.py neural_information_sculpting_v12/manuscript_geometry_learning_v12/CLAIM_EVIDENCE.md neural_information_sculpting_v12/manuscript_geometry_learning_v12/LICENSE-DATA.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/LICENSE-MIT.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/LICENSE_SCOPE.md neural_information_sculpting_v12/manuscript_geometry_learning_v12/README.md neural_information_sculpting_v12/manuscript_geometry_learning_v12/REPRODUCIBILITY.md neural_information_sculpting_v12/manuscript_geometry_learning_v12/figures/curve_identifiability.pdf neural_information_sculpting_v12/manuscript_geometry_learning_v12/figures/geometry_response.pdf neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/added_proof_algebra.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/build_stdout.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/environment.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_checks_summary.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_logs/check_analytic_realization.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_logs/check_blind_identifiability.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_logs/check_identifiability.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_logs/check_scalar_interventions.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_logs/inherited_tests.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/numerical_result_comparison.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/pdf_geometry_audit.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/source_archive_validation.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/qa/visual_audit.json neural_information_sculpting_v12/manuscript_geometry_learning_v12/requirements_repro.txt neural_information_sculpting_v12/manuscript_geometry_learning_v12/scripts/check_added_proof_algebra.py neural_information_sculpting_v12/manuscript_geometry_learning_v12/scripts/make_figures.py neural_information_sculpting_v12/restore_data.py (56 additional files not shown) Additional Features Audio Summary Current browse context: cs.LG new | recent | 2026-10 Change to browse by: cs stat stat.ML References & Citations NASA ADS Google Scholar Semantic Scholar Loading... Data provided by: Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) IArxiv recommender toggle IArxiv Recommender (What is IArxiv?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

展开要点与分析

文章情报

研究者进阶

要点

  • AI 服务暂时不可用,系统已先保留来源内容与降级元数据。
  • arXiv:2610.20678v1 Announce Type: new Abstract: We study what spectral summaries and scalar learning curves reveal about centered quadratic networks. We construct analytic positiv…

要点与分析由自动化流程生成,可能有误,请结合原始来源核实。