Cover Image

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bini, Lorenzo, Marchand-Maillet, Stephane
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)

On Tradeoffs in Learning-Augmented Algorithms
by: Benomar, Ziyad, et al.
Published: (2025)

Learning-Augmented Priority Queues
by: Benomar, Ziyad, et al.
Published: (2024)

Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025)

LapDDPM: A Conditional Graph Diffusion Model for scRNA-seq Generation with Spectral Adversarial Perturbations
by: Bini, Lorenzo, et al.
Published: (2025)

Simulation of Graph Algorithms with Looped Transformers
by: de Luca, Artur Back, et al.
Published: (2024)

Provably Learning from Modern Language Models via Low Logit Rank
by: Golowich, Noah, et al.
Published: (2025)

Efficient Detection of Commutative Factors in Factor Graphs
by: Luttermann, Malte, et al.
Published: (2024)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
by: Luttermann, Malte, et al.
Published: (2026)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
by: Luttermann, Malte, et al.
Published: (2024)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
by: Liu, Zhouyang, et al.
Published: (2025)

Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
by: Yao, Jasper
Published: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
by: Li, Dongyue, et al.
Published: (2025)

Online Learning with Probing for Sequential User-Centric Selection
by: Xu, Tianyi, et al.
Published: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
by: de Wynter, Adrian
Published: (2020)

Learning-augmented smooth integer programs with PAC-learnable oracles
by: He, Hao-Yuan, et al.
Published: (2026)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
by: Guan, Xinyu, et al.
Published: (2025)

Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
by: Ailon, Nir, et al.
Published: (2025)

Learning Augmented Graph $k$-Clustering
by: Fan, Chenglin, et al.
Published: (2025)

Learning to Prune Instances of Steiner Tree Problem in Graphs
by: Zhang, Jiwei, et al.
Published: (2022)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
by: Wienöbst, Marcel, et al.
Published: (2022)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
by: Benomar, Ziyad, et al.
Published: (2025)

Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
by: Choo, Davin, et al.
Published: (2025)

Massive Activations in Graph Neural Networks: Decoding Attention for Domain-Dependent Interpretability
by: Bini, Lorenzo, et al.
Published: (2024)

Parallel Sampling via Counting
by: Anari, Nima, et al.
Published: (2024)

Approximate Lifted Model Construction
by: Luttermann, Malte, et al.
Published: (2025)

Demand Selection for VRP with Emission Quota
by: Najar, Farid, et al.
Published: (2025)

Fast EXP3 Algorithms
by: Sato, Ryoma, et al.
Published: (2025)

Provably Extracting the Features from a General Superposition
by: Liu, Allen
Published: (2025)

Uncovering Fairness through Data Complexity as an Early Indicator
by: Ferreira, Juliett Suárez, et al.
Published: (2025)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
by: Chee, Jerry, et al.
Published: (2025)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
by: Brita, Catalin E., et al.
Published: (2025)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
by: Chen, Wen-Ling, et al.
Published: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
by: Salemohamed, Omar, et al.
Published: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
by: Huisman, Tim, et al.
Published: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
by: Sun, Yiwen, et al.
Published: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)