2016
DOI: 10.48550/arxiv.1606.05407
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Pyramid quantile regression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
7
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(8 citation statements)
references
References 21 publications
1
7
0
Order By: Relevance
“…Rodrigues and Fan (2017) proposed a procedure to postprocess crossing quantiles in a Bayesian framework, however its performance is still influenced by the initial estimates. Recently, several authors have argued that simultaneous estimation offers better estimates, better global efficiency for the estimators have been observed empirically in several studies (Reich and Smith 2013, Yang and Tokdar 2017, Fang et al 2015, Rodrigues et al 2016. Indeed simultaneous quantile fitting is a challenging problem that has gained a lot of attention in recent times.…”
Section: Introductionmentioning
confidence: 95%
See 4 more Smart Citations
“…Rodrigues and Fan (2017) proposed a procedure to postprocess crossing quantiles in a Bayesian framework, however its performance is still influenced by the initial estimates. Recently, several authors have argued that simultaneous estimation offers better estimates, better global efficiency for the estimators have been observed empirically in several studies (Reich and Smith 2013, Yang and Tokdar 2017, Fang et al 2015, Rodrigues et al 2016. Indeed simultaneous quantile fitting is a challenging problem that has gained a lot of attention in recent times.…”
Section: Introductionmentioning
confidence: 95%
“…This fact reduces the problem of infinite quantile monotonicity constraints to ensuring monotonicity only at the vertices of the convex set. Rodrigues et al (2016) used quantile pyramids at selected vertices of the convex hull of the predictor cloud, non-crossing conditions being checked at the remaining vertices. However, in practice, convex hulls of datapoints in dimensions higher than 9 or 10 can be difficult to obtain, and when an algorithm is successful at doing so it may return a large number of vertices.…”
Section: Convex Set Verticesmentioning
confidence: 99%
See 3 more Smart Citations