1 code implementation • 6 May 2023 • Cong Fu, Keqiang Yan, Limei Wang, Wing Yee Au, Michael McThrow, Tao Komikado, Koji Maruhashi, Kanji Uchino, Xiaoning Qian, Shuiwang Ji
Proteins are complex biomolecules that perform a variety of crucial functions within living organisms.
1 code implementation • 25 Nov 2022 • Shuyu Dong, Kento Uemura, Akito Fujii, Shuang Chang, Yusuke Koyanagi, Koji Maruhashi, Michèle Sebag
In the context of linear structural equation models (SEMs), this paper focuses on learning causal structures from the inverse covariance matrix.
1 code implementation • 19 Apr 2022 • Meng Liu, Youzhi Luo, Kanji Uchino, Koji Maruhashi, Shuiwang Ji
Second, to preserve the desirable equivariance property, we select a local reference atom according to the designed auxiliary classifiers and then construct a local spherical coordinate system.
no code implementations • 26 Feb 2022 • Youzhi Luo, Michael McThrow, Wing Yee Au, Tao Komikado, Kanji Uchino, Koji Maruhashi, Shuiwang Ji
In this work, we propose GraphAug, a novel automated data augmentation method aiming at computing label-invariant augmentations for graph classification.
no code implementations • 27 Jun 2021 • Xiaotian Lu, Arseny Tolmachev, Tatsuya Yamamoto, Koh Takeuchi, Seiji Okajima, Tomoyoshi Takebayashi, Koji Maruhashi, Hisashi Kashima
In order to compare various saliency-based XAI methods quantitatively, several approaches for automated evaluation schemes have been proposed; however, there is no guarantee that such automated evaluation metrics correctly evaluate explainability, and a high rating by an automated evaluation scheme does not necessarily mean a high explainability for humans.
1 code implementation • 11 Jun 2021 • Luu Huu Phuc, Koh Takeuchi, Seiji Okajima, Arseny Tolmachev, Tomoyoshi Takebayashi, Koji Maruhashi, Hisashi Kashima
Multi-relational graph is a ubiquitous and important data structure, allowing flexible representation of multiple types of interactions and relations between entities.
1 code implementation • ICLR Workshop GTRL 2021 • Arseny Tolmachev, Akira Sakai, Masaru Todoriki, Koji Maruhashi
Most graph neural network architectures work by message-passing node vector embeddings over the adjacency matrix, and it is assumed that they capture graph topology by doing that.
no code implementations • 8 Jul 2020 • Koji Maruhashi, Heewon Park, Rui Yamaguchi, Satoru Miyano
We propose a learning method that searches for a subspace that maximizes the prediction accuracy while retaining as much of the original data information as possible, even if the prediction model in the subspace has strong nonlinearity.