Tootfinder

Impact and Performance of Randomized Test-Generation using Prolog
Marcus Gelderie, Maximilian Luff, Maximilian Peltzer
https://arxiv.org/abs/2507.13178 htt…

Impact and Performance of Randomized Test-Generation using Prolog
We study randomized generation of sequences of test-inputs to a system using Prolog. Prolog is a natural fit to generate test-sequences that have complex logical inter-dependent structure. To counter the problems posed by a large (or infinite) set of possible tests, randomization is a natural choice. We study the impact that randomization in conjunction with SLD resolution have on the test performance. To this end, this paper proposes two strategies to add randomization to a test-generating pro…

An efficient construction of Raz's two-source randomness extractor with improved parameters
Cameron Foreman, Lewis Wooltorton, Kevin Milner, Florian J. Curchod
https://arxiv.org/abs/2506.15547

An efficient construction of Raz's two-source randomness extractor with improved parameters
Randomness extractors are algorithms that distill weak random sources into near-perfect random numbers. Two-source extractors enable this distillation process by combining two independent weak random sources. Raz's extractor (STOC '05) was the first to achieve this in a setting where one source has linear min-entropy (i.e., proportional to its length), while the other has only logarithmic min-entropy in its length. However, Raz's original construction is impractical due to a polynomial computat…

from my link log —
An epicyclic clock.
https://sophiehoulden.com/randomstuff/epitime/
saved 2023-06-22 https://

Randomised composite linear-combination-of-unitaries: its role in quantum simulation and observable estimation
Jinzhao Sun, Pei Zeng
https://arxiv.org/abs/2506.15658

Randomised composite linear-combination-of-unitaries: its role in quantum simulation and observable estimation
Randomisation is widely used in quantum algorithms to reduce the number of quantum gates and ancillary qubits required. A range of randomised algorithms, including eigenstate property estimation by spectral filters, Hamiltonian simulation, and perturbative quantum simulation, though motivated and designed for different applications, share common features in the use of unitary decomposition and Hadamard-test-based implementation. In this work, we start by analysing the role of randomised linear-…

Revisiting Randomization in Greedy Model Search
Xin Chen, Jason M. Klusowski, Yan Shuo Tan, Chang Yu
https://arxiv.org/abs/2506.15643 https://

Revisiting Randomization in Greedy Model Search
Combining randomized estimators in an ensemble, such as via random forests, has become a fundamental technique in modern data science, but can be computationally expensive. Furthermore, the mechanism by which this improves predictive performance is poorly understood. We address these issues in the context of sparse linear regression by proposing and analyzing an ensemble of greedy forward selection estimators that are randomized by feature subsampling -- at each iteration, the best feature is s…

A file I came across on my iPad. No idea where it came from. #randomThoughts
Thoughts to ponder:
Why isn’t the number 11 pronounced onety-one?
If 4 out of 5 people SUFFER from diarrhea, does that mean that one out of five enjoys it?
Why do croutons come in airtight packages? Aren't they just stale bread to begin with?
If a pig loses its voice, is it disgrunt…

Online Rounding for Set Cover under Subset Arrivals
Jaros{\l}aw Byrka, Yongho Shin
https://arxiv.org/abs/2507.13159 https://arxiv.org…

Online Rounding for Set Cover under Subset Arrivals
A rounding scheme for set cover has served as an important component in design of approximation algorithms for the problem, and there exists an H_s-approximate rounding scheme, where s denotes the maximum subset size, directly implying an approximation algorithm with the same approximation guarantee. A rounding scheme has also been considered under some online models, and in particular, under the element arrival model used as a crucial subroutine in algorithms for online set cover, an O(log s)-…

The Search
Season 4 Episode 1 "Race Against Time: part 1"
#RandomBaywatch #lvdlpx #Baywatch

The VC-dimension of random subsets of finite groups
Brad Rodgers, Anurag Sahay
https://arxiv.org/abs/2506.14219 https://arxiv.org/pdf…

The VC-dimension of random subsets of finite groups
For a random subset of a finite group $G$ of cardinality $N$, we consider the VC-dimension of the family of its translates (equivalently the VC-dimension of a random Cayley graph) and prove a law of large numbers as $N\rightarrow\infty$. This answers a question of McDonald--Sahay--Wyman.

Varanus: Runtime Verification for CSP
Matt Luckcuck, Angelo Ferrando, Fatma Faruq
https://arxiv.org/abs/2506.14426 https://arxiv.org/…

Varanus: Runtime Verification for CSP
Autonomous systems are often used in changeable and unknown environments, where traditional verification may not be suitable. Runtime Verification (RV) checks events performed by a system against a formal specification of its intended behaviour, making it highly suitable for ensuring that an autonomous system is obeying its specification at runtime. Communicating Sequential Processes (CSP) is a process algebra usually used in static verification, which captures behaviour as a trace of events, m…