DeepAI AI Chat
Log In Sign Up

Optimal subsampling algorithm for composite quantile regression with distributed data

by   Xiaohui Yuan, et al.

For massive data stored at multiple machines, we propose a distributed subsampling procedure for the composite quantile regression. By establishing the consistency and asymptotic normality of the composite quantile regression estimator from a general subsampling algorithm, we derive the optimal subsampling probabilities and the optimal allocation sizes under the L-optimality criteria. A two-step algorithm to approximate the optimal subsampling procedure is developed. The proposed methods are illustrated through numerical experiments on simulated and real datasets.


page 1

page 2

page 3

page 4


Optimal Subsampling Algorithms for Big Data Generalized Linear Models

To fast approximate the maximum likelihood estimator with massive data, ...

Composite Estimation for Quantile Regression Kink Models with Longitudinal Data

Kink model is developed to analyze the data where the regression functio...

Distributed Learning of Finite Gaussian Mixtures

Advances in information technology have led to extremely large datasets ...

Optimal subsampling for functional quantile regression

Subsampling is an efficient method to deal with massive data. In this pa...

Optimal subsampling for quantile regression in big data

We investigate optimal subsampling for quantile regression. We derive th...

Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators with Massive Data

Nonuniform subsampling methods are effective to reduce computational bur...

Deep Quantile and Deep Composite Model Regression

A main difficulty in actuarial claim size modeling is that there is no s...