wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our theory provides a simple explanation for the emergence of aneuploid states in a population  .
Revised:  Our theory provides a simple explanation for the maintenance of aneuploid states in a population .
Edit intent: clarity
Original: The main computational cost in the training of and prediction with Convolution Neural Networks (CNNs) typically stems from the convolution .
Revised: The main computational cost in the training of and prediction with CNNs .
Edit intent: clarity
Original:  In this paper, we present three novel ways to parameterize the convolution more efficiently, significantly decreasing the computational complexity.
Revised:  In this paper, we present novel ways to parameterize the convolution more efficiently, significantly decreasing the computational complexity.
Edit intent: clarity
Original:  The second and third architectures arise as discretizations of a new type of residual neural network (ResNet) that is inspired by Partial Differential Equations (PDEs) or reaction-diffusion type.
Revised:  The second and third architectures arise as new types of residual neural network (ResNet) that is inspired by Partial Differential Equations (PDEs) or reaction-diffusion type.
Edit intent: clarity
Original:  The second and third architectures arise as discretizations of a new type of residual neural network (ResNet) that is inspired by Partial Differential Equations (PDEs) or reaction-diffusion type.
Revised:  The second and third architectures arise as discretizations of a new type of residual neural network (ResNet) that can be seen as discretizations of a Partial Differential Equations (PDEs) or reaction-diffusion type.
Edit intent: clarity
Original:   We outline in our numerical experiments that the proposed architectures, although considerably reducing the number of trainable weights, yield comparable accuracy to existing CNNs that are fully coupled in the channel dimension.
Revised:  We outline in our experiments that the proposed architectures, although considerably reducing the number of trainable weights, yield comparable accuracy to existing CNNs that are fully coupled in the channel dimension.
Edit intent: clarity
Original:  We present a hybrid macro/micro level backpropagation algorithm (HM2-BP)  for training multi-layer SNNs.
Revised:  We present a hybrid macro/micro level backpropagation (HM2-BP) for training multi-layer SNNs.
Edit intent: clarity
Original:  We present a hybrid macro/micro level backpropagation algorithm (HM2-BP)  for training multi-layer SNNs.
Revised:  We present a hybrid macro/micro level backpropagation algorithm (HM2-BP) algorithm for training multi-layer SNNs.
Edit intent: fluency
Original:  We evaluate the proposed HM2-BP algorithm by training deep fully connected and convolutional SNNs based on the static MNIST 13 and dynamic neuromorphic N-MNIST 22 datasets.
Revised:  We evaluate the proposed HM2-BP algorithm by training deep fully connected and convolutional SNNs based on the static MNIST 13 and dynamic neuromorphic N-MNIST datasets.
Edit intent: clarity
Original:  We evaluate the proposed HM2-BP algorithm by training deep fully connected and convolutional SNNs based on the static MNIST  and dynamic neuromorphic N-MNIST datasets . HM2-BP achieves an accuracy level of 99.49\% and 98.88\% for MNIST 14 and N-MNIST 25 ,
Revised:  We evaluate the proposed HM2-BP algorithm by training deep fully connected and convolutional SNNs based on the static MNIST 14 and dynamic neuromorphic N-MNIST datasets . HM2-BP achieves an accuracy level of 99.49\% and 98.88\% for MNIST 14 and N-MNIST 25 ,
Edit intent: fluency
Original:  respectively, outperforming the best-reported performances obtained from the existing SNN BP algorithms on various challenging datasets ]  ] . It also achieves competitive performances surpassing those of conventional deep learning models when dealing with asynchronous spiking streams .
Revised:  respectively, outperforming the best reported performances obtained from the existing SNN BP algorithms on various challenging datasets ] ] . It also achieves competitive performances surpassing those of conventional deep learning models when dealing with asynchronous spiking streams .
Edit intent: fluency
Original: This paper proposes some novel efficient and accurate adaptive two-grid (ATG) finite element algorithms for linear and nonlinear partial differential equations (PDEs).
Revised: This paper proposes some efficient and accurate adaptive two-grid (ATG) finite element algorithms for linear and nonlinear partial differential equations (PDEs).
Edit intent: clarity
Original:  In these algorithms , they use the information of the solutions on  k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on  (k+1)-th level adaptive meshes .
Revised:  The main idea of these algorithms is to use the information of the solutions on k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on (k+1)-th level adaptive meshes .
Edit intent: coherence
Original:  In these algorithms , they use the information of the solutions on  k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on  (k+1)-th level adaptive meshes .
Revised:  In these algorithms , they use the information of the solutions on the k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on (k+1)-th level adaptive meshes .
Edit intent: fluency
Original:  In these algorithms , they use the information of the solutions on  k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on  (k+1)-th level adaptive meshes .
Revised:  In these algorithms , they use the information of the solutions on k-th level adaptive meshes to find the solutions on (k+1)-th level adaptive meshes .
Edit intent: coherence
Original:  In these algorithms , they use the information of the solutions on  k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on  (k+1)-th level adaptive meshes .
Revised:  In these algorithms , they use the information of the solutions on k-th level adaptive meshes , instead of on the uniform meshes, to find the solutions on the (k+1)-th level adaptive meshes .
Edit intent: fluency
Original:  They transform the non-symmetric positive definite (non-SPD) PDEs into symmetric positive definite (SPD) PDEs , and transform the nonlinear PDEs into the linear PDEs.
Revised:  They transform the non-symmetric positive definite (non-SPD) PDEs into symmetric positive definite (SPD) PDEs or transform the nonlinear PDEs into the linear PDEs.
Edit intent: coherence
Original:  These algorithms have the following advantages: 1. Comparing with adaptive methods, they do not need to solve the  nonlinear systems;
Revised:  These algorithms have the following advantages: they do not need to solve the nonlinear systems;
Edit intent: coherence
Original:  2. Comparing with two-grid methods, the degrees of freedom are largely reduced;
Revised:  the degrees of freedom are largely reduced;
Edit intent: coherence
Original:  they are especially efficient when many steps of mesh refinements are used since the computational cost of computing solutions on uniform meshes is large then . Next, this paper constructs a residue-type a posteriori error estimator for general non-SPD linear problems.
Revised:  they are especially efficient when many steps of mesh refinements are used since the computational cost of computing solutions on uniform meshes is large then . Next, this paper constructs residue-type a posteriori error estimator for general non-SPD linear problems.
Edit intent: fluency
Original:  Finally , the convergence of the error on the adaptive meshes is proved when bisection is used for the mesh refinement   .
Revised:  Finally , the convergence of the errors on the adaptive meshes is proved when bisection is used for the mesh refinement .
Edit intent: coherence
Original:  The main idea of these algorithms is to use the information of the solutions on the k-th level adaptive meshes to find the solutions on the (k+1)-th level adaptive meshes which are constructed by performing adaptive element bisections to the k-th level adaptive meshes.
Revised:  The main idea of these algorithms is to utilize the solutions on the k-th level adaptive meshes to find the solutions on the (k+1)-th level adaptive meshes which are constructed by performing adaptive element bisections to the k-th level adaptive meshes.
Edit intent: clarity
Original:  The main idea of these algorithms is to use the information of the solutions on the k-th level adaptive meshes to find the solutions on the (k+1)-th level adaptive meshes which are constructed by performing adaptive element bisections to the k-th level adaptive meshes.
Revised:  The main idea of these algorithms is to use the information of the solutions on the k-th level adaptive meshes to find the solutions on the (k+1)-th level adaptive meshes which are constructed by performing adaptive element bisections on the k-th level adaptive meshes.
Edit intent: fluency
Original:  These algorithms transform the non-symmetric positive definite (non-SPD) PDEs  into symmetric positive definite (SPD) PDEs or transform the nonlinear PDEs into the linear PDEs.
Revised:  These algorithms transform non-symmetric positive definite (non-SPD) PDEs into symmetric positive definite (SPD) PDEs or transform the nonlinear PDEs into the linear PDEs.
Edit intent: fluency
Original:  Next, this paper constructs residue-type a posteriori {\em  error estimators, which are shown to be reliable and efficient.
Revised:  Next, this paper constructs residue-type {\em error estimators, which are shown to be reliable and efficient.
Edit intent: clarity
Original:  Next, this paper constructs residue-type a posteriori {\em  error estimators, which are shown to be reliable and efficient.
Revised:  Next, this paper constructs residue-type a posteriori {\em a posteriori error estimators, which are shown to be reliable and efficient.
Edit intent: fluency
Original:  Due to the low regularity of the numerical solution, the oscillation terms may not be higher-order terms (h.o.t.) . This paper overcomes this difficulty by establishing an upper bound of the oscillation terms .
Revised:  The key ingredient in proving the efficiency is to establish an upper bound of the oscillation terms, which may not be higher-order terms (h.o.t.) . This paper overcomes this difficulty by establishing an upper bound of the oscillation terms .
Edit intent: coherence
Original:  Due to the low regularity of the numerical solution, the oscillation terms may not be higher-order terms (h.o.t.) . This paper overcomes this difficulty by establishing an upper bound of the oscillation terms .
Revised:  Due to the low regularity of the numerical solution, the oscillation terms may not be higher-order terms (h.o.t.) due to the low regularity of the numerical solution .
Edit intent: clarity
Original:  Furthermore, the convergence of the errors on the adaptive meshes is proved when bisection is used for the mesh refinement .
Revised:  Furthermore, the convergence of the algorithms is proved when bisection is used for the mesh refinement .
Edit intent: clarity
Original:  Furthermore, the convergence of the errors on the adaptive meshes is proved when bisection is used for the mesh refinement .
Revised:  Furthermore, the convergence of the errors on the adaptive meshes is proved when bisection is used for the mesh refinements .
Edit intent: clarity
Original:  Finally, a few numerical tests are done to verify the accuracy and efficiency of the ATG finite element algorithms, compared to regular adaptive finite element algorithms and two grid finite element algorithms [ 21 ].
Revised:  Finally, numerical experiments are provided to verify the accuracy and efficiency of the ATG finite element algorithms, compared to regular adaptive finite element algorithms and two grid finite element algorithms [ 21 ].
Edit intent: clarity
Original:  Finally, a few numerical tests are done to verify the accuracy and efficiency of the ATG finite element algorithms, compared to regular adaptive finite element algorithms and two grid finite element algorithms [ 21 ].
Revised:  Finally, a few numerical tests are done to verify the accuracy and efficiency of the ATG finite element algorithms, compared to regular adaptive finite element algorithms and two-grid finite element algorithms [ 21 ].
Edit intent: fluency
Original:  Collectively, these challenges severely limit the applicability of these approaches to real world problems.
Revised:  Collectively, these challenges severely limit the applicability of these approaches to real-world problems.
Edit intent: fluency
Original:  However, EAs typically suffer with high sample complexity and struggle to solve problems that require optimization of a large number of parameters.
Revised:  However, EAs typically suffer from high sample complexity and struggle to solve problems that require optimization of a large number of parameters.
Edit intent: fluency
Original:  Experiments in a range of challenging continuous control benchmark tasks demonstrate that ERL significantly outperforms prior DRL and EA methods , achieving state-of-the-art performances .
Revised:  Experiments in a range of challenging continuous control benchmarks demonstrate that ERL significantly outperforms prior DRL and EA methods , achieving state-of-the-art performances .
Edit intent: clarity
Original:  Experiments in a range of challenging continuous control benchmark tasks demonstrate that ERL significantly outperforms prior DRL and EA methods , achieving state-of-the-art performances .
Revised:  Experiments in a range of challenging continuous control benchmark tasks demonstrate that ERL significantly outperforms prior DRL and EA methods .
Edit intent: clarity
Original:  The use of efficient loop scheduling techniques  is crucial for improving their performance , often degraded by load imbalance, on high-performance computing (HPC) platforms.
Revised:  The use of efficient loop scheduling techniques is crucial for improving their performance on high-performance computing (HPC) platforms.
Edit intent: clarity
Original:  The performance reproduction and prediction confirm that the present implementation of these DLS techniques both, in simulation and natively, adheres to their original description.
Revised:  The performance reproduction and prediction confirm that the present implementation of the DLS techniques considered both, in simulation and natively, adheres to their original description.
Edit intent: clarity
Original:  Hence, in the context of neural networks  it alleviates the need for back propagation and reduces the memory consumption dramatically.
Revised:  Hence, in the context of neural networks , it alleviates the need for back propagation and reduces the memory consumption dramatically.
Edit intent: fluency
Original: A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges(vertices) of the path . An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if between each pair of distinct vertices of the graph there is a conflict-free path .
Revised: A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of its edges(vertices) of the path . An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if between each pair of distinct vertices of the graph there is a conflict-free path .
Edit intent: clarity
Original: A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges(vertices) of the path . An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if between each pair of distinct vertices of the graph there is a conflict-free path .
Revised: A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges(vertices) . An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if between each pair of distinct vertices of the graph there is a conflict-free path .
Edit intent: clarity
Original: A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges(vertices) of the path . An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if between each pair of distinct vertices of the graph there is a conflict-free path .
Revised: A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges(vertices) of the path . An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if there is a conflict-free path .
Edit intent: clarity
Original:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices of the graph there exists a conflict-free shortest path .
Revised:  We call the graph\emph{strongly conflict-free connected between each pair of distinct vertices of the graph there exists a conflict-free shortest path .
Edit intent: clarity
Original:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices of the graph there exists a conflict-free shortest path .
Revised:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices . We call the graph G there exists a conflict-free shortest path .
Edit intent: clarity
Original:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices of the graph there exists a conflict-free shortest path .
Revised:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices of the graphstrongly conflict-free connected there exists a conflict-free shortest path .
Edit intent: fluency
Original:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices of the graph there exists a conflict-free shortest path .
Revised:  We call the graph\emph{strongly conflict-free connected if between each pair of distinct vertices of the graphif there exists a conflict-free shortest path .
Edit intent: fluency
Original:  In this paper, we study the problem : Given a connected graph G and a coloring c: E(or\ V)\rightarrow \{1,2,\cdots,k\} \ (k\geq 1) of G , determine whether or not G is  conflict-free (vertex-)connectedunder the coloring c.
Revised:  In this paper, we first investigate the question : Given a connected graph G and a coloring c: E(or\ V)\rightarrow \{1,2,\cdots,k\} \ (k\geq 1) of G , determine whether or not G is conflict-free (vertex-)connectedunder the coloring c.
Edit intent: clarity
Original:  In this paper, we study the problem : Given a connected graph G and a coloring c: E(or\ V)\rightarrow \{1,2,\cdots,k\} \ (k\geq 1) of G , determine whether or not G is  conflict-free (vertex-)connectedunder the coloring c.
Revised:  In this paper, we study the problem : Given a connected graph G and a coloring c: E(or\ V)\rightarrow \{1,2,\cdots,k\} \ (k\geq 1) of the graph , determine whether or not G is conflict-free (vertex-)connectedunder the coloring c.
Edit intent: fluency
Original:  We provide a polynomial-time algorithm for this problem .
Revised:  We solve this question by providing polynomial-time algorithm for this problem .
Edit intent: clarity
Original:  We provide a polynomial-time algorithm for this problem .
Revised:  We provide a polynomial-time algorithms .
Edit intent: clarity
Original:  At last, we show that it is NP-hard to decide whether scfc(G)\leq k (k\geq 3) for a given graph G  .
Revised:  Finally, we prove that the problem of deciding whether scfc(G)\leq k (k\geq 3) for a given graph G .
Edit intent: clarity
Original: We propose a novel technique for faster DNN training which systematically applies sample-based approximation to the constituent tensor operations, i.e., matrix multiplications and convolutions.
Revised: We propose a novel technique for faster deep neural network training which systematically applies sample-based approximation to the constituent tensor operations, i.e., matrix multiplications and convolutions.
Edit intent: clarity
Original:  We introduce new sampling techniques, study their theoretical properties, and prove that they provide the same convergence guarantees when applied to SGD DNN training.
Revised:  We introduce new sampling techniques, study their theoretical properties, and prove that they provide the same convergence guarantees when applied to SGD training.
Edit intent: clarity
Original:  In our article, we proposed, inter alia, that ' the daily travels of mandrills could be seen as a way to escape contaminated habitats on a local scale ' . In their article, Bicca-Marques and Calegaro-Marques [2016] proposed an alternative mechanism that they considered to be more parsimonious.
Revised:  In our article, we proposed, inter alia, that " the daily travels of mandrills could be seen as a way to escape contaminated habitats on a local scale ' . In their article, Bicca-Marques and Calegaro-Marques [2016] proposed an alternative mechanism that they considered to be more parsimonious.
Edit intent: fluency
Original:  In our article, we proposed, inter alia, that ' the daily travels of mandrills could be seen as a way to escape contaminated habitats on a local scale ' . In their article, Bicca-Marques and Calegaro-Marques [2016] proposed an alternative mechanism that they considered to be more parsimonious.
Revised:  In our article, we proposed, inter alia, that ' the daily travels of mandrills could be seen as a way to escape contaminated habitats on a local scale " . In their article, Bicca-Marques and Calegaro-Marques [2016] proposed an alternative mechanism that they considered to be more parsimonious.
Edit intent: fluency
Original:  In the second section ('Parsimony'), we discuss the putative parsimony of the two competing scenario.
Revised:  We then discuss the putative parsimony of the two competing scenario.
Edit intent: coherence
Original:  In particular, recent work has showed how these attacks often take place as a result of "raids," i.e., organized efforts coordinated by ad-hoc mobs  from third-party communities.
Revised:  Prior work has shown how these attacks often take place as a result of "raids," i.e., organized efforts coordinated by ad-hoc mobs from third-party communities.
Edit intent: clarity
Original:  In particular, recent work has showed how these attacks often take place as a result of "raids," i.e., organized efforts coordinated by ad-hoc mobs  from third-party communities.
Revised:  In particular, recent work has showed how these attacks often take place as a result of "raids," i.e., organized efforts by ad-hoc mobs from third-party communities.
Edit intent: clarity
Original:  Despite the increasing relevance of this phenomenon,  online services often lack effective countermeasures to mitigate it.
Revised:  Despite the increasing relevance of this phenomenon, however, online services often lack effective countermeasures to mitigate it.
Edit intent: coherence
Original:  Therefore, the de-facto solution is to reactively rely on user reports and human reviews .
Revised:  Therefore, the de-facto solution is to reactively rely on user reports and human moderation .
Edit intent: clarity
Original:  In this paper, we propose an automated solution to identify  videos that are likely to be targeted by coordinated harassers  . First, we characterize and model YouTube videos along several axes (metadata, audio transcripts, thumbnails) based on a ground truth dataset of raid victims .
Revised:  In this paper, we propose an automated solution to identify YouTube videos that are likely to be targeted by coordinated harassers . First, we characterize and model YouTube videos along several axes (metadata, audio transcripts, thumbnails) based on a ground truth dataset of raid victims .
Edit intent: fluency