Papers › LITE: Efficiently Estimating Gaussian Probability of Maximality

LITE: Efficiently Estimating Gaussian Probability of Maximality

23 Jan 2025arXiv:2501.13535archive 2025-07-28

Nicolas Menet, Jonas Hübotter, Parnian Kassraie, Andreas Krause

We consider the problem of computing the probability of maximality (PoM) of a Gaussian random vector, i.e., the probability for each dimension to be maximal. This is a key challenge in applications ranging from Bayesian optimization to reinforcement learning, where the PoM not only helps with finding an optimal action, but yields a fine-grained analysis of the action domain, crucial in tasks such as drug discovery. Existing techniques are costly, scaling polynomially in computation and memory with the vector size. We introduce LITE, the first approach for estimating Gaussian PoM with almost-linear time and memory complexity. LITE achieves SOTA accuracy on a number of tasks, while being in practice several orders of magnitude faster than the baselines. This also translates to a better performance on downstream tasks such as entropy estimation and optimal control of bandits. Theoretically, we cast LITE as entropy-regularized UCB and connect it to prior PoM estimators.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2501.13535")

Code

Syntology Ran 5 of 5 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 2 ran · violated contract; 3 ran · fixture could not drive it.

By repository: official repository: 5 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

lasgroup/lite officialmentioned in papermentioned on GitHubjax report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

5 samples harvested; 5 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · violated contract
3ran · fixture could not drive it

Licence: 5 of the 5 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from lasgroup/lite. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

flite_pom lasgroup/lite/flite.py official repository ran · fixture could not drive it fingerprinted no licence file found · pointer only · 60d991f2f97fb230 · report
flite_pom_entropy lasgroup/lite/flite.py official repository ran · fixture could not drive it fingerprinted no licence file found · pointer only · 09b995adeda81e15 · report
p_gaussian_geq_kappa lasgroup/lite/code/src/poo_estimators_and_BO.py official repository ran · violated contract fingerprinted no licence file found · pointer only · d6a31863ac811d36 · report
p_vapordist_geq_kappa lasgroup/lite/code/src/poo_estimators_and_BO.py official repository ran · violated contract fingerprinted no licence file found · pointer only · 5b00a0ccd39df70d · report
sum_of_p_gaussian_geq_kappa lasgroup/lite/code/src/poo_estimators_and_BO.py official repository ran · fixture could not drive it fingerprinted no licence file found · pointer only · 3620ab0d621da037 · report

Tasks

Bayesian OptimizationDrug Discovery

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections