Proof of Learning (PoLe): Empowering Machine Learning with Consensus Building on Blockchains
The progress of deep learning (DL), especially the recent development of automatic design of networks, has brought unprecedented performance gains at heavy computational cost. On the other hand, blockchain systems routinely perform a huge amount of computation that does not achieve practical purposes in order to build Proof-of-Work (PoW) consensus from decentralized participants. In this paper, we propose a new consensus mechanism, Proof of Learning (PoLe), which directs the computation spent for consensus toward optimization of neural networks (NN). In our mechanism, the training/testing data are released to the entire blockchain network (BCN) and the consensus nodes train NN models on the data, which serves as the proof of learning. When the consensus on the BCN considers a NN model to be valid, a new block is appended to the blockchain. We experimentally compare the PoLe protocol with Proof of Work (PoW) and show that PoLe can achieve a more stable block generation rate, which leads to more efficient transaction processing. We also introduce a novel cheating prevention mechanism, Secure Mapping Layer (SML), which can be straightforwardly implemented as a linear NN layer. Empirical evaluation shows that SML can detect cheating nodes at small cost to the predictive performance.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningvalidSimilar Papers 제목 키워드 기반
Proof-of-Useful-Work as Dual-Purpose Mechanism for Blockchain and AI: Blockchain Consensus that Enables Privacy Preserving Data Mining
Blockchains rely on a consensus among participants to achieve decentralization and security. However, reaching consensus in an online, digital world where identities are not tied to physical users is a challenging proble…
Privacy PreservingCan we 'future-proof' consensus trees?
Consensus methods are widely used for combining phylogenetic trees into a single estimate of the evolutionary tree for a group of species. As more taxa are added, the new source trees may begin to tell a different evolut…
Physics-inspired Equivariant Descriptors of Non-bonded Interactions
One essential ingredient in many machine learning (ML) based methods for atomistic modeling of materials and molecules is the use of locality. While allowing better system-size scaling, this systematically neglects long-…
Consensus-Based Optimization on the Sphere: Convergence to Global Minimizers and Machine Learning
We investigate the implementation of a new stochastic Kuramoto-Vicsek-type model for global optimization of nonconvex functions on the sphere. This model belongs to the class of Consensus-Based Optimization. In fact, par…
BIG-bench Machine Learningglobal-optimizationRetrievalProof-of-Spiking-Neurons(PoSN): Neuromorphic Consensus for Next-Generation Blockchains
Blockchain systems face persistent challenges of scalability, latency, and energy inefficiency. Existing consensus protocols such as Proof-of-Work (PoW) and Proof-of-Stake (PoS) either consume excessive resources or risk…