Decentralized & Collaborative AI on Blockchain

07/16/2019 ∙ by Justin D. Harris, et al. ∙ University of Colorado Boulder Microsoft 3

Machine learning has recently enabled large advances in artificial intelligence, but these tend to be highly centralized. The large datasets required are generally proprietary; predictions are often sold on a per-query basis; and published models can quickly become out of date without effort to acquire more data and re-train them. We propose a framework for participants to collaboratively build a dataset and use smart contracts to host a continuously updated model. This model will be shared publicly on a blockchain where it can be free to use for inference. Ideal learning problems include scenarios where a model is used many times for similar input such as personal assistants, playing games, recommender systems, etc. In order to maintain the model's accuracy with respect to some test set we propose both financial and non-financial (gamified) incentive structures for providing good data. A free and open source implementation for the Ethereum blockchain is provided at https://github.com/microsoft/0xDeCA10B.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

Code Repositories

0xDeCA10B

Decentralized & Collaborative AI on Blockchain


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

We propose a framework for sharing and improving a machine learning model. In this framework, anyone can freely access the model’s predictions or provide data to help improve the model. An important challenge is that the system must be robust and incentivize participation, but discourage manipulation. Our framework is modular, and we propose and justify three example choices of “incentive mechanisms” with different advantages.

There exist several proposals to combine machine learning and blockchain frameworks. In systems such as DInEMMo [1], access to the trained model is limited to a marketplace. This allows contributors to profit based on a model’s usage, but it limits access to those who can pay. DanKu proposes storing already trained models in smart contracts for competitions, which does not allow for continual updating and collaborative training [2]. In contrast, the goal of this work is to address the current centralization of artificial intelligence by sharing models freely. Such centralization includes machine learning expertise, siloed proprietary data, and access to machine learning model predictions (e.g. charged on a per-query basis).

I-a Overview

By leveraging advances in AI, prediction markets, and blockchain platforms, we can demonstrate the capabilities of a new framework to collect vast amounts of data, allow contributors to potentially profit, and host a shared machine learning model as a public resource. The model can be collaboratively trained by many contributors yet remain open and free for others to use the model for inference. This is accomplished with several configurable components:

  • the incentive mechanism

  • the data handler

  • the machine learning model

A smart contract is created and initialized with choices for these components. It then accepts “add data” actions from participants, with the incentive mechanism possibly triggering payments or allowing other actions. Adding data involves validation from the incentive mechanism, storing in the data handler, and finally calling the update method on the model’s contract, as shown in Fig. 1. Prediction is done off-chain by calling the predict function provided for convenience in the model’s smart contract code.

Fig. 1: Adding data consists of 3 steps. (1) The IncentiveMechanism validates the transaction, for instance, in some cases a “stake” or monetary deposit is required. (2) The DataHandler stores data and meta-data onto the blockchain. This ensures that it is accessible for all future uses, not limited to this smart contract. (3) The machine learning model is updated according to predefined training algorithms. In addition to adding data, anyone can query the model for predictions, and the incentive mechanism may be triggered to provide users with monetary payments or virtual “karma” points.

The goal of our system is not for the creators to profit: the goal is to create valuable shared resources. It is possible for the data contributors to profit financially (depending on the incentive mechanism) but this is mainly a result of mechanisms designed to penalize the contributors who submit bad data.

The dataset is also public because it can be found in the blockchain’s transaction history or through emitted events (if this feature is available to the blockchain framework). Collecting large datasets can be costly using typical crowdsourcing platforms such as Figure Eight (formerly known as Dolores Lab, CrowdFlower) and Amazon Mechanical Turk. In crowdsourcing, filtering out “bad data” is a constant battle with spammers, who can submit low-effort or nonsensical data and still receive compensation for their work [3]. In our incentive mechanisms, contributors do not benefit from submitting bad data and can even pay a penalty; meanwhile, honest contributors are actively incentivized to correct others’ mistakes.

I-B Machine Learning and Blockchain Background

We mainly considered supervised learning problems where a dataset consists of labeled samples. For example, in a recommender system, a movie or restaurant is given a label from

to stars. The term model

refers to a machine learning algorithm that has been trained on data. It is used to make predictions, e.g. predict the label of a given example. It can be represented as a neural network, a matrix of numbers, a decision tree, etc.

