Pith. sign in

REVIEW 1 cited by

Sequential knockoffs for continuous and categorical predictors: with application to a large Psoriatic Arthritis clinical trial pool

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.14026 v1 pith:7M57QWNY submitted 2020-10-27 stat.ME stat.AP

classification stat.MEstat.AP
keywords knockoffsclinicaldataselectionarthritiscategoricalcontinuouslarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Knockoffs provide a general framework for controlling the false discovery rate when performing variable selection. Much of the Knockoffs literature focuses on theoretical challenges and we recognize a need for bringing some of the current ideas into practice. In this paper we propose a sequential algorithm for generating knockoffs when underlying data consists of both continuous and categorical (factor) variables. Further, we present a heuristic multiple knockoffs approach that offers a practical assessment of how robust the knockoff selection process is for a given data set. We conduct extensive simulations to validate performance of the proposed methodology. Finally, we demonstrate the utility of the methods on a large clinical data pool of more than $2,000$ patients with psoriatic arthritis evaluated in 4 clinical trials with an IL-17A inhibitor, secukinumab (Cosentyx), where we determine prognostic factors of a well established clinical outcome. The analyses presented in this paper could provide a wide range of applications to commonly encountered data sets in medical practice and other fields where variable selection is of particular interest.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Compute-Optimal Scaling for Value-Based Deep RL

    cs.LG 2025-08 unverdicted novelty 5.0 of 10

    Value-based deep RL shows TD-overfitting: large batches degrade Q-function accuracy for small networks but not large ones, enabling compute-optimal splits between model size and update frequency.

Pith tools