:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Le, My, Ruiz, Luana, Dhara, Souvik
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2504.08216
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs
by: Zhu, Alan, et al.
Published: (2025)

Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
by: Shen, Cencheng, et al.
Published: (2014)

Incremental Approximate Single-Source Shortest Paths with Predictions
by: McCauley, Samuel, et al.
Published: (2025)

A Poincaré Inequality and Consistency Results for Signal Sampling on Large Graphs
by: Le, Thien, et al.
Published: (2023)

Scalable Random Wavelet Features: Efficient Non-Stationary Kernel Approximation with Convergence Guarantees
by: Kumar, Sawan, et al.
Published: (2026)

Interpretable Self-Supervised Learning via Representer Landmarks and Nyström Approximation
by: Zarvandi, Maedeh, et al.
Published: (2025)

Stochastic Shortest Path with Sparse Adversarial Costs
by: Johnson, Emmeran, et al.
Published: (2025)

Unsupervised Learning for the Elementary Shortest Path Problem
by: Chen, Jingyi, et al.
Published: (2025)

Learning Shortest Paths When Data is Scarce
by: Matsypura, Dmytro, et al.
Published: (2026)

A Spectral Framework for Graph Neural Operators: Convergence Guarantees and Tradeoffs
by: Holden, Roxanne, et al.
Published: (2025)

Skeleton-Guided Learning for Shortest Path Search
by: Liu, Tiantian, et al.
Published: (2025)

Regret Guarantees for Linear Contextual Stochastic Shortest Path
by: Polikar, Dor, et al.
Published: (2025)

Spectral Journey: How Transformers Predict the Shortest Path
by: Cohen, Andrew, et al.
Published: (2025)

Learning Shortest Paths with Generative Flow Networks
by: Morozov, Nikita, et al.
Published: (2026)

A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphs
by: Azad, Amitoz, et al.
Published: (2024)

Landmark Stereo Dataset for Landmark Recognition and Moving Node Localization in a Non-GPS Battlefield Environment
by: Sapkota, Ganesh, et al.
Published: (2024)

Convergent Reinforcement Learning Algorithms for Stochastic Shortest Path Problem
by: Guin, Soumyajit, et al.
Published: (2025)

Neural Shortest Path for Surface Reconstruction from Point Clouds
by: Park, Yesom, et al.
Published: (2025)

Generalization in LLM Problem Solving: The Case of the Shortest Path
by: Tong, Yao, et al.
Published: (2026)

Renormalized Graph Representations for Node Classification
by: Caso, Francesco, et al.
Published: (2023)

GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code
by: Verma, Samidha, et al.
Published: (2025)

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
by: Tarbouriech, Jean, et al.
Published: (2026)

Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning
by: Luo, Yuankai, et al.
Published: (2024)

Multi-View Node Pruning for Accurate Graph Representation
by: Kim, Hanjin, et al.
Published: (2025)

Node Regression on Latent Position Random Graphs via Local Averaging
by: Gjorgjevski, Martin, et al.
Published: (2024)

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
by: Di, Qiwei, et al.
Published: (2024)

Sampling Transferable Graph Neural Networks with Limited Graph Information
by: Wang, Haoyu, et al.
Published: (2024)

Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers
by: Chen, Jinsong, et al.
Published: (2024)

A Generative Model for Controllable Feature Heterophily in Graphs
by: Wang, Haoyu, et al.
Published: (2025)

Efficient Graph Optimization via Distance-Aware Graph Representation Learning
by: Liu, Dong, et al.
Published: (2024)

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
by: Li, Enzhi, et al.
Published: (2024)

Graph Semi-Supervised Learning for Point Classification on Data Manifolds
by: Netto, Caio F. Deberaldini, et al.
Published: (2025)

GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction
by: Ferrini, Francesco, et al.
Published: (2025)

MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings
by: Ren, Jingyao, et al.
Published: (2021)

Subsampling Graphs with GNN Performance Guarantees
by: Jain, Mika Sarkin, et al.
Published: (2025)

Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
by: Chen, Yung-Fu, et al.
Published: (2025)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
by: Tong, Guangmo, et al.
Published: (2024)

Computing Approximate Graph Edit Distance via Optimal Transport
by: Cheng, Qihao, et al.
Published: (2024)

Regret Lower Bounds for Decentralized Multi-Agent Stochastic Shortest Path Problems
by: Chavan, Utkarsh U., et al.
Published: (2025)

AAC: Admissible-by-Architecture Differentiable Landmark Compression for ALT
by: Le, An T., et al.
Published: (2026)