{"paper_id":"2308.01208","title":"Adaptive Collaborative Filtering with Personalized Time Decay Functions for Financial Product Recommendation","authors":["Ashraf Ghiye","Baptiste Barreau","Laurent Carlier","Michalis Vazirgiannis"],"paper_date":"2023-08-01","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2308.01208v1","page_url":"https://thequant.space/flowcharts/adaptive-collaborative-filtering-with-personalized-time-deca/","scores":{"empirical_rigor":8,"math_complexity":4.5,"quadrant":"Street Traders"},"proposes":{"status":"available","statement":"The paper proposes a time‑dependent collaborative filtering algorithm with personalized time decay functions (ACF) to adaptively discount past client‑product interactions.","quote":"We propose personalized time decay functions to aggregate the past, assuming that the utility of past interactions decreases monotonically with time.","summary":"Classical recommender systems often assume that historical data are stationary and fail to account for the dynamic nature of user preferences, limiting their ability to provide reliable recommendations in time-sensitive settings. This assumption is particularly problematic in finance, where…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Interest persists for a certain period after interactions and then fades over time.","type":"model","stated":"explicit","quote":"In this work, we assume that interest persists for a certain period after the interactions have occurred, after which the utility of the interactions progressively fades over time."},{"assumption":"The utility of past interactions decreases monotonically with time.","type":"model","stated":"explicit","quote":"We propose personalized time decay functions to aggregate the past, assuming that the utility of past interactions decreases monotonically with time."}]},"datasets":{"status":"available","items":[{"name":"proprietary database of G10 Bonds RFQs","provider":"BNP Paribas","kind":"other","access":"proprietary","period":null,"universe":null,"quote":"We conduct an extensive study on a proprietary database of G10 Bonds RFQs to test the effectiveness of different aggregation functions in encoding the dynamic collaborative signals."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"daily"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"forecast-accuracy","findings":[{"finding":"ACF outperforms all baselines, achieving up to 16.86% gain in s‑mAP and 12.65% gain in s‑MRR compared to HCF.","kind":"performance","quote":"The best model, ACF-LE, shows substantial improvements in both metrics - with gains of up to 16.86% in s-mAP and 12.65% in s-MRR compared to HCF."},{"finding":"Time‑decayed approaches outperform attention mechanisms and recurrent‑based models, despite both being better than a simple average.","kind":"performance","quote":"Our experiments show that time-decayed approaches outperform attention mechanisms with time embeddings, although both perform better than a simple average (HCF)."}],"reported_performance":null,"out_of_sample":{"method":"holdout","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":7,"citations":{"cited_by_in_corpus":2,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":1},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:23:46Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}