Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Fair recommendation framework for large language models with sensitive attribute absence
Zhenhui GONG, Xiaoyu SHI, Yun LU, Yangcheng LIU, Mingsheng SHANG
Journal of Computer Applications    2026, 46 (9): 2838-2846.   DOI: 10.11772/j.issn.1001-9081.2025080969
Abstract90)   HTML0)    PDF (793KB)(23)       Save

Large Language Models (LLMs) bring enhanced semantic understanding and personalized recommendation capabilities to recommender systems, however, they face significant challenges in user fairness in practical applications. The existing methods for LLM-based fair recommendation often rely on explicit sensitive attributes for constraints or reweighting, making them difficult to apply in scenarios where such attributes are unavailable due to privacy protection or inaccessibility. To address this issue, an FAIR recommendation framework for large language models with Sensitive Attribute Absence (FAIR-SAA) was proposed. In this framework, recommendation fairness was enhanced without accessing sensitive attributes through dynamic prompt optimization and adversarial reweighting. Specifically, in the first stage, a dynamic prompt optimization strategy was adopted to identify high-loss samples during the fine-tuning process, and these samples were utilized as contextual examples to mitigate stereotypical patterns; in the second stage, an adversarial reweighting mechanism was introduced to focus on underperforming regions of the model dynamically, thereby increasing the impact of underrepresented samples on model updates. Experimental results on three public datasets such as MovieLens-1M show that FAIR-SAA reduces the gender group Normalized Discounted Cumulative Gain NDCG@10 and Hit Ratio HR@10 by 74.47% and 61.76%, averagely, with a recommendation accuracy maintained comparable to baseline recommendation accuracy of the BI-step Grounding Paradigm for Recommendation (BIGRec). When BIGRec is used as the base recommendation model, even when compared with Fairness-Aware Conformal Thresholding and Prompt EngineeRing (FACTER) framework, a fair recommendation method with full access to sensitive attributes, FAIR-SAA is competitive with 58.33% fairness metric. It can be seen that FAIR-SAA provides an effective solution to recommendation fairness problem in real-world privacy-preserving scenarios.

Table and Figures | Reference | Related Articles | Metrics
Incremental learning based proactive caching mechanism for RocksDB key-value system
Keyun LUO, Baoliu YE, Bin TANG, Feng MEI, Wenda LU
Journal of Computer Applications    2020, 40 (2): 321-327.   DOI: 10.11772/j.issn.1001-9081.2019091616
Abstract660)   HTML3)    PDF (723KB)(523)       Save

RocksDB key-value storage system based on Log-Structured Merge (LSM) tree has the problem of low read performance caused by the constraints of its hierarchical structure. One effective solution is to cache hot spot data proactively, but it faces two challenges. One is how to predict the hot spot data when the data distribution keeps on changing constantly, the other is how to integrate the proactive caching mechanism with the RocksDB storage structure. To tackle these challenges, a proactive caching framework for RocksDB key-value system with multiple components including data collection, system interaction and system evaluation was built, which can cache the hot spot data at the low levels of the LSM tree. And with the modeling of data access patterns, an incremental learning based prediction analysis method for hot spot data was designed and implemented, which can reduce the number of I/O operations of storage medium. Experimental results show that the proposed mechanism can effectively improve the read performance of RocksDB under different dynamic workloads.

Table and Figures | Reference | Related Articles | Metrics