default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRémi Eyraud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Rémi Eyraud
, Stéphane Ayache:
Distillation of weighted automata from recurrent neural networks using a spectral approach. Mach. Learn. 113(5): 3233-3266 (2024)- [c14]Volodimir Mitarchuk, Clara Lacroce, Rémi Eyraud, Rémi Emonet, Amaury Habrard, Guillaume Rabusseau:
Length independent PAC-Bayes bounds for Simple RNNs. AISTATS 2024: 3547-3555 - 2023
- [c13]Dorian Llavata, Eleonora Cagli, Rémi Eyraud, Vincent Grosso, Lilian Bossuet:
Deep Stacking Ensemble Learning Applied to Profiling Side-Channel Attacks. CARDIS 2023: 235-255 - [c12]Rémi Eyraud, Dakotah Lambert, Badr Tahri Joutei, Aidar Gaffarov, Mathias Cabanne, Jeffrey Heinz, Chihiro Shibata:
TAYSIR Competition: Transformer+RNN: Algorithms to Yield Simple and Interpretable Representations. ICGI 2023: 275-290 - 2021
- [e1]Jane Chandlee, Rémi Eyraud, Jeff Heinz, Adam Jardine, Menno van Zaanen:
Proceedings of the 15th International Conference on Grammatical Inference, 23-27 August 2021, Virtual Event. Proceedings of Machine Learning Research 153, PMLR 2021 [contents] - 2020
- [i4]Philipp O. Tsvetkov, Rémi Eyraud, Stéphane Ayache, Anton A. Bougaev, Soazig Malesinski, Hamed Benazha, Svetlana Gorokhova, Christophe Buffat, Caroline Dehais, Marc Sanson, Franck Bielle, Dominique Figarella-Branger, Olivier Chinot, Emeline Tabouret, François Devred:
An AI-powered blood test to detect cancer using nanoDSF. CoRR abs/2008.03493 (2020) - [i3]Rémi Eyraud, Stéphane Ayache:
Distillation of Weighted Automata from Recurrent Neural Networks using a Spectral Approach. CoRR abs/2009.13101 (2020)
2010 – 2019
- 2019
- [i2]Jane Chandlee, Rémi Eyraud, Jeffrey Heinz, Adam Jardine, Jonathan Rawski:
Learning with Partially Ordered Representations. CoRR abs/1906.07886 (2019) - 2018
- [c11]Stéphane Ayache, Rémi Eyraud, Noé Goudian:
Explaining Black Boxes on Sequential Data using Weighted Automata. ICGI 2018: 81-103 - [i1]Stéphane Ayache, Rémi Eyraud, Noé Goudian:
Explaining Black Boxes on Sequential Data using Weighted Automata. CoRR abs/1810.05741 (2018) - 2016
- [j7]Rémi Eyraud, Jean-Christophe Janodet, Tim Oates, Frédéric Papadopoulos:
Designing and Learning Substitutable Plane Graph Grammars. Fundam. Informaticae 146(4): 403-430 (2016) - [j6]Rémi Eyraud, Colin de la Higuera, Makoto Kanazawa, Ryo Yoshinaka:
Preface. Fundam. Informaticae 146(4): i-ii (2016) - [c10]Denis Arrivault, Dominique Benielli, François Denis, Rémi Eyraud:
Sp2Learn: A Toolbox for the Spectral Learning of Weighted Automata. ICGI 2016: 105-119 - [c9]Borja Balle, Rémi Eyraud, Franco M. Luque, Ariadna Quattoni, Sicco Verwer:
Results of the Sequence PredIction ChallengE (SPiCe): a Competition on Learning the Next Symbol in a Sequence. ICGI 2016: 132-136 - 2015
- [c8]Jane Chandlee, Rémi Eyraud, Jeffrey Heinz:
Output Strictly Local Functions. MOL 2015: 112-125 - 2014
- [j5]Sicco Verwer, Rémi Eyraud, Colin de la Higuera:
PAutomaC: a probabilistic automata and hidden Markov models learning competition. Mach. Learn. 96(1-2): 129-154 (2014) - [j4]Jane Chandlee, Rémi Eyraud, Jeffrey Heinz:
Learning Strictly Local Subsequential Functions. Trans. Assoc. Comput. Linguistics 2: 491-503 (2014) - [c7]Adam Jardine, Jane Chandlee, Rémi Eyraud, Jeffrey Heinz:
Very efficient learning of structured classes of subsequential functions from positive data. ICGI 2014: 94-108 - 2012
- [c6]Rémi Eyraud, Jean-Christophe Janodet, Tim Oates:
Learning Substitutable Binary Plane Graph Grammars. ICGI 2012: 114-128 - [c5]Sicco Verwer, Rémi Eyraud, Colin de la Higuera:
Results of the PAutomaC Probabilistic Automaton Learning Competition. ICGI 2012: 243-248 - 2010
- [j3]Alexander Clark, Rémi Eyraud, Amaury Habrard:
Using Contextual Representations to Efficiently Learn Context-Free Languages. J. Mach. Learn. Res. 11: 2707-2744 (2010)
2000 – 2009
- 2008
- [c4]Alexander Clark, Rémi Eyraud, Amaury Habrard:
A Polynomial Algorithm for the Inference of Context Free Languages. ICGI 2008: 29-42 - 2007
- [j2]Alexander Clark, Rémi Eyraud:
Polynomial Identification in the Limit of Substitutable Context-free Languages. J. Mach. Learn. Res. 8: 1725-1745 (2007) - [j1]Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet:
LARS: A learning algorithm for rewriting systems. Mach. Learn. 66(1): 7-31 (2007) - 2006
- [c3]Alexander Clark, Rémi Eyraud:
Learning Auxiliary Fronting with Grammatical Inference. CoNLL 2006: 125-132 - 2005
- [c2]Alexander Clark, Rémi Eyraud:
Identification in the Limit of Substitutable Context-Free Languages. ALT 2005: 283-296 - 2004
- [c1]Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet:
Representing Languages by Learnable Rewriting Systems. ICGI 2004: 139-150
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
