Image de couverture de livre

Stochastic Shortest Path with Sparse Adversarial Costs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Johnson, Emmeran, Rumi, Alberto, Pike-Burke, Ciara, Rebeschini, Patrick
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity
par: Johnson, Emmeran, et autres
Publié: (2023)

On the necessity of adaptive regularisation:Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls
par: Johnson, Emmeran, et autres
Publié: (2025)

Fixed-Confidence Multiple Change Point Identification under Bandit Feedback
par: Lazzaro, Joseph, et autres
Publié: (2025)

Fixed-Budget Change Point Identification in Piecewise Constant Bandits
par: Lazzaro, Joseph, et autres
Publié: (2025)

Locally Differentially Private Thresholding Bandits
par: Barbara, Annalisa, et autres
Publié: (2025)

When and why randomised exploration works (in linear bandits)
par: Abeille, Marc, et autres
Publié: (2025)

QuACK: A Multipurpose Queuing Algorithm for Cooperative $k$-Armed Bandits
par: Howson, Benjamin, et autres
Publié: (2024)

Learning Fair And Effective Points-Based Rewards Programs
par: Hssaine, Chamsi, et autres
Publié: (2025)

Differentiable Cost-Parameterized Monge Map Estimators
par: Howard, Samuel, et autres
Publié: (2024)

Robust Gradient Descent for Phase Retrieval
par: Buna, Alex, et autres
Publié: (2024)

Regret Guarantees for Linear Contextual Stochastic Shortest Path
par: Polikar, Dor, et autres
Publié: (2025)

Convergent Reinforcement Learning Algorithms for Stochastic Shortest Path Problem
par: Guin, Soumyajit, et autres
Publié: (2025)

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
par: Tarbouriech, Jean, et autres
Publié: (2026)

Best-of-Both Worlds for linear contextual bandits with paid observations
par: Boyer, Nathan, et autres
Publié: (2025)

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
par: Di, Qiwei, et autres
Publié: (2024)

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

Sharp Risk Bounds for Early-Stopping in Gaussian Linear Regression
par: Wegel, Tobias, et autres
Publié: (2025)

Regret Lower Bounds for Decentralized Multi-Agent Stochastic Shortest Path Problems
par: Chavan, Utkarsh U., et autres
Publié: (2025)

DataSP: A Differential All-to-All Shortest Path Algorithm for Learning Costs and Predicting Paths with Context
par: Lahoud, Alan A., et autres
Publié: (2024)

Unsupervised Learning for the Elementary Shortest Path Problem
par: Chen, Jingyi, et autres
Publié: (2025)

Learning Shortest Paths When Data is Scarce
par: Matsypura, Dmytro, et autres
Publié: (2026)

A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence
par: Alfano, Carlo, et autres
Publié: (2023)

Skeleton-Guided Learning for Shortest Path Search
par: Liu, Tiantian, et autres
Publié: (2025)

Spectral Journey: How Transformers Predict the Shortest Path
par: Cohen, Andrew, et autres
Publié: (2025)

Self-Concordant Perturbations for Linear Bandits
par: Lévy, Lucas, et autres
Publié: (2025)

Implicit Regularisation in Diffusion Models: An Algorithm-Dependent Generalisation Analysis
par: Farghly, Tyler, et autres
Publié: (2025)

Learning Shortest Paths with Generative Flow Networks
par: Morozov, Nikita, et autres
Publié: (2026)

Neural Shortest Path for Surface Reconstruction from Point Clouds
par: Park, Yesom, et autres
Publié: (2025)

Non-stationary Bandit Convex Optimization: A Comprehensive Study
par: Liu, Xiaoqi, et autres
Publié: (2025)

Generalization in LLM Problem Solving: The Case of the Shortest Path
par: Tong, Yao, et autres
Publié: (2026)

Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
par: Shen, Cencheng, et autres
Publié: (2014)

Test-time Adversarial Defense with Opposite Adversarial Path and High Attack Time Cost
par: Yeh, Cheng-Han, et autres
Publié: (2024)

Incremental Approximate Single-Source Shortest Paths with Predictions
par: McCauley, Samuel, et autres
Publié: (2025)

Landmark-Based Node Representations for Shortest Path Distance Approximations in Random Graphs
par: Le, My, et autres
Publié: (2025)

Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism
par: Wang, Libo
Publié: (2024)

Learning mirror maps in policy mirror descent
par: Alfano, Carlo, et autres
Publié: (2024)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
par: Maiti, Arnab, et autres
Publié: (2025)

Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs
par: Zhu, Alan, et autres
Publié: (2025)

GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction
par: Ferrini, Francesco, et autres
Publié: (2025)

Learning Adversarial MDPs with Stochastic Hard Constraints
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)