Volgen
Swanand R. Kadhe
Swanand R. Kadhe
IBM Research
Geverifieerd e-mailadres voor ibm.com - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Fastsecagg: Scalable secure aggregation for privacy-preserving federated learning
S Kadhe, N Rajaraman, OO Koyluoglu, K Ramchandran
arXiv preprint arXiv:2009.11248, 2020
2112020
Private information retrieval with side information
S Kadhe, B Garcia, A Heidarzadeh, S El Rouayheb, A Sprintson
IEEE Transactions on Information Theory 66 (4), 2032-2043, 2019
1802019
Federated unlearning: How to efficiently erase a client in fl?
A Halimi, S Kadhe, A Rawat, N Baracaldo
arXiv preprint arXiv:2207.05521, 2022
1102022
On the capacity of single-server multi-message private information retrieval with side information
A Heidarzadeh, B Garcia, S Kadhe, S El Rouayheb, A Sprintson
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
742018
Oversketched newton: Fast convex optimization for serverless systems
V Gupta, S Kadhe, T Courtade, MW Mahoney, K Ramchandran
2020 IEEE International Conference on Big Data (Big Data), 288-297, 2020
482020
Single-server multi-message individually-private information retrieval with side information
A Heidarzadeh, S Kadhe, S El Rouayheb, A Sprintson
2019 IEEE International Symposium on Information Theory (ISIT), 1042-1046, 2019
482019
SeF: A secure fountain architecture for slashing storage costs in blockchains
S Kadhe, J Chung, K Ramchandran
arXiv preprint arXiv:1906.12140, 2019
432019
Analyzing the download time of availability codes
S Kadhe, E Soljanin, A Sprintson
2015 IEEE International Symposium on Information Theory (ISIT), 1467-1471, 2015
412015
Codes with unequal locality
S Kadhe, A Sprintson
2016 IEEE International Symposium on Information Theory (ISIT), 435-439, 2016
402016
Gradient coding based on block designs for mitigating adversarial stragglers
S Kadhe, OO Koyluoglu, K Ramchandran
2019 IEEE International Symposium on Information Theory (ISIT), 2813-2817, 2019
352019
Weakly secure regenerating codes for distributed storage
S Kadhe, A Sprintson
2014 International Symposium on Network Coding (NetCod), 1-6, 2014
322014
Synthesis of logical Clifford operators via symplectic geometry
N Rengaswamy, R Calderbank, HD Pfister, S Kadhe
2018 IEEE International Symposium on Information Theory (ISIT), 791-795, 2018
312018
Communication-efficient and byzantine-robust distributed learning with error feedback
A Ghosh, RK Maity, S Kadhe, A Mazumdar, K Ramchandran
IEEE Journal on Selected Areas in Information Theory 2 (3), 942-953, 2021
292021
On the service capacity region of accessing erasure coded content
M Aktaş, SE Anderson, A Johnston, G Joshi, S Kadhe, GL Matthews, ...
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
292017
Communication-efficient and byzantine-robust distributed learning
A Ghosh, RK Maity, S Kadhe, A Mazumdar, K Ramchandran
2020 Information Theory and Applications Workshop (ITA), 1-28, 2020
262020
Reliable, deniable and hidable communication: A quick survey
PH Che, S Kadhe, M Bakshi, C Chan, S Jaggi, A Sprintson
2014 IEEE Information Theory Workshop (ITW 2014), 227-231, 2014
262014
LESS-VFL: Communication-efficient feature selection for vertical federated learning
T Castiglia, Y Zhou, S Wang, S Kadhe, N Baracaldo, S Patterson
International Conference on Machine Learning, 3757-3781, 2023
252023
Service rate region: A new aspect of coded distributed system design
M Aktaş, G Joshi, S Kadhe, F Kazemi, E Soljanin
IEEE Transactions on Information Theory 67 (12), 7940-7963, 2021
252021
Rate optimal binary linear locally repairable codes with small availability
S Kadhe, R Calderbank
2017 IEEE International Symposium on Information Theory (ISIT), 166-170, 2017
252017
Reliable, deniable, and hidable communication over multipath networks
S Kadhe, S Jaggi, M Bakshi, A Sprintson
2014 IEEE International Symposium on Information Theory, 611-615, 2014
252014
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20