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.
We present BRIEE (Block-structured Representation learning with Interleaved Explore Exploit), an algorithm for efficient reinforcement learning in Markov Decision Processes with block-structured dynamics (i.e., Block MDPs), where rich observations are generated from a set of unknown latent states. BRIEE interleaves latent states discovery, exploration, and exploitation together, and can provably learn a near-optimal policy with sample complexity scaling polynomially in the number of latent states, actions, and the time horizon, with no dependence on the size of the potentially infinite observation space. Empirically, we show that BRIEE is more sample efficient than the state-of-art Block MDP algorithm HOMER and other empirical RL baselines on challenging rich-observation combination lock problems that require deep exploration.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.00063")
get_code_for_paper("2202.00063")
have("2202.00063")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.00063.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.00063)
Connect an agent — have() is free.