Fetching the paper…
Reading the bibliography…
Suppose that we have a regression problem with response variable Y in $\mathbb{R}^d$ and predictor X in $\mathbb{R}^d$, for $d \geq 1$.
1905
Earlier work this paper cites.
1910
Earlier work this paper cites.
H. Kuhn, “The Hungarian Method for the assignment problem,” Naval Research Logistics Quarterly , vol. 2, pp. 83–97, 1955
1955
Earlier work this paper cites.
J. Kiefer and J. Wolfowitz, “Consistency of the maximum likelihood estimator in the presence of infinitely many incidental parameters,” The Annals of Mathematical Statistics , pp. 887–906, 1956
1956
Earlier work this paper cites.
R. Rockafellar, “Characterization of the subdifferentials of convex functions,” Pacific Journal of Mathematics , vol. 17, no. 3, pp. 497–510, 1966
1966
Earlier work this paper cites.
M. DeGroot, P. Feder, and P. Goel, “Matchmaking,” The Annals of Mathematical Statistics , vol. 42, pp. 578–593, 1971
1971
Earlier work this paper cites.
M. DeGroot and P. Goel, “Estimation of the correlation coefficient from a broken random sample,” The Annals of Statistics , vol. 8, pp. 264–278, 1980
1980
Earlier work this paper cites.
B. G. Lindsay, “The geometry of mixture likelihoods: a general theory,” The Annals of Statistics , vol. 11, pp. 86–94, 1983
1983
Earlier work this paper cites.
J. Fan, “On the optimal rates of convergence for nonparametric deconvolution problems,” The Annals of Statistics , pp. 1257–1272, 1991
1991
Earlier work this paper cites.
D. Bertsekas and D. Castanon, “A forward/reverse auction algorihtm for asymmetric assignment problems,” Computational Optimization and Applications , vol. 1, pp. 277–297, 1992
1992
Earlier work this paper cites.
F. Scheuren and W. Winkler, “Regression analysis of data files that are computer matched I,” Survey Methodology , vol. 19, pp. 39–58, 1993
1993
Earlier work this paper cites.
G. Ziegler, Lectures on polytopes , ser. Graduate Texts in Mathematics. Springer, 1995, updated 7th edition of first priting
1995
Earlier work this paper cites.
——, “Regression analysis of data files that are computer matched II,” Survey Methodology , vol. 23, pp. 157–165, 12 1997
1997
Earlier work this paper cites.
L. Sweeney, “Computational disclosure control: A primer on data privacy protection,” Ph.D. dissertation, Massachusetts Institute of Technology, 2001
2001
Earlier work this paper cites.
——, Topics in Optimal Transportation . American Mathematical Society, 2003
2003
Earlier work this paper cites.
R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision , 2nd ed. Cambridge University Press, 2004
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2004
2004
Earlier work this paper cites.
P. Lahiri and M. D. Larsen, “Regression analysis with linked data,” Journal of the American Statistical Association , vol. 100, no. 469, pp. 222–230, 2005
2005
Earlier work this paper cites.
Z. Bai and T. Hsing, “The broken sample problem,” Probability Theory and Related Fields , vol. 131, no. 4, pp. 528–552, 2005
2005
Earlier work this paper cites.
2006
Earlier work this paper cites.
2007
Earlier work this paper cites.
T. Herzog, F. Scheuren, and W. Winkler, Data quality and record linkage techniques . Springer, 2007
2007
Earlier work this paper cites.
A. Narayanan and V. Shmatikov, “Robust de-anonymization of large sparse datasets,” in IEEE Symposium on Security and Privacy , 2008, pp. 111–125
2008
Earlier work this paper cites.
P. Hall and S. N. Lahiri, “Estimation of distributions, moments and quantiles in deconvolution problems,” The Annals of Statistics , vol. 36, no. 5, pp. 2110–2134, 2008
2008
Earlier work this paper cites.
R. Burkard, M. Dell’Amico, and S. Martello, Assignment Problems: Revised Reprint . SIAM, 2009
2009
Cited alongside, same era.
C. Villani, Optimal transport: old and new . Springer, 2009
2009
Cited alongside, same era.
C.-H. Zhang, “Generalized maximum likelihood estimation of normal mixture densities,” Statistica Sinica , pp. 1297–1318, 2009
2009
Cited alongside, same era.
A. Meister, Deconvolution Problems in Nonparametric Statistics . Springer, 2009
2009
Cited alongside, same era.
W. Jiang and C.-H. Zhang, “General maximum likelihood empirical bayes estimation of normal means,” The Annals of Statistics , vol. 37, pp. 1647–1684, 2009
2009
Cited alongside, same era.
A. Pananjady, M. Wainwright, and T. Cortade, “Linear regression with shuffled data: Statistical and computational limits of permutation recovery,” IEEE Transactions on Information Theory , vol. 3826–3300, 2018
2018
Later among the works it cites.
P. Rigollet and J. Weed, “Entropic optimal transport is maximum-likelihood deconvolution,” Comptes Rendus Mathematique , vol. 356, no. 11-12, pp. 1228–1235, 2018
2018
Later among the works it cites.
M. Slawski and E. Ben-David, “Linear Regression with Sparsely Permuted Data,” Electronic Journal of Statistics , vol. 1, pp. 1–36, 2019
2019
Later among the works it cites.
M. Tsakiris and L. Peng, “Homomorphic sensing,” in International Conference on Machine Learning (ICML) , 2019, pp. 6335–6344
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Kakade, S. Shalev-Shwartz, and A. Tewari, “On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization,” 2009, http://ttic.uchicago.edu/shai/papers/KakadeShalevTewari09.pdf
2009
Cited alongside, same era.
I. Liiv, “Seriation and matrix reordering methods: An historical overview,” Statistical Analysis and Data Mining , vol. 3, pp. 70–91, 2010
2010
Cited alongside, same era.
H. Bauschke and P. Combettes, Convex analysis and monotone operator theory in Hilbert spaces . Springer, 2011
2011
Cited alongside, same era.
R. McCann and N. Guillen, Five lectures on optimal transportation: geometry, regularity and applications . American Mathematical Society, 2011, pp. 145 – 180
2011
Cited alongside, same era.
I. Dattner, A. Goldenshluger, and A. Juditsky, “On deconvolution of distribution functions,” The Annals of Statistics , pp. 2477–2501, 2011
2011
Cited alongside, same era.
P. Christen, Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection . Springer, 2012
2012
Cited alongside, same era.
X.-L. Nguyen, “Convergence of latent mixing measures in finite and infinite mixture models,” Annals of Statistics , vol. 41, no. 1, pp. 370–400, 2013
2013
Cited alongside, same era.
2019
Later among the works it cites.
N. Flammarion, C. Mao, and P. Rigollet, “Optimal Rates of Statistical Seriation,” Bernoulli , vol. 25, pp. 623–653, 2019
2019
Later among the works it cites.
P. Rigollet and J. Weed, “Uncoupled isotonic regression via minimum Wasserstein deconvolution,” Information and Inference , vol. 8, pp. 691–717, 2019
2019
Later among the works it cites.
G. Peyré and M. Cuturi, “Computational Optimal Transport: With Applications to Data Science,” Foundations and Trends in Machine Learning , vol. 11, no. 5-6, pp. 355–607, 2019
2019
Later among the works it cites.
M. Cutur, O. Teboul, and J.-P. Vert, “Differentiable ranking and sorting using optimal transport,” in Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Later among the works it cites.
M. Slawski, M. Rahmani, and P. Li, “A Robust Subspace Recovery Approach to Linear Regression with Partially Shuffled Labels,” in Uncertainty in Artificial Intelligence (UAI) , 2019
2019
Later among the works it cites.
M. Tsakiris, L. Peng, A. Conca, L. Kneip, Y. Shi, and H. Choi, “An Algebraic-Geometric Approach to Shuffled Linear Regression,” IEEE Transactions on Information Theory , vol. 66, pp. 5130–5144, 2020
2020
Later among the works it cites.
M. Slawski, E. Ben-David, and P. Li, “A Two-Stage Approach to Multivariate Linear Regression with Sparsely Mismatched Data,” Journal of Machine Learning Research , vol. 21, no. 204, pp. 1–42, 2020
2020
Later among the works it cites.
X. Shi, X. Lu, and T. Cai, “Spherical regresion under mismatch corruption with application to automated knowledge translation,” 2020, to appear in Journal of the American Statistical Association
2020
Later among the works it cites.
R. Ma, T. Cai, and H. Li, “Optimal permutation recovery in permuted monotone matrix model,” Journal of the American Statistical Association , vol. 116, pp. 1358–1372, 2020
2020
Later among the works it cites.
F.-P. Paty, A. d’Aspremont, and M. Cuturi, “Regularity as regularization: Smooth and strongly convex brenier potentials in optimal transport,” in International Conference on Artificial Intelligence and Statistics , 2020, pp. 1222–1232
2020
Later among the works it cites.
H. Zhang and P. Li, “Optimal estimator for unlabeled linear regression,” in Proceedings of the 37th International Conference on Machine Learning , 2020, pp. 11 153–11 162
2020
Later among the works it cites.
S. Saha and A. Guntuboyina, “On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoising,” Annals of Statistics , vol. 48, no. 2, pp. 738–762, 2020
2020
Later among the works it cites.
2021
Later among the works it cites.
R. Ma, T. T. Cai, and H. Li, “Optimal estimation of bacterial growth rates based on a permuted monotone matrix,” Biometrika , vol. 108, no. 3, pp. 693–708, 2021
2021
Later among the works it cites.
J. Meis and E. Mammen, “Uncoupled isotonic regression with discrete errors,” in Advances in Contemporary Statistics and Econometrics . Springer, 2021, pp. 123–135
2021
Later among the works it cites.
J.-C. Hütter and P. Rigollet, “Minimax estimation of smooth optimal transport maps,” The Annals of Statistics , vol. 49, no. 2, pp. 1166–1194, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
L. Peng, B. Wang, and M. Tsakiris, “Homomorphic sensing: Sparsity and noise,” in Proceedings of the 38th International Conference on Machine Learning , 2021, pp. 8464–8475
2021
Later among the works it cites.