| Publication | Date of Publication | Type |
|---|
A generalisation of Ville's inequality to monotonic lower bounds and thresholds
Statistics & Probability Letters | 2025-12-18 | Paper |
Supermartingales for one-sided tests: sufficient monotone likelihood ratios are sufficient
Statistics & Probability Letters | 2025-12-18 | Paper |
Authors' reply to the discussion of `safe testing'
Journal of the Royal Statistical Society. Series B. Statistical Methodology | 2025-09-25 | Paper |
Safe testing
Journal of the Royal Statistical Society. Series B. Statistical Methodology | 2025-09-25 | Paper |
A composite generalization of Ville's martingale theorem using e-processes
Electronic Journal of Probability | 2024-01-17 | Paper |
scientific article; zbMATH DE number 7626761 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-06 | Paper |
| scientific article; zbMATH DE number 7626761 (Why is no real title available?) | 2022-12-06 | Paper |
Log-optimal anytime-valid E-values
International Journal of Approximate Reasoning | 2022-01-20 | Paper |
Testing exchangeability: fork-convexity, supermartingales and e-processes
International Journal of Approximate Reasoning | 2022-01-20 | Paper |
scientific article; zbMATH DE number 7415104 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-27 | Paper |
| scientific article; zbMATH DE number 7415104 (Why is no real title available?) | 2021-10-27 | Paper |
Testing exchangeability: fork-convexity, supermartingales, and e-processes
(available as arXiv preprint) | 2021-01-31 | Paper |
| Efficient algorithms for minimax decisions under tree-structured incompleteness | 2020-02-20 | Paper |
| Sub-Gaussians in game-theoretic probability | 2019-03-20 | Paper |
Universal Codes From Switching Strategies
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
A closer look at adaptive regret
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Robust probability updating
International Journal of Approximate Reasoning | 2016-05-12 | Paper |
| Follow the leader if you can, hedge if you must | 2014-12-08 | Paper |
Follow the leader if you can, hedge if you must
(available as arXiv preprint) | 2014-12-08 | Paper |
Buy low, sell high
Theoretical Computer Science | 2014-10-31 | Paper |
Combining initial segments of lists
Theoretical Computer Science | 2014-01-13 | Paper |
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Switching investments
Theoretical Computer Science | 2013-03-04 | Paper |
A closer look at adaptive regret
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Buy low, sell high
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Combining initial segments of lists
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Switching investments
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Time-bounded incompressibility of compressible strings and sequences
Information Processing Letters | 2010-08-20 | Paper |
