Ryoma Sato

Orcid: 0000-0001-6912-4464

According to our database1, Ryoma Sato authored at least 32 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Making Translators Privacy-aware on the User's Side.
Trans. Mach. Learn. Res., 2024

Polyak Meets Parameter-free Clipped Gradient Descent.
CoRR, 2024

Training-free Graph Neural Networks and the Power of Labels as Features.
CoRR, 2024

User-Side Realization.
CoRR, 2024

2023
Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data.
Trans. Mach. Learn. Res., 2023

Embarrassingly Simple Text Watermarks.
CoRR, 2023

Necessary and Sufficient Watermark for Large Language Models.
CoRR, 2023

Active Learning from the Web.
Proceedings of the ACM Web Conference 2023, 2023

Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure.
Proceedings of the International Conference on Machine Learning, 2023

2022
Approximating 1-Wasserstein Distance with Trees.
Trans. Mach. Learn. Res., 2022

Constant Time Graph Neural Networks.
ACM Trans. Knowl. Discov. Data, 2022

Poincare: Recommending Publication Venues via Treatment Effect Estimation.
J. Informetrics, 2022

Retrieving Black-box Optimal Images from External Databases.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Enumerating Fair Packages for Group Recommendations.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data?
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

Feature-Robust Optimal Transport for High-Dimensional Data.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem.
Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2022

Re-evaluating Word Mover's Distance.
Proceedings of the International Conference on Machine Learning, 2022

Twin Papers: A Simple Framework of Causal Inference for Citations via Coupling.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

CLEAR: A Fully User-side Image Search System.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Towards Principled User-side Recommender Systems.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Fixed Support Tree-Sliced Wasserstein Barycenter.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Random Features Strengthen Graph Neural Networks.
Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

Supervised Tree-Wasserstein Distance.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
A Survey on The Expressive Power of Graph Neural Networks.
CoRR, 2020

Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces.
CoRR, 2020

Fast Unbalanced Optimal Transport on a Tree.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Learning to Find Hard Instances of Graph Problems.
CoRR, 2019

Approximation Ratios of Graph Neural Networks for Combinatorial Problems.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Learning to Sample Hard Instances for Graph Algorithms.
Proceedings of The 11th Asian Conference on Machine Learning, 2019

2018
Short-Term Precipitation Prediction with Skip-Connected PredNet.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2018, 2018


  Loading...