Kazu Ghalamkari, Mahito Sugiyama
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present an efficient low-rank approximation algorithm for non-negative tensors. The algorithm is derived from our two findings: First, we show that rank-1 approximation for tensors can be viewed as a mean-field approximation by treating each tensor as a probability distribution. Second, we theoretically provide a sufficient condition for distribution parameters to reduce Tucker ranks of tensors; interestingly, this sufficient condition can be achieved by iterative application of the mean-field approximation. Since the mean-field approximation is always given as a closed formula, our findings lead to a fast low-rank approximation algorithm without using a gradient method. We empirically demonstrate that our algorithm is faster than the existing non-negative Tucker rank reduction methods and achieves competitive or better approximation of given tensors.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2103.02898")
get_code_for_paper("2103.02898")
have("2103.02898")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2103.02898.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2103.02898)
Connect an agent — have() is free.