.png){kind=icon}
.png){kind=icon}
Return
Model selection over partially ordered sets
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.2314228121.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In problems such as variable selection and graph estimation, models are characterized by Boolean logical structure such as the presence or absence of a variable or an edge. Consequently, false -positive error or false -negative error can be specified as the number of variables/edges that are incorrectly included or excluded in an estimated model. However, there are several other problems such as ranking, clustering, and causal inference in which the associated model classes do not admit transparent notions of false -positive and false -negative errors due to the lack of an underlying Boolean logical structure. In this paper, we present a generic approach to endow a collection of models with partial order structure, which leads to a hierarchical organization of model classes as well as natural analogs of false -positive and false -negative errors. We describe model selection procedures that provide false -positive error control in our general setting, and we illustrate their utility with numerical experiments.
Keywords:
combinatorics
greedy algorithms
multiple testing
stability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
9.1
Papers:
10.8W
Citations:
73.5W