Publications | Perouz Taslakian

Multi-View Causal Representation Learning with Partial Observability

We present a unified framework for studying the identifiability of representations learned from simultaneously observed views, such as …

Dingling Yao, Danru Xu, Sebastien Lachapelle, Sara Magliacane, Perouz Taslakian, Georg Martius, Julius Von K\:uglen, Francesco Locatello

OC-NMN : Object-centric Compositional Neural Module Network for Generative Visual Analogical Reasoning

A key aspect of human intelligence is the ability to imagine — composing learned concepts in novel ways — to make sense of new …

Pau Rodriguez, Perouz Taslakian, David Vazquez, Yoshua Bengio Rim Assouel

Explaining Graph Neural Networks Using Interpretable Local Surrogates

We propose an interpretable local surrogate (ILS) method for understanding the predictions of black-box graph models. Explainability …

Farzaneh Heidari, Perouz Taslakian, Guillaume Rabusseau

Capture the Flag: Uncovering Data Insights with Large Language Models

The extraction of a small number of relevant insights from vast amounts of data is a crucial component of data-driven decision-making. …

Issam Laradji, Perouz Taslakian, Sai Rajeswar, Valentina Zantedeschi, Alexandre Lacoste, Nicolas Chapados, David Vazquez, Christopher Pal, Alexandre Drouin

A Sparsity Principle for Partially Observable Causal Representation Learning

Causal representation learning (CRL) aims at identifying high-level causal variables from low-level data, e.g. images. Current methods …

Danru Xu, Dingling Yao, Sebastien Lachapelle, Perouz Taslakian, Julius Von K\:uglen, Francesco Locatello, Sara Magliacane

Using Graph Algorithms to Pretrain Graph Completion Transformers

Jonathan Pilault, Michael Galkin, Bahare Fatemi, Perouz Taslakian, David Vasquez, Christopher Pal

Typing assumptions improve identification in causal discovery

Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified. Under …

Philippe Brouillard, Perouz Taslakian, Alexandre Lacoste, Sebastien Lachapelle, Drouin Alexandre

Knowledge Hypergraphs: Prediction Beyond Binary Relations

Knowledge graphs store facts using relations between two entities. In this work, we address the question of link prediction in …

Bahare Fatemi, Perouz Taslakian, David Vazquez, David Poole

Context-aware visual compatibility prediction

How do we determine whether two or more clothing items are compatible or visually appealing? Part of the answer lies in understanding …

Guillem Cucurull, Perouz Taslakian, David Vazquez

Efficient multi-robot coverage of a known environment

This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the …

Nare Karapetyan, Kelly Benson, Chris McKinney, Perouz Taslakian, Ioannis Rekleitis

The four bars problem

A four-bar linkage is a mechanism consisting of four rigid bars which are joined by their endpoints in a polygonal chain and which can …

Alexandre Mauroy, Perouz Taslakian, Stefan Langerman, Raphaël Jungers

Continuous Yao Graphs

In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points $S⊂ ℝ^2$ and an angle $0 < Θ łeq 2π$, …

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirel Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot

Theta-3 is connected

In this paper, we show that the $Θ$-graph with three cones is connected. We also provide an alternative proof of the connectivity of …

Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot

New and Improved Spanning Ratios for Yao Graphs

For a set of points in the plane and a fixed integer $k > 0$, the Yao graph $Y_k$ partitions the space around each point into $k$ …

Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia

Necklaces, Convolutions, and X + Y

We give subquadratic algorithms that, given two necklaces each with $n$ beads at arbitrary positions, compute the optimal rotation of …

David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai P̌atraşcu, Perouz Taslakian

Competitive Online Routing on Delaunay Triangulations

Let $G$ be a graph, $s ın G$ be a source node and $t ın G$ be a target node. The sequence of adjacent nodes (graph walk) visited by a …

Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian

Sum of Squared Edges for MST of a Point Set in a Unit Square

Oswin Aichholzer, Sarah R. Allen, Greg Aloupis, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, John Iacona an Stefan Langerman, Diane Souvaine, Perouz Taslakian, Mark Yagnatinsky

Transversals in Trees

A transversal in a rooted tree is any set of nodes that meets every path from the root to a leaf. We let c(T,k) denote the number of …

Victor Campos, Văsek Chvátal, Luc Devroye, Perouz Taslakian

Non-crossing Matchings of Points with Geometric Objects

Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian

Fitting voronoi diagrams to planar tesselations

Given a tesselation of the plane, defined by a planar straight-line graph $G$, we want to find a minimal set $S$ of points in the …

Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer

Coloring and Guarding Arrangements

Given a simple arrangement of lines in the plane, what is the minimum number c of colors required so that we can color all lines in a …

Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian

Cannibal Animal Games: a new variant of Tic-Tac-Toe

Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian

Colorful Strips

Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing …

Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian

Deflating Polygons to the Limit

In this paper we study polygonal transformations through an operation called deflation. It is known that some families of polygons …

Isabel Hubard, Perouz Taslakian

Matching Points with Things

Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian

Relaxed Gabriel Graphs

Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belen Palop, Perouz Taslakian, Norbert Zeh

The Distance Geometry of Music

We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of …

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood

Structural Properties of Euclidean Rhythms

In this paper we investigate the structure of Euclidean rhythms and show that a Euclidean rhythm is formed of a pattern, called the …

Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint

Reconstructing Points on a Circle from Labeled Distances

David Bremner, Erik D. Demaine, Perouz Taslakian, Godfried T. Toussaint

Interlocking and Euclidean Rhythms

Several operations on Euclidean rhythms based on musical motivations are defined. The operations defined are complementation, …

Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint

Musical Rhythms in the Euclidean Plane

Perouz Taslakian

Convergence of the shadow sequence of inscribed polygons

Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint

A Pumping Lemma for Homometric Rhythms

Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint

Evenness preserving operations on musical rhythms

Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint

Vertex Pops and Popturns

Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried Toussaint

On Rolling Cube Puzzles

We analyze the computational complexity of various rolling cube puzzles.

Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor Fekete, Christian Knauer, Andr\ ́Schulz, Perouz Taslakian

Sand Drawings and Gaussian Graphs

Sand drawings form a part of many cultural traditions. Depending on the part of the world in which they occur, such drawings have …

Erik D. Demaine, Martin L. Demaine, Perouz Taslakian, Godfried T. Toussaint

Deflating The Pentagon

Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael Soss, Diane L. Souvaine, Perouz Taslakian, Godfried Toussaint

Deflating The Pentagon

In this paper we consider deflations inverse pocket flips of n-gons for small n. We show that every pentagon can be deflated after …

Erik D. Demaine, Martin L. Demaine, Diane L. Souvaine, Perouz Taslakian

Geometric properties of musical rhythms

Perouz Taslakian, Godfried T. Toussaint

Curves in the Sand: Algorithmic Drawing

Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint

The Distance Geometry of Deep Rhythms and Scales

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood

Hamiltonian Cycles in Sparse Vertex-Adjacency Duals

Perouz Taslakian, Godfried T. Toussaint

Orderly Broadcasting in a 2D Torus

Hovhannes A. Harutyunyan, Perouz Taslakian

Orderly Broadcasting in Multidimensional Tori

Perouz Taslakian