Our framework applies to platforms where decentralized networks agree on a shared sequence of computations. An example is the Ethereum blockchain [4]. A smart contract is an object (in the sense of object-oriented programming) in this shared code. It contains data fields and interacts with new code and events via its method calls. A computation on-chain means the computation is done inside of a smart contract. The input and result of the computation are usually stored on the blockchain. In contrast, off-chain means the computation can be done locally on the client’s machine and does not necessarily need to be public.

In Ethereum, reading and running code provided by a smart contract has no cost if it does not write to the blockchain. This means that one can use the model in a smart contract for inference for free. When we discuss blockchains, smart contracts, and examples throughout this paper, we are mainly referring to Ethereum blockchain and the specifics of smart contracts on the Ethereum platform. However, this design is certainly not limited to only run on Ethereum.

I-C Staking a Deposit

In conventional legal systems, violating an agreement may result in a penalty or fine. Enforcing a penalty via a smart contract is complicated because a user cannot be forced to make a payment. Instead, many solutions in the blockchain space require users to “stake” deposits that can be re-claimed later if they obey rules.111E.g. many solutions using Proof-of-Stake (PoS) such as in Tendermint [5] and the Casper system for Ethereum [6] involve staking a deposit to be considered eligible to participate. Similarly to those systems, we will also propose staking a deposit to simplify some incentive mechanisms for submitting new data.

I-D Organization

In section II, we describe the machine learning data handler and model portion of the algorithm. In section III, we give our incentive mechanisms. Then we discuss some implementation details in section IV. In section V, we present some reasons for using a blockchain for this framework. We present our responses to several potential issues in section VI. Finally, we motivate some future work in section VII.

Ii Machine Learning Models

This system can be used with various types of models including supervised and unsupervised. The model architecture (e.g. different types of neural networks, CRFs [7], SVMs [8]

, etc.) chosen relates closely to the incentive mechanism chosen. In our examples, we mainly consider training supervised classifiers because they can be used for many applications. We first propose to leverage the work in the Incremental Learning space

[9] by using models capable of efficiently updating with one sample. This should lower the transaction costs (“gas”) to update a model hosted in an Ethereum smart contract because each data contribution will be small. One simple model with “cheap” updates is a Nearest Centroid Classifier, also known as a Rocchio Classifier [10]. Online learning algorithms could also be appropriate.

Ii-a Initial Model

It is often helpful if the initially deployed model has been trained to some extent. For example, if the model is already somewhat useful, it is more likely to receive users for inference, who are more likely to generate and provide back data to improve the model. Also, for some but not all of our incentive mechanisms, having an initial level of accuracy allows better validation of contributed data. We stress that although this can be helpful, in many cases the model does not need to be pre-trained or highly accurate.

Ii-B Limitations

Due to limitations such as the cost of memory in the Ethereum blockchain, our examples usually focus on applications related to handling small input that can be compressed easily, such as text. Text can easily be compressed using vocabulary dictionaries or with common shared encoders such as the Universal Sentence Encoder in [11]. Complex models such as deep neural networks capable of processing images may be costly to store and update using Ethereum. Just uploading the raw images would be costly. For example, uploading all of the popular MNIST dataset of handwritten digits would cost about 275 ether at a modest gas price of 4gwei according to [2]. At the time of this writing (May 2019) that is about 65,000USD. Of course this cost would be amortized amongst all data contributors.

The transactions could incur high gas costs especially for the initial model deployment if the model or smart contract is large. With high gas costs it is possible that nodes will reject the transaction. Currently (May 2019) Ethereum has a limit of around 8 million gas. In our experiments 8M gas is enough to deploy simple models and to submit complex data samples. Even if the entire model is too large to submit when the contract is first deployed, the model can be added to the contract in several transactions after the contract is created.

Ii-C Experiment

Action Gas Cost USD
Deploy model contract 3,845,840 $4.06
Add data with 15 words () 177,693 $0.19
Add data with 15 words () 249,037 $0.26
Perceptron models are only updated when .
In May 2019 with a modest gas price of 4gwei.
TABLE I: Gas Costs

