Statistical and Computational Efficiency for Smooth Tensor Estimation with Unknown Permutations

DOI10.1080/01621459.2024.2419114MaRDI QIDQ6910915zbMATH OpenFDO

Authors Chanwoo Lee, Miaoyan Wang

Publication date 28 October 2025

Published in Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01621459.2024.2419114

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A nonparametric view of network models and Newman–Girvan and other modularities
• Adaptive piecewise polynomial estimation via trend filtering
• Adaptive risk bounds in unimodal regression
• All of Nonparametric Statistics
• Efficient random graph matching via degree profiles
• Estimation of Monge matrices
• Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit
• Hypergraph limits: A regularity approach
• Ideal spatial adaptation by wavelet shrinkage
• Introduction to nonparametric estimation
• Isotonic regression with unknown permutations: statistics, computation and adaptation
• Large networks and graph limits
• Learning from binary multiway data: probabilistic tensor decomposition and its statistical optimality
• Locally adaptive regression splines
• Low permutation-rank matrices: structural properties and noisy completion
• Matrix estimation by universal singular value thresholding
• Minimax and adaptive inference in nonparametric function estimation
• Multilayer tensor factorization with applications to recommender systems
• Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model
• Nonparametric modeling of higher-order interactions via hypergraphons
• Nonparametric, tuning-free estimation of S-shaped functions
• Optimal estimation and completion of matrices with biclustering structures
• Optimal rates of statistical seriation
• Oracle inequalities for network models and sparse graphon estimation
• Rate-optimal graphon estimation
• Sharp oracle inequalities for least squares estimators in shape restricted regression
• Tensor clustering with planted structures: statistical optimality and computational limits
• Tensor Decompositions and Applications
• Tensor SVD: Statistical and Computational Limits
• The graph matching problem
• Three-way clustering of multi-tissue multi-individual gene expression data using semi-nonnegative tensor decomposition

This page was built for publication: Statistical and Computational Efficiency for Smooth Tensor Estimation with Unknown Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6910915)