Polynomial Algorithm For Learning From Interpretation Transition - l'unam - université nantes angers le mans Accéder directement au contenu
Poster De Conférence Année : 2021

Polynomial Algorithm For Learning From Interpretation Transition

Résumé

Learning from interpretation transition (LFIT) automatically constructs a model of the dynamics of a system from the observation of its state transitions. The previously proposed General Usage LFIT Algorithm (GULA) serves as the core block to several methods of the framework that capture different dynamics. But its exponential complexity limits the use of the whole framework to relatively small systems. In this paper, we introduce an approximated algorithm (PRIDE) which trades the completeness of GULA for a polynomial complexity.
Fichier principal
Vignette du fichier
ilp21_extended_abstract_pride.pdf (295.13 Ko) Télécharger le fichier
Ribeiro_IJCLR_PRIDE_Poster.pdf (791.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03347026 , version 1 (16-09-2021)

Identifiants

  • HAL Id : hal-03347026 , version 1

Citer

Tony Ribeiro, Maxime Folschette, Morgan Magnin, Katsumi Inoue. Polynomial Algorithm For Learning From Interpretation Transition. 1st International Joint Conference on Learning & Reasoning, Oct 2021, (virtual), Greece. . ⟨hal-03347026⟩
99 Consultations
89 Téléchargements

Partager

Gmail Facebook X LinkedIn More