[其他] 计算视觉Practical Differentially Private Top-k Selection with Pay-what-you-get ... [推广有奖]

0关注
3粉丝

已卖：182份资源

教授

97%

还不是VIP/贵宾

威望: 0 级
论坛币: 61 个
通用积分: 108.4266
学术水平: 11 点
热心指数: 34 点
信用等级: 4 点
经验: 19298 点
帖子: 1253
精华: 0
在线时间: 786 小时
注册时间: 2024-1-22
最后登录: 2026-1-25

楼主

Luce2030 发表于 2025-7-27 11:02:42 |AI写论文

是否 +2 论坛币

k人参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Practical Differentially Private Top-k Selection with
      Pay-what-you-get Composition

               David Durfee1 and Ryan Rogers1
            1
               Data Science Applied Research, LinkedIn

                     Abstract
   We study the problem of top-k selection over a large domain universe subject to
   user-level differential privacy. Typically, the exponential mechanism or report noisy
   max are the algorithms used to solve this problem. However, these algor ...