We trained a single layer perceptron model [12] on the IMDB reviews dataset introduced in [13]. The model has 100 binary features which are the presence of the 100 common words used in the dataset. Thus 100 weights are initially deployed with the model. Table I shows the gas cost for various interactions with the model, , using the Ethereum blockchain. When data is added, is the features and is the label assigned to . The gas costs for adding data are calculated by adding data via the main contract entry point (not directly to the model contract). When using more features, initial deployment cost increases but the cost to add data is similar because the features in data have a sparse representation.

Iii Incentive Mechanisms

The proposed incentive mechanisms (IM) encourage contributors to submit data that will improve the model’s accuracy. This can be measured in various ways. The most natural proxy is to measure the performance with respect to a specific test set. We will also discuss ways to measure performance if a test set cannot be provided. The purpose of this paper is to present the general framework with motivating examples, as such, each incentive mechanism will be analysed further in future work.

We refer to good data in the following sections as data that is objectively correct. E.g. for a picture of the number 1, the label “1” is clearly better than the label “0”. Data can also be bad (i.e. wrong) or ambiguous.

Iii-a Gamification

We first propose a baseline with no financial incentives in any form with the goal of reducing the barrier to entry. This is the Wikipedia [14] for Models & Datasets. This proposal relies solely on the willingness of contributors to collaborate for free, for a common good.

Additionally, points and optionally badges can be awarded to data contributors, i.e. stackexchangification [15]. Badges in Stack Exchange have been shown to be effective by [16]. The points and badges can be recorded on-chain in a smart contract using the contributor’s wallet address as a key or identification. Here are some examples of measurements for awarding points or badges to a user:

  • a specified number of data samples has been contributed

  • submitting diverse data samples

  • submitting data with different labels

  • submitting data routinely (e.g. weekly)

Further experiments must be done into how these metrics can be explicitly computed efficiently on-chain or expanded off-chain.

Iii-B Rewards Mechanism Based on Prediction Markets

In this section, we describe a monetary reward-based system for incentivizing contribution of correct data. This design extends proposals of [17] and [18] for collaborative machine learning contests. An outside party, such as an academic institution or a company, provides (1) a pool of reward funds and (2) a test dataset. Participants are rewarded according to how well they improve the model’s performance as measured by the test data.

When this provider is available, we will be able to give very robust incentives for participation. The mechanism is also resilient against manipulative or malicious providers and participants. For cases where there is no outside party, we suggest the mechanism in section III-C.

Iii-B1 Overview

The mechanism is given in Fig. 2

. There are three phases. In the commitment phase, the provider deposits the bounty and defines a loss function

. This is a measure of loss (or a surrogate or proxy metric) of any model on any dataset (typically the average loss on points in the dataset). Finally, the provider cryptographically commits to a test dataset, a small random fraction of which is initially revealed, similar to how data is revealed in [2].

In the participation phase, people add data or otherwise provide updates to the model. Each participant is required to deposit or “stake” unit of currency along with their update.222For the purposes of this description, each interaction is considered a separate participant. This is useful because participants cannot gain anything by creating false identities. After an end condition is met (such as a maximum time limit or amount of data), this phase ends. A new cycle can begin if a new provider decides to commit new test data.

In the reward phase, the provider uploads the test dataset and the smart contract checks that it satisfies the commitment.333We note that, because the test data is not uploaded until the end, participants do not see the current performance of the model on the final test set and cannot overfit to it. Then, the smart contract determines rewards for all participants, as discussed next.

1:A. Commitment Phase
2:Provider deposits units of currency.
3:Provider defines a loss function .
4:Provider secretly divides a test dataset into equal parts and uploads their cryptographic hashes.
5:Smart contract randomly selects of these hashes.
6:Provider uploads partial datasets. If they do not match the hashes, abort.
7:Provider specifies end condition (e.g. time limit).
1:B. Participation Phase
2:Smart contract contains an initial model, .
3:for each participant until end condition is met: do
4:     Participant deposits a stake of unit of currency
5:     Participant provides data.
6:     Model is updated from to .
1:C. Reward Phase
2:Provider uploads partial datasets; call them . If they do not match the remaining hashes, abort.
3:Let for all // balance initially equals stake
4:Let list // list initially contains everyone
5:for  do
6:     for each participant in  do
7:         Let be previous participant in , or if none.
8:         Participant ’s balance is changed:
     
9:     Let list . // all who can re-stake stay in
10:Each participant is paid .
Fig. 2: Bounty-based Incentive Mechanism. We use to denote a machine learning model and for a dataset. The loss function is clipped to the range by the smart contract.

