No articles match
Exact Conditional Poisson Regression: Theory and Implementation7 days ago
1. Motivation: why exact conditional inference | 2. The model and notation shared by every algorithm | 2.1 Indices and strata | 2.2 Response, offset, exposure | 2.3 Design: the interest column and the nuisance columns | 2.4 The stratified Poisson log-linear model | 2.5 Notation at a glance, and one deliberate disambiguation | 3. The general principle: exponential families and eliminating nuisance parameters by conditioning | 3.1 The model as a canonical exponential family | 3.2 The conditioning theorem | 3.3 Finite conditional reference sets | 3.4 Coefficient tables and the conditional law of $T$ | 4. Adjustment vs. stratification: when they agree, and when they don't | 4.1 The narrow case where the two are the same model | 4.2 The two conditioning events are the same event | 4.3 The general principle: crossing variables into a stratification means adjusting for their full joint interaction (precisely defined) | 4.4 Worked contrast: why fit23 and fit232 disagree | 4.5 Other conditions the equivalence needs | 4.6 Why the package still treats stratification and adjustment as different mechanisms | 4.7 Choosing between stratification and adjustment in practice: a clinical-trials perspective | 5. The multivariate-shift algorithm (ep_multi_shift()) | 5.1 The Poisson base measure, explicitly | 5.2 SAS-style cap rules for $S_i$ | 5.3 Stratum-level decomposition and the within-stratum dynamic program | 5.4 Combining strata (convolution) | 5.5 Pruning for feasibility (Rule A and Rule B) | 5.6 Filtering and marginalizing to $C(t)$ | 5.7 Algorithmic summary: the exact steps performed | 6. The closed-form algorithm (ep_closed_form()) | 6.1 The special case | 6.2 Deriving the within-stratum conditional distribution (Poisson thinning) | 6.3 The coefficient table as a polynomial in $\theta$ | 6.3.1 The Guess-Thomas (1990) recursive algorithm, and why it is fast | 6.4 Correspondence with the general coefficient table | 6.5 Exact inference specifics: the truncated-table trick | 6.6 Why the search over $\beta$ is done the way it is | 6.7 Algorithmic summary: the exact steps performed | 7. The network algorithm (ep_network()) | 7.1 Where this algorithm sits, and why it exists | 7.2 The network representation of a stratum's reference set | 7.3 Backward induction: longest and shortest paths | 7.3.1 Intuition, in plain terms: what "remaining nuisance length" actually means | 7.4 The closed form used by this package, and why it is exact | 7.5 Forward processing with continuous pruning | 7.6 Combining strata | 7.7 Correctness: why the extra pruning never discards a valid state | 8. The shared exact-inference machinery | 8.1 Log-scale arithmetic and log-sum-exp | 8.2 The conditional maximum likelihood estimate (CMLE) | 8.3 Root-finding scaffold | 8.4 P-values and confidence intervals | 9. Numerical implementation notes | 10. Comparing the three algorithms, and choosing among them | 10.1 Why the closed-form algorithm is faster, precisely, in the case it covers | 10.2 A worked example where the algorithms genuinely disagree | 10.3 Multivariate-shift versus network, precisely | 10.4 Practical guidance | 11. References
A Low-Incidence Vaccine Efficacy Example8 days ago
Why this vignette exists | The scenario | Simulating the trial | Recommended: aggregate repeated covariate patterns before fitting | Analysing it the exact way | Analysing the same model with glm() | Side by side | Cross-checking with the general algorithms | Reusing an already-computed exact distribution | A different null hypothesis: is efficacy above 50%, not just above 0%? | A different confidence level: 90% instead of 95% | A Monte Carlo check: does the nominal coverage actually hold? | A more general model: adjusting for a covariate on top of stratification | References
What does the {covr2gh} GitHub action do?9 months ago
Summary | Details