Lagarde, Guillaume

1. The Complexity of Learning Linear Temporal Formulas from Examples
   2021/02/01 by Nathanaël Fijalkow, Guillaume Lagarde, Fijalkow, Nathanaël +1 · 3 citations
   Computer Science · #Algorithms and Data Compression #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Machine Learning (cs.LG) #Machine Learning and Algorithms
2. Scaling Neural Program Synthesis with Distribution-based Search
   2021/10/24 by Nathanaël Fijalkow, Guillaume Lagarde, Fijalkow, Nathanaël +9 · 2 citations
   Computer Science · #Machine Learning and Algorithms #Adversarial Robustness in Machine Learning #Machine Learning and Data Classification
3. On Efficient Low Distortion Ultrametric Embedding
   2020/08/15 by Cohen-Addad, Vincent, S., Karthik C., Lagarde, Guillaume · 1 citation
   #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Metric Geometry (math.MG)
4. Learning temporal formulas from examples is hard
   2023/12/26 by Mascle, Corto, Fijalkow, Nathanaël, Lagarde, Guillaume · 2 citations
   #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Machine Learning (cs.LG)