Iii-B2 Reward calculation.

First imagine that the bounty , so that each participant ’s reward is their stake plus the following number:

(1)

This is exactly the reward function proposed in [17], based on automated-market-maker or scoring-rule based prediction markets [19]. It can be pictured as follows: The smart contract first pays to the first participant. Their data updated the model to , so they pay to the second participant. This continues down the line until the last participant pays back to the smart contract. The better performs, the less participant has to pay forward, so they are incentivized to provide data that is as useful as possible relative to the (expected) test set. (If performs worse than the previous model, loses some or all of their stake.) In total, the smart contract pays out a net amount of , which is the total improvement from all contributions. It is at most by assumption on the loss function.

Finally, we must scale this mechanism for a bounty of . The approach of [17] would require that all participants stake , which is infeasible. Therefore, instead, we use the approach of iterating the mechanism times. Each iteration, the participant stakes unit, then receives a reward. If she can no longer stake unit due to losses, she drops out.444Of course, our mechanism can be modified to allow participants to stake more than unit in order to cover more losses, but it is not clear if this would be beneficial to them. Although this is slightly complex, it still remains that the better , the more reward gets, so we believe incentives for participation are strongly aligned.

Iii-B3 Untrusted provider, commitment, and value burning

The provider can potentially manipulate by first, the choice of dataset, and second, by participating or partnering with some participants. As we describe next, the defenses against manipulation are the cryptographic commitment scheme along with value “burning”, which occurs when some value that was deposited to the smart contract is not returned to anyone.

The cryptographic commitment scheme forces the provider to reveal in advance a random of the dataset (of course, the numbers of and can be adjusted as desired). If the provider does not comply, the process is aborted and the reward stays stuck in the contract (not refunded). Assuming the provider complies, participants learn something about the final dataset. This prevents the following problematic attack: the provider secretly chooses a dataset with incorrect labels, then participates anonymously with corresponding updates. The provider could then not only gain back most of the original reward, but also earn significant amounts from the stakes of the honest participants, which they would lose because their data is not helpful for this test set. The commitment scheme reveals a representative part of the test set up front, so that participants would likely be alerted to such an attack and refuse to participate.

At the end of the process, a significant amount of the original bounty is likely to remain stuck in the contract. Specifically, only the following amount is distributed:

(2)

While this is not ideal, the benefit is that there is no incentive for the provider to choose an incorrect dataset in hopes of having significant value left over. The smart contract could instead donate left over funds to some predetermined account (such as a charity), but that would be open to manipulation.

In summary, the provider must expect to lose the entire bounty. Therefore, it will only participate if the benefit from the trained model is worth this cost, so that only honest providers have an incentive to join.555A colleague points out that a provider may be able to gain back some of the bounty by participating using the portion of the initially revealed test set. However, this is not harmful to the final performance of the model.

Iii-C Deposit, Refund, and Take: Self-Assessment

Ideally, one could enforce a fine or penalty on those submitting bad data. One way to determine if data is bad is to have other contributors validate it as is common in conventional crowdsourcing methods. However, enforcing a penalty at a later time via a smart contract is difficult as established in section I-C. To facilitate penalties, this proposal enforces a deposit when contributing data.

This IM is an alternative where one does not need to rely on a benevolent agent to submit a test set as described previously. Instead it is possible to rely on the data contributors to indirectly validate and pay each other. As a proxy to verify data, we propose using the deployed model, , to validate new contributions. The caveat is that the initially deployed model needs to already be trained and generally already correctly classify samples with some accepted degree of accuracy.

Here are the highlights of the proposal:

  • Deploy a model, , already trained with some data.

  • Deposit: Each data contribution with data and label also requires a deposit, . Data and meta-data for each contribution is stored in the data handler.

  • Refund: To claim a refund on their deposit, after a time has passed and if the current model, , still agrees with the originally submitted classification, i.e. if , then the contributor can have their entire deposit returned.

    • We now assume that is “good” data.

    • The successful return of the deposit should be recorded in a tally of points for the wallet address.

  • Take: A contributor that has already had data validated in the Refund stage can locate a data point for which and request to take a portion of the deposit, , originally given when was submitted.

