scientific article; zbMATH DE number 7164732
From MaRDI portal
Publication:5214224
zbMath1441.62194arXiv1802.02698MaRDI QIDQ5214224
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1802.02698
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asymptotic properties of parametric estimators (62F12) Asymptotic distribution theory in statistics (62E20) Optimal statistical designs (62K05) Generalized linear models (logistic models) (62J12) Statistical aspects of big data and data science (62R07)
Related Items (19)
Robust active learning with binary responses ⋮ Distributed subdata selection for big data via sampling-based approach ⋮ Optimal subsample selection for massive logistic regression with distributed data ⋮ Functional principal subspace sampling for large scale functional data analysis ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Inversion-free subsampling Newton's method for large sample logistic regression ⋮ Optimal subsampling for composite quantile regression model in massive data ⋮ Optimal subsampling for multiplicative regression with massive data ⋮ A model robust subsampling approach for generalised linear models in big data settings ⋮ Subsampling and Jackknifing: A Practically Convenient Solution for Large Data Analysis With Limited Computational Resources ⋮ Communication-efficient distributed estimation of partially linear additive models for large-scale data ⋮ Post-selection Inference of High-dimensional Logistic Regression Under Case–Control Design ⋮ Optimal subsampling for functional quantile regression ⋮ Crawling subsampling for multivariate spatial autoregression model in large-scale networks ⋮ Optimal subsampling for large-scale quantile regression ⋮ Optimal designs for model averaging in non-nested models ⋮ Optimal subsampling for composite quantile regression in big data ⋮ Optimal subsampling for least absolute relative error estimators with massive data ⋮ Subdata selection algorithm for linear model discrimination
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- Aggregated estimating equation estimation
- Local case-control sampling: efficient subsampling in imbalanced data sets
- Bootstrap consistency for general semiparametric \(M\)-estimation
- Faster least squares approximation
- Some results on the convergence of conditional distributions
- Randomized sketches for kernels: fast and optimal nonparametric regression
- Divide-and-conquer information-based optimal subdata selection algorithm
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- Julia: A Fresh Approach to Numerical Computing
- Randomized Algorithms for Matrices and Data
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Low-Rank Approximation and Regression in Input Sparsity Time
- Central Limit Theorems for Interchangeable Processes
- Approximation Theorems of Mathematical Statistics
- Sampling algorithms for l2 regression and applications
- Asymptotic Statistics
- Applied Logistic Regression
- Optimal Subsampling for Large Sample Logistic Regression
- A Scalable Bootstrap for Massive Data
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
This page was built for publication:
