Minimax approximation to lognormal sum distributions
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Sums of lognormal random variables occur in many problems in wireless communications because signal shadowing is well modelled by the lognormal distribution. The lognormal sum distribution is not known in closed-form and is difficult to compute numerically. Several approximations to the distribution have been proposed and employed in applications. Some widely used approximations are based on the assumption that a lognormal sum is well approximated by a lognormal random variable. Here, a new paradigm for approximating lognormal sum distributions is presented. A linearizing transform is used with a linear minimax approximation to determine an optimal lognormal approximation to a lognormal sum distribution. The accuracies of the new method are quantitatively compared to the accuracies of some well-known approximations. In some practical cases, the normal lognormal approximation is several orders of magnitude more accurate than previous approximations. Efficient numerical computation of the lognormal characteristic function is considered.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it