activity
20202026
most citedJoint Inference of Multiple Graphs from Matrix Polynomials

23 citations · 48 across the 26 of their papers we have counts for

collaborators
Showing cs.LGShow all

13 papers · 1 filter

cs.LG2026

Exploiting Non-Negativity in DAG Structure Learning

Samuel Rey, Madeline navarro, Gonzalo Mateos +1

This work addresses the problem of learning directed acyclic graphs (DAGs) from nodal observations adhering to a linear structural equation model. DAG structure learning is a centr…

cs.LG2026

Fair Feature Importance Scores via Feature Occlusion and Permutation

Camille Little, Madeline Navarro, Santiago Segarra +1

As machine learning models increasingly impact society, their opaque nature poses challenges to trust and accountability, particularly in fairness contexts. Understanding how indiv…

cs.LG2025

Learning Time-Varying Turn-Taking Behavior in Group Conversations

Madeline Navarro, Lisa O'Bryan, Santiago Segarra

We propose a flexible probabilistic model for predicting turn-taking patterns in group conversations based solely on individual characteristics and past speaking behavior. Many mod…

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

Adaptive Node Feature Selection For Graph Neural Networks

Madeline Navarro, Ali Azizpour, Santiago Segarra

We propose an adaptive node feature selection approach for graph neural networks (GNNs) that identifies and removes unnecessary features during training. The ability to measure how…

cs.LG2025

Adaptive Graph Coarsening for Efficient GNN Training

Rostyslav Olshevskyi, Madeline Navarro, Santiago Segarra

We propose an adaptive graph coarsening method to jointly learn graph neural network (GNN) parameters and merge nodes via K-means clustering during training. As real-world graphs g…

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

cs.LG2024

Fair CoVariance Neural Networks

Andrea Cavallo, Madeline Navarro, Santiago Segarra +1

Covariance-based data processing is widespread across signal processing and machine learning applications due to its ability to model data interconnectivities and dependencies. How…

cs.LG2023

Recovering Missing Node Features with Local Structure-based Embeddings

Victor M. Tenorio, Madeline Navarro, Santiago Segarra +1

Node features bolster graph-based learning when exploited jointly with network structure. However, a lack of nodal attributes is prevalent in graph data. We present a framework to…

cs.LG2022

GraphMAD: Graph Mixup for Data Augmentation using Data-Driven Convex Clustering

Madeline Navarro, Santiago Segarra

We develop a novel data-driven nonlinear mixup mechanism for graph data augmentation and present different mixup functions for sample pairs and their labels. Mixup is a data augmen…