Work

Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon

Year: 2018

Type: conference-paper

Source: Conference on Learning Theory

Authors: Nan Jiang, Alekh Agarwal

Institutions: University of Illinois Urbana-Champaign, Microsoft (United States)

Language: English

Topic: Advanced Bandit Algorithms Research

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: closed

OpenAlex ID: W2886712433

FWCI: 9.947

Cites: 9

Cited by: 28

Related to: 10