Novel Distributed Multimedia Recommendation Systems Using Personalized Information
Bibliographic record
Abstract
In this paper, we propose a novel distributed multimedia recommendation system (DMRS) to address personalized preference by use of the matrix-sketching approach for dimensionality reduction and local information updates. Conventional recommendation systems can hardly address scalability, privacy, and robustness, all of which are very important in practice. To combat the aforementioned challenges, we propose to incorporate local information updates based on local private information at the client side to protect privacy by restricting users’ data from the server and utilize the matrix-sketching scheme to further reduce the dimensionality of the global user-item interaction data so that the personalized (distributed) recommendations can be made by users’ devices in local. To evaluate the system performance, we define a new robustness measure, namely ϵ-robustness, which quantifies the performance consistency of the recommendation system and involves both sketching errors and local rating updates. Furthermore, we introduce a novel randomized matrix-factorization algorithm to achieve the desired robustness while still maintaining the interaction-data fidelity in terms of normalized root-mean-square error (NRMSE). Our experimental results on both simulated and real-world data demonstrate the effectiveness of our proposed novel DMRS in attaining a good balance between the interaction-data fidelity and the system robustness subject to the privacy protection.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".