18 citations · 45 across the 4 of their papers we have counts for
4 papers
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation
Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe +2
Recomputation algorithms collectively refer to a family of methods that aims to reduce the memory consumption of the backpropagation by selectively discarding the intermediate resu…
Automated Theorem Proving in Intuitionistic Propositional Logic by Deep Reinforcement Learning
Mitsuru Kusumoto, Keisuke Yahata, Masahiro Sakai
The problem-solving in automated theorem proving (ATP) can be interpreted as a search problem where the prover constructs a proof tree step by step. In this paper, we propose a dee…
Efficient SimRank Computation via Linearization
Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for comput…
Testing Forest-Isomorphism in the Adjacency List Model
Mitsuru Kusumoto, Yuichi Yoshida
We consider the problem of testing if two input forests are isomorphic or are far from being so. An algorithm is called an -tester for forest-isomorphism if given an o…