# Isotonic regression with unknown permutations: Statistics, computation, and adaptation

@article{Pananjady2022IsotonicRW,
title={Isotonic regression with unknown permutations: Statistics, computation, and adaptation},
author={Ashwin Pananjady and Richard J. Samworth},
journal={ArXiv},
year={2022},
volume={abs/2009.02609}
}
• Published 5 September 2020
• Mathematics
• ArXiv
Motivated by models for multiway comparison data, we consider the problem of estimating a coordinate-wise isotonic function on the domain $[0, 1]^d$ from noisy observations collected on a uniform lattice, but where the design points have been permuted along each dimension. While the univariate and bivariate versions of this problem have received significant attention, our focus is on the multivariate case $d \geq 3$. We study both the minimax risk of estimation (in empirical $L_2$ loss) and the…

## Figures from this paper

Smooth tensor estimation with unknown permutations
• Computer Science, Mathematics
ArXiv
• 2021
This work develops a general family of smooth tensor models up to arbitrary index permutations, which incorporates the popular tensor block models and Lipschitz hypergraphon models as special cases and shows that a constrained least-squares estimator in the block-wise polynomial family achieves the minimax error bound.
Statistics, computation, and adaptation in high dimensions
Statistics, Computation, and Adaptation in High Dimensions: Foundations of a Models-based Approach to Models-Based Adaptation and Model-Based Models for Model-based Adaptation.
Efficient Minimax Optimal Estimators For Multivariate Convex Regression
• Computer Science, Mathematics
ArXiv
• 2022
This work is the first to show the existence of efﬁcient minimax optimal estimators for non-Donsker classes that their corresponding Least Squares Estimators are provably minimax sub-optimal ; a result of independent interest.
Modeling and Correcting Bias in Sequential Evaluation
• Computer Science
ArXiv
• 2022
A natural model for the evaluator’s rating process that captures the lack of calibration inherent to such a task is proposed and guarantees in terms of two canonical ranking metrics are proved, matched with lower bounds demonstrating optimality in a certain sense.
Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms
• Computer Science
• 2022
This work first establishes the fundamental statistical limit for the matrix reordering problem in a decision-theoretic framework and shows that a constrained least square estimator is rate-optimal, and proposes a novel polynomial-time adaptive sorting algorithm.
A heuristic for statistical seriation
• Computer Science
UAI
• 2021
The statistical seriation problem is studied, where the goal is to estimate a matrix whose rows satisfy the same shape constraint after a permutation of the columns, and it is shown that the attained local minimum is the global minimum in certain special cases under the noiseless setting, and preserves desirable properties under the noisy setting.
Uncoupled Isotonic Regression with Discrete Errors
• Mathematics
Advances in Contemporary Statistics and Econometrics
• 2021
In Rigollet and Weed (2019), an estimator was proposed for the uncoupled isotonic regression problem. It was shown that a so-called minimum Wasserstein deconvolution estimator achieves the rate
Optimal detection of the feature matching map in presence of noise and outliers
• Computer Science, Mathematics
ArXiv
• 2021
The main result shows that, in the high-dimensional setting, a detection region of unknown injection may be characterized by the sets of vectors for which the inlier-inlier distance is of order at least d and theInlier-outlier distance are of orderAt least d.
A new computational framework for log-concave density estimation
• Computer Science, Mathematics
• 2021
Enhanced understanding of the structural properties of this optimization problem is provided, which motivates the proposal of new algorithms, based on both randomized and Nesterov smoothing, combined with an appropriate integral discretization of increasing accuracy.
Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit
• Computer Science
• 2020
The convergence of the proposed procedure is established, and it is shown that the method achieves exact clustering under reasonable assumptions, and the complete characterization for the statistical-computational trade-off in high-order clustering based on three different signal-to-noise ratio regimes is given.

## References

SHOWING 1-10 OF 137 REFERENCES
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
• Computer Science
COLT
• 2018
This work introduces several new techniques to give a web of average-case reductions showing strong computational lower bounds based on the planted clique conjecture using natural problems as intermediates, including tight lower bounds for Planted Independent Set, Planted Dense Subgraph, Sparse Spiked Wigner, and Sparse PCA.
Isotonic regression in general dimensions
• Mathematics
The Annals of Statistics
• 2019
We study the least squares regression function estimator over the class of real-valued functions on $[0,1]^d$ that are increasing in each coordinate. For uniformly bounded signals and with a fixed,
Reducibility and Statistical-Computational Gaps from Secret Leakage
• Computer Science
COLT
• 2020
This work gives the first evidence that an expanded set of hardness assumptions, such as for secret leakage planted clique, may be a key first step towards a more complete theory of reductions among statistical problems.
Estimation in Tournaments and Graphs Under Monotonicity Constraints
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2019
A natural estimator is proposed which bypasses the need to search over all possible latent permutations and hence is computationally tractable and derived asymptotic risk bounds for this estimator.
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• Computer Science
IEEE Transactions on Information Theory
• 2017
This paper studies a flexible model for pairwise comparisons, under which the probabilities of outcomes are required only to satisfy a natural form of stochastic transitivity, and proposes and studies algorithms that achieve the minimax rate over interesting sub-classes of the full stochastically transitive class.
Fast, Provable Algorithms for Isotonic Regression in all L_p-norms
• Computer Science, Mathematics
NIPS
• 2015
Improved algorithms for computing the Isotonic Regression for all weighted $\ell_{p}$-norms with rigorous performance guarantees are given.
Assortment Planning: Review of Literature and Industry Practice