Download the PHP package cleatsquad/php-bandit without Composer

PHP Bandit

Beta-Bernoulli Thompson Sampling for multi-armed bandit problems, in dependency-free PHP.

You have several options and no idea which performs best. Testing them evenly wastes traffic on the losers; committing early to the leader may commit to a fluke. Thompson Sampling resolves that trade-off by drawing from each option's posterior belief and picking the winner of that draw — good options get chosen more often, uncertain ones keep getting explored.

Installation

Requires PHP 8.2 or later. No runtime dependencies.

Usage

Pick an option

The result is deliberately stochastic. An arm that looks worse still gets picked occasionally — that is the exploration that stops the bandit from locking onto an early fluke.

Keeping the draws makes a decision explainable after the fact: log $result->samples and you can replay why that arm won, without drawing again. When you only need the key, use the shorthand:

There is no "was this exploration or exploitation?" flag, because Thompson Sampling has no such mode — every pick is one draw per arm. If you want to know whether the winner was the current front-runner, compare it yourself:

Run the loop

Selecting is one fifth of the job. The full cycle is select → execute → observe → update → persist:

Three rules hold that loop together:

• Only the arm that played is updated. The others observed nothing.
• An observation is binary. This is the Bernoulli variant; threshold a continuous reward before feeding it in.
• A late observation is still valid. A conversion that lands a day later is applied when it arrives, to the arm's current state.

If your storage counts trials rather than failures, build the state directly:

Persist it yourself, concurrently

The library is stateless: the policy remembers nothing between calls, ArmState is immutable, and nothing here touches storage. That is deliberate — keys, transactions, serialization and increment semantics belong to your application, not to a bandit.

Which leaves one mistake worth naming. Loading an ArmState, calling withSuccess(), and writing both counts back is a read-modify-write: two concurrent processes write the same value and one observation vanishes. Under concurrency, increment in the store instead:

withSuccess() and withFailure() remain the right API in memory — in a single process, a simulation, or a test.

Two things you do not need to protect against:

• A stale read before deciding. Choosing on state that is a few requests old slows convergence; it does not bias it. select() needs no lock.
• A lost or duplicated observation. At volume the posterior absorbs the noise. If rewards arrive asynchronously and can be replayed, deduplicate by decision id on your side.

Inspect the posterior

Reproducible runs

Design notes

Beta(1,1) prior. Successes and failures are offset by an uninformative prior, so an arm with no data yet behaves as a coin flip rather than dividing by zero.

Gamma draws via Marsaglia & Tsang (2000). Constant-time rejection sampling, valid for shape ≥ 1 — which the Beta(1,1) prior guarantees by construction. Beta samples are then formed as X / (X + Y) from two Gamma draws.

Native randomness. Uses PHP's \Random\Randomizer. Inject your own engine, or use withSeed() for a Mt19937 engine with a fixed seed.

Invalid counts are rejected, not repaired. A negative success or failure count is a caller bug, never data: ArmState and every statistic throw InvalidArmStateException rather than silently produce a wrong posterior. Every exception in this package implements BanditException, so catch (BanditException $e) catches all of them — and each one still extends its natural SPL class.

A result cannot contradict itself. SelectionResult validates its own bookkeeping: the samples are non-empty, the selected arm was drawn, and $sample is the draw that arm got. The winning draw is not required to be the largest one — a policy other than Thompson Sampling may pick against its own samples, and SelectionResult is the shared return type of BanditPolicyInterface.

Statistical validation

A sampler can pass every unit test and still draw from the wrong curve, so the suite checks the distribution itself. Every run below is seeded: the assertions are deterministic, not flaky.

• Goodness of fit. Draws are compared to the exact Beta CDF with a Kolmogorov-Smirnov test at the 99% level, across uninformed, balanced, skewed and highly concentrated posteriors.
• Moments. Empirical mean and variance are matched against posteriorMean() and posteriorVariance(), the variance on a relative tolerance since it spans four orders of magnitude across those posteriors.
• Regret. A full bandit episode of 20,000 rounds is simulated against known conversion rates. Cumulative regret has to grow sublinearly: regret per round keeps falling, and the second half of a run costs less than the first.
• Invariants. Laws that hold for every input — draws inside the open unit interval, trials equal to successes plus failures, a selection only ever reporting arms it was given, a seed always replaying the same decision — are checked on generated cases rather than hand-picked ones.

Performance

Measured with PHPBench on PHP 8.4, one decision per operation:

Cost is linear in the number of arms and flat in the amount of evidence: a posterior backed by ten thousand observations draws as fast as an uninformed one. Run composer bench for the numbers on your own hardware.

When to use it

Good fits: A/B and multivariate testing, traffic allocation, ranking candidate strategies, model or provider selection, any explore-versus-exploit choice with a binary outcome.

Poor fits: rewards that are not success/failure (this is the Bernoulli variant), or a setting where a single decision must be reproducible without a fixed seed.

Stability

1.0.0 freezes the public API. From here on the package follows Semantic Versioning strictly: nothing listed below changes without a major release.

• The signatures of ThompsonSamplingPolicy, ArmState, SelectionResult and BanditPolicyInterface, including their public properties.
• BanditException as the marker every exception here implements, and each exception's SPL parent class.
• Which exception a given invalid input throws.

Three things are explicitly not covered, and may change in a minor release:

• The draws a given seed produces. withSeed() guarantees that two runs of the same version agree, not that two versions agree. Improving the sampler is a bug fix, not a breaking change. Assert on distributions, not on values.
• Exception messages. Catch the class, do not match the text.
• Anything marked private, including how the posterior is drawn from.

Upgrading to 1.0.0

1.0.0 removes selectBestArm(), deprecated since 0.2.0. Replace it with selectArm(); the behaviour is identical.

Two smaller changes, neither of which affects correct code:

• SelectionResult now rejects an inconsistent decision at construction time with InvalidSelectionException. Only code building results by hand — a test double, a custom policy — can hit this, and only when the result was already wrong.
• Uniform draws are taken over 2^53 rather than PHP_INT_MAX, so the top of the interval can no longer round to exactly 1.0. Drawn sequences change for a given seed; distributions do not. Pin the version if you assert on exact seeded values.

Upgrading from 0.1.0

0.2.0 reshapes the public API. The maths are untouched: same algorithm, same draws, same numbers.

selectBestArm() still works in 0.2.0, deprecated. It is gone in 1.0.0: the name promised an argmax, while what it returns is a posterior draw.

Testing

bench and mutation install their own toolchain under tools/ on first use. They are kept out of require-dev on purpose: the package is tested on PHP 8.2 through 8.5, and neither tool has to be installable on all of them for the matrix to run.

License

MIT. See LICENSE.