Linear regression with sparsely permuted data
From MaRDI portal
Publication:1711600
DOI10.1214/18-EJS1498zbMath1416.62398arXiv1710.06030OpenAlexW2963518783WikidataQ128685776 ScholiaQ128685776MaRDI QIDQ1711600
Martin Slawski, Emanuel Ben-David
Publication date: 18 January 2019
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.06030
Linear regression; mixed models (62J05) Robustness and adaptive procedures (parametric inference) (62F35) Integer programming (90C10)
Related Items (7)
A Pseudo-Likelihood Approach to Linear Regression With Partially Shuffled Data ⋮ Optimal Permutation Recovery in Permuted Monotone Matrix Model ⋮ Linear regression with partially mismatched data: local search with theoretical guarantees ⋮ Homomorphic sensing of subspace arrangements ⋮ Provable training set debugging for linear regression ⋮ Unnamed Item ⋮ Optimal detection of the feature matching map in presence of noise and outliers
Uses Software
Cites Work
- Best subset selection via a modern optimization lens
- Geometric inference for general high-dimensional linear inverse problems
- Least quantile regression via modern optimization
- A tail inequality for quadratic forms of subgaussian random vectors
- A simple proof of the restricted isometry property for random matrices
- Estimation of the correlation coefficient from a broken random sample
- Optimal rates of statistical seriation
- The broken sample problem
- The convex geometry of linear inverse problems
- Simultaneous analysis of Lasso and Dantzig selector
- Some assignment problems arising from multiple target tracking
- Minimax rates in permutation estimation for feature matching
- The Generalized Lasso With Non-Linear Observations
- Robust Lasso With Missing and Grossly Corrupted Observations
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Outlier Detection Using Nonconvex Penalized Regression
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Scaled sparse linear regression
- Assignment Problems
- Decoding by Linear Programming
- An elementary proof of a theorem of Johnson and Lindenstrauss
- A Bayesian Procedure for File Linking to Analyze End-of-Life Medical Costs
- Regression analysis with linked data: problems and possible solutions
- Algorithm 948
- Random Fields and Geometry
- Corrupted Sensing: Novel Guarantees for Separating Structured Signals
- Unlabeled Sensing With Random Linear Measurements
- Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
- Robust Statistics
- Robust Estimation of a Location Parameter
- Matchmaking
- Regression Analysis With Linked Data
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear regression with sparsely permuted data
