AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Learning Bipartite Graphs: Heavy Tails and Multiple Components

José Vinícius De Miranda Cardoso, Jiaxi Ying, Daniel P. Palomar

NeurIPS 2022 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Student-t likelihood (SBG) instead of Gaussian SOBG/SGA for connected bipartite graphsSBG · S&P500 rolling windowaccuracy and modularityImproved
use Student-t k-component bipartite graph learning (kSBG) vs SOBG and SGLAkSBG · S&P500 rolling window, k=8accuracy and modularity: 0.75 -> 0.97 accuracyImproved
kSBG vs SGLA on full datasetkSBG · S&P500 whole datasetaccuracy: 0.77 -> 0.97Improved
kSBG vs SOBG on full datasetkSBG · S&P500 whole datasetmodularity: 0.61 -> 0.82Improved
kSBG vs SGLA on full datasetkSBG · S&P500 whole datasetmodularity: 0.56 -> 0.82Improved
COVID-19 market turmoil from Jan 2020GBG, SBG, kSBG · S&P500 rolling windowaccuracy and modularityHurt
uniform random vs default initialization (ablation)SBG and kSBG · S&P500 (362 stocks, 9 sectors) 100 realizationsobjective convergence and learned graphNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy