Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of Design Considerations, and Numerical Comparison

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.

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

Contemporary AI faces important limitations that remain unresolved despite significant successes. Chief among these are the inability to acquire new knowledge without destroying old, the incomprehensible and nonengineerable nature of internal representatio ...

Deep neural networks (DNNs) are receiving increasing attention in wind power forecasting due to their ability to effectively capture complex patterns in wind data. However, their forecast errors are severely limited by the local optimal weight issue in opt ...

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...

The Internet of Things (IoT) consists of physical objects and devices embedded with network connectivity, software, and sensors to collect and transmit data. The development of the Internet of Things (IoT) has led to various security and privacy issues, in ...

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

Neurons in the human amygdala and hippocampus are classically thought to encode a person’s identity invariant to visual features. However, it remains largely unknown how visual information from higher visual cortical areas is translated into such a semanti ...

High-dimensional data must be highly structured to be learnable. Although the compositional and hierarchical nature of data is often put forward to explain learnability, quantitative measurements establishing these properties are scarce. Likewise, accessin ...

In this paper, we study the problem of learning Graph Neural Networks (GNNs) with Differential Privacy (DP). We propose a novel differentially private GNN based on Aggregation Perturbation (GAP), which adds stochastic noise to the GNN's aggregation functio ...

In this paper, we set the mathematical foundations of the Dynamical Low-Rank Approximation (DLRA) method for stochastic differential equations (SDEs). DLRA aims at approximating the solution as a linear combination of a small number of basis vectors with r ...

“You never forget how to ride a bike”, – but how is that possible? The brain is able to learn complex skills, stop the practice for years, learn other skills in between, and still retrieve the original knowledge when necessary. The mechanisms of this capab ...

Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-m ...

The adaptive social learning paradigm helps model how networked agents are able to form opinions on a state of nature and track its drifts in a changing environment. In this framework, the agents repeatedly update their beliefs based on private observation ...

We propose ordering-based approaches for learning the maximal ancestral graph (MAG) of a structural equation model (SEM) up to its Markov equivalence class (MEC) in the presence of unobserved variables. Existing ordering-based methods in the literature rec ...

Graph Neural Networks (GNNs) have emerged as a powerful tool for learning on graphs, demonstrating exceptional performance in various domains. However, as GNNs become increasingly popular, new challenges arise. One of the most pressing is the need to ensur ...

In the field of image acquisition, Dynamic Vision Sensors (DVS) present an innovative methodology, capturing only the variations in pixel brightness instead of absolute values and thereby revealing unique features. Given that the primary deployment of DVS ...

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

Approximate message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing ...

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of Design Considerations, and Numerical Comparison

Chat with Graph Search

Graph generative deep learning models with an application to circuit topologies

Foundations of a New Learning Paradigm in AI Grounded in the Principles of Evolutionary Developmental Biology

Improving the accuracy and interpretability of neural networks for wind power forecasting

A full characterization of invariant embeddability of unimodular planar graphs

GraphFedAI framework for DDoS attack detection in IoT systems using federated learning and graph based artificial intelligence

Maximum Independent Set: Self-Training through Dynamic Programming

Feature-based encoding of face identity by single neurons in the human amygdala and hippocampus

Probing the latent hierarchical structure of data via diffusion models

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation

Dynamical Low-Rank Approximation for Stochastic Differential Equations

Context selectivity with dynamic availability enables lifelong continual learning

Privatized graph federated learning

Discovering Influencers in Opinion Formation Over Social Graphs

Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables

Privacy-Preserving Machine Learning on Graphs

Evaluation of the impact of lossy compression on event camera-based computer vision tasks

Density estimation in RKHS with application to Korobov spaces in high dimensions

Graph-based approximate message passing iterations

Equilibria in Network Constrained Energy Markets

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al