Optimality and complexity of classification by random projection
From MaRDI portal
Publication:6375190
arXiv2108.06339MaRDI QIDQ6375190
Evzenie Coupkova, Mireille Boutin
Publication date: 11 August 2021
Computational learning theory (68Q32) Approximation by polynomials (41A10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
This page was built for publication: Optimality and complexity of classification by random projection