Search Results for author:
Found 3 papers, 0 papers with code
Efficient Generalized Low-Rank Tensor Contextual Bandits
In this paper, we aim to build a novel bandits algorithm that is capable of fully harnessing the power of multi-dimensional data and the inherent non-linearity of reward functions to provide high-usable and accountable decision-making services.
An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration
Frequent Directions, as a deterministic matrix sketching technique, has been proposed for tackling low-rank approximation problems.
Effective Streaming Low-tubal-rank Tensor Approximation via Frequent Directions
Low-tubal-rank tensor approximation has been proposed to analyze large-scale and multi-dimensional data.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
