83 citations · 160 across the 26 of their papers we have counts for
6 papers · 1 filter
Retrieving Black-box Optimal Images from External Databases
Ryoma Sato
Suppose we have a black-box function (e.g., deep neural network) that takes an image as input and outputs a value that indicates preference. How can we retrieve optimal images with…
Fixed Support Tree-Sliced Wasserstein Barycenter
Yuki Takezawa, Ryoma Sato, Zornitsa Kozareva +2
The Wasserstein barycenter has been widely studied in various fields, including natural language processing, and computer vision. However, it requires a high computational cost to…
Enumerating Fair Packages for Group Recommendations
Ryoma Sato
Package-to-group recommender systems recommend a set of unified items to a group of people. Different from conventional settings, it is not easy to measure the utility of group rec…
Re-evaluating Word Mover's Distance
Ryoma Sato, Makoto Yamada, Hisashi Kashima
The word mover's distance (WMD) is a fundamental technique for measuring the similarity of two documents. As the crux of WMD, it can take advantage of the underlying geometry of th…
Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data?
Ryoma Sato
Fairness is a crucial property in recommender systems. Although some online services have adopted fairness aware systems recently, many other services have not adopted them yet. In…
Supervised Tree-Wasserstein Distance
Yuki Takezawa, Ryoma Sato, Makoto Yamada
To measure the similarity of documents, the Wasserstein distance is a powerful tool, but it requires a high computational cost. Recently, for fast computation of the Wasserstein di…