Downloads provided by UsageCounts
handle: 2117/84029
We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, defined by Denis, D'Halluin and Gilleron, with the standard simple-PAC model and give a general technique that subsumes the results of Denis et al and Parekh and Honavar.
:Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC], PAC learning, Kolmogorov complexity, Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
:Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC], PAC learning, Kolmogorov complexity, Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 13 | |
| downloads | 13 |

Views provided by UsageCounts
Downloads provided by UsageCounts