We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Statistical performance bounds for reinforcement learning (RL) algorithms can be critical for high-stakes applications like healthcare. This paper introduces a new framework for theoretically measuring the performance of such algorithms called Uniform-PAC, which is a strengthening of the classical Probably Approximately Correct (PAC) framework. In contrast to the PAC framework, the uniform version may be used to derive high probability regret guarantees and so forms a bridge between the two setups that has been missing in the literature. We demonstrate the benefits of the new framework for finite-state episodic MDPs with a new algorithm that is Uniform-PAC and simultaneously achieves optimal regret and PAC guarantees except for a factor of the horizon.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1703.07710")
get_code_for_paper("1703.07710")
have("1703.07710")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1703.07710.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1703.07710)
Connect an agent — have() is free.