activity
20192026
most citedRobust Graph Filter Identification and Graph Denoising from Signal Observations

16 citations · 39 across the 21 of their papers we have counts for

collaborators

25 papers

cs.LG2026

Joint Precision Neural Networks: Task-Aware Dependency and Predictive Learning

Andrea Cavallo, Samuel Rey, Antonio G. Marques +1

Exploiting meaningful latent structures from data to solve downstream tasks is a fundamental challenge in signal processing and machine learning. While Principal Component Analysis…

eess.SP2026

Sparse Experimental Design for Nonsmooth Estimators via Bilevel Optimization

Antonio G. Marques, Samuel Rey

Optimal experimental design (OED) decides which measurements to acquire for downstream estimation. Classically, this is done by optimizing an information criterion derived from a l…

cs.LG2025

Estimating Fair Graphs from Graph-Stationary Data

Madeline Navarro, Andrei Buciulea, Samuel Rey +2

We estimate fair graphs from graph-stationary nodal observations such that connections are not biased with respect to sensitive attributes. Edges in real-world graphs often exhibit…

cs.LG2025

Precision Neural Networks: Joint Graph And Relational Learning

Andrea Cavallo, Samuel Rey, Antonio G. Marques +1

CoVariance Neural Networks (VNNs) perform convolutions on the graph determined by the covariance matrix of the data, which enables expressive and stable covariance-based learning.…

cs.AI2025

Unrolling Dynamic Programming via Graph Filters

Sergio Rozada, Samuel Rey, Gonzalo Mateos +1

Dynamic programming (DP) is a fundamental tool used across many engineering fields. The main goal of DP is to solve Bellman's optimality equations for a given Markov decision proce…

cs.LG2025

Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery

Victor M. Tenorio, Madeline Navarro, Samuel Rey +2

Graph Neural Networks (GNNs) often struggle with heterophilic data, where connected nodes may have dissimilar labels, as they typically assume homophily and rely on local message p…

cs.LG2025

Enhancing Graphical Lasso: A Robust Scheme for Non-Stationary Mean Data

Samuel Rey, Ernesto Curbelo, Luca Martino +2

This work addresses the problem of graph learning from data following a Gaussian Graphical Model (GGM) with a time-varying mean. Graphical Lasso (GL), the standard method for estim…

cs.LG2024

Structure-Guided Input Graph for GNNs facing Heterophily

Victor M. Tenorio, Madeline Navarro, Samuel Rey +2

Graph Neural Networks (GNNs) have emerged as a promising tool to handle data exhibiting an irregular structure. However, most GNN architectures perform well on homophilic datasets,…

cs.LG2024

Online Network Inference from Graph-Stationary Signals with Hidden Nodes

Andrei Buciulea, Madeline Navarro, Samuel Rey +2

Graph learning is the fundamental task of estimating unknown graph connectivity from available data. Typical approaches assume that not only is all information available simultaneo…

cs.LG2024

Redesigning graph filter-based GNNs to relax the homophily assumption

Samuel Rey, Madeline Navarro, Victor M. Tenorio +2

Graph neural networks (GNNs) have become a workhorse approach for learning from data defined over irregular domains, typically by implicitly assuming that the data structure is rep…

stat.ML2024

Fair GLASSO: Estimating Fair Graphical Models with Unbiased Statistical Behavior

Madeline Navarro, Samuel Rey, Andrei Buciulea +2

We propose estimating Gaussian graphical models (GGMs) that are fair with respect to sensitive nodal attributes. Many real-world models exhibit unfair discriminatory behavior due t…

eess.SP2024

Mitigating Subpopulation Bias for Fair Network Topology Inference

Madeline Navarro, Samuel Rey, Andrei Buciulea +2

We consider fair network topology inference from nodal observations. Real-world networks often exhibit biased connections based on sensitive nodal attributes. Hence, different subp…

cs.LG2023★ 1 cited

Robust Graph Neural Network based on Graph Denoising

Victor M. Tenorio, Samuel Rey, Antonio G. Marques

Graph Neural Networks (GNNs) have emerged as a notorious alternative to address learning problems dealing with non-Euclidean datasets. However, although most works assume that the…

eess.SP2023

Blind Deconvolution of Sparse Graph Signals in the Presence of Perturbations

Victor M. Tenorio, Samuel Rey, Antonio G. Marques

Blind deconvolution over graphs involves using (observed) output graph signals to obtain both the inputs (sources) as well as the filter that drives (models) the graph diffusion pr…

eess.SP2023★ 13 cited

Joint Network Topology Inference in the Presence of Hidden Nodes

Madeline Navarro, Samuel Rey, Andrei Buciulea +2

We investigate the increasingly prominent task of jointly inferring multiple networks from nodal observations. While most joint inference methods assume that observations are avail…

eess.SP2023

Robust Network Topology Inference and Processing of Graph Signals

Samuel Rey

The abundance of large and heterogeneous systems is rendering contemporary data more pervasive, intricate, and with a non-regular structure. With classical techniques facing troubl…

eess.SP2022

Joint graph learning from Gaussian observations in the presence of hidden nodes

Samuel Rey, Madeline Navarro, Andrei Buciulea +2

Graph learning problems are typically approached by focusing on learning the topology of a single graph when signals from all nodes are available. However, many contemporary setups…

eess.SP2022★ 16 cited

Robust Graph Filter Identification and Graph Denoising from Signal Observations

Samuel Rey, Victor M. Tenorio, Antonio G. Marques

When facing graph signal processing tasks, the workhorse assumption is that the graph describing the support of the signals is known. However, in many relevant applications the ava…

eess.SP2022

Enhanced graph-learning schemes driven by similar distributions of motifs

Samuel Rey, T. Mitchell Roddenberry, Santiago Segarra +1

This paper looks at the task of network topology inference, where the goal is to learn an unknown graph from nodal observations. One of the novelties of the approach put forth is t…

cs.SI2021

Joint inference of multiple graphs with hidden variables from stationary graph signals

Samuel Rey, Andrei Buciulea, Madeline Navarro +2

Learning graphs from sets of nodal observations represents a prominent problem formally known as graph topology inference. However, current approaches are limited by typically focu…

stat.ME2021

Learning Graphs from Smooth and Graph-Stationary Signals with Hidden Variables

Andrei Buciulea, Samuel Rey, Antonio G. Marques

Network-topology inference from (vertex) signal observations is a prominent problem across data-science and engineering disciplines. Most existing schemes assume that observations…

eess.SP2021

A Robust Alternative for Graph Convolutional Neural Networks via Graph Neighborhood Filters

Victor M. Tenorio, Samuel Rey, Fernando Gama +2

Graph convolutional neural networks (GCNNs) are popular deep learning architectures that, upon replacing regular convolutions with graph filters (GFs), generalize CNNs to irregular…

eess.SP2021

Untrained Graph Neural Networks for Denoising

Samuel Rey, Santiago Segarra, Reinhard Heckel +1

A fundamental problem in signal processing is to denoise a signal. While there are many well-performing methods for denoising signals defined on regular supports, such as images de…

eess.SP2021

Robust graph-filter identification with graph denoising regularization

Samuel Rey, Antonio G. Marques

When approaching graph signal processing tasks, graphs are usually assumed to be perfectly known. However, in many practical applications, the observed (inferred) network is prone…