A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared to deterministic algorithmic coordinators. Furthermore, these probabilistic algorithmic coordinators are provably not characterized in power by teams of deterministic ones. An insightful, enumeration technique based, normal form characterization of the classes that are learnable by total computable coordinators is given. These normal forms are for insight only since it is shown that the complexity of the normal form of a total computable coordinator can be infeasible compared to the original coordinator. Montagna and Osherson showed that the competence class of a total coordinator cannot be strictly improved by another total coordinator. It is shown in the present paper that the competencies of any two total coordinators are the same modulo isomorphism. Furthermore, a completely effective, index set version of this competency isomorphism result is given, where all the coordinators are total computable.

Case, J., Jain, S., Montagna, F., Simi, G., Sorbi, A. (2003). On learning to coordinate random bits help, insightful normal forms, and competency isomorphisms. In Learning Theory and Kernel Machines (pp.699-713). Berlin : Springer-Verlag [10.1007/978-3-540-45167-9_51].

On learning to coordinate random bits help, insightful normal forms, and competency isomorphisms

MONTAGNA, FRANCO;SIMI, GIULIA;SORBI, ANDREA
2003-01-01

Abstract

A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared to deterministic algorithmic coordinators. Furthermore, these probabilistic algorithmic coordinators are provably not characterized in power by teams of deterministic ones. An insightful, enumeration technique based, normal form characterization of the classes that are learnable by total computable coordinators is given. These normal forms are for insight only since it is shown that the complexity of the normal form of a total computable coordinator can be infeasible compared to the original coordinator. Montagna and Osherson showed that the competence class of a total coordinator cannot be strictly improved by another total coordinator. It is shown in the present paper that the competencies of any two total coordinators are the same modulo isomorphism. Furthermore, a completely effective, index set version of this competency isomorphism result is given, where all the coordinators are total computable.
2003
3540407200
Case, J., Jain, S., Montagna, F., Simi, G., Sorbi, A. (2003). On learning to coordinate random bits help, insightful normal forms, and competency isomorphisms. In Learning Theory and Kernel Machines (pp.699-713). Berlin : Springer-Verlag [10.1007/978-3-540-45167-9_51].
File in questo prodotto:
File Dimensione Formato  
learning-proc.pdf

non disponibili

Descrizione: Articolo unico
Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 222.6 kB
Formato Adobe PDF
222.6 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/36517