If the sample submitted, is incorrect or invalid, then within time , other contributors should submit where is the correct or at least generally preferred label for and . This is similar to how one generally expects bad edits to popular Wikipedia articles to be corrected in a timely manner.

Iii-C1 Time to Wait for Refund

The creator of the contract must select, , how much time contributors need to wait before they can claim a refund on their deposit. As a guideline, we propose setting to be enough time for other contributors to submit corrections with different labels if they disagree with the data. For example, .

Models that are not very sensitive might need to allow more time to pass in order for enough samples to be provided to teach the model about a new use case.

Very sensitive models could allow malicious contributors to claim refunds for “bad” data before another contributor has a chance to “correct” their bad submission. Such models should also require a deposit high enough to dissuade bursts of malicious data submissions. Special care needs to be taken and experiments should be done before setting .

Certainly

does not have to be constant. It could somehow depend on the provided data sample, frequency of data submitted, or even the certainty of the model on the data point. I.e. if the model has a measure of probability of correctness,

, for submission then it can be used to reduce because it’s unlikely to be changed later.

Iii-C2 Varying Deposit

Requiring a deposit has a few goals:

  • Introduce value to the system allowing others the chance to profit after they have contributed correct data.

  • Inhibit too frequent changes to the model.

  • Reduce spam (incorrect or invalid data).

To achieve these goals we propose

I.e. it is costly for contributors to send many updates in a short amount of time. This should give those using the prediction function of the models a more consistent experience. E.g. consider a personal assistant in one’s home that behaves too differently to the same spoken request uttered several times a day, such as a request to play the news.

Iii-C3 Taking Another’s Deposit

We introduce some guidelines for a contributor that is reporting “bad” data to take some of the deposit from the original contributor, . Note that contributed data and meta-data about it can be found in the data handler or emitted events.

First some definitions:

  • Let be the reward that the contributing reporter, receives for reporting data with deposit .

  • Let be the number of data samples for which contributor received a refund (assumed good data).

Guidelines:

  • : The current model disagrees with the label. So we assume the data is “bad”.

  • : The reporter should have already had data refunded. This enforces that they hopefully already submitted “good” data before they can try to profit from the system.

  • : The reporter cannot be the original contributor. Otherwise contributors can easily attempt to reclaim their deposit for “bad” data.

  • The reward should be shared amongst “good” contributors.

    (3)
    • This protects against Sybil attacks where a contributor can use a second account to take back their entire deposit. They can still claim back some of their reward from another account but they will have to wait and get refunded for some “good” data using that other account.

  • : The reward should be at least some minimal value to cover potential transaction costs.

  • The data handler must keep track of the remaining deposit that can be claimed, .

  • Since changes over time, the ratio in (3) changes while reporters are claiming their share of . Therefore, it possible that some reporters get a smaller proportion of . We discuss some possible solutions to this in III-C5.

Iii-C4 Biasing the Model

With the proposal, contributors can be tempted to only submit data the model already agrees with () at submission time and hope the model still agrees with at refund time. This could create a bias in the model towards data it already “knows”. Contributors would normally still have to pay a transaction fee so in effect they still pay a nominal fee to deposit and claim their refund. The model and training method must be carefully chosen and the designer can consider how to handle duplicate or similar data. The IM can even reject too much duplicate or similar data.

Iii-C5 Preventing Lock-ups

In this section we discuss ways to avoid funds getting “locked-up“ or “stuck inside” the smart contract. It is possible that contributors omit to collect their refunds or that contributors do not take their portion of the deposit leaving value “stuck inside” the contract. To avoid this we introduce two new parameters:

  • : The amount of time the creator has to wait to take the entire remaining refund () for a specific contribution. Where . Additionally, this gives creators some incentive to deploy a model as they may get a chance to claim a significant portion of . Contracts may want to enforce that this is much greater than the amount of time to wait for attempting a refund, which gives contributors even more time to get the deposit back and not allow the creator take too much ().

  • : The amount of time anyone has to wait to take the entire remaining refund (). Where . in case the creator omits to take “stuck” value from the contract.

Certainly there can be more variants of these such as a value, , for data contributors with refunded submissions () where .

Iii-C6 Experiment

