Extremely Fast and Compact Binary Graph Representations via Randomized Operator Sketching

arXiv:2609.32641 · cs.LG · Submitted 2026-09-26 · Read on arXiv

cs.LG

Submitted: 2026-09-26

Updated: 2026-09-26

Code: https://github.com/Srajansstar/Fast_Binary_Graph_Representation

Terminology

• Accuracy — 59× in this paper · explained in 1 episode
• Benchmark — 51× in this paper · explained in 2 episodes
• Core — 11× in this paper · explained in 2 episodes
• Embeddings — 11× in this paper · explained in 2 episodes
• Adaptation — 8× in this paper · explained in 1 episode
• Adam — 7× in this paper · explained in 2 episodes
• F1 Score — 7× in this paper · explained in 3 episodes
• GNNs — 7× in this paper · explained in 2 episodes
• Ablation — 6× in this paper · explained in 1 episode
• Actor — 6× in this paper · explained in 3 episodes
• Aggregation — 6× in this paper · explained in 1 episode
• Pseudo-labels — 6× in this paper · explained in 2 episodes
• Quantization — 6× in this paper · explained in 12 episodes
• Graph Convolutional Network — 5× in this paper
• Linear probe — 4× in this paper · explained in 2 episodes
• Representation Learning — 4× in this paper · explained in 2 episodes
• Spiking neural networks — 4× in this paper · explained in 2 episodes
• Adjacency Matrix — 3× in this paper · explained in 1 episode
• Failure Modes — 3× in this paper · explained in 3 episodes
• Ablation Studies — 2× in this paper · explained in 1 episode
• Conference on Knowledge Discovery and Data Mining — 2× in this paper
• In International Conference on Learning Representations — 2× in this paper
• Robustness — 2× in this paper · explained in 5 episodes
• Spiking Agreement-Driven Plasticity — 2× in this paper
• Abundance — 1× in this paper · explained in 1 episode
• Alignment — 1× in this paper · explained in 1 episode
• Benchmarking — 1× in this paper · explained in 4 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Conference on Computer Vision and Pattern Recognition — 1× in this paper
• Consistency — 1× in this paper · explained in 3 episodes
• Downstream Tasks — 1× in this paper · explained in 2 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Large Language Models (LLMs) — 1× in this paper · explained in 6 episodes
• Modularity — 1× in this paper · explained in 9 episodes
• Open Graph Benchmark — 1× in this paper
• Pseudo-labeling — 1× in this paper · explained in 3 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Resource Constraints — 1× in this paper · explained in 3 episodes
• Scaffolding — 1× in this paper · explained in 3 episodes
• Semantic Drift — 1× in this paper · explained in 3 episodes
• Sparsity — 1× in this paper · explained in 4 episodes
• World Wide Web — 1× in this paper

Sources

• Building Supervision into Hebbian Plasticity through Spike Agreement

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