wanyu/IteraTeR_v2 huggingface dataset:
Original:  Therefore, even partial automation of this process would help make deep learning more accessible to both researchers and practitioners.
Revised:  Therefore, even partial automation of this process helps to make deep learning more accessible to both researchers and practitioners.
Edit intent: clarity
Original:  We achieve this via a discussion of common architecture search spaces and architecture optimization algorithms based on principles of reinforcement learning and evolutionary algorithms along with approaches that incorporate surrogate and one-shot models.
Revised:  We achieve this via a comprehensive discussion of the commonly adopted architecture search spaces and architecture optimization algorithms based on principles of reinforcement learning and evolutionary algorithms along with approaches that incorporate surrogate and one-shot models.
Edit intent: clarity
Original:  However, existing studies usually make network or attack assumptions biased towards the defense ( e.g., assuming the prior knowledge of attacks is known ) . In practice, attackers can adopt any arbitrary behavior and avoid any pre-assumed pattern or assumption used by defense strategies.
Revised:  However, existing studies usually assume network or attackers as passive entities, e.g., assuming the prior knowledge of attacks is known ) . In practice, attackers can adopt any arbitrary behavior and avoid any pre-assumed pattern or assumption used by defense strategies.
Edit intent: clarity
Original:  However, existing studies usually make network or attack assumptions biased towards the defense ( e.g., assuming the prior knowledge of attacks is known ) . In practice, attackers can adopt any arbitrary behavior and avoid any pre-assumed pattern or assumption used by defense strategies.
Revised:  However, existing studies usually make network or attack assumptions biased towards the defense ( e.g., assuming the prior knowledge of attacks is known ) . In practice, attackers can actively adopt arbitrary behaviors and avoid pre-assumed pattern or assumption used by defense strategies.
Edit intent: clarity
Original:  However, existing studies usually make network or attack assumptions biased towards the defense ( e.g., assuming the prior knowledge of attacks is known ) . In practice, attackers can adopt any arbitrary behavior and avoid any pre-assumed pattern or assumption used by defense strategies.
Revised:  However, existing studies usually make network or attack assumptions biased towards the defense ( e.g., assuming the prior knowledge of attacks is known ) . In practice, attackers can adopt any arbitrary behavior and avoid any pre-assumed patterns or assumptions used by defense strategies.
Edit intent: fluency
Original:  In this paper, we revisit this traditional security problem and propose a novel learning-empowered framework named Learn-Evaluate-Beat (LEB) to mislead the fusion center.
Revised:  In this paper, we revisit this traditional security problem and propose a novel learning-empowered attack framework named Learning-Evaluation-Beating (LEB) to mislead the fusion center.
Edit intent: clarity
Original:  Based on the black-box nature of the fusion center in cooperative spectrum sensing process , our new perspective is to make the adversarial use of machine learning to construct a surrogate model of the fusion center's decision model.
Revised:  Based on the black-box nature of the fusion center in cooperative spectrum sensing , our new perspective is to make the adversarial use of machine learning to construct a surrogate model of the fusion center's decision model.
Edit intent: clarity
Original:  Then, we propose a generic algorithm to create malicious sensing data  .
Revised:  We propose a generic algorithm to create malicious sensing data .
Edit intent: coherence
Original:  Our real-world experiments show that the LEB attack is very effective to beat a wide range of existing defense strategies with an up to 82\% of success ratio.
Revised:  Our real-world experiments show that the LEB attack is effective to beat a wide range of existing defense strategies with an up to 82\% of success ratio.
Edit intent: clarity
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the proposed LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Edit intent: clarity
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Edit intent: coherence
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting defense, which can coexist with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Edit intent: clarity
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against LEB attack or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Edit intent: coherence
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks . We show that this defense is highly effective and reduces the overall disruption ratio reduction by up to 80\% of the LEB attacks .
Edit intent: coherence
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio of LEB attack by up to 80\% of the LEB attacks .
Edit intent: clarity
Original:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% of the LEB attacks .
Revised:  Given the gap between the new LEB attack and existing defenses, we introduce a non-invasive and parallel method named as influence-limiting policy sided with existing defenses to defend against the LEB-based or other similar attacks , which demonstrates a strong performance in terms of overall disruption ratio reduction by up to 80\% .
Edit intent: clarity
Original:  In line with literature on related inference problems, we consider the regime where the number of infected individuals is sublinear in the total population size.
Revised:  For the regime where the number of infected individuals is sublinear in the total population size.
Edit intent: clarity
Original:  Moreover, we propose and analyze an efficient greedy reconstruction algorithm that outperforms the best known sublinear algorithm (Karimi et al. 2019) for certain sparsity regimes.
Revised:  Moreover, we propose and analyze an efficient greedy reconstruction algorithm that outperforms the best known algorithm (Karimi et al. 2019) for certain sparsity regimes.
Edit intent: clarity
Original:  To this end, we can test groups of individuals where each test returns the total number of infected individuals in the tested pool .
Revised:  To this end, we can test groups of individuals where each test returns the total number of infected individuals in the tested group .
Edit intent: clarity
Original:  For the regime where the number of infected individuals is sublinear in the total population we derive the information-theoretic threshold for the minimum number of tests required to identify the infected individuals with high probability.
Revised:  For the regime where the number of infected individuals is sublinear in the population size we derive a sharp information-theoretic threshold for the minimum number of tests required to identify the infected individuals with high probability.
Edit intent: clarity
Original:  Such a threshold was so far only known for the case where the infected individuals are a constant fraction of the population (Alaoui et al. 2019 , Scarlett & Cevher 2017).
Revised:  Such a threshold was so far only known for the case where the infected individuals form a constant fraction of the population (Alaoui et al. 2019 , Scarlett & Cevher 2017).
Edit intent: clarity
Original:  Moreover, we propose and analyze an efficient greedy reconstruction algorithm that outperforms the best known algorithm (Karimi et al. 2019) for certain sparsity regimes .
Revised:  Moreover, we propose and analyze an efficient greedy reconstruction algorithm that outperforms the best known algorithm (Karimi et al. 2019) .
Edit intent: clarity
Original: The  conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures due to the two global reductions required each iteration.
Revised: The standard implementation of the conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures due to the two global reductions required each iteration.
Edit intent: clarity
Original: The  conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures due to the two global reductions required each iteration.
Revised: The conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures , due primarily to the two global reductions required each iteration.
Edit intent: clarity
Original: The  conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures due to the two global reductions required each iteration.
Revised: The conjugate gradient algorithm suffers from communication bottlenecks on parallel architectures due to the two global reductions required every iteration.
Edit intent: fluency
Original:  The convergence these variants are improved using a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for the true value, and then recomputed exactly later in the iteration .
Revised:  The convergence these variants are improved using a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly later in the iteration .
Edit intent: clarity
Original:  The convergence these variants are improved using a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for the true value, and then recomputed exactly later in the iteration .
Revised:  The convergence these variants are improved using a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for the true value, and then recomputed exactly at a later point in the iteration .
Edit intent: clarity
Original:  In this paper, we introduce several predict-and-recompute type conjugate gradient variants, which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Revised:  In this paper, we introduce several conjugate gradient variants, which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Edit intent: coherence
Original:  In this paper, we introduce several conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Revised:  In this paper, we study conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Edit intent: clarity
Original:  In this paper, we introduce several conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Revised:  In this paper, we introduce several conjugate gradient variants which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Edit intent: fluency
Original:  In this paper, we introduce several conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Revised:  In this paper, we introduce several conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of pipelined variants, matrix vector products.
Edit intent: fluency
Original:  In this paper, we introduce several conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix vector products.
Revised:  In this paper, we introduce several conjugate gradient variants , which decrease the runtime per iteration by overlapping global synchronizations, and in the case of our pipelined variants, matrix-vector products.
Edit intent: fluency
Original:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence properties nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Revised:  Through the use of a predict-and-recompute scheme, whereby recursively-updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence properties nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Edit intent: fluency
Original:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence properties nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Revised:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, these variants are observed to have convergence properties nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Edit intent: clarity
Original:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence properties nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Revised:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence behavior nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Edit intent: clarity
Original:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence properties nearly as good as the standard conjugate gradient problem implementation on every problem we tested.
Revised:  Through the use of a predict-and-recompute scheme, whereby recursively updated quantities are first used as a predictor for their true values and then recomputed exactly at a later point in the iteration, our variants are observed to have convergence properties nearly as good as the standard conjugate gradient implementation on a variety of test problems. We provide a rounding error analysis which provides insight into this observation.
Edit intent: clarity
Original:  It is also verified experimentally that our variants do indeed reduce  runtime per iteration in practice , and that they scale similarly to previously studied communication hiding variants.
Revised:  It is also verified experimentally that the variants studied do indeed reduce runtime per iteration in practice , and that they scale similarly to previously studied communication hiding variants.
Edit intent: clarity
Original:  It is also verified experimentally that our variants do indeed reduce  runtime per iteration in practice , and that they scale similarly to previously studied communication hiding variants.
Revised:  It is also verified experimentally that our variants do indeed reduce the runtime per iteration in practice , and that they scale similarly to previously studied communication hiding variants.
Edit intent: fluency
Original:  It is also verified experimentally that our variants do indeed reduce  runtime per iteration in practice , and that they scale similarly to previously studied communication hiding variants.
Revised:  It is also verified experimentally that our variants do indeed reduce runtime per iteration in practice and that they scale similarly to previously studied communication hiding variants.
Edit intent: fluency
Original:  It is also verified experimentally that our variants do indeed reduce  runtime per iteration in practice , and that they scale similarly to previously studied communication hiding variants.
Revised:  It is also verified experimentally that our variants do indeed reduce runtime per iteration in practice , and that they scale similarly to previously-studied communication-hiding variants.
Edit intent: fluency
Original:  Finally, because our variants achieve good convergence without the use of any additional input parameters, they have the potential to be used in place of the standard conjugate gradient implementation in a range of applications.
Revised:  Finally, because these variants achieve good convergence without the use of any additional input parameters, they have the potential to be used in place of the standard conjugate gradient implementation in a range of applications.
Edit intent: clarity
Original:  These phenomena are usually inevitable in a cost-effective practical HSTN.
Revised:  These phenomena are usually inevitable in a practical HSTN.
Edit intent: clarity
Original: Solidity is an object-oriented and high-level language for writing smart contracts which are used to execute, verify and enforce credible transactions on permissionless blockchains.
Revised: Solidity is an object-oriented and high-level language for writing smart contracts that are used to execute, verify and enforce credible transactions on permissionless blockchains.
Edit intent: clarity
Original:  In the last few years, analysis of vulnerabilities in smart contracts has raised considerable interest and numerous techniques have been proposed  . Current techniques lack traceability in source code and have widely differing work flows.
Revised:  In the last few years, analysis of smart contracts has raised considerable interest and numerous techniques have been proposed . Current techniques lack traceability in source code and have widely differing work flows.
Edit intent: clarity
Original:  Many real-world networks consist of billions of nodes and edges of multiple types  and each node is associated with different attributes.
Revised:  Many real-world networks consist of billions of nodes and edges of multiple types , and each node is associated with different attributes.
Edit intent: fluency
Original:  We also give the theoretical analysis of the proposed framework, showing its connection with previous works and proving its better generalization ability .
Revised:  We also give the theoretical analysis of the proposed framework, showing its connection with previous works and proving its better expressiveness .
Edit intent: clarity
Original:  We conduct systematical evaluations for the proposed framework on four different genres of challenging datasets: Amazon, YouTube, Twitter, and Alibaba dataset . Experimental results demonstrate that with the learned embeddings from the proposed framework, we can achieve statistically significant improvements (e.g., 5.99-28.23\% lift by F1 scores;
Revised:  We conduct systematical evaluations for the proposed framework on four different genres of challenging datasets: Amazon, YouTube, Twitter, and Alibaba . Experimental results demonstrate that with the learned embeddings from the proposed framework, we can achieve statistically significant improvements (e.g., 5.99-28.23\% lift by F1 scores;
Edit intent: coherence
Original:  p<<0.01, t-test) over previous state-of-the-arts for link prediction.
Revised:  p<<0.01, t-test) over previous state-of-the-art methods for link prediction.
Edit intent: clarity