We developed simulations to test parameters for incentive mechanisms and models. For one simulation, we initially trained a Perceptron model [12] with 8% of the IMDB reviews training dataset introduced in [13]. The model has 1000 binary features which are the presence of the 1000 most frequent words in the dataset. Fig 3 shows the results of a simulation where for simplicity, we show just one honest contributor and one malicious contributor but these contributors effectively represent many contributors submitting the remaining 92% of the training data over time. Details for the simulation can be found with our source code.

Fig. 3: Balance percentages and model accuracy in a simulation where an adversary, ”Bad Agent” is willing to spend about twice as much on deposits than an honest contributor, ”Good Agent”. The adversary is only submitting data about one sixth as often. Despite the malicious efforts, the accuracy can still be maintained and the honest contributors profit.

Iv Implementation

In this section we discuss some implementation details for our proposed framework.

Iv-a Floating Point Numbers

In our examples we use integers for data representations because Ethereum does not support floating point numbers. Whenever we expect a floating point number, we take in an integer that has already been multiplied by some value, e.g. (9 decimal places of precision). All operations are done considering this transformation.

Iv-B Inversion of Control

To favor clarity and ease development, our examples use the Inversion of Control [20] principle favoring composition over inheritance. In Ethereum smart contracts using inheritance can be cheaper than ones using composition according to [21]. Some subtleties such as ownership and publicity of contained contracts need to be considered. Fig. 4 shows a class diagram for the proposed framework.

Fig. 4: Overview of the class diagram for the framework; other members and methods exist. We use “@” before a method to indicate that only the owner may call the method.

Since the model will exist as its own contract it will need to have its update method exposed publicly. Only the owner of the model (the CollaborativeTrainer) can call the model’s update method because this owner is responsible for using the incentive mechanism.

V Benefits of Blockchain

Using a blockchain (such as Ethereum [4]) provides us with many advantages compared to traditional source code hosting and deployment:

V-a Public, Persistent & Decentralized

The model is a shared and publicly visible resource. One can essentially trust that the model will persist and be available on one of many decentralized nodes.

V-B Versioning

It is easy to revert to an earlier version of the model by only updating your node’s version of the blockchain up to the particular block where your application is satisfied with the model, possibly measuring performance with respect to one’s own hidden test set.

V-C Models Evolve Over Time

Smart contracts on a blockchain allow models to evolve as the environment changes, for example recognize novel words.

V-D Transparency & Trust

Typically a machine learning or data collection service would be set up with a REST API or some other system where users interface with code running on some servers. Users can submit or request data from the servers but there is no way for the user can be completely certain of the source code running on the servers. Code running in an Ethereum smart contract is completely public and the result of a particular execution can be deterministically evaluated. Essentially, data contributors can trust that the model updates and that they will be compensated for their contributions.

Vi Potential Issues

Data contributors and smart contract creators should consider several vulnerabilities when using our framework. Many possible issues have already been addressed for systems with static models in [2]. This section analyzes issues specific to systems where models can be trained.

Vi-a Submitting Bad Data

A wealthy and determined agent can corrupt a model deployed by submitting incorrect or nonsensical training data.

Response

The incentive mechanism should make it costly and unbeneficial to submit bad data. Furthermore, many blockchains have transactions fees making it very costly to submit a lot of data. Even if a model is corrupted, the users of the model can just revert back to an earlier version of the model since it is on a blockchain. Additionally, analysis can be done to salvage “good” data already submitted.

Vi-B Ambiguous Data

Those using this framework must carefully consider the type of model, IM, and how submitting ambiguous data can affect the system. For example, the sentiment of “The movie is okay” if the options for the label are “happy” or “sad”. Ambiguous data is always an issue when crowdsourcing but is especially concerning here since contributors can lose funds. It is safest for contributors to keep their data unambiguous.

Vi-C Overwhelming the Network

Some applications relying on public blockchains have had reliability issues due to network congestion. This can be an issue for this framework when adding data which requires creating new transactions. Inference should not be affected because running inference just involves reading which is normally free and can be done locally with the latest local version of the model.

Vi-D Requiring a Deposit

Many new contributors might not be familiar with the established practice of blockchain applications requiring a deposit. Small fees are already required to process any transaction in most of the popular blockchains such as Bitcoin [22] and Ethereum [4].

There are some ways to hide these fees from end users. A third-party can hide the deposit cost by providing their own interface to a public system and validating data contributions themselves. Perhaps this third party believes they have algorithms and better means to validate data. They could then reward users under their own scheme which may not even involve financial incentives.

