We consider the problem of recovering polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random samples. In particular, we show that a Legendre s-sparse polynomial of maximal degree N can be recovered fromm s log(N) random samples that are chosen independently according to the Chebyshev probability measure dν(x) = π−1(1 − x2)−1/2dx. As an effici...

Variace / covariance components of 227118 first lactaiom test-day milk yield records belonged to 31258 Iranian Holstein cows were estimated using nine random regression models. Afterwards, different measures of persistency based on estimation breeding value were evaluated. Three functions were used to adjust fixed lactation curve: Ali and Schaeffer (AS), quadratic (LE3) and cubic (LE4) order of...

We address efficient calculation of influence functions for tracking predictions back to the training data. propose and analyze a new approach speeding up inverse Hessian based on Arnoldi iteration. With this improvement, we achieve, best our knowledge, first successful implementation that scales full-size (language vision) Transformer models with several hundreds millions parameters. evaluate ...