Linear regression with partially mismatched data: local search with theoretical guarantees

DOI10.1007/s10107-022-01863-yOpenAlexW3171982279WikidataQ114228477 ScholiaQ114228477MaRDI QIDQ2689832

Rahul Mazumder, Haoyue Wang

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.02175

zbMATH Keywords

polynomial time algorithmmixed integer programminglinear regressionlocal search methodpermutation learningmismatched data

Mathematics Subject Classification ID

Linear inference, regression (62J99) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear regression with sparsely permuted data
• Linear regression with mismatched data: a provably optimal local search algorithm
• Signal Recovery From Unlabeled Samples
• Signal Amplitude Estimation and Detection From Unlabeled Binary Quantized Samples
• High-Dimensional Statistics
• A Pseudo-Likelihood Approach to Linear Regression With Partially Shuffled Data
• An Algebraic-Geometric Approach for Linear Regression Without Correspondences
• Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
• Unlabeled Sensing With Random Linear Measurements
• Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
• Matchmaking

This page was built for publication: Linear regression with partially mismatched data: local search with theoretical guarantees