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 条
  • [11] OPTIMAL SAMPLING LAWS FOR BI-OBJECTIVE SIMULATION OPTIMIZATION ON FINITE SETS
    Hunter, Susan R.
    Feldman, Guy
    2015 WINTER SIMULATION CONFERENCE (WSC), 2015, : 3749 - 3757
  • [12] Sensitivity-aware Distance Measurement for Boosting Metric Learning
    Liu, Haoliang
    Yu, Tan
    Li, Ping
    PROCEEDINGS OF THE 2022 SIAM INTERNATIONAL CONFERENCE ON DATA MINING, SDM, 2022, : 576 - 584
  • [13] A Tabu Search Method for a Bi-Objective Urban Waste Collection Problem
    Ruben Gomez, Jose
    Pacheco, Joaquin
    Gonzalo-Orden, Hernan
    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2015, 30 (01) : 36 - 53
  • [14] Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming
    Liefooghe, Arnaud
    Verel, Sebastien
    Paquete, Luis
    Hao, Jin-Kao
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PT I, 2015, 9018 : 171 - 186
  • [15] Bi-objective hybrid flow shop scheduling: a new local search
    Mousavi, S. M.
    Mousakhani, M.
    Zandieh, M.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (5-8): : 933 - 950
  • [16] Solving Bi-Objective Quadratic Assignment Problem with Squirrel Search Algorithm
    Ningtiyas, Sri Wahyuni
    Pratiwi, Asri Bekti
    Damayanti, Auli
    INTERNATIONAL CONFERENCE ON MATHEMATICS, COMPUTATIONAL SCIENCES AND STATISTICS 2020, 2021, 2329
  • [18] Bi-objective hybrid flow shop scheduling: a new local search
    S. M. Mousavi
    M. Mousakhani
    M. Zandieh
    The International Journal of Advanced Manufacturing Technology, 2013, 64 : 933 - 950
  • [19] A discrete squirrel search optimization based algorithm for Bi-objective TSP
    Liu, Zhuoran
    Zhang, Fanhao
    Wang, Xinyuan
    Zhao, Qidong
    Zhang, Changsheng
    Liu, Tianhua
    Zhang, Bin
    WIRELESS NETWORKS, 2021,
  • [20] Bi-objective robust optimisation
    Kuhn, K.
    Raith, A.
    Schmidt, M.
    Schoebel, A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (02) : 418 - 431