Optimal Time Complexity Algorithms for Computing General Random Walk Graph Kernels on Sparse Graphs

arXiv:2410.10368 · cs.LG, stat.ML · Submitted 2024-10-14 · Read on arXiv

cs.LG, stat.ML

Submitted: 2024-10-14

Updated: 2026-08-26

Terminology

• Embeddings — 7× in this paper · explained in 2 episodes
• Clustering — 5× in this paper · explained in 2 episodes
• Accuracy — 3× in this paper · explained in 1 episode
• Adjacency Matrix — 3× in this paper · explained in 1 episode
• Benchmark — 3× in this paper · explained in 2 episodes
• Downstream Tasks — 3× in this paper · explained in 2 episodes
• Theoretical Guarantees — 2× in this paper · explained in 2 episodes
• Ablation — 1× in this paper · explained in 1 episode
• Computational Biology — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Inverse Problem — 1× in this paper · explained in 2 episodes
• Latent Representation — 1× in this paper · explained in 2 episodes
• Representation Learning — 1× in this paper · explained in 2 episodes
• Sparsity — 1× in this paper · explained in 4 episodes
• Transformer — 1× in this paper · explained in 2 episodes

Sources

• Rethinking Attention with Performers

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks