Rasoul Shafipour

Dr. Rasoul Shafipour


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
RSRasoul Shafipour
Rasoul Shafipour
AKAli Khodabakhsh
Ali Khodabakhsh
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
ENEvdokia Nikolova
Evdokia Nikolova
We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low, medium and high frequencies we seek a digraph (D)GFT such that the orthonormal frequency components are as spread as possible in the graph spectral domain. To that end, we advocate a two-step design whereby we: (i) find the maximum directed variation (i.e., a novel notion of frequency on a digraph) a candidate basis vector can attain; and (ii) minimize a smooth spectral dispersion function over the achievable frequency range to obtain the desired spread DGFT basis. Both steps involve non-convex, orthonormality-constrained optimization problems, which are efficiently tackled via a feasible optimization method on the Stiefel manifold that provably converges to a stationary solution. We also propose a heuristic to construct the DGFT basis from Laplacian eigenvectors of an undirected version of the digraph. We show that the spectral-dispersion minimization problem can be cast as supermodular optimization over the set of candidate frequency components, whose orthonormality can be enforced via a matroid basis constraint. This motivates adopting a scalable greedy algorithm to obtain an approximate solution with quantifiable worst-case spectral dispersion. We illustrate the effectiveness of our DGFT algorithms through numerical tests on synthetic and real-world networks. We also carry out a graph-signal denoising task, whereby the DGFT basis is used to decompose and then low-pass filter temperatures recorded across the United States.

17 June 2023
Verified
Conference Paper
Open access
BRBita Darvish Rouhani
Bita Darvish Rouhani
RZRitchie Zhao
Ritchie Zhao
VEVenmugil Elango
Venmugil Elango
RSRasoul Shafipour
Rasoul Shafipour
MHMathew Hall
Mathew Hall
MNMaxim Naumov
Maxim Naumov
This paper introduces Block Data Representations (BDR), a framework for exploring and evaluating a wide spectrum of narrow-precision formats for deep learning. It enables comparison of popular quantization standards, and through BDR, new formats based on shared microexponents (MX) are identified, which outperform other state-of-the-art quantization approaches, including narrow-precision floating-point and block floating-point. MX utilizes multiple levels of quantization scaling with ultra-fine scaling factors based on shared microexponents in the hardware. The effectiveness of MX is demonstrated on real-world models including large-scale generative pretraining and inferencing, and production-scale recommendation systems.

9 September 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
RSRasoul Shafipour
Rasoul Shafipour
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
We develop online graph learning algorithms from streaming network data. Our goal is to track the (possibly) time-varying network topology, and affect memory and computational savings by processing the data on-the-fly as they are acquired. The setup entails observations modeled as stationary graph signals generated by local diffusion dynamics on the unknown network. Moreover, we may have a priori information on the presence or absence of a few edges as in the link prediction problem. The stationarity assumption implies that the observations’ covariance matrix and the so-called graph shift operator (GSO—a matrix encoding the graph topology) commute under mild requirements. This motivates formulating the topology inference task as an inverse problem, whereby one searches for a sparse GSO that is structurally admissible and approximately commutes with the observations’ empirical covariance matrix. For streaming data, said covariance can be updated recursively, and we show online proximal gradient iterations can be brought to bear to efficiently track the time-varying solution of the inverse problem with quantifiable guarantees. Specifically, we derive conditions under which the GSO recovery cost is strongly convex and use this property to prove that the online algorithm converges to within a neighborhood of the optimal time-varying batch solution. Numerical tests illustrate the effectiveness of the proposed graph learning approach in adapting to streaming information and tracking changes in the sought dynamic network.

