Call for participation

Learning and Automata (LearnAut) — LICS 2017 Workshop
June 19, Reykjavik (Iceland)
Early registration: May 5th

Grammatical Inference studies machine learning algorithms for classical recursive models of computations like automata and grammars. The expressive power of these models and the complexity of associated computational problems are a major research topic within theoretical computer science. This workshop aims at offering a favorable place for dialogue and at generating discussions between researchers from these two communities.

The following papers have been accepted for oral presentation:

    • Enes Avcu, Chihiro Shibata and Jeffrey Heinz: Subregular Complexity and Deep Learning
    • Simone Barlocco and Clemens Kupke: Automata Learning: A Modal Logic Perspective
    • Alexander Clark: Strong learning of Probabilistic Context-Free Grammars from Strings
    • Nathanaël Fijalkow: Bisimulation on Distributions for Markov Decision Processes
    • Ariadna Quattoni, Xavier Carreras and Matthias Gallé. Scalable Spectral Learning of Automata through Maximum Matching
    • Rick Smetsers: Grammatical Inference as a Satisfiability Modulo Theories Problem

In addition, the papers accepted for poster presentation are:

  • Giovanni Bacci, Giorgio Bacci, Kim Guldstrand Larsen and Radu Mardare: On the Metric-based Approximate Minimization of Markov Chains
  • Michael Bukatin and Jon Anthony: Dataflow Matrix Machines as a Model of Computations with Linear Streams
  • Kaizaburo Chubachi, Diptarama, Ryo Yoshinaka and Ayumi Shinohara: Query Learning of Regular Languages over Large Ordered Alphabets
  • Joshua Moerman: Learning Product Automata
  • Tianyu Li, Guillaume Rabusseau and Doina Precup: Neural Network Based Nonlinear Weighted Finite Automata
  • Alexis Linard, Rick Smetsers, Frits Vaandrager, Umar Waqas, Joost van Pinxten and Sicco Verwer: Learning Pairwise Disjoint Simple Languages from Positive Examples
  • Xiaoran Liu, Qin Lin, Sicco Verwer and Dmitri Jarnikov: Anomaly Detection in a Digital Video Broadcasting System Using Timed Automata
  • Guillaume Rabusseau and Joelle Pineau: Multitask Spectral Learning of Weighted Automata
  • Michal Soucha and Kirill Bogdanov: Efficient Active Learning with Extra States

The following top researchers will be invited speakers at LearnAut:

  • Kim G. Larsen (Aalborg University)
  • Mehryar Mohri (New York University & Google Research)
  • Alexandra Silva (University College London)

If you have not registered yet to the workshop, and if you are interested by its program, we strongly recommend you to do it as soon as possible (http://www.icetcs.ru.is/lics2017-registration.html). The early registration deadline is on May 5th.

Pressures on accommodation possibilities are high, the sooner you book one the better it is (a lot of hotels are unfortunately already full).

Call for papers

Learning and Automata (LearnAut) — LICS 2017 Workshop
June 19, Reykjavik (Iceland)

Grammatical Inference (GI) studies machine learning algorithms for classical recursive models of computations like automata and grammars. The expressive power of these models and the complexity of associated computational problems are a major research topic within theoretical computer science (TCS). This workshop aims at offering a favorable place for dialogue and at generating discussions between researchers from these two communities.

The workshop will have a particular emphasis on the recent successes due to collaborations between members with these two different backgrounds.

We invite submissions of recent works, possibly preliminary ones, related to the theme of the workshop. Similarly to how main machine learning conferences and workshops are organized, all accepted abstracts will be part of a poster session held during the workshop. Additionally, the Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop.

Topics of interest include (but are not limited to):

  • Computational complexity of learning problems involving automata and formal languages.
  • Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars.
  • Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models.
  • Relations between automata and recurrent neural networks.
  • Active learning of finite state machines and formal languages.
  • Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models.
  • Applications of learning to formal verification and (statistical) model checking.
  • Logical aspects of learning and grammatical inference.
  • Theoretical studies of learnable classes of languages/representations.
  • Metrics and other error measures between automata or formal languages.

The workshop will not have formal proceedings, but authors of accepted abstracts can choose to have their work published on the workshop webpage. Depending on the success of LearnAut, a special issue in a computer science journal may be edited, to which participants will be strongly encouraged to submit.

Invited speakers

  • Kim G. Larsen (Aalborg)
  • Mehryar Mohri (NYU & Google)
  • Alexandra Silva (UCL) [TBC]

Submission instructions

Submissions in the form of extended abstracts must be at most 4 pages long (plus at most two for bibliography and possible appendixes) and adhere to the IEEE Proceedings 2-column 10pt format used by LICS; LaTeX style files are available here. We do accept submissions of work recently published or currently under review (just inform us of it while submitting). Submissions do not need to be anonymized.

Program Committee

Dana Angluin (Yale)

Jorge Castro (UPC)

François Denis (Aix-Marseille)

Jeff Heinz (Delaware)

Colin de la Higuera (Nantes)

Falk Howar (TU Clausthal)

José Oncina (Alicante)

Prakash Panangaden (McGill)

Ariadna Quattoni (Xerox)

Bernhard Steffen (TU Dortmund)

Sicco Verwer (TU Delft)

James Worrell (Oxford)

Organizers

Borja Balle (Amazon)

Leonor Becerra-Bonache (Jean Monnet)

Remi Eyraud (Aix-Marseille)

Call for participation

To be announced