arXiv Machine Learning By Tiago Closs, Leandro Farina

Totally Positive Matrices and the Highest-Order Coefficients of the Characteristic Polynomial

Read the original on arXiv Machine Learning →

arXiv:2607. 18148v1 Announce Type: new Abstract: We investigate the extent to which totally positive matrices can be distinguished through the highest-order coefficients of their characteristic polynomials.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jun 1

Expressivity of congruence-based architectures for DNNs on positive-definite matrices

This work studies neural architectures for classifying symmetric positive-definite matrices, focusing on congruence-like layers, in which the input matrix is multiplied on the left and right by a (possibly rectangular) weight matrix $W$ and its transpose. Such layers lie at the core of the celebrated SPDNet and have also been employed independently for dimensionality reduction on positive-definite data.