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 条
  • [1] Cascading Ranking Pipelines for Sensitivity-Aware Search
    McKechnie, Jack
    ADVANCES IN INFORMATION RETRIEVAL, ECIR 2024, PT V, 2024, 14612 : 331 - 333
  • [2] BI-OBJECTIVE OPTIMIZATION IN STRATIFIED SAMPLING
    DREXL, A
    JAHRBUCHER FUR NATIONALOKONOMIE UND STATISTIK, 1985, 200 (06): : 622 - 636
  • [3] Distributed localized bi-objective search
    Derbel, Bilel
    Humeauc, Jeremie
    Liefooghe, Arnaud
    Verel, Sebastien
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (03) : 731 - 743
  • [4] Local Search Effects in Bi-Objective Orienteering
    Bossek, Jakob
    Grimme, Christian
    Meisel, Stephan
    Rudolph, Gunter
    Trautmann, Heike
    GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, : 585 - 592
  • [5] On Local Search for Bi-objective Knapsack Problems
    Liefooghe, Arnaud
    Paquete, Luis
    Figueira, Jose Rui
    EVOLUTIONARY COMPUTATION, 2013, 21 (01) : 179 - 196
  • [6] Bi-Objective Routing for Robotic Irrigation and Sampling in Vineyards
    Thayer, Thomas C.
    Vougioukas, Stavros
    Goldberg, Ken
    Carpin, Stefano
    2019 IEEE 15TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2019, : 1481 - 1488
  • [7] An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem
    Bezerra, Leonardo C. T.
    Lopez-Ibanez, Manuel
    Stutzle, Thomas
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION (EVOCOP 2013), 2013, 7832 : 85 - 96
  • [8] Bi-objective Genetic Search for Release Planning in Support of Themes
    Karim, Muhammad Rezaul
    Ruhe, Guenther
    SEARCH-BASED SOFTWARE ENGINEERING, 2014, 8636 : 123 - 137
  • [9] Sensitivity-Aware Density Estimation in Multiple Dimensions
    Boquet-Pujadas, Aleix
    Pla, Pol del Aguila
    Unser, Michael
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2024, 46 (11) : 7120 - 7135
  • [10] Bi-Objective Optimization for Energy Aware leInternet of Things Service Composition
    Alsaryrah, Osama
    Mashal, Ibrahim
    Chung, Tein-Yaw
    IEEE ACCESS, 2018, 6 : 26809 - 26819