DeepAI AI Chat
Log In Sign Up

Optimal subsampling algorithm for composite quantile regression with distributed data

01/06/2023
by   Xiaohui Yuan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/18/2018

Optimal Subsampling Algorithms for Big Data Generalized Linear Models

To fast approximate the maximum likelihood estimator with massive data, ...
09/04/2020

Composite Estimation for Quantile Regression Kink Models with Longitudinal Data

Kink model is developed to analyze the data where the regression functio...
10/20/2020

Distributed Learning of Finite Gaussian Mixtures

Advances in information technology have led to extremely large datasets ...
05/05/2022

Optimal subsampling for functional quantile regression

Subsampling is an efficient method to deal with massive data. In this pa...
01/28/2020

Optimal subsampling for quantile regression in big data

We investigate optimal subsampling for quantile regression. We derive th...
05/21/2020

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

Nonuniform subsampling methods are effective to reduce computational bur...
12/06/2021

Deep Quantile and Deep Composite Model Regression

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