Search Results for author:
Found 8 papers, 3 papers with code
SF-SGL: Solver-Free Spectral Graph Learning from Linear Measurements
This work introduces a highly-scalable spectral graph densification framework (SGL) for learning resistor networks with linear measurements, such as node voltages and currents.
HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering
To address the ever-increasing computational challenges, graph coarsening can be potentially applied for preprocessing a given hypergraph by aggressively aggregating its vertices (nodes).
SPADE: A Spectral Method for Black-Box Adversarial Robustness Evaluation
A black-box spectral method is introduced for evaluating the adversarial robustness of a given machine learning (ML) model.
A Unified Spectral Sparsification Framework for Directed Graphs
For the first time, we prove the existence of linear-sized spectral sparsifiers for general directed graphs and introduce a practically-efficient and unified spectral graph sparsification approach that allows sparsifying real-world, large-scale directed and undirected graphs with guaranteed preservation of the original graph spectra.
Graph Learning via Spectral Densification
Graph learning plays important role in many data mining and machine learning tasks, such as manifold learning, data representation and analysis, dimensionality reduction, data clustering, and visualization, etc.
SF-GRASS: Solver-Free Graph Spectral Sparsification
Recent spectral graph sparsification techniques have shown promising performance in accelerating many numerical and graph algorithms, such as iterative methods for solving large sparse matrices, spectral partitioning of undirected graphs, vectorless verification of power/thermal grids, representation learning of large graphs, etc.
GRASPEL: Graph Spectral Learning at Scale
Learning meaningful graphs from data plays important roles in many data mining and machine learning tasks, such as data representation and analysis, dimension reduction, data clustering, and visualization, etc.
GraphZoom: A multi-level spectral approach for accurate and scalable graph embedding
GraphZoom first performs graph fusion to generate a new graph that effectively encodes the topology of the original graph and the node attribute information.
