随机学习规则下的可学习性和LOO稳定性分析

摘要

The problem of learnability is one of the most basic questions in statistical learning theory.We show that a randomized learning problem is learnable if and only if there exists a learning rule which is always an AERM and uniform-LOO stable.Moreover,a generic learning algorithm in randomization learning rule setting will study.%学习算法的可学习性是统计学习理论的基本问题.本文指出,一个随机学习问题具有可学习性当且仅当存在AERM且一致LOO稳定的学习规则.同时,得到随机学习规则下通用学习算法的一些结果.