Seminars

Title:
Separator logic, expressive power and algorithmic applications
Abstract:
First-order logic (FO) can express many algorithmic problems on graphs,
but fails to express whether two vertices are connected. We define a
new logic (separator logic) by enriching FO with connectivity
predicates connk(x, y, z1, . . . , zk) that hold true in a graph if
there exists a path between x and y after deletion of z1, . . . , zk.
In this talk I will first present a study of the expressive power of
this new logic.
I will then present algorithmic results for this logic on graph classes
that exclude a topological minor.
These results were obtained in collaboration with Michał Pilipczuk,
Nicole Schirrmacher, Sebastian Siebertz, and Szymon Toruńczyk.

Title: Stackless Processing of Streamed Trees
Abstract:
Processing tree-structured data in the streaming model is a chal-lenge: capturing regular properties of streamed trees by means of astack is costly in memory, but falling back to finite-state automata drastically limits the computational power. We propose an intermediate stackless model based on register automata equipped with a single counter, used to maintain the current depth in the tree. We explore the power of this model to validate and query streamed trees. Our main result is an effective characterization of regular path queries (RPQs) that can be evaluated stacklessly—with and without registers. In particular, we confirm the conjectured characterization of tree languages defined by DTDs that are recognizable without registers, by Segoufin and Vianu (2002), in the special case of tree languages defined by means of an RPQ.

Link: paperman.name/data/pub.....0.pdf

Title: Knowledge graph generation and validation

Title:
Spanner Evaluation over SLP-Compressed Documents

