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

Yixiao Lan

dblp:271/4321 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper
Blockchain and cryptocurrency security · 50% Security and privacy of machine learning · 50%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
consensus protocol
0.512021
Proof of Learning (PoLe): Empowering Machine Learning with Consensus Building on Blockchains (Demo) · AAAI 2021
Security and privacy of machine learning › verifiable machine learning
proof of learning
0.512021
Proof of Learning (PoLe): Empowering Machine Learning with Consensus Building on Blockchains (Demo) · AAAI 2021
Machine learning › Efficient and distributed learning
distributed training
0.112021
Proof of Learning (PoLe): Empowering Machine Learning with Consensus Building on Blockchains (Demo) · AAAI 2021

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

deep learning · 1.0proof-of-work · 0.5proof of work · 0.5
YearPublicationVenuePosition
2021 Proof of Learning (PoLe): Empowering Machine Learning with Consensus Building on Blockchains (Demo)
abstract
The consensus algorithm is the core component of a blockchain system, which determines the efficiency, security, and scalability of the blockchain network. The representative consensus algorithm is the proof of work (PoW) proposed in Bitcoin, where the consensus process consumes large amount of compute in solving meaningless Hash puzzel. Meanwhile, the deep learning (DL) has brought unprecedented performance gains at heavy computate cost. In this demo, we channels the otherwise wasted computational power to the practical purpose of training neural network models, through the proposed proof of learning (PoL) consensus algorithm. In PoLe, 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. Through our system, we investigate the potential of enpowering machine learning with consensus building on blockchains.
Yixiao Lan, Yuan Liu 0002, Boyang Li 0001, Chunyan Miao
AAAI1
2021 Proof of Learning (PoLe): Empowering neural network training with consensus building on blockchains
abstract
The advent of neural network (NN) based deep learning, especially the recent development of the automatic design of networks, has brought unprecedented performance gains at heavy computational cost. On the other hand, in order to generate a new consensus block, Proof of Work (PoW) based blockchain systems routinely perform a huge amount of computation that does not achieve practical purposes but to solving a difficult cryptographic hash puzzle problem.In this study, we propose a new consensus mechanism, Proof of Learning (PoLe), which directs the computation spent for block consensus toward optimization of neural networks. In our design, the training and testing data are released to the entire blockchain network and the consensus nodes train NN models on the data, which serves as the proof of learning. As a core component of PoLe, we design a secure mapping layer (SML) to prevent consensus nodes from cheating, which can be straightforwardly implemented as a linear NN layer. When the consensus on the blockchain network is achieved, 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. Experimental evaluation also shows the PoLe can achieve a stable block generation rate without significantly sacrificing training performance.
Yuan Liu 0002, Yixiao Lan, Boyang Li 0001, Chunyan Miao, Zhihong Tian 0001
Comput. Networks2