paper-with-me

홈 › Papers

A Hoeffding Inequality for Finite State Markov Chains and its Applications to Markovian Bandits

2020-01-05 · Vrettos Moulos

This paper develops a Hoeffding inequality for the partial sums $\sum_{k=1}^n f (X_k)$, where $\{X_k\}_{k \in \mathbb{Z}_{> 0}}$ is an irreducible Markov chain on a finite state space $S$, and $f : S \to [a, b]$ is a real-valued function. Our bound is simple, general, since it only assumes irreducibility and finiteness of the state space, and powerful. In order to demonstrate its usefulness we provide two applications in multi-armed bandit problems. The first is about identifying an approximately best Markovian arm, while the second is concerned with regret minimization in the context of Markovian bandits.

📄 PDF Abstract BibTeX arXiv:2001.01199

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Hoeffding's Inequality for Markov Chains under Generalized Concentrability Condition

2023-10-04 · Hao Chen, Abhishek Gupta, Yin Sun, Ness Shroff

This paper studies Hoeffding's inequality for Markov chains under the generalized concentrability condition defined via integral probability metric (IPM). The generalized concentrability condition establishes a framework…

A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices

2020-08-06 · NeurIPS 2020 12 · Jiezhong Qiu, Chi Wang, Ben Liao, Richard Peng 외

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian…

Graph LearningGraph Representation LearningRepresentation Learning

New-Type Hoeffding's Inequalities and Application in Tail Bounds

2021-01-02 · Pingyi Fan

It is well known that Hoeffding's inequality has a lot of applications in the signal and information processing fields. How to improve Hoeffding's inequality and find the refinements of its applications have always attra…

Vocal Bursts Type Prediction

Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards

2020-01-30 · NeurIPS 2020 12 · Vrettos Moulos

We study an extension of the classic stochastic multi-armed bandit problem which involves multiple plays and Markovian rewards in the rested bandits setting. In order to tackle this problem we consider an adaptive alloca…

Sharp Finite-Time Iterated-Logarithm Martingale Concentration

2014-05-12 · Akshay Balsubramani

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-c…