arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0504001cs.LG
收藏

概率学习和团队PFIN型学习:一般性质

Probabilistic and Team PFIN-type Learning: General Properties

Andris Ambainis

摘要:

我们考虑Popperian有限学习的概率层次,并研究这个层次的一般性质。我们证明了概率层次是可判定的,即存在一个算法,它接收p_1和p_2,并回答成功概率为p_1的PFIN型学习是否等价于成功概率为p_2的PFIN型学习。为了证明我们的结果,我们分析了概率层次的拓扑结构。我们证明了它是降序良序的,并且序等价于序数ε_0。由此可见,这个阶层的结构是非常复杂的。使用类似的方法,我们还证明了,PFIN型学习,团队学习和概率学习是相同的权力。

英文摘要:

We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning, team learning and probabilistic learning are of the same power.

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

↑