Copertina

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Harada, Tsubasa, Kawase, Yasushi, Sumita, Hanna
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio
di: Yoshinaga, Toru, et al.
Pubblicazione: (2026)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
di: Kawase, Yasushi, et al.
Pubblicazione: (2025)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
di: Kawase, Yasushi, et al.
Pubblicazione: (2023)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
di: Harada, Tsubasa, et al.
Pubblicazione: (2024)

Online Matching with Delays and Size-based Costs
di: Kawase, Yasushi, et al.
Pubblicazione: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
di: Harada, Tsubasa
Pubblicazione: (2024)

Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty
di: Wang, Yanzhao, et al.
Pubblicazione: (2025)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
di: John, Philips George, et al.
Pubblicazione: (2024)

Towards Optimal Differentially Private Regret Bounds in Linear MDPs
di: Sahu, Sharan
Pubblicazione: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

Online Multi-Class Selection with Group Fairness Guarantee
di: Zargari, Faraz, et al.
Pubblicazione: (2025)

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
di: Davoodi, Mansoor, et al.
Pubblicazione: (2025)

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
di: Xu, Haoran, et al.
Pubblicazione: (2026)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
di: Vaze, Rahul, et al.
Pubblicazione: (2025)

Optimal Scalarizations for Sublinear Hypervolume Regret
di: Zhang, Qiuyi
Pubblicazione: (2023)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
di: Oki, Taihei, et al.
Pubblicazione: (2026)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
di: Oki, Taihei, et al.
Pubblicazione: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Near-Optimal Algorithms for Omniprediction
di: Okoroafor, Princewill, et al.
Pubblicazione: (2025)

Online Algorithms with Limited Data Retention
di: Immorlica, Nicole, et al.
Pubblicazione: (2024)

Online Algorithms with Uncertainty-Quantified Predictions
di: Sun, Bo, et al.
Pubblicazione: (2023)

Improving Online Algorithms via ML Predictions
di: Kumar, Ravi, et al.
Pubblicazione: (2024)

Online Conformal Prediction with Efficiency Guarantees
di: Srinivas, Vaidehi
Pubblicazione: (2025)

Optimal Algorithms for Augmented Testing of Discrete Distributions
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2024)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
di: Hu, Hang, et al.
Pubblicazione: (2022)

Near-optimal Swap Regret Minimization for Convex Losses
di: Hu, Lunjia, et al.
Pubblicazione: (2026)

A Simple Approximation Algorithm for Optimal Decision Tree
di: Zhuo, Zhengjia, et al.
Pubblicazione: (2025)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2026)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
di: Angelopoulos, Spyros, et al.
Pubblicazione: (2024)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
di: Lechowicz, Adam, et al.
Pubblicazione: (2023)

Learning-Augmented Algorithms for $k$-median via Online Learning
di: Hebbar, Anish, et al.
Pubblicazione: (2026)

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
di: Hayderi, Alexandre, et al.
Pubblicazione: (2024)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
di: Zhang, Keyuan, et al.
Pubblicazione: (2024)

Spectral Guarantees for Adversarial Streaming PCA
di: Price, Eric, et al.
Pubblicazione: (2024)

Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy
di: Wu, Ruihan, et al.
Pubblicazione: (2025)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
di: Lee, Russell, et al.
Pubblicazione: (2022)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
di: He, Yuchen, et al.
Pubblicazione: (2024)

Dynamic Spectral Clustering with Provable Approximation Guarantee
di: Laenen, Steinar, et al.
Pubblicazione: (2024)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
di: Sakaue, Shinsaku, et al.
Pubblicazione: (2026)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
di: Collina, Natalie, et al.
Pubblicazione: (2024)