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 条
  • [21] A tabu search algorithm to solve a green logistics bi-objective bi-level problem
    Camacho-Vallejo, Jose-Fernando
    Lopez-Vera, Lilian
    Smith, Alice E.
    Gonzalez-Velarde, Jose-Luis
    ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) : 927 - 953
  • [22] A Bi-Search Evolutionary Algorithm for High-Dimensional Bi-Objective Feature Selection
    Xu, Hang
    Xue, Bing
    Zhang, Mengjie
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024, 8 (05): : 3489 - 3502
  • [23] A tabu search algorithm to solve a green logistics bi-objective bi-level problem
    José-Fernando Camacho-Vallejo
    Lilian López-Vera
    Alice E. Smith
    José-Luis González-Velarde
    Annals of Operations Research, 2022, 316 : 927 - 953
  • [24] One Rank Cuckoo Search Algorithm for Bi-Objective Load Dispatch Problem
    Cuong Dinh Tran
    Thang Trung Nguyen
    Hanh Minh Hoang
    Bao Quoc Nguyen
    INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2016, 9 (04): : 13 - 26
  • [25] An exact criterion space search algorithm for a bi-objective blood collection problem
    Esmaeili, Somayeh
    Bashiri, Mahdi
    Amiri, Amirhossein
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 311 (01) : 210 - 232
  • [26] APPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
    Gupta, A.
    Kumar, A.
    Sharma, M. Kumar
    IRANIAN JOURNAL OF FUZZY SYSTEMS, 2012, 9 (01): : 1 - 19
  • [27] Simple and efficient bi-objective search algorithms via fast dominance checks
    Hernandez, Carlos
    Yeoh, William
    Baier, Jorge A.
    Zhang, Han
    Suazo, Luis
    Koenig, Sven
    Salzman, Oren
    ARTIFICIAL INTELLIGENCE, 2023, 314
  • [28] Sensitivity-Aware Spatial Quality Adaptation for Live Video Analytics
    Wang, Wufan
    Wang, Bo
    Zhang, Lei
    Huang, Hua
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2022, 40 (08) : 2474 - 2484
  • [29] SANA: Sensitivity-Aware Neural Architecture Adaptation for Uniform Quantization
    Guo, Mingfei
    Dong, Zhen
    Keutzer, Kurt
    APPLIED SCIENCES-BASEL, 2023, 13 (18):
  • [30] Benchmarking the Pure Random Search on the Bi-objective BBOB-2016 Testbed
    Auger, Anne
    Brockhoff, Dimo
    Hansen, Nikolaus
    Tusar, Dejan
    Tusar, Tea
    Wagner, Tobias
    PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION), 2016, : 1217 - 1223