Abstract:
We consider the problem of evaluating regular spanners over compressed documents, i.e., we wish to solve evaluation tasks directly on the compressed data, without decompression. As compressed forms of the documents we use straight-line programs (SLPs) -- a lossless compression scheme for textual data widely used in different areas of theoretical computer science and particularly well-suited for algorithmics on compressed data. In terms of data complexity, our results are as follows. For a regular spanner M and an SLP S that represents a document D, we can solve the tasks of model checking and of checking non-emptiness in time O(size(S)). Computing the set M(D) of all span-tuples extracted from D can be done in time O(size(S) size(M(D))), and enumeration of M(D) can be done with linear preprocessing O(size(S)) and a delay of O(depth(S)), where depth(S) is the depth of S's derivation tree. Note that size(S) can be exponentially smaller than the document's size |D|; and, due to known balancing results for SLPs, we can always assume that depth(S) = O(log(|D|)) independent of D's compressibility. Hence, our enumeration algorithm has a delay logarithmic in the size of the non- compressed data and a preprocessing time that is at best (i.e., in the case of highly compressible documents) also logarithmic, but at worst still linear. Therefore, in a big-data perspective, our enumeration algorithm for SLP-compressed documents may nevertheless beat the known linear preprocessing and constant delay algorithms for non-compressed documents.
[This is joint work with Markus Schmid, to be presented at PODS'21.]

Link to the paper: arxiv.org/pdf/2101.10890.pdf for the paper at least
Link to the ACM video: TBA

titre: Problèmes algorithmiques en théorie des groupes infinis
resumé:
Malgré le titre très général, il s'agira uniquement de problèmes concernant les sous-groupes de groupes infinis, et même juste les sous-groupes de groupes libres. Les résultats et méthodes que je présenterai sont issus de près de 40 ans de littérature et sont dûs à un grand nombre d'auteurs.

Je commencerai par poser le paysage, y compris pour ceux qui ne savent plus ce qu'est le groupe libre -- où l'on verra qu'on est, du point de vue algorithmique, dans une variante de la combinatoire des mots. Je présenterai ensuite l'outil central de la plupart des algorithmes efficaces sur les sous-groupes du groupe libre : la représentation de chaque sous-groupe finiment engendré par un graphe étiqueté et enraciné (disons : d'un automate :-)…) unique et facilement calculable à partir d'un ensemble de générateurs du sous-groupe considéré, qu'on appelle le graphe de Stallings.

Le jeu consiste ensuite à traduire les problèmes algorithmiques sur les sous-groupes en problèmes algorithmiques sur les graphes de Stallings, et à résoudre ces problèmes de la façon la plus efficace possible.

On considèrera notamment les problèmes suivants -- bon, juste le début de cette longue liste.
- Le problème du mot généralisé : étant donnés k+1 éléments du groupe libre (ce sont des mots), le dernier appartient-il au sous-groupe engendré par les k premiers ?
- Le problème de l'indice : étant donné un tuple d'éléments du groupe libre, le sous-groupe qu'ils engendrent est-il d'indice fini ?
- Le problème de la base : étant donné un tuple d'éléments du groupe libre, trouver le rang, et une base du sous-groupe qu'ils engendrent.
- Le problème de l'intersection : étant donnés deux tuples d'éléments du groupe libre, calculer l'intersection des sous-groupes qu'ils engendrent (ou calculer une base de cette intersection).
- Le problème de la conjugaison : étant donnés deux tuples d'éléments du groupe libre, engendrent-ils le même sous-groupe ? deux sous-groupes conjugués ?
- Et de nombreux autres problèmes (mots clés : minimalité de Whitehead, facteur libre, malnormalité, clôture par radical, clôture au sens de la topologie pro-p, etc…)


title: Algorithmic problems in the theory of infinite groups
abstract:
In spite of the very general title, we will talk only about problems on subgroups of infinite groups, and in fact, only on subgroups of free groups . The results and methods I will present have been obtained over the past 40 years and are due to many researchers.

I will start by setting the landscape, including for those who forgot what the free group is --- and we will see that we are dealing here, from the algorithmic point of view, with a variant of combinatorics on words. I will then present the tool that is central to most efficient algorithms on subgroups of free groups: the representation of each finitely generated subgroup by a labeled rooted graph (shall we say… an automaton?) which is unique and easily computable when a tuple of generators of the subgroup under consideration is given. This graph is called the Stallings graph.

The game consists, then, in translating algorithmic problems on subgroups into algorithmic problems on Stallings graphs, and in solving these problems as efficiently as possible.

We will discuss in particular the following problems (clearly: just the beginning of this long list).
- The generalized word problem: given k+1 elements of the free group (these are words), does the last one belong to the subgroup generated by the k first ones?
- The index problem: given a tuple of elements of the free group, does the subgroup they generate have finite index?
- The basis problem: given a tuple of elements of the free group, find the rank and a basis of the subgroup they generate.
- The intersection problem: given two tuples of elements of the free group, compute the intersection of the subgroups they generate (compute a basis of this intersection).
- The conjugacy problem: given two tuples of elements of the free group, are the subgroups they generate equal? conjugated?
- And many other problems (keywords: Whitehead minimality, free factors, malnormality, closure under radicals, closure in the sense of the pro-p topology, etc…)

Title: Theory and practice of learning-based compressed data structures

Presenter: Giorgio Vinciguerra

Abstract:
We revisit two fundamental and ubiquitous problems in data structure design:
predecessor search and rank/select primitives. We show that real data present a
peculiar kind of regularity based on geometric considerations. We name it
“approximate linearity”.
We thus expand the horizon of compressed data structures by presenting two
solutions for the problems above that discover, or “learn”, in a principled
algorithmic way, these approximate linearities. We provide a walkthrough of
these new theoretical achievements, also with a focus on open-source libraries
and their experimental improvements. We conclude by discussing the plethora of
research opportunities that these new learning-based approaches to data
structure design open up.

Zoom link: univ-lille-fr.zoom.us/j/95419000064

Title: Foundations of Languages for Interpretability.

Abstract:
The area of interpretability in Machine Learning aims for the design of algorithms that we humans can understand and trust. One of the fundamental questions of interpretability is: given a classifier M, and an input vector x, why did M classify x as M(x)? In order to approximate an answer to this "why" question, many concrete queries, metrics and scores have emerged as proxies, and their complexity has been studied over different classes of models. Many of these analyses are ad-hoc, but they tend to agree on the fact that these queries and scores are hard to compute over Neural Networks, but easy to compute over Decision Trees. It is thus natural to think of a more general approach, like a query language in which users could write an arbitrary number of different queries, and that would allow for a generalized study of the complexity of interpreting different ML models. Our work proposes foundations for such a language, tying to First Order Logic, as a way to have a clear understanding of its expressiveness and complexity. We manage to define a minimalistic structure over FO that allows expressing many natural interpretability queries over models, and we show that evaluating such queries can be done efficiently for Decision Trees, in data-complexity.

Zoom link: univ-lille-fr.zoom.us/j/95419000064