NFFT meets Krylov methods: Fast matrix-vector products for the graph
Laplacian of fully connected networks

v1v2 (latest)

NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks

14 August 2018

ArXiv (abs)PDF HTML

Papers citing "NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks"

10 / 10 papers shown

Title
Graph Laplacian-based Bayesian Multi-fidelity Modeling Orazio Pinti Jeremy M. Budd Franca Hoffmann Assad A. Oberai 81 1 0 12 Sep 2024
A Preconditioned Interior Point Method for Support Vector Machines Using an ANOVA-Decomposition and NFFT-Based Matrix-Vector Products Theresa Wagner John W. Pearson Martin Stoll 64 4 0 01 Dec 2023
Joint reconstruction-segmentation on graphs Jeremy Budd Y. Gennip J. Latz S. Parisotto Carola-Bibiane Schönlieb 45 3 0 11 Aug 2022
Learning in High-Dimensional Feature Spaces Using ANOVA-Based Fast Matrix-Vector Multiplication Franziska Nestler Martin Stoll Theresa Wagner 37 9 0 19 Nov 2021
PrivateMail: Supervised Manifold Learning of Deep Features With Differential Privacy for Image Retrieval Praneeth Vepakomma Julia Balla Ramesh Raskar 28 4 0 22 Feb 2021
Pseudoinverse Graph Convolutional Networks: Fast Filters Tailored for Large Eigengaps of Dense Graphs and Hypergraphs Dominik Alfke Martin Stoll GNN 50 5 0 03 Aug 2020
Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products Kai Bergermann Martin Stoll Toni Volkmer 33 10 0 10 Jul 2020
A literature survey of matrix methods for data science Martin Stoll 65 20 0 17 Dec 2019
Semi-Supervised Classification on Non-Sparse Graphs Using Low-Rank Graph Convolutional Networks Dominik Alfke Martin Stoll GNN 48 3 0 24 May 2019
The Oracle of DLphi Dominik Alfke W. Baines J. Blechschmidt Mauricio J. del Razo Sarmina Amnon Drory ... L. Thesing Philipp Trunschke Johannes von Lindheim David Weber Melanie Weber 52 0 0 17 Jan 2019