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 条
  • [31] A clustering search metaheuristic for the bi-objective flexible job shop scheduling problem
    Altoe, Wagner A. S.
    Bissoli, Dayan de C.
    Mauri, Geraldo R.
    Amaral, Andre R. S.
    2018 XLIV LATIN AMERICAN COMPUTER CONFERENCE (CLEI 2018), 2018, : 158 - 166
  • [32] New Initialisation Techniques for Multi-objective Local Search Application to the Bi-objective Permutation Flowshop
    Blot, Aymeric
    Lopez-Ibanez, Manuel
    Kessaci, Marie-Eleonore
    Jourdan, Laetitia
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT I, 2018, 11101 : 323 - 334
  • [33] Sensitivity-Aware Bit Allocation for Intermediate Deep Feature Compression
    Hu, Yuzhang
    Xia, Sifeng
    Yang, Wenhan
    Liu, Jiaying
    2020 IEEE INTERNATIONAL CONFERENCE ON VISUAL COMMUNICATIONS AND IMAGE PROCESSING (VCIP), 2020, : 475 - 478
  • [34] A Sensitivity-aware Methodology to Improve Cell Layouts for DFM Guidelines
    Sundareswaran, Savithri
    Maziasz, Robert
    Rozenfeld, Vladimir
    Sotnikov, Mikhail
    Konstantin, Mukhanov
    2011 12TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED), 2011, : 431 - 436
  • [35] Bi-objective Optimization in Role Mining
    Crampton, Jason
    Eiben, Eduard
    Gutin, Gregory
    Karapetyan, Daniel
    Majumdar, Diptapri yo
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2025, 28 (01)
  • [36] Heuristics for the Bi-Objective Diversity Problem
    Colmenar, J. M.
    Marti, R.
    Duarte, A.
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 108 : 193 - 205
  • [37] Classification of ADHD with bi-objective optimization
    Shao, Lizhen
    Xu, Yadong
    Fu, Dongmei
    JOURNAL OF BIOMEDICAL INFORMATICS, 2018, 84 : 164 - 170
  • [38] Representative Solutions for Bi-Objective Optimisation
    Demirovic, Emir
    Schwind, Nicolas
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1436 - 1443
  • [39] A Bi-Objective Approach for Product Recommendations
    Benouaret, Idir
    Amer-Yahia, Sihem
    Kamdem-Kengne, Christiane
    Chagraoui, Jalil
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 2159 - 2168
  • [40] Bi-objective matchings with the triangle inequality
    Gourves, Laurent
    Monnot, Jerome
    Pascual, Fanny
    Vanderpooten, Daniel
    THEORETICAL COMPUTER SCIENCE, 2017, 670 : 1 - 10