Sai Praneeth Karimireddy
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
- Han Shao3×
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Tutorial: Incentives for Collaborative Learning and Data Sharing, Part I | Federated and Collaborative Learning Boot Camp 2026 | 2026-01-26 |
Presents a formal model where K agents choose contribution levels (Mi) and utilities equal local model quality minus linear data cost, proves Nash equilibria… | ||
| Tutorial: Incentives for Collaborative Learning and Data Sharing, Part Ib | Federated and Collaborative Learning Boot Camp 2026 | 2026-01-26 |
Shows that naive collaboration can be K times inefficient: a double-star network has an optimal effort of 2 but any stable outcome costs Theta(K). Uses… | ||
| Tutorial: Incentives for Collaborative Learning and Data Sharing, Part II | Federated and Collaborative Learning Boot Camp 2026 | 2026-01-26 |
Covers practical definitions and limits of data valuation: leave-one-out needs N+1 retrainings and fails on redundancy; Shapley value solves redundancy but… | ||
| nothing matches | ||