22 citations · 22 across the 6 of their papers we have counts for
16 papers
Quiver Semistability and Structured Kalman Decompositions for Networked Linear Dynamical Systems
Kazuo Murota, Tasuku Soma
We introduce new notions of controllability and observability for networked linear time-invariant (LTI) systems based on -semistability of quiver representations. Utilizing King…
Numerically stable variants of overrelaxation for operator Sinkhorn iteration
Henrik Eisenmann, Tasuku Soma, Xun Tang +1
We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternati…
-Approximation Algorithms for Bipartiteness Ratio
Tasuku Soma, Mingquan Ye, Yuichi Yoshida
We propose an -approximation algorithm for the bipartiteness ratio of undirected graphs introduced by Trevisan (SIAM Journal on Computing, vol. 41, no. 6, 2012), where $…
Accelerating operator Sinkhorn iteration with overrelaxation
Tasuku Soma, André Uschmajew
We propose accelerated versions of the operator Sinkhorn iteration for operator scaling using successive overrelaxation. We analyze the local convergence rates of these accelerated…
Algorithmic aspects of semistability of quiver representations
Yuni Iwamasa, Taihei Oki, Tasuku Soma
We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistab…
Online Algorithms for Spectral Hypergraph Sparsification
Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida
We provide the first online algorithm for spectral hypergraph sparsification. In the online setting, hyperedges with positive weights are arriving in a stream, and upon the arrival…