Vii Future Work

There are a few areas where the presented framework can be configured and built upon.

Vii-a Models

More research needs to be done on the types of models that will work well within this framework.

Vii-A1 Unsupervised Models

The examples discussed mainly use supervised classifiers because we focus on validating data with labels. Test sets and incentive mechanisms to validate the data contributions can still be used with unsupervised models. Some examples are:

  • Clustering: Developing clustering models especially for outlier detection can be very useful.

  • Generative models such as autoencoders and GANs. For example, a model could be built that attempts to generate text or draw pictures.

Vii-A2 Complex Models

There are cost limitations as described in section II-B. We propose more research in pre-computing as much as possible off-chain and only performing necessary steps in a smart contract. Techniques such as fine-tuning

(in the transfer learning field)

[23] or off-chain training as proposed for DeepChain [24] can help. One can use a common encoder (shared in more conventional ways such as via web APIs or publicly posting source code to a website) off-chain to encode the input and then fine-tune the encoded result on-chain with a simple neural network or even just a single layer. While the encoder should be static, it is possible for it to change slightly as long as the input to the fine-tuning component is similar enough to previously seen training data.

Complex models can even be interfaced via an API through the smart contract using a system such as Provable (formerly Oraclize) [25]. Hiding the model behind an API means the model is not necessarily public which is not in the spirit of this proposal. Complex models can also be built up by combining several “layers” of smart contracts using this framework.

Vii-A3 Recovering Corrupted Models

Work can be done in how to recover a model corrupted by bad data (as described in section VI-A). Once a dataset is collected it can be further refined through various methods (e.g. clustering data). The cleaned dataset can be used to train a new model. This new model could be kept private by those that organize cleaning efforts and used in their production system. The model could also be used to start a new instance of the collaborative training process and collect more training data.

Vii-B Incentive Mechanisms

More exploration, analysis, and experiments with incentive mechanisms in this space needs to be done with emphasis on the type of model each incentive mechanism works well with.

The incentive mechanisms imposed by the smart contract could be hidden to end users by 3rd party services that build services around this proposed framework. These services could validate data contribution themselves offering their own rewards to users of their platforms that do not wish to interact with these smart contracts.

Vii-C Privacy

Contributors may not want to publish their data to a public blockchain. Initially we propose to only use this for framework for data that is safe to become public. E.g. certain queries to a personal assistant such as, “What will the weather be like tomorrow?”, which contains no personal data.

Future work can be done to not submit data directly to the smart contract and instead just submit model updates as discussed in section VII-A2 and in DeepChain [24].

Viii Conclusion

We have presented a configurable framework for training a model and collecting data on a blockchain by leveraging several baseline incentive mechanisms and existing types of machine learning models for incremental learning. Ideal scenarios have varying data with generally agreed upon labels. Currently, this framework is mainly designed for models that can be efficiently updated but we hope to see future research in scaling to more complex models.

Acknowledgement

The authors would like to thank William Buchwalter for believing in the ideas initially and helping to implement the first demos. Nicole Immorlica, Brendan Lucier, Dave Pennock, and Glen Weyl for discussions and suggestions. Adam Atkinson, Hannes Schulz, Kaheer Suleman, and Jaclyn Hearnden for giving detailed feedback on the paper.

