all InfoSec news
Rate-Optimal Rank Aggregation with Private Pairwise Rankings
Feb. 27, 2024, 5:11 a.m. | Shirong Xu, Will Wei Sun, Guang Cheng
cs.CR updates on arXiv.org arxiv.org
Abstract: In various real-world scenarios like recommender systems and political surveys, pairwise rankings are commonly collected and utilized for rank aggregation to obtain an overall ranking of items. However, preference rankings can reveal individuals' personal preferences, underscoring the need to protect them before releasing for downstream analysis. In this paper, we address the challenge of preserving privacy while ensuring the utility of rank aggregation based on pairwise rankings generated from the Bradley-Terry-Luce (BTL) model. Using the …
aggregation analysis arxiv can cs.cr cs.lg personal political private protect rate real recommender systems reveal stat.ml surveys systems world
More from arxiv.org / cs.CR updates on arXiv.org
IDEA: Invariant Defense for Graph Adversarial Robustness
1 day, 11 hours ago |
arxiv.org
FairCMS: Cloud Media Sharing with Fair Copyright Protection
1 day, 11 hours ago |
arxiv.org
Efficient unitary designs and pseudorandom unitaries from permutations
1 day, 11 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Principal Security Analyst - Threat Labs (Position located in India) (Remote)
@ KnowBe4, Inc. | Kochi, India
Cyber Security - Cloud Security and Security Architecture - Manager - Multiple Positions - 1500860
@ EY | Dallas, TX, US, 75219
Enterprise Security Architect (Intermediate)
@ Federal Reserve System | Remote - Virginia
Engineering -- Tech Risk -- Global Cyber Defense & Intelligence -- Associate -- Dallas
@ Goldman Sachs | Dallas, Texas, United States
Vulnerability Management Team Lead - North Central region (Remote)
@ GuidePoint Security LLC | Remote in the United States