default search action
Ryoma Sato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Ryoma Sato:
Making Translators Privacy-aware on the User's Side. Trans. Mach. Learn. Res. 2024 (2024) - [i29]Ryoma Sato:
User-Side Realization. CoRR abs/2403.15757 (2024) - [i28]Ryoma Sato:
Training-free Graph Neural Networks and the Power of Labels as Features. CoRR abs/2404.19288 (2024) - [i27]Yuki Takezawa, Han Bao, Ryoma Sato, Kenta Niwa, Makoto Yamada:
Polyak Meets Parameter-free Clipped Gradient Descent. CoRR abs/2405.15010 (2024) - 2023
- [j4]Yuki Takezawa, Han Bao, Kenta Niwa, Ryoma Sato, Makoto Yamada:
Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data. Trans. Mach. Learn. Res. 2023 (2023) - [c19]Ryoma Sato:
Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure. ICML 2023: 30062-30079 - [c18]Yuki Takezawa, Ryoma Sato, Han Bao, Kenta Niwa, Makoto Yamada:
Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence. NeurIPS 2023 - [c17]Ryoma Sato
:
Active Learning from the Web. WWW 2023: 1616-1625 - [i26]Ryoma Sato:
Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure. CoRR abs/2301.10956 (2023) - [i25]Yuki Takezawa, Ryoma Sato, Han Bao, Kenta Niwa, Makoto Yamada:
Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence. CoRR abs/2305.11420 (2023) - [i24]Yuki Takezawa, Ryoma Sato, Han Bao, Kenta Niwa, Makoto Yamada:
Necessary and Sufficient Watermark for Large Language Models. CoRR abs/2310.00833 (2023) - [i23]Ryoma Sato, Yuki Takezawa, Han Bao, Kenta Niwa, Makoto Yamada:
Embarrassingly Simple Text Watermarks. CoRR abs/2310.08920 (2023) - [i22]Ryoma Sato:
Making Translators Privacy-aware on the User's Side. CoRR abs/2312.04068 (2023) - 2022
- [j3]Ryoma Sato
Poincare: Recommending Publication Venues via Treatment Effect Estimation. J. Informetrics 16(2): 101283 (2022) - [j2]Ryoma Sato
Constant Time Graph Neural Networks. ACM Trans. Knowl. Discov. Data 16(5): 92:1-92:31 (2022) - [j1]Makoto Yamada, Yuki Takezawa, Ryoma Sato, Han Bao, Zornitsa Kozareva, Sujith Ravi:
Approximating 1-Wasserstein Distance with Trees. Trans. Mach. Learn. Res. 2022 (2022) - [c16]Yuki Takezawa
Fixed Support Tree-Sliced Wasserstein Barycenter. AISTATS 2022: 1120-1137 - [c15]Ryoma Sato:
Towards Principled User-side Recommender Systems. CIKM 2022: 1757-1766 - [c14]Ryoma Sato, Makoto Yamada
Twin Papers: A Simple Framework of Causal Inference for Citations via Coupling. CIKM 2022: 4444-4448 - [c13]Ryoma Sato:
CLEAR: A Fully User-side Image Search System. CIKM 2022: 4970-4974 - [c12]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Re-evaluating Word Mover's Distance. ICML 2022: 19231-19249 - [c11]Ryoma Sato:
Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem. NAACL-HLT 2022: 2166-2172 - [c10]Mathis Petrovich, Chao Liang, Ryoma Sato, Yanbin Liu, Yao-Hung Hubert Tsai, Linchao Zhu, Yi Yang, Ruslan Salakhutdinov, Makoto Yamada
Feature-Robust Optimal Transport for High-Dimensional Data. ECML/PKDD (5) 2022: 291-307 - [c9]Ryoma Sato:
Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? SDM 2022: 549-557 - [c8]Ryoma Sato:
Enumerating Fair Packages for Group Recommendations. WSDM 2022: 870-878 - [c7]Ryoma Sato:
Retrieving Black-box Optimal Images from External Databases. WSDM 2022: 879-887 - [i21]Ryoma Sato:
Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem. CoRR abs/2205.01954 (2022) - [i20]Ryoma Sato:
CLEAR: A Fully User-side Image Search System. CoRR abs/2206.08521 (2022) - [i19]Makoto Yamada
Approximating 1-Wasserstein Distance with Trees. CoRR abs/2206.12116 (2022) - [i18]Ryoma Sato, Makoto Yamada
Twin Papers: A Simple Framework of Causal Inference for Citations via Coupling. CoRR abs/2208.09862 (2022) - [i17]Ryoma Sato:
Towards Principled User-side Recommender Systems. CoRR abs/2208.09864 (2022) - [i16]Yuki Takezawa, Han Bao, Kenta Niwa, Ryoma Sato, Makoto Yamada
Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data. CoRR abs/2209.15505 (2022) - [i15]Ryoma Sato:
Active Learning from the Web. CoRR abs/2210.08205 (2022) - 2021
- [c6]Yuki Takezawa, Ryoma Sato, Makoto Yamada:
Supervised Tree-Wasserstein Distance. ICML 2021: 10086-10095 - [c5]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Random Features Strengthen Graph Neural Networks. SDM 2021: 333-341 - [i14]Yuki Takezawa, Ryoma Sato, Makoto Yamada:
Supervised Tree-Wasserstein Distance. CoRR abs/2101.11520 (2021) - [i13]Ryoma Sato:
Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? CoRR abs/2105.12353 (2021) - [i12]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Re-evaluating Word Mover's Distance. CoRR abs/2105.14403 (2021) - [i11]Ryoma Sato:
Enumerating Fair Packages for Group Recommendations. CoRR abs/2105.14423 (2021) - [i10]Yuki Takezawa, Ryoma Sato, Zornitsa Kozareva, Sujith Ravi, Makoto Yamada:
Fixed Support Tree-Sliced Wasserstein Barycenter. CoRR abs/2109.03431 (2021) - [i9]Ryoma Sato:
Retrieving Black-box Optimal Images from External Databases. CoRR abs/2112.14921 (2021) - 2020
- [c4]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Fast Unbalanced Optimal Transport on a Tree. NeurIPS 2020 - [i8]Ryoma Sato, Marco Cuturi, Makoto Yamada, Hisashi Kashima:
Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces. CoRR abs/2002.01615 (2020) - [i7]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Random Features Strengthen Graph Neural Networks. CoRR abs/2002.03155 (2020) - [i6]Ryoma Sato:
A Survey on The Expressive Power of Graph Neural Networks. CoRR abs/2003.04078 (2020) - [i5]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Fast Unbalanced Optimal Transport on Tree. CoRR abs/2006.02703 (2020) - [i4]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Poincare: Recommending Publication Venues via Treatment Effect Estimation. CoRR abs/2010.09157 (2020)
2010 – 2019
- 2019
- [c3]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Learning to Sample Hard Instances for Graph Algorithms. ACML 2019: 503-518 - [c2]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Approximation Ratios of Graph Neural Networks for Combinatorial Problems. NeurIPS 2019: 4083-4092 - [i3]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Constant Time Graph Neural Networks. CoRR abs/1901.07868 (2019) - [i2]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Learning to Find Hard Instances of Graph Problems. CoRR abs/1902.09700 (2019) - [i1]Ryoma Sato, Makoto Yamada, Hisashi Kashima:
Approximation Ratios of Graph Neural Networks for Combinatorial Problems. CoRR abs/1905.10261 (2019) - 2018
- [c1]Ryoma Sato, Hisashi Kashima, Takehiro Yamamoto:
Short-Term Precipitation Prediction with Skip-Connected PredNet. ICANN (3) 2018: 373-382
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: