Efficient subsampling for exponential family models
From MaRDI portal
Cites work
- A geometric characterization of c-optimal designs for heteroscedastic regression
- A statistical perspective on algorithmic leveraging
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- D-Optimum Designs for Heteroscedastic Linear Models
- Distances and inference for covariance operators
- General equivalence theory for optimum designs (approximate theory)
- scientific article; zbMATH DE number 3734989 (Why is no real title available?)
- scientific article; zbMATH DE number 1350773 (Why is no real title available?)
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Information-based optimal subdata selection for big data logistic regression
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- More efficient estimation for logistic regression with optimal subsamples
- Non-Euclidean statistics for covariance matrices, with applications to diffusion tensor imaging
- Optimal Design of Experiments
- Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators With Massive Data
- Optimal subsampling for large sample logistic regression
- Optimal subsampling for large-scale quantile regression
- Optimal subsampling for quantile regression in big data
- Optimum experimental designs, with SAS
- Orthogonal subsampling for big data linear regression
- Weak convergence and optimal scaling of random walk Metropolis algorithms
This page was built for publication: Efficient subsampling for exponential family models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7249826)
