AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Limiting Extrapolation in Linear Approximate Value Iteration

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 13 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use LAVIER interpolation (min l1 interpolation weights over anchors) instead of least-squares AVILS-AVI · Two-state MDP (Tsitsiklis-Van Roy)prediction error vs horizonHelped
use LAVIER with greedy anchors (C<=1.2) instead of LS-AVILS-AVI · Chain MDP N=50suboptimality at s1Helped
LAVIER with small C (1.05, 1.2) instead of LS-AVILS-AVI · Successive linear banditsV*(st) errorHelped
loosen amplification target from C=1.05 to C=1.5 (fewer anchors) (ablation)LAVIER · Successive linear banditsV*(st) errorMixed
use LSTD off-policy prediction instead of LAVIERLAVIER · Successive linear banditsvalue estimate quality vs chain lengthHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy