Subdata selection algorithm for linear model discrimination

DOI10.1007/S00362-022-01299-8zbMath1502.62077OpenAlexW4214812430WikidataQ122966714 ScholiaQ122966714MaRDI QIDQ2110346

Jun Yu, Hai Ying Wang

Publication date: 21 December 2022

Published in: Statistical Papers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00362-022-01299-8

zbMATH Keywords

entropyBayesian information criterionbig data\(D\)-optimal designdiscrimination designmeasurement constraints

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Optimal statistical designs (62K05) Statistical aspects of big data and data science (62R07)

Related Items (5)

Information-based optimal subdata selection for non-linear models ⋮ A model robust subsampling approach for generalised linear models in big data settings ⋮ A note on centering in subsample selection for linear regression ⋮ A review on design inspired subsampling for big data ⋮ Robust optimal subsampling based on weighted asymmetric least squares

Uses Software

• LSRN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• Are more data always better for factor analysis?
• Local case-control sampling: efficient subsampling in imbalanced data sets
• Faster least squares approximation
• Bayesian \(T\)-optimal discriminating designs
• Estimating the dimension of a model
• Objective Bayesian model discrimination in follow-up experimental designs
• Least angle regression. (With discussion)
• Information criteria for selecting possibly misspecified parametric models
• Support points
• Optimal discrimination designs
• Efficient and adaptive linear regression in semi-supervised settings
• Optimal subsampling for softmax regression
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
• Model selection in validation sampling: An asymptotic likelihood-based LASSO approach
• On a Measure of the Information Provided by an Experiment
• Model Selection and Model Averaging
• Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation
• The design of experiments for discriminating between two rival models
• Asymptotic Statistics
• Follow-Up Designs to Resolve Confounding in Multifactor Experiments
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Maximum Entropy Sampling and Optimal Bayesian Experimental Design
• Optimal Subsampling for Large Sample Logistic Regression
• Optimal Sampling for Generalized Linear Models Under Measurement Constraints
• LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
• A Scalable Bootstrap for Massive Data
• More efficient approximation of smoothing splines via space-filling basis selection
• Model Selection confidence sets by likelihood ratio testing
• Information-Based Optimal Subdata Selection for Big Data Linear Regression
• Optimal Design of Experiments
• An Optimal Experimental Design Criterion for Discriminating Between Non-Normal Models
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Methods and Criteria for Model Selection
• Combining Linear Regression Models
• On Information and Sufficiency
• A new look at the statistical model identification

This page was built for publication: Subdata selection algorithm for linear model discrimination