TTPFTS is the first anytime algorithm for Pareto set identification in multi-objective multi-armed bandits, benchmarked on synthetic environments, applied to molecular discovery, equipped with a new uncertainty metric, and supported by an asymptotic correctness proof.
Bayesian Anytime m-top Exploration
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Persistent homology applied to fingerprint ridges produces multi-scale summaries that carry substantial identity information and enable effective verification outperforming pixel geometry baselines.
citing papers explorer
-
Bayesian Anytime Pareto Set Identification for Multi-Objective Multi-Armed Bandits
TTPFTS is the first anytime algorithm for Pareto set identification in multi-objective multi-armed bandits, benchmarked on synthetic environments, applied to molecular discovery, equipped with a new uncertainty metric, and supported by an asymptotic correctness proof.
-
Topological summaries of fingerprint ridge patterns carry identity information
Persistent homology applied to fingerprint ridges produces multi-scale summaries that carry substantial identity information and enable effective verification outperforming pixel geometry baselines.