AI Chat AI Image Generator AI Video Text to Speech

A Concentration Bound for LSPE(λ)

11/04/2021
∙
by   Vivek S. Borkar, et al.
∙
4
∙

The popular LSPE(λ) algorithm for policy evaluation is revisited to derive a concentration bound that gives high probability performance guarantees from some time on.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 10/09/2022

A Concentration Bound for Distributed Stochastic Approximation

We revisit the classical model of Tsitsiklis, Bertsekas and Athans for d...
0 Harsh Dolhare, et al. ∙
research
∙ 11/20/2019

Sparse random tensors: concentration, regularization and applications

We prove a non-asymptotic concentration inequality of sparse inhomogeneo...
0 Zhixin Zhou, et al. ∙
research
∙ 07/03/2023

Fitting an ellipsoid to a quadratic number of random points

We consider the problem (P) of fitting n standard Gaussian random vector...
0 Afonso S. Bandeira, et al. ∙
research
∙ 04/20/2020

Estimating Ising Models from One Sample

Given one sample X ∈{± 1}^n from an Ising model [X=x]∝(x^ J x/2), whose ...
0 Yuval Dagan, et al. ∙
research
∙ 01/03/2020

On the definition of a concentration function relevant to the ROC curve

This is a reader's reaction to a recent paper by E. Schechtman and G. Sc...
0 Mauro Gasparini, et al. ∙
research
∙ 05/27/2020

An Ambient-Physical System to Infer Concentration in Open-plan Workplace

One of the core challenges in open-plan workspaces is to ensure a good l...
0 Mohammad Saiedur Rahaman, et al. ∙
research
∙ 06/12/2020

Concentration Bounds for the Collision Estimator

We prove a strong concentration result about the natural collision estim...
0 Maciej Skorski, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal