Imagen de Portada

Regret Guarantees for Linear Contextual Stochastic Shortest Path

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Polikar, Dor, Cohen, Alon
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Eluder-based Regret for Stochastic Contextual MDPs
por: Levy, Orin, et al.
Publicado: (2022)

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

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
por: Levy, Orin, et al.
Publicado: (2025)

Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
por: Levy, Orin, et al.
Publicado: (2026)

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

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

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

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

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

On the Optimal Regret of Locally Private Linear Contextual Bandit
por: Li, Jiachun, et al.
Publicado: (2024)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
por: Di, Qiwei, et al.
Publicado: (2023)

Any-Time Regret-Guaranteed Algorithm for Control of Linear Quadratic Systems
por: Chekan, Jafar Abbaszadeh, et al.
Publicado: (2024)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
por: Kim, Seok-Jin, et al.
Publicado: (2024)

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
por: Güçlü, Arda, et al.
Publicado: (2024)

Active Learning for Stochastic Contextual Linear Bandits
por: Brunskill, Emma, et al.
Publicado: (2026)

Rate-Optimal Policy Optimization for Linear Markov Decision Processes
por: Sherman, Uri, et al.
Publicado: (2023)

Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimization
por: Nazari, Parvin, et al.
Publicado: (2025)

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

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

Fast Best-in-Class Regret for Contextual Bandits
por: Girard, Samuel, et al.
Publicado: (2025)

Optimal Regret for Policy Optimization in Contextual Bandits
por: Levy, Orin, et al.
Publicado: (2026)

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

Queue Length Regret Bounds for Contextual Queueing Bandits
por: Bae, Seoungbin, et al.
Publicado: (2026)

How Does Variance Shape the Regret in Contextual Bandits?
por: Jia, Zeyu, et al.
Publicado: (2024)

Redefining the Shortest Path Problem Formulation of the Linear Non-Gaussian Acyclic Model: Pairwise Likelihood Ratios, Prior Knowledge, and Path Enumeration
por: Ong, Hans Jarett J., et al.
Publicado: (2024)

Improved Bounds for Reward-Agnostic and Reward-Free Exploration
por: Ridel, Oran, et al.
Publicado: (2026)

Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee
por: Takeno, Shion
Publicado: (2026)

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

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
por: Liu, Junyan, et al.
Publicado: (2025)

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

The Sample Complexity of Multiclass and Sparse Contextual Bandits
por: Erez, Liad, et al.
Publicado: (2026)

Data-Driven Online Model Selection With Regret Guarantees
por: Pacchiano, Aldo, et al.
Publicado: (2023)

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
por: Chen, Zijun, et al.
Publicado: (2026)

Active Context Selection Improves Simple Regret in Contextual Bandits
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Fairness and Privacy Guarantees in Federated Contextual Bandits
por: Solanki, Sambhav, et al.
Publicado: (2024)

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

Improved Regret of Linear Ensemble Sampling
por: Lee, Harin, et al.
Publicado: (2024)

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

Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood
por: Liu, Ziyi, et al.
Publicado: (2024)

Stronger Neyman Regret Guarantees for Adaptive Experimental Design
por: Noarov, Georgy, et al.
Publicado: (2025)