Thompson sampling
PulseAugur coverage of Thompson sampling — every cluster mentioning Thompson sampling across labs, papers, and developer communities, ranked by signal.
- used by Multi-armed bandits for adjudicating documents in pooling-based evaluation of information retrieval systems 90%
- used by alphaXiv 70%
- used by CORE Recommender 70%
- instance of ScienceCast 70%
- used by Gotit.pub 70%
- used by CatalyzeX 70%
- instance of CatalyzeX 70%
- authored by alphaXiv 70%
- instance of alphaXiv 70%
- instance of Gotit.pub 70%
- authored by Gotit.pub 60%
- authored by ScienceCast 50%
2 day(s) with sentiment data
-
UC Berkeley researchers develop bandit-based pruning for transformers
Researchers from the University of California, Berkeley have developed a novel method for pruning large transformer models, including those used in vision and language tasks. This technique, framed as a damage-aware mul…
-
New arXiv papers advance multi-armed bandit algorithms and regret minimization
Multiple research papers published on arXiv explore advancements in multi-armed bandit algorithms. One paper addresses optimal switching regret for bandits with an oblivious adversary, proposing a single algorithm that …
-
New Thompson Sampling variant \"alpha-TS\" offers generalized regret analysis
Researchers have developed a generalized regret analysis for Thompson sampling, a popular algorithm for solving stochastic multi-armed bandit problems. This new approach, termed \"alpha-TS,\" utilizes a fractional poste…
-
New Thompson Sampling variant explains variance inflation in bandit problems
Researchers have introduced \"$\alpha$-TS\", a variant of the Thompson Sampling algorithm designed for generalized linear bandit problems. This new approach formalizes the concept of variance inflation, which is necessa…
-
New research improves Gaussian process bandit optimization techniques · 2 sources tracked
Two new research papers on arXiv explore advancements in Gaussian process bandit optimization. The first paper focuses on time-varying environments, proposing a method with a constant exploration parameter to achieve sh…
-
New framework boosts LLM heuristic design with Bayesian MCTS
Researchers have developed Clade-AHD, a novel framework designed to enhance the efficiency of Monte Carlo Tree Search (MCTS) in the context of Automatic Heuristic Design (AHD) for large language models. This new approac…
-
New research explores memory-augmented evolution for code optimization
Two new research papers propose novel approaches to enhance evolutionary algorithms for code optimization and automated algorithm design. EvoMem introduces a persistent memory architecture to capture and reuse successfu…
-
DocMemo framework enhances long-document understanding with dynamic memory
Researchers have introduced DocMemo, a novel memory-guided framework designed to enhance multi-modal document understanding, particularly for long documents. This system addresses limitations in static retrieval and fra…
-
LLMs enhance cold-start recommendation with Bayesian priors · 2 sources tracked
Researchers have developed a method to improve cold-start performance in comment recommendation systems by leveraging large language models (LLMs). The approach uses LLMs to extract semantic signals from comment text, c…
-
Conformal Bandits framework integrates statistical validity with reward efficiency
Researchers have introduced Conformal Bandits, a new framework that integrates Conformal Prediction into bandit problems for sequential decision-making. This approach aims to provide statistical validity and improve rew…
-
New Bayesian Optimization Method Enhances Spectroscopic Data Analysis
Researchers have developed a new method for selecting optimal wavelengths in near-infrared spectroscopy, crucial for improving the accuracy and interpretability of spectral data in tasks like sugar content estimation. T…
-
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 framework classifies Thompson Sampling under model misspecification
This paper introduces a novel stochastic stability framework to analyze Thompson Sampling (TS) algorithms in dynamic decision-making scenarios where the underlying model might be misspecified. The research provides a de…
-
New algorithm PBTS tackles periodically non-stationary bandit problems
Researchers have introduced Periodic Bootstrap Thompson Sampling (PBTS), a novel algorithm designed to address bandit problems with periodic non-stationarity. Unlike traditional Thompson Sampling, which can become biase…
-
New research explores regret minimization and LLM preference optimization
This paper introduces a novel framework for regret minimization in online learning scenarios involving piecewise linear reward functions, applicable to areas like contract design and auctions. The proposed algorithm ach…
-
New Stochastic Reset Pathfinding framework introduced for graph-based learning
Researchers have introduced Stochastic Reset Pathfinding (SRP), a new episodic learning problem designed for scenarios involving unknown edge success probabilities on directed graphs. This framework is applicable to div…
-
New causal bandit methods leverage structural relationships for better decision-making
Researchers have developed new methods for causal bandits, which leverage structural relationships between variables to improve decision-making. The proposed techniques, Information-Directed Sampling (IDS) and causal va…
-
Thompson Sampling Proven 2-Competitive for Mistakes in Bayesian Bandit Models
A new paper published on arXiv details a theoretical advancement in Bayesian bandit models, proving that Thompson sampling is 2-competitive in terms of mistakes. This means Thompson sampling makes at most twice the expe…
-
New framework tackles Low Autocorrelation Binary Sequences Problem
Researchers have developed a novel hybrid search framework to tackle the complex Low Autocorrelation Binary Sequences Problem (LABS). This new method integrates Thompson sampling with parallel self-avoiding walks, allow…
-
New Joint-Thompson Sampling algorithm improves communication link adaptation
Researchers have introduced a new algorithm called Joint-Thompson Sampling (Joint-TS) for link adaptation in communication systems. This algorithm models the problem as a multi-armed bandit, where each modulation and co…