Newest papers

Exact Compilation and Resource Laws for Hidden Integer Feedback

Ganxuan Yang, Siqi Wen, Shuyan Yu, Jidong Yuan · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.26442 · cited by 0 works (OpenAlex) · open-access PDF

Chinese

我们研究一个合理的反馈机制,在可预测的签名单位参与和每个物理输出的全面观察下。准备的回馈寿命连接了三个结果。首先,保留完整的输出,直到观察的回声同步世界给出准确的终极法定点编译,每一个固定预算的3C-2美元的支持宽度指数。第二,提前发布的承诺给出了一个单调的等级,其精确的终端点,严格的差距和数字支架量化了校准损失。在一个固定的格鲁西亚分散的错误编译中,需要4个承诺的损失额为0.09C-2美元。第三,法律再生工作产生了无限制的KL状态率,具有四根基板的剩余测试,并启示了一个完整的边界

Machine translation (Meta M2M100); the English original follows.

Abstract

Hidden randomized rounding couples the privacy loss of successive integer releases. We study a rational-feedback mechanism under predictable signed-unit participation and full observation of every physical output. A preparation's lifetime connects three results. First, preserving complete carries until an observed echo synchronizes the worlds gives exact finite-law point compilation, with support-width exponent $3C-2$ at every fixed budget $C\ge2$. Second, releasing commitments earlier gives a monotone hierarchy whose exact endpoint, strict gaps and numerical brackets quantify calibration loss. At one fixed discrete Gaussian, a loss allowance of 0.09 requires all four commitments. Third, legal regeneration yields an unrestricted KL rate with a square-root testing remainder and a complete asymptotic frontier under joint physical-time and participation constraints. At fixed rational parameters, finite-window occupation programs approximate that frontier to error $2^{-b}$ in polynomial bit time in $b$. Verified countable-transcript semantics and independently checked finite certificates support these analyses. A matched static workload illustrates the resulting design tradeoff: a structured finite integer matrix improves error and fresh randomness, while the scalar feedback instance retains fewer noise-state and source-table bits.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Integer (computer science), Mathematics, Rounding, Fixed point, Equivalence (formal languages), Polynomial

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.26442, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange