thompson-sampling

Tag

Cards List
#thompson-sampling

Odds-Ratio Thompson Sampling: A Specification and Design Guide for Contrast-Based Multi-Armed Bandits

arXiv cs.LG ↗ · 2026-09-18 Cached

The paper introduces Odds-Ratio Thompson Sampling (OR-TS), a method for batched multi-armed bandits that uses contrast-based updates to handle varying common levels, showing improved regret over absolute-rate memory in simulations and real experiments.

0 favorites 0 likes
#thompson-sampling

Thompson Sampling for Non-Monotone Convex Ridge Bandits: Monotonicity Is Not Needed for Polynomial Regret

arXiv cs.LG ↗ · 2026-09-11 Cached

This paper proves that Thompson sampling achieves polynomial regret for non-monotone convex ridge bandits, showing that monotonicity is not necessary, with a new regret bound of Õ(d^{9/2} √n).

0 favorites 0 likes
#thompson-sampling

Online Learning for Cost-Efficient LLM Routing (6 minute read)

TLDR AI ↗ · 2026-07-21

Ramp Router uses EWMA for failure rates and Thompson sampling for latency to select the cheapest LLM model and service tier meeting deadlines, achieving 30% cost savings without performance loss.

0 favorites 0 likes
#thompson-sampling

Information-Directed Sampling for Causal Bandits

arXiv cs.LG ↗ · 2026-07-20 Cached

This paper studies contextual causal bandits with non-manipulable variables, proposing causal variants of Thompson Sampling and Information-Directed Sampling (IDS) that exploit shared causal mechanisms to accelerate decision-making. Theoretical regret bounds and experiments on synthetic tasks show that the proposed methods outperform causal and non-causal baselines.

0 favorites 0 likes
#thompson-sampling

Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem

arXiv cs.LG ↗ · 2026-07-14 Cached

This paper presents a hybrid search framework that combines Thompson sampling with parallel self-avoiding walks to adaptively allocate computational effort across restriction classes for the LABS problem. The method improves previously best-known merit factors for 35 sequence lengths and achieves a new longest sequence with merit factor exceeding 8.0.

0 favorites 0 likes
#thompson-sampling

Randomized Exploration for Linear Bandits via Absolute Perturbations

arXiv cs.LG ↗ · 2026-06-30 Cached

This paper proposes Absolute Thompson Sampling (ATS), a modification of Thompson Sampling that ensures optimism in expectation by using absolute exploration noise, enabling a simpler UCB-style regret analysis while maintaining computational efficiency. It achieves regret matching existing TS bounds, and introduces an ensemble variant that converges to UCB behavior.

0 favorites 0 likes
#thompson-sampling

Structured Neuron Pruning in Deep Neural Networks Using Multi-Armed Bandits

arXiv cs.LG ↗ · 2026-06-09 Cached

This paper proposes a novel structured neuron pruning framework for deep neural networks using multi-armed bandit algorithms, demonstrating effectiveness on various tasks.

0 favorites 0 likes
#thompson-sampling

Mango: Multi-Agent Web Navigation via Global-View Optimization

arXiv cs.CL ↗ · 2026-04-22 Cached

Purdue researchers introduce Mango, a multi-agent web navigation system that uses global site structure and Thompson Sampling to pick optimal starting URLs, boosting success rates on WebVoyager and WebWalkerQA benchmarks.

0 favorites 0 likes
← Back to home

Submit Feedback