instruction:
In this task, you are given the abstract of a research paper. Your task is to generate a summary of this abstract. Your summary should not be very short, but it's better if it's not more than 30 words.
question:
Bitcoin is a virtual coinage system that enables users to trade virtually free of a central trusted authority. All transactions on the Bitcoin blockchain are publicly available for viewing, yet as Bitcoin is built mainly for security it’s original structure does not allow for direct analysis of address transactions. 
 Existing analysis methods of the Bitcoin blockchain can be complicated, computationally expensive or inaccurate. We propose a computationally efficient model to analyze bitcoin blockchain addresses and allow for their use with existing machine learning algorithms. We compare our approach against Multi Level Sequence Learners (MLSLs), one of the best performing models on bitcoin address data.
answer:
a 2vec model for cryptocurrency transaction graphs


question:
Neural networks with low-precision weights and activations offer compelling
 efficiency advantages over their full-precision equivalents. The two most
 frequently discussed benefits of quantization are reduced memory consumption,
 and a faster forward pass when implemented with efficient bitwise
 operations. We propose a third benefit of very low-precision neural networks:
 improved robustness against some adversarial attacks, and in the worst case,
 performance that is on par with full-precision models. We focus on the very
 low-precision case where weights and activations are both quantized to $\pm$1,
 and note that stochastically quantizing weights in just one layer can sharply
 reduce the impact of iterative attacks. We observe that non-scaled binary neural
 networks exhibit a similar effect to the original \emph{defensive distillation}
 procedure that led to \emph{gradient masking}, and a false notion of security.
 We address this by conducting both black-box and white-box experiments with
 binary models that do not artificially mask gradients.
answer:
We conduct adversarial attacks against binarized neural networks and show that we reduce the impact of the strongest attacks, while maintaining comparable accuracy in a black-box setting


question:
Discovering causal structure among a set of variables is a fundamental problem in many empirical sciences. Traditional score-based casual discovery methods rely on various local heuristics to search for a Directed Acyclic Graph (DAG) according to a predefined score function. While these methods, e.g., greedy equivalence search, may have attractive results with infinite samples and certain model assumptions, they are less satisfactory in practice due to finite data and possible violation of assumptions. Motivated by recent advances in neural combinatorial optimization, we propose to use Reinforcement Learning (RL) to search for the DAG with the best scoring. Our encoder-decoder model takes observable data as input and generates graph adjacency matrices that are used to compute rewards. The reward incorporates both the predefined score function and two penalty terms for enforcing acyclicity. In contrast with typical RL applications where the goal is to learn a policy, we use RL as a search strategy and our final output would be the graph, among all graphs generated during training, that achieves the best reward. We conduct experiments on both synthetic and real datasets, and show that the proposed approach not only has an improved search ability but also allows for a flexible score function under the acyclicity constraint.
answer:

We apply reinforcement learning to score-based causal discovery and achieve promising results on both synthetic and real datasets