Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Roie Reshef

dblp:359/6985 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 100%
Artificial intelligence
2 papers
Efficient and distributed learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.622025
Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation · ICML 2025
Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems · ICML 2024
Privacy and data protection › differential privacy › differentially private learning
differentially private federated learning
1.622025
Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation · ICML 2025
Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems · ICML 2024
Privacy and data protection
differential privacy
1.622025
Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation · ICML 2025
Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems · ICML 2024

Methods — techniques the papers use, named apart from their topics

stochastic convex optimization · 3.3differential privacy · 3.3noise cancellation · 1.7
YearPublicationVenuePosition
2025 Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation
abstract
This paper addresses the challenge of achieving Differential Privacy (DP) in Federated Learning (FL) under the partial-participation setting, where each machine participates in only some of training rounds. While earlier work achieved optimal performance and efficiency in full-participation scenarios, these methods could not extend effectively to cases with partial-participation. Our approach addresses this gap by introducing a novel noise-cancellation mechanism that ensures privacy without compromising convergence rates or computational efficiency. We analyze our method within the Stochastic Convex Optimization (SCO) framework and demonstrate that it achieves optimal performance for both homogeneous and heterogeneous data distributions. This work broadens the applicability of DP in FL, providing a practical and efficient solution for privacy-preserving learning in distributed systems with partial participation.
Roie Reshef, Kfir Y. Levy
ICML1
2024 Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems
abstract
This paper addresses the challenge of preserving privacy in Federated Learning (FL) within centralized systems, focusing on both trusted and untrusted server scenarios. We analyze this setting within the Stochastic Convex Optimization (SCO) framework, and devise methods that ensure Differential Privacy (DP) while maintaining optimal convergence rates for homogeneous and heterogeneous data distributions. Our approach, based on a recent stochastic optimization technique, offers linear computational complexity, comparable to non-private FL methods, and reduced gradient obfuscation. This work enhances the practicality of DP in FL, balancing privacy, efficiency, and robustness in a variety of server trust environments.
Roie Reshef, Kfir Y. Levy
ICML1
2024 Verification of Neural Networks' Local Differential Classification Privacy
Roie Reshef, Anan Kabaha, Olga Seleznova, Dana Drachsler-Cohen
VMCAI (2)1