Theory Ties Binary Experiment Dominance to Two Information Measures
Preprint: An arXiv paper examines how binary experiments can be compared when observations stop as evidence arrives.
1641–1660
Preprint: An arXiv paper examines how binary experiments can be compared when observations stop as evidence arrives.
The arXiv study reached 0.97 efficiency at a 3.39 kHz candidate rate on independent validation data, while continuous background replay averaged 6.64 kHz.
Preprint: A Norwegian study reports higher scores for optimized preprocessing in chlorophyll-a and water-clarity models, but finds no universal setup or validation beyond the region.
The preprint reports the best image- and video-generation scores among displayed methods, but benchmark scores averaged only two subjects per dataset.
Preprint: A benchmark of 9,740 AI agent Skills found detectors performed much worse on held-out sources, with one model flagging 62.4% of benign Skills.
A preprint reports sub-millisecond high-order derivative calculations and a simulated 20-trailer parking manoeuvre, with tests limited to computation.
A mathematical note argues that the K − 1 factor shifts between two ways of framing the statistical test rather than disappearing.
Preprint: A study of finite ordered structures finds that branching can block window-based composition, while rooted forests support it under the paper's conditions.
The exact result covers normal connection sets in finite groups with a kernel of size q and a complement of size q−1.
The test-time method updated about 0.03% of a pretrained model and reported stronger early-enrichment scores on two benchmarks, but its evidence is limited to computational tests.
An arXiv preprint reports qualitative agreement with a conventional numerical controller, while leaving run counts and statistical performance unquantified.
Preprint: A Bayesian estimator matched or beat classical methods on eight of 11 synthetic targets and slightly outperformed Good–Turing on a Bible test.
An arXiv preprint uses idealized calculations to follow zero-energy modes as modeled chains grow from two to six quantum dots.
On simulated collisions, a boosted tree and a neural network stayed within 1% of the larger model’s AUC; FPGA timing is still a synthesis estimate.
An arXiv preprint sets out spectral enclosures and resolvent bounds, then illustrates the framework with an operator pencil and two semigroup examples.
Preprint: The approach outperformed comparison methods in synthetic tests and a small multi-site fMRI analysis, but the human-data evidence remains preliminary.
This preprint gives exact formulas for binary-tree covering numbers and a tight length bound for one sequence, while the ordinary covering number for general non-binary trees remains open.
A graph-based method reached the lower bound in every tested Quantum Tanner case, while hardware constraints and noise were not assessed.
A technical review marked as a Preprint says microwave kinetic inductance detectors could bring low noise, spectral detail and larger arrays to four imaging fields, but reports no clinical testing.
The asymptotic result uses fixed graphs, with the counted graph connected and of diameter at most 3; whether both graphs can be connected remains open.