4 March 2021 in IEEE Open Journal of Signal Processing
Verified
Journal Article
Open access
RSRasoul Shafipour
Rasoul Shafipour
SSSantiago Segarra
Santiago Segarra
AMAntonio G. Marques
Antonio G. Marques
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
We address the problem of inferring an undirected graph from nodal observations, which are modeled as non-stationary graph signals generated by local diffusion dynamics that depend on the structure of the unknown network. Using the so-called graph-shift operator (GSO), which is a matrix representation of the graph, we first identify the eigenvectors of the shift matrix from observations of the diffused signals, and then estimate the eigenvalues by imposing desirable properties on the graph to be recovered. Different from the stationary setting where the eigenvectors can be obtained directly from the covariance matrix of the measurements, here we need to estimate first the unknown diffusion (graph) filter - a polynomial in the GSO that preserves the sought eigenbasis. To carry out this initial system identification step, we exploit different sources of information on the arbitrarily-correlated input signal driving the diffusion on the graph. We first explore the setting where the observations, the input information, and the unknown graph filter are linearly related. We then address the case where the relation is given by a system of matrix quadratic equations, which arises in pragmatic scenarios where only the second-order statistics of the inputs are available. While such a quadratic filter identification problem boils down to a non-convex fourth-order polynomial minimization, we discuss identifiability conditions, propose algorithms to approximate the solution, and analyze their performance. Numerical tests illustrate the effectiveness of the proposed topology inference algorithms in recovering brain, social, financial, and urban transportation networks using synthetic and real-world signals.

5 June 2018 in Palgrave Communications
Verified
Journal Article
Open access
PDF file
RSRasoul Shafipour
Rasoul Shafipour
RBRaiyan Abdul Baten
Raiyan Abdul Baten
KHKamrul Hasan
Kamrul Hasan
GGGourab Ghoshal
Gourab Ghoshal
GMGonzalo Mateos
Gonzalo Mateos
MHMohammed Ehsan Hoque
Mohammed Ehsan Hoque
Studies in learning communities have consistently found evidence that peer-interactions contribute to students’ performance outcomes. A particularly important competence in the modern context is the ability to communicate ideas effectively. One metric of this is speaking, which is an important skill in professional and casual settings. In this study, we explore peer-interaction effects in online networks on speaking skill development. In particular, we present an evidence for gradual buildup of skills in a small-group setting that has not been reported in the literature. Evaluating the development of such skills requires studying objective evidence, for which purpose, we introduce a novel dataset of six online communities consisting of 158 participants focusing on improving their speaking skills. They video-record speeches for 5 prompts in 10 days and exchange comments and performance-ratings with their peers. We ask (i) whether the participants’ ratings are affected by their interaction patterns with peers, and (ii) whether there is any gradual buildup of speaking skills in the communities towards homogeneity. To analyze the data, we employ tools from the emerging field of Graph Signal Processing (GSP). GSP enjoys a distinction from Social Network Analysis in that the latter is concerned primarily with the connection structures of graphs, while the former studies signals on top of graphs. We study the performance ratings of the participants as graph signals atop underlying interaction topologies. Total variation analysis of the graph signals show that the participants’ rating differences decrease with time (slope = −0.04, p < 0.01), while average ratings increase (slope = 0.07, p < 0.05)—thereby gradually building up the ratings towards community-wide homogeneity. We provide evidence for peer-influence through a prediction formulation. Our consensus-based prediction model outperforms baseline network-agnostic regression models by about 23% in predicting performance ratings. This in turn shows that participants’ ratings are affected by their peers’ ratings and the associated interaction patterns, corroborating previous findings. Then, we formulate a consensus-based diffusion model that captures these observations of peer-influence from our analyses. We anticipate that this study will open up future avenues for a broader exploration of peer-influenced skill development mechanisms, and potentially help design innovative interventions in small-groups to maximize peer-effects.

1 May 2019
Verified
Conference Paper
Closed access
RSRasoul Shafipour
Rasoul Shafipour
AKAli Khodabakhsh
Ali Khodabakhsh
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
We propose a methodology to carry out vertex-frequency analyses of graph signals, with the goal of unveiling the signal's frequency occupancy over a localized region in the network. To this end, we first introduce localized graph signals in the vertex domain, by defining windows that are localized around each node by construction. Recent directed graph Fourier transform (DGFT) advances facilitate the frequency analysis of said localized signals, to reveal the signal's energy distribution in a way akin to a spectrogram in the vertex-frequency plane. We then learn a set of windows by applying gradient descent method to an optimization problem governed by penalty parameters in the spectral domain. We also argue about the tradeoff between the resolution in the vertex and frequency domains based on the said parameters. We evaluate the performance of the proposed windowed GFT approach through numerical experiments on synthetic and real-world graphs.