Search Results for author: Masahiro Sato

Found 7 papers, 0 papers with code

Aspect-Similarity-Aware Historical Influence Modeling for Rating Prediction

no code implementations EcomNLP (COLING) 2020 Ryo Shimura, Shotaro Misawa, Masahiro Sato, Tomoki Taniguchi, Tomoko Ohkuma

Previous laboratory studies have indicated that the ratings recorded by these systems differ from the actual evaluations of the users, owing to the influence of historical ratings in the system.

Online Evaluation Methods for the Causal Effect of Recommendations

no code implementations14 Jul 2021 Masahiro Sato

In contrast to conventional interleaving methods, we measure the outcomes of both items on an interleaved list and items not on the interleaved list, since the causal effect is the difference between outcomes with and without recommendations.

Causality-Aware Neighborhood Methods for Recommender Systems

no code implementations17 Dec 2020 Masahiro Sato, Sho Takemori, Janmajay Singh, Qian Zhang

In this work, we unify traditional neighborhood recommendation methods with the matching estimator, and develop robust ranking methods for the causal effect of recommendations.

Causal Inference Recommendation Systems

Approximation Theory Based Methods for RKHS Bandits

no code implementations23 Oct 2020 Sho Takemori, Masahiro Sato

The RKHS bandit problem (also called kernelized multi-armed bandit problem) is an online optimization problem of non-linear functions with noisy feedback.

An Intuitionistic Set-theoretical Model of Fully Dependent CCω

no code implementations23 Oct 2020 Masahiro Sato, Jacques Garrigue

Werner's set-theoretical model is one of the simplest models of CIC.

Logic in Computer Science Logic

Unbiased Learning for the Causal Effect of Recommendation

no code implementations11 Aug 2020 Masahiro Sato, Sho Takemori, Janmajay Singh, Tomoko Ohkuma

This paper proposes an unbiased learning framework for the causal effect of recommendation.

Recommendation Systems

Submodular Bandit Problem Under Multiple Constraints

no code implementations1 Jun 2020 Sho Takemori, Masahiro Sato, Takashi Sonoda, Janmajay Singh, Tomoko Ohkuma

Thus, motivated by diversified retrieval considering budget constraints, we introduce a submodular bandit problem under the intersection of $l$ knapsacks and a $k$-system constraint.

Recommendation Systems Retrieval

Cannot find the paper you are looking for? You can Submit a new open access paper.