Foraging decisions as multi-armed bandit problems: applying reinforcement learning algorithms to foraging data (Q1730108): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q91421791, #quickstatements; #temporary_batch_1711094041063 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3040961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal patch use in a stochastic environment / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2810878 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3629037 / rank | |||
Normal rank |
Latest revision as of 15:28, 18 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Foraging decisions as multi-armed bandit problems: applying reinforcement learning algorithms to foraging data |
scientific article |
Statements
Foraging decisions as multi-armed bandit problems: applying reinforcement learning algorithms to foraging data (English)
0 references
11 March 2019
0 references
foraging decisions
0 references
multi-armed bandit
0 references
reinforcement learning algorithms
0 references