Sato, Ryoma

17 publications

TMLR 2025 Influential Bandits: Pulling an Arm May Change the Environment Ryoma Sato, Shinji Ito

TMLR 2025 Necessary and Sufficient Watermark for Large Language Models Yuki Takezawa, Ryoma Sato, Han Bao, Kenta Niwa, Makoto Yamada

TMLR 2025 Solving the Cold Start Problem on One's Own as an End User via Preference Transfer Ryoma Sato

TMLR 2024 Making Translators Privacy-Aware on the User's Side Ryoma Sato

NeurIPS 2024 Parameter-Free Clipped Gradient Descent Meets Polyak Yuki Takezawa, Han Bao, Ryoma Sato, Kenta Niwa, Makoto Yamada

TMLR 2024 Training-Free Graph Neural Networks and the Power of Labels as Features Ryoma Sato

NeurIPS 2023 Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-Time Convergence Yuki Takezawa, Ryoma Sato, Han Bao, Kenta Niwa, Makoto Yamada

ICML 2023 Graph Neural Networks Can Recover the Hidden Features Solely from the Graph Structure Ryoma Sato

TMLR 2023 Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data Yuki Takezawa, Han Bao, Kenta Niwa, Ryoma Sato, Makoto Yamada

AISTATS 2022 Fixed Support Tree-Sliced Wasserstein Barycenter Yuki Takezawa, Ryoma Sato, Zornitsa Kozareva, Sujith Ravi, Makoto Yamada

TMLR 2022 Approximating 1-Wasserstein Distance with Trees Makoto Yamada, Yuki Takezawa, Ryoma Sato, Han Bao, Zornitsa Kozareva, Sujith Ravi

ECML-PKDD 2022 Feature-Robust Optimal Transport for High-Dimensional Data Mathis Petrovich, Chao Liang, Ryoma Sato, Yanbin Liu, Yao-Hung Hubert Tsai, Linchao Zhu, Yi Yang, Ruslan Salakhutdinov, Makoto Yamada

ICML 2022 Re-Evaluating Word Mover’s Distance Ryoma Sato, Makoto Yamada, Hisashi Kashima

ICML 2021 Supervised Tree-Wasserstein Distance Yuki Takezawa, Ryoma Sato, Makoto Yamada

NeurIPS 2020 Fast Unbalanced Optimal Transport on a Tree Ryoma Sato, Makoto Yamada, Hisashi Kashima

NeurIPS 2019 Approximation Ratios of Graph Neural Networks for Combinatorial Problems Ryoma Sato, Makoto Yamada, Hisashi Kashima

ACML 2019 Learning to Sample Hard Instances for Graph Algorithms Ryoma Sato, Makoto Yamada, Hisashi Kashima