A Novel Method for Sampling Bandlimited Graph Signals

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 1975, Erdős asked for the maximum number of edges that an n-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Turán-type results can be used to prove an upper bound of n3/2+o(1). However, this ...

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 ...

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 ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

The recent geopolitical conflicts in Europe have underscored the vulnerability of the current energy system to the volatility of energy carrier prices. In the prospect of defining robust energy systems ensuring sustainable energy supply in the future, the ...

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Surrogate-based optimization is widely used for aerodynamic shape optimization, and its effectiveness depends on representative sampling of the design space. However, traditional sampling methods are hard-pressed to effectively sample high-dimensional desi ...

Decentralized learning is appealing as it enables the scalable usage of large amounts of distributed data and resources (without resorting to any central entity), while promoting privacy since every user minimizes the direct exposure of their data. Yet, wi ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

Whereas the ability of deep networks to produce useful predictions on many kinds of data has been amply demonstrated, estimating the reliability of these predictions remains challenging. Sampling approaches such as MC-Dropout and Deep Ensembles have emerge ...

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

Deep heteroscedastic regression involves jointly optimizing the mean and covariance of the predicted distribution using the negative log-likelihood. However, recent works show that this may result in sub-optimal convergence due to the challenges associated ...

Given the patchy nature of gas plumes and the slow response of conventional gas sensors, the use of mobile robots for Gas Source Localization (GSL) tasks presents significant challenges. These aspects increase the difficulties in obtaining gas measurements ...

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Drones hold promise to assist in civilian tasks. To realize this application, future drones must operate within large cities, covering large distances while navigating within cluttered urban landscapes. The increased efficiency of winged drones over rotary ...

We perform an error analysis of a fully discretised Streamline Upwind Petrov Galerkin Dynamical Low Rank (SUPG-DLR) method for random time-dependent advection-dominated problems. The time integration scheme has a splitting-like nature, allowing for potenti ...

The Dark Energy Spectroscopic Instrument (DESI) was designed to conduct a survey covering 14,000 deg(2) over 5 yr to constrain the cosmic expansion history through precise measurements of baryon acoustic oscillations (BAO). The scientific program for DESI ...

By 'social learning,' in this article we refer to mechanisms for opinion formation and decision making over graphs and the study of how agents' decisions evolve dynamically through interactions with neighbors and the environment. The study of social learni ...

A Novel Method for Sampling Bandlimited Graph Signals

Chat with Graph Search

Edge-disjoint cycles with the same vertex set

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

Graph generative deep learning models with an application to circuit topologies

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Identification of typical district configurations: A two-step global sensitivity analysis framework

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Gibbs sampling the posterior of neural networks

DiffAirfoil: An Efficient Novel Airfoil Sampler Based on Latent Space Diffusion Model for Aerodynamic Shape Optimization

The Privacy Power of Correlated Noise in Decentralized Learning

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Network-based kinetic models: Emergence of a statistical description of the graph topology

ZigZag: Universal Sampling-free Uncertainty Estimation Through Two-Step Inference

Random matrix methods for high-dimensional machine learning models

TIC-TAC: A Framework for Improved Covariance Estimation in Deep Heteroscedastic Regression

Sense in Motion with Belief Clustering: Efficient Gas Source Localization with Mobile Robots

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Accurate and agile flight with winged drones

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

Validation of the Scientific Program for the Dark Energy Spectroscopic Instrument

Socially Intelligent Networks: A framework for decision making over graphs