Learning Shortest Paths When Data is Scarce
Fuente:
arXiv
Saved in:
| Main Authors: | Matsypura, Dmytro, Pan, Yu, Wang, Hanzhao |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
When No-Rejection Learning is Consistent for Regression with Rejection
by: Li, Xiaocheng, et al.
Published: (2023)
by: Li, Xiaocheng, et al.
Published: (2023)
Unsupervised Learning for the Elementary Shortest Path Problem
by: Chen, Jingyi, et al.
Published: (2025)
by: Chen, Jingyi, et al.
Published: (2025)
Skeleton-Guided Learning for Shortest Path Search
by: Liu, Tiantian, et al.
Published: (2025)
by: Liu, Tiantian, et al.
Published: (2025)
Learning Shortest Paths with Generative Flow Networks
by: Morozov, Nikita, et al.
Published: (2026)
by: Morozov, Nikita, et al.
Published: (2026)
When Data Is Scarce: Scaling Sparse Language Models with Repeated Training
by: Wu, Boqian, et al.
Published: (2026)
by: Wu, Boqian, et al.
Published: (2026)
Machine Learning-Based Prediction of Key Genes Correlated to the Subretinal Lesion Severity in a Mouse Model of Age-Related Macular Degeneration
by: Yan, Kuan, et al.
Published: (2024)
by: Yan, Kuan, et al.
Published: (2024)
Convergent Reinforcement Learning Algorithms for Stochastic Shortest Path Problem
by: Guin, Soumyajit, et al.
Published: (2025)
by: Guin, Soumyajit, et al.
Published: (2025)
DataSP: A Differential All-to-All Shortest Path Algorithm for Learning Costs and Predicting Paths with Context
by: Lahoud, Alan A., et al.
Published: (2024)
by: Lahoud, Alan A., et al.
Published: (2024)
Stochastic Shortest Path with Sparse Adversarial Costs
by: Johnson, Emmeran, et al.
Published: (2025)
by: Johnson, Emmeran, et al.
Published: (2025)
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
by: Di, Qiwei, et al.
Published: (2024)
by: Di, Qiwei, et al.
Published: (2024)
Regret Guarantees for Linear Contextual Stochastic Shortest Path
by: Polikar, Dor, et al.
Published: (2025)
by: Polikar, Dor, et al.
Published: (2025)
Spectral Journey: How Transformers Predict the Shortest Path
by: Cohen, Andrew, et al.
Published: (2025)
by: Cohen, Andrew, et al.
Published: (2025)
Learning to Make Adherence-Aware Advice
by: Chen, Guanting, et al.
Published: (2023)
by: Chen, Guanting, et al.
Published: (2023)
Centrality of shortest paths: Algorithms and complexity results
by: Phosavanh, Johnson, et al.
Published: (2024)
by: Phosavanh, Johnson, et al.
Published: (2024)
Graph Pseudotime Analysis and Neural Stochastic Differential Equations for Analyzing Retinal Degeneration Dynamics and Beyond
by: Shi, Dai, et al.
Published: (2025)
by: Shi, Dai, et al.
Published: (2025)
Neural Shortest Path for Surface Reconstruction from Point Clouds
by: Park, Yesom, et al.
Published: (2025)
by: Park, Yesom, et al.
Published: (2025)
Calibrating an Imperfect Auxiliary Predictor for Unobserved No-Purchase Choice
by: Xiong, Jiangkai, et al.
Published: (2026)
by: Xiong, Jiangkai, et al.
Published: (2026)
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
by: Chen, Yung-Fu, et al.
Published: (2025)
by: Chen, Yung-Fu, et al.
Published: (2025)
Improving Open-world Continual Learning under the Constraints of Scarce Labeled Data
by: Li, Yujie, et al.
Published: (2025)
by: Li, Yujie, et al.
Published: (2025)
Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating
by: Salehi, Mohammad Reza Deylam
Published: (2026)
by: Salehi, Mohammad Reza Deylam
Published: (2026)
Generalization in LLM Problem Solving: The Case of the Shortest Path
by: Tong, Yao, et al.
Published: (2026)
by: Tong, Yao, et al.
Published: (2026)
OMGPT: A Sequence Modeling Framework for Data-driven Operational Decision Making
by: Wang, Hanzhao, et al.
Published: (2025)
by: Wang, Hanzhao, et al.
Published: (2025)
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
by: Tarbouriech, Jean, et al.
Published: (2026)
by: Tarbouriech, Jean, et al.
Published: (2026)
Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
by: Shen, Cencheng, et al.
Published: (2014)
by: Shen, Cencheng, et al.
Published: (2014)
An Algorithm for Learning Smaller Representations of Models With Scarce Data
by: de Wynter, Adrian
Published: (2020)
by: de Wynter, Adrian
Published: (2020)
Multi-View Subgraph Neural Networks: Self-Supervised Learning with Scarce Labeled Data
by: Wang, Zhenzhong, et al.
Published: (2024)
by: Wang, Zhenzhong, et al.
Published: (2024)
Incremental Approximate Single-Source Shortest Paths with Predictions
by: McCauley, Samuel, et al.
Published: (2025)
by: McCauley, Samuel, et al.
Published: (2025)
Landmark-Based Node Representations for Shortest Path Distance Approximations in Random Graphs
by: Le, My, et al.
Published: (2025)
by: Le, My, et al.
Published: (2025)
A Three-Stage Bayesian Transfer Learning Framework to Improve Predictions in Data-Scarce Domains
by: Furlong, Aidan, et al.
Published: (2025)
by: Furlong, Aidan, et al.
Published: (2025)
A Transfer Framework for Enhancing Temporal Graph Learning in Data-Scarce Settings
by: Agarwal, Sidharth, et al.
Published: (2025)
by: Agarwal, Sidharth, et al.
Published: (2025)
Cross-Learning from Scarce Data via Multi-Task Constrained Optimization
by: Agorio, Leopoldo, et al.
Published: (2025)
by: Agorio, Leopoldo, et al.
Published: (2025)
Causality Enhanced Origin-Destination Flow Prediction in Data-Scarce Cities
by: Feng, Tao, et al.
Published: (2025)
by: Feng, Tao, et al.
Published: (2025)
Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs
by: Zhu, Alan, et al.
Published: (2025)
by: Zhu, Alan, et al.
Published: (2025)
Pre-trained Encoders for Global Child Development: Transfer Learning Enables Deployment in Data-Scarce Settings
by: Fahim, Md Muhtasim Munif, et al.
Published: (2026)
by: Fahim, Md Muhtasim Munif, et al.
Published: (2026)
GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction
by: Ferrini, Francesco, et al.
Published: (2025)
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)
by: Ren, Jingyao, et al.
Published: (2021)
Bridging Local and Global Knowledge: Cascaded Mixture-of-Experts Learning for Near-Shortest Path Routing
by: Chen, Yung-Fu, et al.
Published: (2026)
by: Chen, Yung-Fu, et al.
Published: (2026)
Query-decision Regression between Shortest Path and Minimum Steiner Tree
by: Tong, Guangmo, et al.
Published: (2024)
by: Tong, Guangmo, et al.
Published: (2024)
Learning Continuous Network Emerging Dynamics from Scarce Observations via Data-Adaptive Stochastic Processes
by: Cui, Jiaxu, et al.
Published: (2023)
by: Cui, Jiaxu, et al.
Published: (2023)
Regret Lower Bounds for Decentralized Multi-Agent Stochastic Shortest Path Problems
by: Chavan, Utkarsh U., et al.
Published: (2025)
by: Chavan, Utkarsh U., et al.
Published: (2025)
Similar Items
-
When No-Rejection Learning is Consistent for Regression with Rejection
by: Li, Xiaocheng, et al.
Published: (2023) -
Unsupervised Learning for the Elementary Shortest Path Problem
by: Chen, Jingyi, et al.
Published: (2025) -
Skeleton-Guided Learning for Shortest Path Search
by: Liu, Tiantian, et al.
Published: (2025) -
Learning Shortest Paths with Generative Flow Networks
by: Morozov, Nikita, et al.
Published: (2026) -
When Data Is Scarce: Scaling Sparse Language Models with Repeated Training
by: Wu, Boqian, et al.
Published: (2026)