Search Results for author:
Found 5 papers, 0 papers with code
Bridging Offline-Online Evaluation with a Time-dependent and Popularity Bias-free Offline Metric for Recommenders
The offline and online evaluation metrics for recommender systems are ambiguous in their true objectives.
Generalization Bounds for Inductive Matrix Completion in Low-noise Settings
We study inductive matrix completion (matrix completion with side information) under an i. i. d.
Fine-grained Generalization Analysis of Inductive Matrix Completion
In this paper, we bridge the gap between the state-of-the-art theoretical results for matrix completion with the nuclear norm and their equivalent in \textit{inductive matrix completion}: (1) In the distribution-free setting, we prove bounds improving the previously best scaling of $O(rd^2)$ to $\widetilde{O}(d^{3/2}\sqrt{r})$, where $d$ is the dimension of the side information and $r$ is the rank.
Orthogonal Inductive Matrix Completion
We propose orthogonal inductive matrix completion (OMIC), an interpretable approach to matrix completion based on a sum of multiple orthonormal side information terms, together with nuclear-norm regularization.
Universal and Distinct Properties of Communication Dynamics: How to Generate Realistic Inter-event Times
We show the potential application of SFP by proposing a framework to generate a synthetic dataset containing realistic communication events of any one of the analyzed means of communications (e. g. phone calls, e-mails, comments on blogs) and an algorithm to detect anomalies.
