57 citations · 59 across the 12 of their papers we have counts for
13 papers
An Axiomatisation of Error Intolerant Estimation
Michael Brand
Point estimation is a fundamental statistical task. Given the wide selection of available point estimators, it is unclear, however, what, if any, would be universally-agreed theore…
A taxonomy of estimator consistency on discrete estimation problems
Michael Brand, Thomas Hendrey
We describe a four-level hierarchy mapping both all discrete estimation problems and all estimators on these problems, such that the hierarchy describes each estimator's consistenc…
Risk-averse estimation, an axiomatic approach to inference, and Wallace-Freeman without MML
Michael Brand
We define a new class of Bayesian point estimators, which we refer to as risk averse. Using this definition, we formulate axioms that provide natural requirements for inference, e.…
In-database connected component analysis
Harald Bögeholz, Michael Brand, Radu-Alexandru Todor
We describe a Big Data-practical, SQL-implementable algorithm for efficiently determining connected components for graph data stored in a Massively Parallel Processing (MPP) relati…
RKL: a general, invariant Bayes solution for Neyman-Scott
Michael Brand
Neyman-Scott is a classic example of an estimation problem with a partially-consistent posterior, for which standard estimation methods tend to produce inconsistent results. Past a…
MML is not consistent for Neyman-Scott
Michael Brand
Strict Minimum Message Length (SMML) is an information-theoretic statistical inference method widely cited (but only with informal arguments) as providing estimations that are cons…
The IMP game: Learnability, approximability and adversarial learning beyond
Michael Brand, David L. Dowe
We introduce a problem set-up we call the Iterated Matching Pennies (IMP) game and show that it is a powerful framework for the study of three problems: adversarial learnability, c…
Arbitrary Sequence RAMs
Michael Brand
It is known that in some cases a Random Access Machine (RAM) benefits from having an additional input that is an arbitrary number, satisfying only the criterion of being sufficient…
On the density of nice Friedmans
Michael Brand
A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatena…
The RAM equivalent of P vs. RP
Michael Brand
One of the fundamental open questions in computational complexity is whether the class of problems solvable by use of stochasticity under the Random Polynomial time (RP) model is l…
Computing with and without arbitrary large numbers
Michael Brand
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, i…
Lower bounds on the Münchhausen problem
Michael Brand
"The Baron's omni-sequence", B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verif…
Compressed Genotyping
Yaniv Erlich, Assaf Gordon, Michael Brand +2
Significant volumes of knowledge have been accumulated in recent years linking subtle genetic variations to a wide variety of medical disorders from Cystic Fibrosis to mental retar…