2021-06-25T14:26:34Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:002028812020-04-01T00:33:29Z01164:02592:10084:10085
Online Row Sampling from Random StreamsOnline Row Sampling from Random Streamsenghttp://id.nii.ac.jp/1001/00202787/Technical Reporthttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=202881&item_no=1&attribute_id=1&file_no=1Copyright (c) 2020 by the Information Processing Society of JapanThe University of TokyoKeio UniversityMasataka, GohdaNaonori, KakimuraThis paper studies spectral approximation for a positive semidefinite matrix in the online setting. It is known in [Cohen et al. APPROX 2016] that we can construct a spectral approximation of a given n × d matrix in the online setting if an additive error is allowed. In this paper, we propose an online algorithm that avoids an additive error with the same time and space complexities as the algorithm of Cohen et al., and provides a better upper bound on the approximation size when a given matrix has small rank. In addition, we consider the online random order setting where a row of a given matrix arrives uniformly at random. In this setting, we propose time and space efficient algorithms to find a spectral approximation. Moreover, we reveal that a lower bound on the approximation size in the online random order setting is Ω(dε-2 log n), which is larger than the one in the offline setting by an O (log n) factor.This paper studies spectral approximation for a positive semidefinite matrix in the online setting. It is known in [Cohen et al. APPROX 2016] that we can construct a spectral approximation of a given n × d matrix in the online setting if an additive error is allowed. In this paper, we propose an online algorithm that avoids an additive error with the same time and space complexities as the algorithm of Cohen et al., and provides a better upper bound on the approximation size when a given matrix has small rank. In addition, we consider the online random order setting where a row of a given matrix arrives uniformly at random. In this setting, we propose time and space efficient algorithms to find a spectral approximation. Moreover, we reveal that a lower bound on the approximation size in the online random order setting is Ω(dε-2 log n), which is larger than the one in the offline setting by an O (log n) factor.AN1009593X研究報告アルゴリズム（AL）2020-AL-1762182020-01-222188-85662020-01-14