Skip to content
Book Open access

TSMOO: Solving Multi-Objective Experimentation with Constrained Thompson Sampling

Sep 2026 · Proceedings of the 20th ACM Conference on Recommender Systems · 0 citations · 22 references

TL;DR

This work introduces TSMOO (Thompson Sampling with Multi-Objective Optimization), a method that bridges the gap by combining multi-metric optimization with continuous learning in batch traffic allocation and outperforming both single-metric and elimination-based baselines.

Abstract

Traditional online A/B experimentation limits the number of treatments that can be evaluated concurrently. Bandit-based adaptive experimentation algorithms address this by dynamically reallocating traffic across an order of magnitude more treatments. Yet existing methods involve a fundamental trade-off: single-metric Thompson Sampling-based methods are robust to novelty effects but cannot accommodate multiple launch criteria, while elimination-based multi-objective methods support multiple constraints but risk prematurely removing promising treatments. We introduce TSMOO (Thompson Sampling with Multi-Objective Optimization), a method that bridges this gap by combining multi-metric optimization with continuous learning. Grounded in stochastically constrained best-arm identification, TSMOO extends single-metric Thompson Sampling to multi-objective batch traffic allocation by estimating multi-constraint feasibility at each allocation step, while preserving all treatments throughout exploration. It further incorporates uplift modeling that mitigates temporal effects shared across treatments and control and ensures that the Gaussian distribution assumption holds. In simulations replaying historical real-world experimentation patterns, TSMOO achieves 93-94% success rates in multi-winner settings and 63-66% under novelty effects, outperforming both single-metric and elimination-based baselines.

Read PDF

Similar papers

#software testing Preprint Aug 2026

Algorithms for optimizing model-based incomplete block designs

This work proposes a model-based approach that optimizes model parameters, and evaluates first- and best-improvement algorithms, simulated annealing (SA), threshold accepting (TA), and two novel algorithms utilizing directional derivatives (dd) to guide exchanges.

Jonas Bjermo, Frank Miller · 0 citations
Preprint Aug 2026

JANUS: Online Jacobian-Aligned Infill for Black-Box Optimization

JANUS is a plug-and-play infill module that extracts a local Jacobian from the recent evaluation trace, and gives the best mean cost on 1135-dimensional UAV path planning and improves SMS-EMOA/AGE-MOEA2 hosts on 12/38 multi-objective tasks with zero significant regressions.

Hongyuan Yu, Pufan Xu, Jiaojiao Yi et al. · 0 citations

Adaptive Scenario Partitioning for Stochastic Bilevel Linear Programs

The results show that basis-aware refinement and informative initial partitions substantially reduce solution times while keeping objective gaps small relative to the reference model, indicating that adaptive partitioning is a promising computational strategy for large-scale stochastic bilevel optimization.

Carlos Muñoz-Rey, Francisco Jara-Moroni · 0 citations
Preprint Aug 2026

Constrained Hyperparameter Optimization for Streaming Data

This study introduces four strategies to navigate boundary constraints in online optimization algorithms and demonstrates that adopting boundary strategies outperforms the"boundary"strategy.

Bruno Veloso, João Gama · 0 citations
Preprint Aug 2026

Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut

This paper develops a differentiable framework for multi-objective MaxCut by combining an adjacency-based quadratic formulation with linear scalarization, thereby reducing the problem to a preference-conditioned single-objective signed-weight MaxCut problem.

Jing-Hang Huang, Cheng-Han Huang, Alvaro Velasquez et al. · 0 citations
#artificial intelligence Preprint Sep 2026

A Better Spur Should Start From Each Objective

This work proposes Multi-Marginal Preference Optimization (MMPO), a fine-grained framework that intervenes at the data, gradient, and constraint levels rather than relying on coarse-grained global scalarization to address optimization conflicts among multiple objectives in real-world deployment scenarios.

Shang-Wen Mao, Hao Zhang, Guangtao Nie et al. · 1 citation · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.