- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper studies identification of reduced nested-logit hierarchies under a probability-query oracle with independently adjustable continuous item inputs, unknown affine input scales, and access to the full probability vector. The main theoretical result shows that one baseline plus three generic perturbations recover the full canonical model almost surely, and that four responses are necessary for probability-one full-model recovery for n >= 3, even with adaptive queries. For inexact probability intervals, the paper further develops a candidate-only certificate for strict binary structures and a packed outer-cover method for prediction under structural ambiguity. The experiments mainly audit numerical behavior on synthetic models and public fitted components.
Critical strengths
-
Sharp and nontrivial exact-query characterization. The scale-free contraction is elegant: the same three perturbations can be reused recursively despite unknown input scales and hierarchy depth. The matching lower bound against adaptive queries makes the four-response result substantially stronger than a sufficient-recovery construction alone.
-
Careful treatment of finite precision. Rather than implicitly extending the exact theorem to noisy observations, the paper develops explicit certificates with refusal and reports adverse numerical results. This separation between exact identifiability, conditional certification, and statistical learning is scientifically valuable.
Critical weaknesses
-
The main result relies on a rather strong and specialized information model. Each query exposes a complete probability vector and permits independent continuous perturbations of every item, while model-family membership is assumed. I am therefore uncertain that the sharp four-query boundary has sufficient relevance beyond this oracle-identification setting. This is my main reason for leaning toward rejection.
-
The bridge to realistic finite-information settings remains limited. The certificates assume valid probability enclosures and family membership, the strict-tree certificate can refuse and the packed alternative is worst-case exponential. Moreover, the paper reports weak float32 certification and unsuccessful frequency-based structure recovery even at very large simulated sample sizes. Thus the empirical evidence currently supports the mathematical scope of the method more strongly than practical statistical usefulness.
Questions for authors
-
What concrete application or API setting motivates the assumed oracle—i.e., independently adjustable per-item continuous inputs and reliable full probability vectors, while the underlying hierarchy and parameters remain inaccessible? In such a setting, why is the number of probability queries the relevant bottleneck rather than total computation or probability-estimation cost?
-
Is there a useful separation/conditioning assumption under which the exact four-response result can be converted into a finite-sample recovery or certification guarantee? In particular, should the poor frequency-based results be viewed mainly as a limitation of the current numerical estimator, or as evidence that sample complexity can become arbitrarily poor without additional margin assumptions?