arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.16693econ.EM
收藏

带选择的分位数回归的快速算法

Fast Algorithms for Quantile Regression with Selection

Santiago Pereda-Fernández

AI总结:

本文针对带选择的分位数回归估计计算负担重的问题,提出利用预处理和分位数网格缩减的快速算法,在提升估计精度的同时显著降低计算时间,为基于copula等非凸准则的估计提供实用方案。

摘要:

本文解决了带选择的分位数回归(QRS)估计中的计算难题。对自选择进行建模的参数估计需要多次估计整个分位数过程。此外,渐近方差的闭式表达式过于繁琐,使得自助法在进行推断时更为方便。利用分位数回归估计的最新进展,以及QRS估计问题的一些特定特征,我为QRS估计量提出了精简算法。这些算法通过预处理技术和用于估计copula及斜率参数的分位数网格缩减,显著减少了计算时间。我通过一些模拟展示了优化增强效果。最后,我展示了预处理方法如何在不牺牲计算效率的情况下提高估计的精度。因此,它们为具有不可微和非凸准则函数的估计量(例如基于copula的估计量)提供了一种实用的解决方案。

英文摘要:

This paper addresses computational challenges in estimating Quantile Regression with Selection (QRS). The estimation of the parameters that model self-selection requires the estimation of the entire quantile process several times. Moreover, closed-form expressions of the asymptotic variance are too cumbersome, making the bootstrap more convenient to perform inference. Taking advantage of recent advancements in the estimation of quantile regression, along with some specific characteristics of the QRS estimation problem, I propose streamlined algorithms for the QRS estimator. These algorithms significantly reduce computation time through preprocessing techniques and quantile grid reduction for the estimation of the copula and slope parameters. I show the optimization enhancements with some simulations. Lastly, I show how preprocessing methods can improve the precision of the estimates without sacrificing computational efficiency. Hence, they constitute a practical solutions for estimators with non-differentiable and non-convex criterion functions such as those based on copulas.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