跳到正文
arXiv cs.AI· Jeongho Bang, Marcin Paw{\l}owski·· 14 小时前AI 评分18

Neural-IC:面向表示学习的随机访问容量定律

Neural Information Causality: A Random-Access Capacity Law for Representation Learning

AI 导读

研究者提出“神经信息因果性(Neural-IC)”表示定律,将因果访问与物理指定的接口容量联系起来:对独立比特构成的新数据库,后续查询可恢复的总信息量不能超过该容量,即使预先建立量子资源也不例外。

正文 · 原文

View PDF HTML (experimental)

Abstract:How can a learned representation remain useful when the question it must answer is chosen only after encoding? Preserving information is essential, but does not by itself ensure access to the requested target. We address this problem by deriving "neural information causality (Neural-IC)," a representation law that connects causal access to the physically specified interface capacity. For a fresh database of independent bits, the aggregate information recoverable across later queries cannot exceed that capacity, even with pre-established quantum resources. A decomposition separates capacity slack, information organized jointly across targets, and losses in producing answers. Exhaustive evaluation of trained binary codes reveals why nearly full use of a memory's information budget can coexist with limited retrieval. In a nested Bell-correlation construction, quantum assistance improves average retrieval over the optimal classical one-bit benchmark within the same communicated budget. These results give representation learning a design principle that connects information capacity to the organization and extraction of target information. By locating the constraints on later answers, the framework can inform memory allocation, encoding objectives, and decoder outputs, providing a basis for seeking better retrieval within a fixed budget.
Comments: 13 pages, 3 figures (including Appendix)
Subjects: Quantum Physics (quant-ph); Artificial Intelligence (cs.AI)
Cite as: arXiv:2605.09316 [quant-ph]
  (or arXiv:2605.09316v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2605.09316

arXiv-issued DOI via DataCite

Submission history

From: Jeongho Bang [view email]
[v1] Sun, 10 May 2026 04:25:11 UTC (1,572 KB)
[v2] Sat, 24 Oct 2026 14:06:15 UTC (131 KB)

来源:arXiv cs.AI · arxiv.org