10 citations · 15 across the 6 of their papers we have counts for
3 papers · 1 filter
On the optimal rank-1 approximation of matrices in the Chebyshev norm
Stanislav Morozov, Matvey Smirnov, Nikolai Zamarashkin
The problem of low rank approximation is ubiquitous in science. Traditionally this problem is solved in unitary invariant norms such as Frobenius or spectral norm due to existence…
Variational Bayesian inference for CP tensor completion with side information
Stanislav Budzinskiy, Nikolai Zamarashkin
We propose a message passing algorithm, based on variational Bayesian inference, for low-rank tensor completion with automatic rank determination in the canonical polyadic format w…
On the algorithm of best approximation by low rank matrices in the Chebyshev norm
Stanislav Morozov, Nikolai Zamarashkin, Eugene Tyrtyshnikov
The low-rank matrix approximation problem is ubiquitous in computational mathematics. Traditionally, this problem is solved in spectral or Frobenius norms, where the accuracy of th…