References

  • [1] A. Marathe, K. Narayanan, A. Gupta, and M. Pr, “DInEMMo: Decentralized incentivization for enterprise marketplace models,” 2018 IEEE 25th International Conference on High Performance Computing Workshops (HiPCW), pp. 95–100, 2018.
  • [2] A. B. Kurtulmus and K. Daniel, “Trustless machine learning contracts; evaluating and exchanging machine learning models on the ethereum blockchain,” 2018. [Online]. Available: https://algorithmia.com/research/ml-models-on-blockchain
  • [3] F. Daniel, P. Kucherbaev, C. Cappiello, B. Benatallah, and M. Allahbakhsh, “Quality control in crowdsourcing: A survey of quality attributes, assessment techniques and assurance actions,” CoRR, vol. abs/1801.02546, 2018. [Online]. Available: http://arxiv.org/abs/1801.02546
  • [4] V. Buterin, “A next generation smart contract & decentralized application platform,” 2015.
  • [5] J. Kwon, “Tendermint: Consensus without mining,” 2014.
  • [6] V. Buterin and V. Griffith, “Casper the friendly finality gadget,” 2017.
  • [7] J. Lafferty, A. McCallum, and F. C. Pereira, “Conditional random fields: Probabilistic models for segmenting and labeling sequence data,” 2001.
  • [8]

    C. Cortes and V. Vapnik, “Support-vector networks,”

    Machine Learning, vol. 20, no. 3, pp. 273–297, Sep 1995. [Online]. Available: https://doi.org/10.1007/BF00994018
  • [9] J. C. Schlimmer and D. Fisher, “A case study of incremental concept induction,” in Proceedings of the Fifth AAAI National Conference on Artificial Intelligence, ser. AAAI’86.   AAAI Press, 1986, pp. 496–501. [Online]. Available: http://dl.acm.org/citation.cfm?id=2887770.2887853
  • [10] C. D. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval.   Cambridge University Press, 2008, ch. Vector space classification, http://nlp.stanford.edu/IR-book/html/htmledition/rocchio-classification-1.html.
  • [11] D. Cer, Y. Yang, S. yi Kong, N. Hua, N. Limtiaco, R. S. John, N. Constant, M. Guajardo-Cespedes, S. Yuan, C. Tar, Y.-H. Sung, B. Strope, and R. Kurzweil, “Universal sentence encoder,” 2018.
  • [12] F. Rosenblatt, “The perceptron: a probabilistic model for information storage and organization in the brain,” Psychological Review, vol. 65, no. 6, p. 386, 1958.
  • [13]

    A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y. Ng, and C. Potts, “Learning word vectors for sentiment analysis,” in

    Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies.   Portland, Oregon, USA: Association for Computational Linguistics, June 2011, pp. 142–150. [Online]. Available: http://www.aclweb.org/anthology/P11-1015
  • [14] Wikipedia contributors, “Wikipedia — Wikipedia, the free encyclopedia,” https://en.wikipedia.org/w/index.php?title=Wikipedia&oldid=889379633, 2019, [Online; accessed 25-March-2019].
  • [15] Stack Exchange contributors, “Stack exchange,” https://stackexchange.com, 2019, [Online; accessed 25-March-2019].
  • [16] B. Bornfeld and S. Rafaeli, “Gamifying with badges: A big data natural experiment on stack exchange,” First Monday, vol. 22, no. 6, 2017. [Online]. Available: https://firstmonday.org/ojs/index.php/fm/article/view/7299
  • [17] J. D. Abernethy and R. M. Frongillo, “A collaborative mechanism for crowdsourcing prediction problems,” in Advances in Neural Information Processing Systems 25, ser. NeurIPS ’11, 2011, pp. 2600–2608.
  • [18] B. Waggoner, R. Frongillo, and J. D. Abernethy, “A market framework for eliciting private data,” in Advances in Neural Information Processing Systems 28, ser. NeurIPS ’15, 2015, pp. 3492–3500.
  • [19] R. Hanson, “Combinatorial information market design,” Information Systems Frontiers, vol. 5, no. 1, pp. 107–119, 2003.
  • [20] Wikipedia contributors, “Inversion of control — Wikipedia, the free encyclopedia,” https://en.wikipedia.org/w/index.php?title=Inversion_of_control&oldid=885334776, 2019, [Online; accessed 27-March-2019].
  • [21] Sergii Bomko, “Composition over inheritance - gas efficiency,” https://ethereum.stackexchange.com/a/60244/9564, 2018, [Online; accessed 27-March-2019].
  • [22] S. Nakamoto et al., “Bitcoin: A peer-to-peer electronic cash system,” 2008.
  • [23]

    Y. Bengio, “Deep learning of representations for unsupervised and transfer learning,” in

    Proceedings of ICML Workshop on Unsupervised and Transfer Learning, 2012, pp. 17–36.
  • [24] J.-S. Weng, J. Weng, M. Li, Y. Zhang, and W. Luo, “DeepChain: Auditable and privacy-preserving deep learning with blockchain-based incentive,” IACR Cryptology ePrint Archive, vol. 2018, p. 679, 2018.
  • [25] Provable, “Provable - Oraclize 2.0 - blockchain oracle service, enabling data-rich smart contracts,” https://provable.xyz/, 2019, [Online; accessed 5-April-2019].