Multi-armed bandits for adjudicating documents in pooling-based evaluation of information retrieval systems
PulseAugur coverage of Multi-armed bandits for adjudicating documents in pooling-based evaluation of information retrieval systems — every cluster mentioning Multi-armed bandits for adjudicating documents in pooling-based evaluation of information retrieval systems across labs, papers, and developer communities, ranked by signal.
2 day(s) with sentiment data
-
New research explores 1/2-Tsallis-INF algorithm for best-arm identification
This research paper investigates the effectiveness of the 1/2-Tsallis-INF algorithm, a known method for minimizing regret in multi-armed bandit problems, when applied to the task of identifying the best arm. The study a…
-
AI research uses multi-armed bandits to prune neural networks
Researchers have developed a novel method for pruning feature maps in convolutional neural networks (CNNs) to reduce computational costs and storage requirements. This approach utilizes multi-armed bandit algorithms, sp…
-
New research explores advanced multi-armed bandit algorithms · 8 sources tracked
This cluster features several research papers exploring advancements in multi-armed bandit algorithms. Topics include characterizing learnability in adversarial noisy bandits, developing contextual slate bandits with li…
-
New research explores leveraging action similarities in multi-armed bandit problems
A new research paper explores online learning strategies for multi-armed bandit problems where actions have inherent similarities, such as shared traits or hierarchical structures. The study introduces a rooted tree mod…
-
New research explores robust optimization and reinforcement learning techniques · 6 sources tracked
Several new research papers explore advanced techniques in reinforcement learning and optimization, focusing on robustness and generative models. One paper introduces a stationary robust mean-field game framework to add…
-
New research explores bandit algorithms for optimal decision-making with delays and bounded noise · 5 sources tracked
Researchers have published new papers on bandit algorithms, exploring different approaches to optimize decision-making under uncertainty. One paper investigates stochastic linear bandits with delayed feedback, analyzing…
-
Multi-armed bandits optimize structured pruning in deep neural networks
Researchers have developed a novel structured pruning framework for deep neural networks that utilizes multi-armed bandit (MAB) algorithms to remove entire neurons. This method treats each neuron as an 'arm' in a bandit…
-
New Bayesian Framework MINTS Simplifies Sequential Decision-Making
Researchers have introduced MINTS, a new Bayesian framework for sequential decision-making under uncertainty. This minimalist approach places a prior only on the optimum's location, simplifying complex structural constr…
-
New framework unifies sampling and optimization problems
This paper introduces the multi-armed sampling problem, a new framework that mirrors the multi-armed bandit problem but focuses on sampling rather than optimization. Researchers have defined regret measures and establis…