Bi-Objective Negative Sampling for Sensitivity-Aware Search

被引:0
|
作者
McKechnie, Jack [1 ]
McDonald, Graham [1 ]
Macdonald, Craig [1 ]
机构
[1] Univ Glasgow, Glasgow, Lanark, Scotland
关键词
Sensitive Information; Sensitivity-Aware Search; Neural IR;
D O I
10.1145/3626772.3657895
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Cross-encoders leverage fine-grained interactions between documents and queries for effective relevance ranking. Such ranking models are typically trained to satisfy the single objective of providing relevant information to the users. However, not all information should be made available. For example, documents containing sensitive information, such as personal or confidential information, should not be returned in the search results. Sensitivity-aware search (SAS) aims to develop retrieval models that can satisfy two objectives, namely: (1) providing the user with relevant search results, while (2) ensuring that no documents that contain sensitive information are included in the ranking. In this work, we propose three novel negative sampling strategies that enable cross-encoders to be trained to satisfy the bi-objective task of SAS. Additionally, we investigate and compare with filtering sensitive documents in ranking pipelines. Our experiments on a collection labelled for sensitivity show that our proposed negative sampling strategies lead to a similar to 37% increase in terms of cost-sensitive nDCG (nCSDCG) for SAS.
引用
收藏
页码:2296 / 2300
页数:5
相关论文
共 50 条
  • [41] Self-Adaptive and Sensitivity-Aware QoS Modeling for the Cloud
    Chen, Tao
    Bahsoon, Rami
    PROCEEDINGS OF THE 8TH INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR ADAPTIVE AND SELF-MANAGING SYSTEMS (SEAMS 2013), 2013, : 43 - 52
  • [42] Metaheuristics for the bi-objective orienteering problem
    Schilde M.
    Doerner K.F.
    Hartl R.F.
    Kiechle G.
    Swarm Intelligence, 2009, 3 (3) : 179 - 201
  • [43] The bi-objective covering tour problem
    Jozefowiez, Nicolas
    Semet, Frederic
    Talbi, El-Ghazali
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (07) : 1929 - 1942
  • [44] Reference Line Guided Pareto Local Search for Bi-objective Traveling Salesman Problem
    Xia, Chao
    Cai, Xinye
    Fan, Zhun
    Sulaman, Muhammad
    2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE) AND IEEE/IFIP INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC), VOL 1, 2017, : 50 - 56
  • [45] Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach
    Zandieh M.
    Abiri M.B.
    Rahmati S.H.A.
    Production Engineering, 2016, 10 (4-5) : 477 - 488
  • [46] Generating High-Score Crosswords Puzzles With Bi-Objective, Stochastic and Systematic Search
    Botea, Adi
    Bulitko, Vadim
    ICGA JOURNAL, 2025,
  • [47] Parallel Pareto Local Search Revisited First experimental results on Bi-objective UBQP
    Shi, Jialong
    Zhang, Qingfu
    Derbel, Bilel
    Liefooghe, Arnaud
    Sun, Jianyong
    GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, : 753 - 760
  • [48] NSGAII With Local Search Based Heavy Perturbation for Bi-Objective Weighted Clique Problem
    Cai, Dunbo
    Gao, Yuhui
    Yin, Minghao
    IEEE ACCESS, 2018, 6 : 51253 - 51261
  • [49] A population-based local search for solving a bi-objective vehicle routing problem
    Pasia, Joseph M.
    Doerner, Karl F.
    Hartl, Richard F.
    Reimann, Marc
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4446 : 166 - +
  • [50] SaDes: An Interactive System for Sensitivity-aware Desensitization towards Tabular Data
    Zhao, Kechun
    Li, Hui
    Gong, Zheng
    Cui, Jiangtao
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 4828 - 4832