1 citations · 1 across the 8 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Stochastic Sequential Decision Making over Expanding Networks with Graph Filtering
Zhan Gao, Bishwadeep Das, Elvin Isufi
Graph filters leverage topological information to process networked data with existing methods mainly studying fixed graphs, ignoring that graphs often expand as nodes continually…
cs.LG2024
Online Learning Of Expanding Graphs
Samuel Rey, Bishwadeep Das, Elvin Isufi
This paper addresses the problem of online network topology inference for expanding graphs from a stream of spatiotemporal signals. Online algorithms for dynamic graph learning are…
cs.LG2024
Online Graph Filtering Over Expanding Graphs
Bishwadeep Das, Elvin Isufi
Graph filters are a staple tool for processing signals over graphs in a multitude of downstream tasks. However, they are commonly designed for graphs with a fixed number of nodes,…