wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our approach combines recent ideas from adaptive dropouts and randomized hashing for maximum inner product search to select only the nodes with the highest activation efficiently.
Revised:  Our approach combines recent ideas from adaptive dropouts and randomized hashing for maximum inner product search to select the nodes with the highest activation efficiently.
Edit intent: clarity
Original:  Our new algorithm for training deep networks reduces the overall computational cost ,of both feed-forward pass and backpropagation, by operating on significantly fewer  nodes.
Revised:  Our new algorithm for deep learning reduces the overall computational cost ,of both feed-forward pass and backpropagation, by operating on significantly fewer nodes.
Edit intent: clarity
Original:  Our new algorithm for training deep networks reduces the overall computational cost ,of both feed-forward pass and backpropagation, by operating on significantly fewer  nodes.
Revised:  Our new algorithm for training deep networks reduces the overall computational cost of forward and back-propagation by operating on significantly fewer nodes.
Edit intent: clarity
Original:  As a consequence, our algorithm only requires 5\% of computations (multiplications) compared to traditional algorithms, without any loss in the accuracy .
Revised:  As a consequence, our algorithm uses only 5\% of computations (multiplications) compared to traditional algorithms, without any loss in the accuracy .
Edit intent: clarity
Original:  Furthermore, due to very sparse gradient updates, our algorithm is ideally suited for asynchronous  training leading to near linear speedup with increasing parallelism .
Revised:  Furthermore, due to very sparse gradient updates, our algorithm is ideally suited for asynchronous and parallel training leading to near linear speedup with increasing parallelism .
Edit intent: clarity
Original:  Furthermore, due to very sparse gradient updates, our algorithm is ideally suited for asynchronous  training leading to near linear speedup with increasing parallelism .
Revised:  Furthermore, due to very sparse gradient updates, our algorithm is ideally suited for asynchronous training leading to near linear speedup with increasing number of cores .
Edit intent: clarity
Original:  It ensures a maximum load that is exponentially better than the strategy of placing each ball uniformly at random . V\"ocking showed that a slightly asymmetric variant, Left[d], provides a further significant improvement.
Revised:  With high probability, the maximum load under Greedy[d] is exponentially lower than the result when balls are placed uniformly randomly . V\"ocking showed that a slightly asymmetric variant, Left[d], provides a further significant improvement.
Edit intent: clarity
Original:  Although the number of probes could be quite large for some of the balls, we show that FirstDiff[d] requires only  d probes on average per ball (in both the standard and the heavily-loaded settings).
Revised:  Although the number of probes could be quite large for some of the balls, we show that FirstDiff[d] requires only at most d probes on average per ball (in both the standard and the heavily-loaded settings).
Edit intent: clarity
Original:  We show that the SMLP behaves identically, during both prediction and training, to a conventional deep network of rectified-linear units  in the limiting case where we run the spiking network for a long time.
Revised:  We show that the spiking Multi-Layer Perceptron behaves identically, during both prediction and training, to a conventional deep network of rectified-linear units in the limiting case where we run the spiking network for a long time.
Edit intent: clarity
Original:  We show that the SMLP behaves identically, during both prediction and training, to a conventional deep network of rectified-linear units  in the limiting case where we run the spiking network for a long time.
Revised:  We show that the SMLP behaves identically, during both prediction and training, to a conventional deep network of rectified-linear units , in the limiting case where we run the spiking network for a long time.
Edit intent: fluency
Original:  In this paper, we derive a closed-form expression for  the epidemic threshold of the ASIS model in arbitrary networks with heterogeneous node and edge dynamics.
Revised:  In this paper, we derive a closed-form expression for a lower bound on the epidemic threshold of the ASIS model in arbitrary networks with heterogeneous node and edge dynamics.
Edit intent: clarity
Original:  For networks with homogeneous node and edge dynamics, we show that the resulting epidemic threshold \blue{lower bound} is proportional to the  threshold of the standard SIS model over static networks  .
Revised:  For networks with homogeneous node and edge dynamics, we show that the resulting \blue{lower bound} is proportional to the threshold of the standard SIS model over static networks .
Edit intent: clarity
Original:  For networks with homogeneous node and edge dynamics, we show that the resulting epidemic threshold \blue{lower bound} is proportional to the  threshold of the standard SIS model over static networks  .
Revised:  For networks with homogeneous node and edge dynamics, we show that the resulting epidemic threshold \blue{lower bound} is proportional to the epidemic threshold of the standard SIS model over static networks .
Edit intent: fluency
Original: In high energy physics  scholarly papers circulate primarily through online preprint archives based on a centralized repository, arXiv .org , that physicists simply refer to as 'the archive.'
Revised: In high energy physics , scholarly papers circulate primarily through online preprint archives based on a centralized repository, arXiv .org , that physicists simply refer to as 'the archive.'
Edit intent: fluency
Original: In high energy physics  scholarly papers circulate primarily through online preprint archives based on a centralized repository, arXiv .org , that physicists simply refer to as 'the archive.'
Revised: In high energy physics scholarly papers circulate primarily through online preprint archives based on a centralized repository, arXiv , that physicists simply refer to as 'the archive.'
Edit intent: clarity
Original: In high energy physics  scholarly papers circulate primarily through online preprint archives based on a centralized repository, arXiv .org , that physicists simply refer to as 'the archive.'
Revised: In high energy physics scholarly papers circulate primarily through online preprint archives based on a centralized repository, arXiv .org , that physicists simply refer to as "the archive".
Edit intent: fluency
Original:  This is not  a tool for preservation and memory, but rather a space of flows where written objects are detected and then disappear, and their authors made available for scrutiny.
Revised:  This is not just a tool for preservation and memory, but rather a space of flows where written objects are detected and then disappear, and their authors made available for scrutiny.
Edit intent: coherence
Original:  This is not  a tool for preservation and memory, but rather a space of flows where written objects are detected and then disappear, and their authors made available for scrutiny.
Revised:  This is not a tool for preservation and memory, but also a space of flows where written objects are detected and then disappear, and their authors made available for scrutiny.
Edit intent: coherence
Original:  This is not  a tool for preservation and memory, but rather a space of flows where written objects are detected and then disappear, and their authors made available for scrutiny.
Revised:  This is not a tool for preservation and memory, but rather a space of flows where written objects are detected and their authors made available for scrutiny.
Edit intent: clarity
Original:  In this work I analyse the reading and publishing practices of two subsets of particle physicists, theorists and experimentalists.
Revised:  In this work I analyze the reading and publishing practices of two subsets of particle physicists, theorists and experimentalists.
Edit intent: fluency
Original:  In order to be recognized as legitimate and productive members of their community, physicists need to abide by the temporalities and authorial practices structured by the archive.
Revised:  In order to be recognized as legitimate and productive members of their community, they need to abide by the temporalities and authorial practices structured by the archive.
Edit intent: clarity
Original:  As digital archives for the exchange of preprint articles emerge in other scientific fields, physics could help shed light on general transformations of contemporary scholarly communication systems.
Revised:  As digital platforms for the exchange of preprint articles emerge in other scientific fields, physics could help shed light on general transformations of contemporary scholarly communication systems.
Edit intent: clarity
Original:  As digital archives for the exchange of preprint articles emerge in other scientific fields, physics could help shed light on general transformations of contemporary scholarly communication systems.
Revised:  As digital archives for the exchange of scholarly articles emerge in other scientific fields, physics could help shed light on general transformations of contemporary scholarly communication systems.
Edit intent: clarity
Original:  As digital archives for the exchange of preprint articles emerge in other scientific fields, physics could help shed light on general transformations of contemporary scholarly communication systems.
Revised:  As digital archives for the exchange of preprint articles emerge in other fields, high energy physics could help shed light on general transformations of contemporary scholarly communication systems.
Edit intent: clarity
Original:  By employing graph-theoretic tools , we formulate an efficient algorithm for answering this question.
Revised:  By employing graph-theoretic techniques , we formulate an efficient algorithm for answering this question.
Edit intent: clarity
Original:  Here we present a new design of an external memory, wherein memories are stored in an Euclidean key space \mathbb R^n. An LSTM controller performs read and write via specialized structures called read and write heads , following the design of Neural Turing Machine .
Revised:  Here we present a new design of an external memory, wherein memories are stored in an Euclidean key space \mathbb R^n. An LSTM controller performs read and write via specialized read and write heads , following the design of Neural Turing Machine .
Edit intent: clarity
Original:  Here we present a new design of an external memory, wherein memories are stored in an Euclidean key space \mathbb R^n. An LSTM controller performs read and write via specialized structures called read and write heads , following the design of Neural Turing Machine .
Revised:  Here we present a new design of an external memory, wherein memories are stored in an Euclidean key space \mathbb R^n. An LSTM controller performs read and write via specialized structures called read and write heads .
Edit intent: coherence
Original:  In this way, the "L" and "R" instructions of a traditional Turing Machine is generalized to arbitrary elements of a fixed Lie group action.
Revised:  In this way, the "L" and "R" instructions of a traditional Turing Machine are generalized to arbitrary elements of a fixed Lie group action.
Edit intent: fluency
Original:  As LANTM is differentiable end-to-end, training was done with RMSProp.
Edit intent: coherence
Original:  We found the right configuration of LANTM to be capable of learning different permutation and arithmetic tasks and extrapolating to at least twice the input size, all with the number of parameters 2 orders of magnitude below that for the LSTM baseline .
Revised:  We found the right configuration of LANTM to outperform the baseline in all of our experiments .
Edit intent: clarity
Original:  In this paper, we  introduce the first secondary storage array-relation dot-product join  operator between a set of sparse arrays and a dense relation targeted.
Revised:  In this paper, we introduce the first array-relation dot-product join operator between a set of sparse arrays and a dense relation targeted.
Edit intent: coherence
Original:  The paramount challenge in designing such an operator is how to optimally schedule access to the dense relation based on the sparse non-contiguous entries in the sparse arrays.
Revised:  The paramount challenge in designing such an operator is how to optimally schedule access to the dense relation based on the non-contiguous entries in the sparse arrays.
Edit intent: clarity
Original:  We prove that this problem is NP-hard and propose a practical solution characterized by two important technical contributions---dynamic batch processing and array reordering.
Revised:  We prove that this problem is NP-hard and propose a practical solution characterized by two technical contributions---dynamic batch processing and array reordering.
Edit intent: clarity
Original:  We  execute extensive experiments over synthetic and real data that confirm the minimal overhead the operator incurs when sufficient memory is available and the graceful degradation it suffers as memory resources become scarce.
Revised:  We execute extensive experiments over synthetic and real data that confirm the minimal overhead the operator incurs when sufficient memory is available and the graceful degradation it suffers as memory becomes scarce.
Edit intent: clarity
Original:  Moreover, dot-product join achieves an order of magnitude reduction in execution time for Big Model analytics over alternative in-database solutions.
Revised:  Moreover, dot-product join achieves an order of magnitude reduction in execution time over alternative in-database solutions.
Edit intent: clarity
Original:  Comput. , 215, 4, pp. 1622--1645, 2009  the authors proposed a method of summation of some slowly convergent series.
Revised:  Comput. 215, 4, pp. 1622--1645, 2009 the authors proposed a method of summation of some slowly convergent series.
Edit intent: fluency
Original:  Comput. , 215, 4, pp. 1622--1645, 2009  the authors proposed a method of summation of some slowly convergent series.
Revised:  Comput. , 215, 1622--1645, 2009 the authors proposed a method of summation of some slowly convergent series.
Edit intent: clarity
Original:  Comput. , 215, 4, pp. 1622--1645, 2009  the authors proposed a method of summation of some slowly convergent series.
Revised:  Comput. , 215, 4, pp. 1622--1645, 2009 ), the authors proposed a method of summation of some slowly convergent series.
Edit intent: fluency
Original:  The purpose of this note is to give more  analysis for this transformation, including the convergence acceleration theorem , in the case of summation of generalized hypergeometric series.
Revised:  The purpose of this note is to give more analysis for this transformation, including the convergence acceleration theorem in the case of summation of generalized hypergeometric series.
Edit intent: fluency
Original:  In this paper, we dramatically improve upon the known upper bounds for generalised colouring numbers for graphs excluding a fixed minor, from the exponential bounds of Grohe et al.
Revised:  In this paper, we dramatically improve upon the known upper bounds for generalised colouring numbers for graphs excluding a fixed minor, from the exponential bounds of Grohe 
Edit intent: clarity
Original:  \ to a linear bound for the r-colouring number col_r and a polynomial bound for the weak r-colouring number wcol_r.
Revised:  et al. to a linear bound for the r-colouring number col_r and a polynomial bound for the weak r-colouring number wcol_r.
Edit intent: clarity
Original:  In the case of graphs G of bounded genus g, we improve the bounds to col_r(G)\le(2g+3)(2r+1) (and even col_r(G)\le5r+1 if g=0, i.e. \ if G is planar) and \mathrm{wcol}_r(G)\le\Bigl(2g+\binom{r+2}{2}\Bigr)\,(2r+1).
Revised:  In the case of graphs G of bounded genus g, we improve the bounds to col_r(G)\le(2g+3)(2r+1) (and even col_r(G)\le5r+1 if g=0, i.e. if G is planar) and \mathrm{wcol}_r(G)\le\Bigl(2g+\binom{r+2}{2}\Bigr)\,(2r+1).
Edit intent: fluency
Original: We analyze the network of pig trade in Germany  with respect to its ability to spread infectious diseases.
Revised: Background: Animal trade plays an important role for the spread of infectious diseases in livestock populations. As a case study, we consider pig trade in Germany with respect to its ability to spread infectious diseases.
Edit intent: coherence
Original: We analyze the network of pig trade in Germany  with respect to its ability to spread infectious diseases.
Revised: We analyze the network of pig trade in Germany with respect to its potential to spread infectious diseases.
Edit intent: clarity
Original:  These characteristics are on the contrary of great importance for  any general spreading process on this particular network.
Revised:  These characteristics are on the contrary of great importance for understanding any general spreading process on this particular network.
Edit intent: clarity
Original:  A remarkable feature of the capacity achieving scheme is that if it is projected onto any subset of messages by eliminating the remaining messages, it also achieves the PIR capacity for that subset of messages.
Revised:  A remarkable feature of the capacity achieving scheme is that if we eliminate any subset of messages by eliminating the remaining messages, it also achieves the PIR capacity for that subset of messages.
Edit intent: clarity
Original:  A remarkable feature of the capacity achieving scheme is that if it is projected onto any subset of messages by eliminating the remaining messages, it also achieves the PIR capacity for that subset of messages.
Revised:  A remarkable feature of the capacity achieving scheme is that if it is projected onto any subset of messages by eliminating the remaining messages, it also achieves the PIR capacity for the remaining subset of messages.
Edit intent: clarity
Original: In this paper we determine the complexity of a broad class of problems that extends  temporal constraint satisfaction problems.
Revised: In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems.
Edit intent: fluency
Original:  the question is whether these formulas are satisfied by any finite partial order or not.
Revised:  the question is whether this input is satisfied by any finite partial order or not.
Edit intent: clarity
Original:  We show that every such problem is NP-complete or can be solved in polynomial time, depending on the set \Phi.
Revised:  We show that every such problem is NP-complete or can be solved in polynomial time, depending on \Phi.
Edit intent: clarity
Original: This paperproposes a dynamic Stackelberg repeated game for decentralized Device-to-Device (  D2D) communications overlaying cellular communications .
Revised: User-behavior-aware communications will be a key feature of future generation cellular networks, so user experience is enhanced with greater benefit to users. In this paper, a user-behavior-aware Stackelberg ( D2D) communications overlaying cellular communications .
Edit intent: coherence
Original:  and minimize transmit power , while maximizing packet delivery ratio (PDR)  for all D2D users .
Revised:  and minimize transmit power , while maximizing packet delivery ratio (PDR) for all D2D pairs .
Edit intent: clarity
Original:  The Stackelberg game architecture consists of a single leader(base station - BS)and multiple followers (D2D users), where the leader selects its satisfaction with the social welfare of the D2D users by considering the reaction of the followers from the charged price it assigns.
Revised:  The Stackelberg leader, base station (BS), selects its satisfaction with the social welfare of the D2D users by considering the reaction of the followers from the charged price it assigns.
Edit intent: clarity
Original:  The Stackelberg game architecture consists of a single leader(base station - BS)and multiple followers (D2D users), where the leader selects its satisfaction with the social welfare of the D2D users by considering the reaction of the followers from the charged price it assigns.
Revised:  The Stackelberg game architecture consists of a single leader(base station - BS)and multiple followers (D2D users), where the leader selects its satisfaction with the social welfare of the D2D followers by considering the reaction of the followers from the charged price it assigns.
Edit intent: fluency
Original:  The followers on the other hand select transmit power so as to guarantee a certain level of quality-of-experience (QoE) for all players.
Revised:  The followers on the other hand select transmit power so as to guarantee a desired quality-of-experience (QoE) for all players.
Edit intent: clarity
Original:  We prove that there exists an overall Stackelberg Equilibrium for our proposed game for all players, which is a sub-game perfect equilibrium, as the equilibrium achieved at each stage is independent of the game history.
Revised:  We prove that there exists a sub-game perfect equilibrium, as the equilibrium achieved at each stage is independent of the game history.
Edit intent: clarity
Original:  On  other hand, we have a much firmer grasp of these issues in the world of arithmetic circuits.
Revised:  On the other hand, we have a much firmer grasp of these issues in the world of arithmetic circuits.
Edit intent: fluency
Original:  Specifically, it is known that convolutional arithmetic circuits posses the property of "complete depth efficiency", meaning that besides a negligible set, all functions that can be implemented by a deep network of polynomial size, require exponential size in order to be implemented (or even approximated) by a shallow network.
Revised:  Specifically, it is known that convolutional arithmetic circuits possess the property of "complete depth efficiency", meaning that besides a negligible set, all functions that can be implemented by a deep network of polynomial size, require exponential size in order to be implemented (or even approximated) by a shallow network.
Edit intent: fluency
Original:  this is done by comparing, analyzing, and executing numerical examinations of various PCGS algorithms, including the most recently proposed one.
Revised:  this is done by comparing, analyzing, and executing numerical examinations of various PCGS algorithms, including another improved one.
Edit intent: clarity
Original:  Current practice of assessing dynamic changes in functional fMRI connectivity over time uses the Fisher transform onto connectivity values aiming to make brain connectivity adhere to an approximate normal distribution, thus stabilizing the signal variance .
Revised:  Current practice when deriving connectivity estimates over time is to use the Fisher transform onto connectivity values aiming to make brain connectivity adhere to an approximate normal distribution, thus stabilizing the signal variance .
Edit intent: clarity
Original:  It becomes unclear how well the stabilization of signal variance offered by the Fisher transform performs in the case of each time series, which generally have non-zero means .
Revised:  It becomes unclear how well the stabilization of signal variance performed by the Fisher transform performs in the case of each time series, which generally have non-zero means .
Edit intent: clarity
Original:  It becomes unclear how well the stabilization of signal variance offered by the Fisher transform performs in the case of each time series, which generally have non-zero means .
Revised:  It becomes unclear how well the stabilization of signal variance offered by the Fisher transform works for each connectivity time series, which generally have non-zero means .
Edit intent: clarity