Cassie Heart pfp
Cassie Heart
@cassie
Working on a test case to confirm an idea would improve the performance of the RPM paper and reduce round complexity – it also has a neat side effect that it also enables massive parallel gradient descent compute for secure ML in a completely MPC context
3 replies
0 recast
0 reaction

Cassie Heart pfp
Cassie Heart
@cassie
In the spirit of building in public, I'll share the approach I'm evaluating – the RPM paper referenced the SecureML paper, which suggested the use of Beaver triples to keep the polynomial degree bounded to the shares of matrices when computing dot products. This works great under 2PC but requires log(n) rounds...
1 reply
0 recast
0 reaction

Cassie Heart pfp
Cassie Heart
@cassie
when you increase the number of participants in the protocol. I had tuned Quilibrium to be relatively lower bounded on this so it wasn't a super painful issue, but in the spirit of research and downtime waiting between flights, I kept thinking... https://i.imgur.com/eA7rNCI.gif
2 replies
0 recast
0 reaction