Overlap properties of geometric expanders

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In this thesis, we concentrate on advancing high-level behavioral control policies for robotic systems within the framework of Dynamical Systems (DS). Throughout the course of this research, a unifying thread weaving through diverse fields emerges, and tha ...

Graph neural networks (GNNs) have demonstrated promising performance across various chemistry-related tasks. However, conventional graphs only model the pairwise connectivity in molecules, failing to adequately represent higher order connections, such as m ...

Hyperbolic lattices are a new type of synthetic materials based on regular tessellations in non-Euclidean spaces with constant negative curvature. While so far, there has been several theoretical investigations of hyperbolic topological media, experimental ...

Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three ...

In this thesis, we apply cochain complexes as an algebraic model of space in a diverse range of mathematical and scientific settings. We begin with an algebraic-discrete Morse theory model of auto-encoding cochain data, connecting the homotopy theory of d ...

Glacial moulins (cylindrical meltwater drainage shafts) provide valuable insights into glacier dynamics, but are inaccessible and hazardous environments for humans to study. Exploring them using passive sensor probes has revealed their complex geometry, wh ...

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...

Dynamical System (DS)-based closed-loop control is a simple and effective way to generate reactive motion policies that well generalize to the robotic workspace, while retaining stability guarantees. Lately the formalism has been expanded in order to handl ...

We propose a structured prediction approach for robot imitation learning from demonstrations. Among various tools for robot imitation learning, supervised learning has been observed to have a prominent role. Structured prediction is a form of supervised le ...

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...

Objective. Powered lower-limb prostheses relying on decoding motor intentions from non-invasive sensors, like electromyographic (EMG) signals, can significantly improve the quality of life of amputee subjects. However, the optimal combination of high decod ...

We address the problem of stably and efficiently training a deep neural network robust to adversarial perturbations bounded by an

l_1

norm. We demonstrate that achieving robustness against

l_1

-bounded perturbations is more challenging than in the

l_2

...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently in ...

Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topological-equivalent subspace with a sequence of elementary moves. Recently, discrete Morse theory techniques provided an efficient way to construct deformatio ...

In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space

\R^d.

We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...

The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

Overlap properties of geometric expanders

Chat with Graph Search

Geometric Learning: Leveraging differential geometry for learning and control

Molecular hypergraph neural networks

Anomalous and Chern topological waves in hyperbolic networks

A unified framework for Simplicial Kuramoto models

Cochains are all you need

Into the ice: Exploration and data capturing in glacial moulins by a tethered robot

On the boundedness of n-folds with κ(X) = n - 1

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Hybrid Quadratic Programming - Pullback Bundle Dynamical Systems Control

A structured prediction approach for robot imitation learning

Correspondence functors and duality

Early decoding of walking tasks with minimal set of EMG channels

Towards Stable and Efficient Adversarial Training against $l_1$ Bounded Adversarial Attacks

Formula Normalizations in Verification

Persistence and the Sheaf-Function Correspondence

Collapse-invariant properties of spaces equipped with signals or directions

Localization errors of the stochastic heat equation

Reduced representations of complexes, signals, and multifiltrations

Motif Cut Sparsifiers