Closed-form solution for arbitrary LAE regularization weight orders

Determine whether the non-uniformly weighted denoising linear autoencoder objective with diagonal regularization matrix \(\Lambda=\operatorname{diag}(\lambda_1,\ldots,\lambda_k)\) admits a closed-form solution when the weights are in an arbitrary order rather than non-descending order.

Background

The paper discusses a non-uniform weighted 2\ell_2-regularized linear autoencoder objective involving factor matrices W1W_1 and W2W_2, with a diagonal regularization matrix Λ\Lambda. Prior work provides a closed-form solution only when the diagonal entries of Λ\Lambda are ordered non-descendingly. The unresolved issue is whether such a closed-form characterization remains available for arbitrary permutations of the regularization weights. Although the paper later claims to resolve this issue through an automatic-sorting result, the passage in A3 explicitly identifies the arbitrary-order case as unresolved in the cited prior work.

References

It remains unclear if a closed-form exists for an arbitrary weight order.

On the Regularization Landscape for the Linear Recommendation Models  (2609.11876 - Li et al., 10 Sep 2026) in Section 2, subsection “Nuclear-norm based regularizations,” A3. Linear Regression via Denoising Linear Auto-Encoder