Copertina

Learning Shortest Paths When Data is Scarce

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Matsypura, Dmytro, Pan, Yu, Wang, Hanzhao
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

When No-Rejection Learning is Consistent for Regression with Rejection
di: Li, Xiaocheng, et al.
Pubblicazione: (2023)

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

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

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

When Data Is Scarce: Scaling Sparse Language Models with Repeated Training
di: Wu, Boqian, et al.
Pubblicazione: (2026)

Machine Learning-Based Prediction of Key Genes Correlated to the Subretinal Lesion Severity in a Mouse Model of Age-Related Macular Degeneration
di: Yan, Kuan, et al.
Pubblicazione: (2024)

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

DataSP: A Differential All-to-All Shortest Path Algorithm for Learning Costs and Predicting Paths with Context
di: Lahoud, Alan A., et al.
Pubblicazione: (2024)

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

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

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

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

Learning to Make Adherence-Aware Advice
di: Chen, Guanting, et al.
Pubblicazione: (2023)

Centrality of shortest paths: Algorithms and complexity results
di: Phosavanh, Johnson, et al.
Pubblicazione: (2024)

Graph Pseudotime Analysis and Neural Stochastic Differential Equations for Analyzing Retinal Degeneration Dynamics and Beyond
di: Shi, Dai, et al.
Pubblicazione: (2025)

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

Calibrating an Imperfect Auxiliary Predictor for Unobserved No-Purchase Choice
di: Xiong, Jiangkai, et al.
Pubblicazione: (2026)

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

Improving Open-world Continual Learning under the Constraints of Scarce Labeled Data
di: Li, Yujie, et al.
Pubblicazione: (2025)

Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating
di: Salehi, Mohammad Reza Deylam
Pubblicazione: (2026)

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

OMGPT: A Sequence Modeling Framework for Data-driven Operational Decision Making
di: Wang, Hanzhao, et al.
Pubblicazione: (2025)

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

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

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

Multi-View Subgraph Neural Networks: Self-Supervised Learning with Scarce Labeled Data
di: Wang, Zhenzhong, et al.
Pubblicazione: (2024)

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

Landmark-Based Node Representations for Shortest Path Distance Approximations in Random Graphs
di: Le, My, et al.
Pubblicazione: (2025)

A Three-Stage Bayesian Transfer Learning Framework to Improve Predictions in Data-Scarce Domains
di: Furlong, Aidan, et al.
Pubblicazione: (2025)

A Transfer Framework for Enhancing Temporal Graph Learning in Data-Scarce Settings
di: Agarwal, Sidharth, et al.
Pubblicazione: (2025)

Cross-Learning from Scarce Data via Multi-Task Constrained Optimization
di: Agorio, Leopoldo, et al.
Pubblicazione: (2025)

Causality Enhanced Origin-Destination Flow Prediction in Data-Scarce Cities
di: Feng, Tao, et al.
Pubblicazione: (2025)

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

Pre-trained Encoders for Global Child Development: Transfer Learning Enables Deployment in Data-Scarce Settings
di: Fahim, Md Muhtasim Munif, et al.
Pubblicazione: (2026)

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

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

Bridging Local and Global Knowledge: Cascaded Mixture-of-Experts Learning for Near-Shortest Path Routing
di: Chen, Yung-Fu, et al.
Pubblicazione: (2026)

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

Learning Continuous Network Emerging Dynamics from Scarce Observations via Data-Adaptive Stochastic Processes
di: Cui, Jiaxu, et al.
Pubblicazione: (2023)

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