eCommons

 

TOPICS IN MODERN REGRESSION MODELING

dc.contributor.authorZhang, Tao
dc.contributor.chairRuppert, David
dc.contributor.chairKato, Kengo
dc.contributor.committeeMemberWegkamp, Marten H.
dc.contributor.committeeMemberNing, Yang
dc.date.accessioned2022-10-31T16:21:15Z
dc.date.available2022-10-31T16:21:15Z
dc.date.issued2022-08
dc.description228 pages
dc.description.abstractIn the first part of this work, we propose a novel efficient sampling method for measurement-constrained data. Under “measurement constraints,” responses are expensive to measure and initially unavailable on most of records in the dataset, but the covariates are available for the entire dataset. Our goal is to sample a relatively small portion of the dataset where the expensive responses will be measured and the resultant sampling estimator is statistically efficient. Measurement constraints require the sampling probabilities can only depend on a very small set of the responses. A sampling procedure that uses responses at most only on a small pilot sample will be called “response-free.” We propose a response-free sampling procedure (OSUMC) for generalized linear models (GLMs). Using the A-optimality criterion, i.e., the trace of the asymptotic variance, the resultant estimator is statistically efficient within a class of sampling estimators. We establish the unconditional asymptotic distribution of a general class of response-free sampling estimators. This result is novel compared with the existing conditional results obtained by conditioning on both covariates and responses. Under our unconditional framework, the subsamples are no longer independent and new martingale techniques are developed for our asymptotic theory. We further derive the A-optimal response-free sampling distribution. Since this distribution depends on population level quantities, we propose the Optimal Sampling Under Measurement Constraints (OSUMC) algorithm to approximate the theoretical optimal sampling. Finally, we conduct an intensive empirical study to demonstrate the advantages of OSUMC algorithm over existing methods in both statistical and computational perspectives. We find that OSUMC’s performance is comparable to that of sampling algorithms that use complete responses. This shows that, provided an efficient algorithm such as OSUMC is used, there is little or no loss in accuracy due to the unavailability of responses because of measurement constraints. In the second part of this work, we develop uniform inference methods for the conditional mode based on quantile regression. Specifically, we propose to estimate the conditional mode by minimizing the derivative of the estimated conditional quantile function defined by smoothing the linear quantile regression estimator, and develop two bootstrap methods, a novel pivotal bootstrap and the nonparametric bootstrap, for our conditional mode estimator. Building on high-dimensional Gaussian approximation techniques, we establish the validity of simultaneous confidence rectangles constructed from the two bootstrap methods for the conditional mode. We also extend the preceding analysis to the case where the dimension of the covariate vector is increasing with the sample size. Finally, we conduct simulation experiments and a real data analysis using U.S. wage data to demonstrate the finite sample performance of our inference method. The supplemental materials include the wage dataset, R codes and an appendix containing proofs of the main results, additional simulation results, discussion of model misspecification and quantile crossing, and additional details of the numerical implementation. In the third part of this work, we develop a multi-round aggregated one-step estimator and a scalable bootstrap method for distributed sparse least absolute deviation (LAD) regression with high-dimensional covariates. The proposed one-step estimator is based on multi-round distributed quantile regression andlinear regression estimators. We derive convergence rates and sparsity proper- ties of the new multi-round estimators and show that our multi-round one-step estimator requires less restrictive sample complexity than the one-shot aggregation for valid inference. We also develop a novel pivotal bootstrap for simultaneous inference that is scalable to the distributed setting. Building on high-dimensional Gaussian approximation techniques, we establish the validity of simultaneous confidence rectangles constructed from the pivotal boot- strap. Finally, we conduct numerical experiments using the simulated data, which demonstrate encouraging performance of our methods.
dc.identifier.doihttps://doi.org/10.7298/3sbk-9780
dc.identifier.otherZhang_cornellgrad_0058F_13178
dc.identifier.otherhttp://dissertations.umi.com/cornellgrad:13178
dc.identifier.urihttps://hdl.handle.net/1813/112100
dc.language.isoen
dc.rightsAttribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectDistributed inference
dc.subjectHigh-dimensional CLT
dc.subjectMode estimation
dc.subjectOptimal sampling
dc.subjectPivotal bootstrap
dc.subjectQuantile regression
dc.titleTOPICS IN MODERN REGRESSION MODELING
dc.typedissertation or thesis
dcterms.licensehttps://hdl.handle.net/1813/59810.2
thesis.degree.disciplineStatistics
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Statistics

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Zhang_cornellgrad_0058F_13178.pdf
Size:
1.39 MB
Format:
Adobe Portable Document Format