2021
DOI: 10.1214/21-aos2085
|View full text |Cite
|
Sign up to set email alerts
|

Optimal linear discriminators for the discrete choice model in growing dimensions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 35 publications
0
7
0
Order By: Relevance
“…Utilizing a maximal inequality of Giné and Guillou (2001), our close‐to‐nprefix−1$$ {n}^{-1} $$ rate of the classification parameter is faster than most of the rates of the smoothed estimators in the change‐plane model literature that are shown to be at most nprefix−3false/4$$ {n}^{-3/4} $$ (e.g., Li et al, 2021; Seo & Linton, 2007a; Zhang et al, 2021). Furthermore, although Mukherjee et al (2020) derives the same close‐to‐nprefix−1$$ {n}^{-1} $$ rate as we do in their model, our proof is original in that we directly deal with the score function when deriving the convergence rate. Without invoking the general rate theorem for M‐estimator (e.g., theorem 3.4.1 of van der Vaart & Wellner, 1996) as Mukherjee et al (2020) do, our direct approach shortens the proof.…”
Section: Introductionmentioning
confidence: 61%
See 4 more Smart Citations
“…Utilizing a maximal inequality of Giné and Guillou (2001), our close‐to‐nprefix−1$$ {n}^{-1} $$ rate of the classification parameter is faster than most of the rates of the smoothed estimators in the change‐plane model literature that are shown to be at most nprefix−3false/4$$ {n}^{-3/4} $$ (e.g., Li et al, 2021; Seo & Linton, 2007a; Zhang et al, 2021). Furthermore, although Mukherjee et al (2020) derives the same close‐to‐nprefix−1$$ {n}^{-1} $$ rate as we do in their model, our proof is original in that we directly deal with the score function when deriving the convergence rate. Without invoking the general rate theorem for M‐estimator (e.g., theorem 3.4.1 of van der Vaart & Wellner, 1996) as Mukherjee et al (2020) do, our direct approach shortens the proof.…”
Section: Introductionmentioning
confidence: 61%
“…Furthermore, although Mukherjee et al (2020) derives the same close‐to‐nprefix−1$$ {n}^{-1} $$ rate as we do in their model, our proof is original in that we directly deal with the score function when deriving the convergence rate. Without invoking the general rate theorem for M‐estimator (e.g., theorem 3.4.1 of van der Vaart & Wellner, 1996) as Mukherjee et al (2020) do, our direct approach shortens the proof.…”
Section: Introductionmentioning
confidence: 61%
See 3 more Smart Citations