Two-stage approach to multivariate linear regression with sparsely mismatched data
From MaRDI portal
Publication:5148995
Recommendations
- Linear regression with sparsely permuted data
- Linear regression with mismatched data: a provably optimal local search algorithm
- Linear regression with partially mismatched data: local search with theoretical guarantees
- Isotonic regression with unknown permutations: statistics, computation and adaptation
- Permutation-based multivariate regression analysis: The case for least sum of absolute deviations regression
Cites work
- A file linkage problem of DeGroot and Goel revisited
- A forward/reverse auction algorithm for asymmetric assignment problems
- A tail inequality for quadratic forms of subgaussian random vectors
- An Algebraic-Geometric Approach for Linear Regression Without Correspondences
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Banach-Mazur distances and projections on random subgaussian polytopes
- Estimation of the correlation coefficient from a broken random sample
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3644343 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 6253944 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
- Linear regression with sparsely permuted data
- Matchmaking
- Model Selection and Estimation in Regression with Grouped Variables
- On re-pairing observations in a broken random sample
- One-bit compressed sensing by linear programming
- Optimal rates of statistical seriation
- Oracle inequalities and optimal inference under group sparsity
- Outlier detection using nonconvex penalized regression
- Regression Analysis With Linked Data
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust Lasso With Missing and Grossly Corrupted Observations
- Robust Recovery of Signals From a Structured Union of Subspaces
- Signal Amplitude Estimation and Detection From Unlabeled Binary Quantized Samples
- Signal Recovery From Unlabeled Samples
- Smooth minimization of non-smooth functions
- Spectral norm of products of random and deterministic matrices
- The broken sample problem
- Two-stage approach to multivariate linear regression with sparsely mismatched data
- Uncoupled isotonic regression via minimum Wasserstein deconvolution
- Unlabeled Sensing With Random Linear Measurements
Cited in
(10)- Linear regression with mismatched data: a provably optimal local search algorithm
- A two-stage sequential conditional selection approach to sparse high-dimensional multivariate regression models
- Linear regression with partially mismatched data: local search with theoretical guarantees
- A Pseudo-Likelihood Approach to Linear Regression With Partially Shuffled Data
- Two-stage approach to multivariate linear regression with sparsely mismatched data
- A Two-Stage Approach to Multivariate Linear Regression with Sparsely Mismatched Data
- Regression with linked datasets subject to linkage error
- Categorical linkage-data analysis
- Matrix recovery from permutations
- A field-theoretic view of unlabeled sensing
This page was built for publication: Two-stage approach to multivariate linear regression with sparsely mismatched data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148995)
