Results 101 to 110 of about 12,386 (222)

Computational Modeling of Decision Making Enhances the Adversity Researcher's Toolbox

open access: yesTopics in Cognitive Science, EarlyView.
Abstract Over the past decades, there has been major progress in our understanding of how adversity influences cognitive abilities and strategies. However, most of this research is based on raw performance, such as response times and accuracy. These measures are informative about decision‐making outcomes but tell us little about cognitive processes. In
Stefan Vermeent   +2 more
wiley   +1 more source

Two-stage index computation for bandits with switching penalties II : switching delays [PDF]

open access: yes
This paper addresses the multi-armed bandit problem with switching penalties including both costs and delays, extending results of the companion paper [J. Niño-Mora.
Jose Nino-Mora
core  

Multi-Armed Bandits and Quantum Channel Oracles [PDF]

open access: yesQuantum
Multi-armed bandits are one of the theoretical pillars of reinforcement learning. Recently, the investigation of quantum algorithms for multi-armed bandit problems was started, and it was found that a quadratic speed-up (in query complexity) is possible ...
Simon Buchholz   +2 more
doaj   +1 more source

Development of Elective Flexibility and Related Cognitive Functions Across Three Cultures

open access: yesDevelopmental Science, Volume 30, Issue 1, January 2027.
ABSTRACT Elective flexibility, the ability to switch between working strategies adaptively, is critical for decision‐making in complex environments. Here we experimentally assessed elective flexibility alongside three related cognitive measures short‐term memory, inhibition, and responsive flexibility–in 325 children and adults (ages 4–81‐years) from ...
Sarah Pope‐Caldwell   +6 more
wiley   +1 more source

Dead Mexican Bandits Columbus NM

open access: yes, 1916
Mexican Bandits Killed at ...
Unknown
core   +2 more sources

A Comprehensive Review on Federated and Incremental Learning in Spatial Crowdsourcing Systems

open access: yesWIREs Data Mining and Knowledge Discovery, Volume 16, Issue 4, December 2026.
A comprehensive overview of Federated and Incremental Learning (FIL) integration in Spatial Crowdsourcing, highlighting privacy, security, adaptability, efficiency challenges, and future research directions. ABSTRACT Spatial Crowdsourcing (SC) coordinates workers and requesters through personal mobile devices to complete location‐dependent tasks in ...
Md Mujibur Rahman   +3 more
wiley   +1 more source

Evaluating Early‐Stage Oncology Clinical Trial Designs in the Era of Project Optimus: A Scoping Review

open access: yesPharmaceutical Statistics, Volume 25, Issue 6, November/December 2026.
ABSTRACT In 2021, the FDA initiated Project Optimus to reform dose optimization and selection in early‐phase oncology, highlighting that doses and schedules of new therapies are often inadequately characterized and that traditional dose‐finding approaches should be revised.
Marie‐Karelle Riviere   +4 more
wiley   +1 more source

Deepening the real options debate: Real options as dynamic optimization

open access: yesStrategic Management Journal, Volume 47, Issue 11, Page 2823-2870, November 2026.
Abstract Research Summary Is real option theory useful for management research? This topic was hotly debated two decades ago. Real options were said to be inapplicable to management research and to lack conceptual distinctiveness. Whereas responses to the claim about the non‐distinctiveness of real options were disparate, the concern about the theory's
Arkadiy V. Sakhartov   +2 more
wiley   +1 more source

Latent Bandits

open access: yes, 2014
We consider a multi-armed bandit problem where the reward distributions are indexed by two sets -one for arms, one for type- and can be partitioned into a small number of clusters according to the type. First, we consider the setting where all reward distributions are known and all types have the same underlying cluster, the type's identity is, however,
Maillard, Odalric-Ambrym, Mannor, Shie
openaire   +2 more sources

Sparse Stochastic Bandits

open access: yesCoRR, 2017
In the classical multi-armed bandit problem, d arms are available to the decision maker who pulls them sequentially in order to maximize his cumulative reward. Guarantees can be obtained on a relative quantity called regret, which scales linearly with d (or with sqrt(d) in the minimax sense).
Kwon, Joon   +2 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy