Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a committed/no-bypass receiver closure, task-relevant information can affect the final estimate only by passing through a budgeted collection of vulnerable primitives unless an explicit protected bypass is modeled. Modeling each vulnerable primitive as a memoryless noisy channel yields a baseline supply--demand converse: the task-relevant information needed to attain a target distortion cannot exceed the smaller of the total information supplied by the communication channel and the total information supplied by the vulnerable compute budget. Our main converse shows that committed intermediate interfaces create additional first-order serial cuts and receiver-internal computation-graph cuts, captured in general by a receiver-internal compute min-cut converse. In particular, the twofold loss in the symmetric two-stage hard-separation special case is not inherent to unreliable receiver computation but induced by hard-separation under the committed/no-bypass closure. This extra first-order tax is therefore closure-dependent rather than universal. On the converse side, if downstream modules retain soft visibility to the raw channel output, the converse reduces to the single-bottleneck supply, up to any explicitly reserved soft-path budget. Under a separate stronger protected-support closure with reliable decoder and control support, we establish achievability results for task-direct and serial hard-separation constructions. For the fully noisy-logic regime, we obtain only a conservative depth-dependent converse, and matched achievability remains open.
翻译:经典信息论通常假设接收端处理可靠。本文研究当通信存在噪声且接收端自身由不可靠组件构成、并受有限冗余预算约束时的远端推理问题。在承诺/无旁路接收机构封闭条件下,除非对受保护的显式旁路进行建模,任务相关信息只能通过预算有限的脆弱基元集合传递才能影响最终估计。将每个脆弱基元建模为无记忆噪声信道,可得到基线供需逆界:实现目标失真所需的任务相关信息不能超过通信信道提供的总信息量与脆弱计算预算提供的总信息量中的较小者。本文主要逆界表明,承诺型中间接口会产生额外的一阶串行割与接收机内部计算图割,其通用表达为接收机内部计算最小割逆界。特别地,对称两阶段硬分离特例中的双重损失并非不可靠接收机计算所固有,而是由承诺/无旁路封闭条件下的硬分离机制导致。该额外一阶代价因此依赖于封闭条件而非普适。反之,若下游模块保留对原始信道输出的软可见性,则逆界退化为单瓶颈供给(扣除显式预留的软路径预算)。在另一类更强的受保护支撑封闭条件(含可靠解码器与控制支撑)下,我们建立了任务直连与串行硬分离结构可达性结果。对于全噪声逻辑体制,仅得到保守的深度相关逆界,且可达性匹配问题仍待解决。