arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.05889cs.ITmath.ITmath.OC
收藏

受不确定转移概率影响的通信系统信道容量计算

Computing the channel capacity of a communication system affected by uncertain transition probabilities

Krzysztof Postek, Aharon Ben-Tal

摘要:

我们研究的问题计算的离散无记忆信道下的不确定性影响的信道法矩阵的能力,并可能与输入分布的平均成本的约束。这个问题在文献中被表述为最大-最小问题。我们使用鲁棒优化方法将最大-最小问题转化为一个标准的凸优化问题。对于小规模的问题,以及许多类型的不确定性,这样的问题可以解决原则上使用内点方法(IPM)。然而,对于大规模的问题,IPM是不实用的。在这里,我们提出了一个$\mathcal{O}(1/T)$一阶算法的基础上Nemirovski(2004),直接适用于最大-最小问题。

英文摘要:

We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been formulated in the literature as a max-min problem. We use the robust optimization methodology to convert the max-min problem to a standard convex optimization problem. For small-sized problems, and for many types of uncertainty, such a problem can be solved in principle using interior point methods (IPM). However, for large-scale problems, IPM are not practical. Here, we suggest an $\mathcal{O}(1/T)$ first-order algorithm based on Nemirovski (2004) which is applied directly to the max-min problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