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.
In many real-world sequential decision making problems, the number of available actions (decisions) can vary over time. While problems like catastrophic forgetting, changing transition dynamics, changing rewards functions, etc. have been well-studied in the lifelong learning literature, the setting where the action set changes remains unaddressed. In this paper, we present an algorithm that autonomously adapts to an action set whose size changes over time. To tackle this open problem, we break it into two problems that can be solved iteratively: inferring the underlying, unknown, structure in the space of actions and optimizing a policy that leverages this structure. We demonstrate the efficiency of this approach on large-scale real-world lifelong learning problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.01770")
get_code_for_paper("1906.01770")
have("1906.01770")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.01770.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.01770)
Connect an agent — have() is free.