| Random features strengthen graph neural networks R Sato, M Yamada, H Kashima Proceedings of the 2021 SIAM International Conference on Data Mining (SDM …, 2021 | 113 | 2021 |
| A survey on the expressive power of graph neural networks R Sato arXiv preprint arXiv:2003.04078, 2020 | 113 | 2020 |
| Approximation ratios of graph neural networks for combinatorial problems R Sato, M Yamada, H Kashima Advances in Neural Information Processing Systems 32, 2019 | 86 | 2019 |
| Short-term precipitation prediction with skip-connected prednet R Sato, H Kashima, T Yamamoto Artificial Neural Networks and Machine Learning–ICANN 2018: 27th …, 2018 | 22 | 2018 |
| Fast unbalanced optimal transport on a tree R Sato, M Yamada, H Kashima Advances in neural information processing systems 33, 19039-19051, 2020 | 19 | 2020 |
| Fast and robust comparison of probability measures in heterogeneous spaces R Sato, M Cuturi, M Yamada, H Kashima arXiv preprint arXiv:2002.01615, 2020 | 14 | 2020 |
| Re-evaluating word mover’s distance R Sato, M Yamada, H Kashima International Conference on Machine Learning, 19231-19249, 2022 | 9 | 2022 |
| Fixed support tree-sliced Wasserstein barycenter Y Takezawa, R Sato, Z Kozareva, S Ravi, M Yamada arXiv preprint arXiv:2109.03431, 2021 | 8 | 2021 |
| Enumerating fair packages for group recommendations R Sato Proceedings of the Fifteenth ACM International Conference on Web Search and …, 2022 | 7 | 2022 |
| Constant time graph neural networks R Sato, M Yamada, H Kashima ACM Transactions on Knowledge Discovery from Data (TKDD) 16 (5), 1-31, 2022 | 5 | 2022 |
| Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? R Sato Proceedings of the 2022 SIAM International Conference on Data Mining (SDM …, 2022 | 5 | 2022 |
| Supervised tree-wasserstein distance Y Takezawa, R Sato, M Yamada International Conference on Machine Learning, 10086-10095, 2021 | 5 | 2021 |
| Retrieving black-box optimal images from external databases R Sato arXiv preprint arXiv:2112.14921, 2021 | 4 | 2021 |
| Learning to Sample Hard Instances for Graph Algorithms R Sato, M Yamada, H Kashima Asian Conference on Machine Learning, 503--518, 2019 | 4* | 2019 |
| Feature-Robust Optimal Transport for High-Dimensional Data M Petrovich, C Liang, R Sato, Y Liu, YHH Tsai, L Zhu, Y Yang, ... Machine Learning and Knowledge Discovery in Databases: European Conference …, 2023 | 3 | 2023 |
| Clear: A fully user-side image search system R Sato Proceedings of the 31st ACM International Conference on Information …, 2022 | 3 | 2022 |
| Poincare: Recommending publication venues via treatment effect estimation R Sato, M Yamada, H Kashima Journal of Informetrics 16 (2), 101283, 2022 | 3 | 2022 |
| Towards principled user-side recommender systems R Sato Proceedings of the 31st ACM International Conference on Information …, 2022 | 2 | 2022 |
| Approximating 1-Wasserstein Distance with Trees M Yamada, Y Takezawa, R Sato, H Bao, Z Kozareva, S Ravi arXiv preprint arXiv:2206.12116, 2022 | 1 | 2022 |
| Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem R Sato arXiv preprint arXiv:2205.01954, 2022 | 1 | 2022 |
Makoto YamadaOkinawa Institute of Science and Technology / Kyoto University / RIKEN Center for AdvancedVerified email at oist.jp
