wanyu/IteraTeR_v2 huggingface dataset:
Original:  In addition, Susceptible-Infected (SI) model and Kendall's tau coefficient are applied to show the correlation between different methods.
Revised:  In addition, a susceptible infected (SI) model and Kendall's tau coefficient are applied to show the correlation between different methods.
Edit intent: fluency
Original:  The experiment results show the superiority of this proposed method.
Revised:  Experiment results show the superiority of this proposed method.
Edit intent: clarity
Original:  The experiment results show the superiority of this proposed method.
Revised:  The experiment results show the superiority of the proposed method.
Edit intent: clarity
Original: In this paper (which is a prosecution  of "The naturality of natural deduction ", Studia Logica 2019) we investigate the exact relationship between the Russell-Prawitz translation of intuitionistic propositional logic into intuitionistc second-order propositional logic (System F), and its variant proposed by Fernando Ferreira and Gilda Ferreira into  the atomic fragment of System F (System Fat).
Revised: In a previous paper (of which this is a prosecution of "The naturality of natural deduction ", Studia Logica 2019) we investigate the exact relationship between the Russell-Prawitz translation of intuitionistic propositional logic into intuitionistc second-order propositional logic (System F), and its variant proposed by Fernando Ferreira and Gilda Ferreira into the atomic fragment of System F (System Fat).
Edit intent: coherence
Original: In this paper (which is a prosecution  of "The naturality of natural deduction ", Studia Logica 2019) we investigate the exact relationship between the Russell-Prawitz translation of intuitionistic propositional logic into intuitionistc second-order propositional logic (System F), and its variant proposed by Fernando Ferreira and Gilda Ferreira into  the atomic fragment of System F (System Fat).
Revised: In this paper (which is a prosecution of natural deduction ", Studia Logica 2019) we investigate the exact relationship between the Russell-Prawitz translation of intuitionistic propositional logic into intuitionistc second-order propositional logic (System F), and its variant proposed by Fernando Ferreira and Gilda Ferreira into the atomic fragment of System F (System Fat).
Edit intent: fluency
Original:  We devise an alternating algorithm to represent a given tensor in the multiscale format and prove local convergence guarantees.
Revised:  We devise an alternating algorithm to represent a given tensor in the multiresolution format and prove local convergence guarantees.
Edit intent: clarity
Original:  Since the preferential attachment in  BA model does not consider any stop against the infinite growth of networks, we introduce a modified version of preferential attachment of  BA model.
Revised:  Since the preferential attachment in the BA model does not consider any stop against the infinite growth of networks, we introduce a modified version of preferential attachment of BA model.
Edit intent: fluency
Original:  Since the preferential attachment in  BA model does not consider any stop against the infinite growth of networks, we introduce a modified version of preferential attachment of  BA model.
Revised:  Since the preferential attachment in BA model does not consider any stop against the infinite growth of networks, we introduce a modified version of preferential attachment of the BA model.
Edit intent: fluency
Original:  During the process of achieving a winning position, the variables against growth such as the competition cost, besides with the internally structural cost may emerge.
Revised:  During the process of achieving a winning position, the variables against growth such as the competition cost, besides the internally structural cost may emerge.
Edit intent: fluency
Original:  In the end, by applying this modified model, we found the circumstances  which a trade-off between value and cost emerge .
Revised:  In the end, by applying this modified model, we found the circumstances in which a trade-off between value and cost emerge .
Edit intent: fluency
Original:  In the end, by applying this modified model, we found the circumstances  which a trade-off between value and cost emerge .
Revised:  In the end, by applying this modified model, we found the circumstances which a trade-off between value and cost emerges .
Edit intent: fluency
Original: In a recent article, Zemblys et al. 1 reported on a new method for the classification of eye-movements using deep neural networks.
Revised:  Zemblys et al. 1 reported on a new method for the classification of eye-movements using deep neural networks.
Edit intent: clarity
Original: In a recent article, Zemblys et al. 1 reported on a new method for the classification of eye-movements using deep neural networks.
Revised: In a recent article, Zemblys et al. 1 reported on a method for the classification of eye-movements using deep neural networks.
Edit intent: clarity
Original:  I will refer to this paper as the "gazeNet paper "  . I have found 2 errors and two problems with that paper that are explained herein.
Revised:  I will refer to this paper as the "gazeNet " . I have found 2 errors and two problems with that paper that are explained herein.
Edit intent: fluency
Original:  I will refer to this paper as the "gazeNet paper "  . I have found 2 errors and two problems with that paper that are explained herein.
Revised:  I will refer to this paper as the "gazeNet paper " ) . I have found 2 errors and two problems with that paper that are explained herein.
Edit intent: fluency
Original:  Problem 1\textit{\textbf{ has to do with the fact that even among the 500 Hz data, the inter-timestamp intervals varied widely.
Revised:  Problem 1\textit{\textbf{Problem 1 has to do with the fact that even among the 500 Hz data, the inter-timestamp intervals varied widely.
Edit intent: clarity
Original:  Problem 1\textit{\textbf{ has to do with the fact that even among the 500 Hz data, the inter-timestamp intervals varied widely.
Revised:  Problem 1\textit{\textbf{ has to do with the fact that even among the 500Hz data, the inter-timestamp intervals varied widely.
Edit intent: fluency
Original:  Error 2 \underline{\textit{\textbf{ arises out of the novel event-related agreement analysis employed by the gazeNet authors.
Revised:  \underline{\textit{\textbf{ arises out of the novel event-related agreement analysis employed by the gazeNet authors.
Edit intent: coherence
Original:  Error 2 \underline{\textit{\textbf{ arises out of the novel event-related agreement analysis employed by the gazeNet authors.
Revised:  Error 2 \underline{\textit{\textbf{Error 2 arises out of the novel event-related agreement analysis employed by the gazeNet authors.
Edit intent: fluency
Original: When collecting information, local differential privacy (LDP) alleviates privacy concerns of users , as users' private information is randomized before being sent to the central aggregator.
Revised: When collecting information, local differential privacy (LDP) alleviates privacy concerns of users because their private information is randomized before being sent to the central aggregator.
Edit intent: coherence
Original:  To address this issue, recent work introduced an intermediate server and with the assumption that this intermediate server did not collude with the aggregator.
Revised:  To address this issue, recent work introduced an intermediate server with the assumption that this intermediate server did not collude with the aggregator.
Edit intent: fluency
Original: When collecting information, local differential privacy (LDP) alleviates privacy concerns of users because their private information is randomized before being sent  to the central aggregator.
Revised: When collecting information, local differential privacy (LDP) alleviates privacy concerns of users because their private information is randomized before being sent it to the central aggregator.
Edit intent: clarity
Original:  However, LDP results in loss of utility due to the amount of noise that is added to each individual data item .
Revised:  LDP imposes large amount of noise that is added to each individual data item .
Edit intent: clarity
Original:  To address this issue, recent work introduced an intermediate server with the assumption that this intermediate server did not collude with the aggregator.
Revised:  To address this issue, recent work introduced an intermediate server with the assumption that this intermediate server does not collude with the aggregator.
Edit intent: fluency
Original:  Using this trust model, one can add less noise to achieve the same privacy guarantee ;
Revised:  Under this assumption, less noise can be added to achieve the same privacy guarantee ;
Edit intent: clarity
Original:  We first analyze the threat model and identify potential adversaries.
Revised:  We analyze the system model and identify potential adversaries.
Edit intent: clarity
Original:  We then make observations about existing approaches and propose new techniques that achieve a better privacy-utility tradeoff than existing ones .
Revised:  We then make two improvements: a new algorithm that achieves a better privacy-utility tradeoff than existing ones .
Edit intent: clarity
Original:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems where both the objective function  and the constraint can be non-convex.
Revised:  In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems where both the objective function and the constraint can be non-convex.
Edit intent: clarity
Original:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems where both the objective function  and the constraint can be non-convex.
Revised:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems , where the objective function and the constraint can be non-convex.
Edit intent: clarity
Original:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems where both the objective function  and the constraint can be non-convex.
Revised:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems where both the objective function is non-convex, and the constraint can be non-convex.
Edit intent: fluency
Original:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems where both the objective function  and the constraint can be non-convex.
Revised:  In this paper, an inexact proximal-point penalty method is proposed for constrained optimization problems where both the objective function and the constraint functions can also be non-convex.
Edit intent: clarity
Original:  Under a weak-convexity assumption, each subproblem is made strongly convex and can be solved effectively to a required accuracy by an optimal gradient-type method.
Revised:  Under a weak-convexity assumption, each subproblem is made strongly convex and can be solved effectively to a required accuracy by an optimal gradient-based method.
Edit intent: clarity
Original:  In the first case, the objective function is non-convex but the constraint functions are assumed to be convex , while in the second case, both the objective function and the constraint are non-convex .
Revised:  In the first case, the objective function is non-convex constraint .
Edit intent: coherence
Original:  For both cases, we give the complexity results  in terms of the number of function value and gradient evaluations to produce near-stationary points.
Revised:  For both cases, the complexity results in terms of the number of function value and gradient evaluations to produce near-stationary points.
Edit intent: clarity
Original:  The complexity for producing a nearly \varepsilon -stationary point is \tilde O(\varepsilon^{-5/2}) for the first case while it becomes \tilde O(\varepsilon ^{-4) if a non-singularity condition holds on constraints and otherwise }\tilde  .
Revised:  The complexity for producing a nearly \varepsilon -stationary point is \tilde O(\varepsilon^{-5/2}) for the first case while it becomes \tilde O(\varepsilon ^{-4) if a non-singularity condition holds on constraints and otherwise }\tilde O(\varepsilon^{-4 .
Edit intent: fluency
Original: In this paper we will continue analysis of the  semi-discrete optimal transport problem with storage fees, previously introduced by the authors, by proving convergence of a damped Newton algorithm for a specific choice of storage fee function, along with quantitative convergence of the associated Laguerre cells under limits of various parameters associated with the problem.
Revised: In this paper we will continue analysis of the semi-discrete optimal transport problem with storage fees, previously analyzed by the authors, by proving convergence of a damped Newton algorithm for a specific choice of storage fee function, along with quantitative convergence of the associated Laguerre cells under limits of various parameters associated with the problem.
Edit intent: clarity
Original:  A convergence result for cells in measure is proven without the additional assumption of a Poincar \`e%DIFDELCMD < }%%% -Wirtinger inequality on the  source measure, while convergence in Hausdorff metric is shown when assuming such an inequality.
Revised:  A convergence result for cells in measure is proven without the additional assumption of a Poincar %DIFDELCMD < }%%% -Wirtinger inequality on the source measure, while convergence in Hausdorff metric is shown when assuming such an inequality.
Edit intent: fluency
Original:  Our result is novel as it  does not require any connectedness assumptions on the support of the source measure, in contrast with previous results.
Revised:  Our result is novel as it does not require any connectedness assumptions on the support of the source measure, in contrast with existing results.
Edit intent: clarity
Original: The problem of structural diversity search is to nd the top-k vertices with the largest structural diversity in a graph.
Revised: The problem of structural diversity search is to find the top-k vertices with the largest structural diversity in a graph.
Edit intent: fluency
Original:  However, when identifying distinct social contexts, existing structural diversity models (e.g., t-sized component, t-core  and t-brace) are sensitive to an input parameter of t.
Revised:  However, when identifying distinct social contexts, existing structural diversity models (e.g., t-sized component, t-core , and t-brace) are sensitive to an input parameter of t.
Edit intent: fluency
Original:  Speci cally , we propose a novel notation of discriminative core, which automatically models various kinds of social contexts without parameter t. Leveraging on discriminative cores and h-index, the structural diversity score for a vertex is calculated.
Revised:  Specifically , we propose a novel notation of discriminative core, which automatically models various kinds of social contexts without parameter t. Leveraging on discriminative cores and h-index, the structural diversity score for a vertex is calculated.
Edit intent: fluency
Original:  An e cient top-k search algorithm with a well-designed upper bound for pruning is proposed.
Revised:  An efficient top-k search algorithm with a well-designed upper bound for pruning is proposed.
Edit intent: fluency
Original: A nut graph is a singular graph with one-dimensional kernel and corresponding eigenverctor with no 0 elements.
Revised: A nut graph is a singular graph with one-dimensional kernel and corresponding eigenverctor with no zero elements.
Edit intent: fluency
Original:  If we are given a sufficient number of d-regular nut graphs of consecutive orders, called seed graphs, this construction may be applied in such a way that the existence of all d-regular nut graphs of higher orders are established.
Revised:  If we are given a sufficient number of d-regular nut graphs of consecutive orders, called seed graphs, this construction may be applied in such a way that the existence of all d-regular nut graphs of higher orders is established.
Edit intent: fluency
Original:  For achieving tractability, fundamental properties of the underlying semiring, such as positivity, are crucial  .
Revised:  For achieving tractability, fundamental properties of the underlying semiring, such as positivity, are crucial for establishing tractability .
Edit intent: clarity
Original:  For instance, the regular spanners are the closure under the Relational Algebra (RA) of the regular expressions with capture variables, and the expressive power of the regular spanners is precisely captured by the class of vset-automata - a restricted class of transducers that mark the endpoints of selected spans.
Revised:  For instance, the regular spanners are the closure under the Relational Algebra (RA) of the regular expressions with capture variables, and the expressive power of the regular spanners is precisely captured by the class of VSet-automata - a restricted class of transducers that mark the endpoints of selected spans.
Edit intent: fluency
Original:  As a specific instantiation, we explore weighted vset-automata that, similarly to weighted automata and transducers, attach semiring elements to transitions.
Revised:  As a specific instantiation, we explore weighted VSet-automata that, similarly to weighted automata and transducers, attach semiring elements to transitions.
Edit intent: fluency
Original:  We introduce and evaluate a novel, hardware-friendly  and lossless compression scheme for the feature maps present within convolutional neural networks.
Revised:  We introduce and evaluate a novel, hardware-friendly , and lossless compression scheme for the feature maps present within convolutional neural networks.
Edit intent: fluency
Original:  We show that an average compression ratio of 5.1x for AlexNet, 4x for VGG-16, 2.4x for ResNet-34 and 2.2x for MobileNetV2 can be achieved---a gain of 45--70 \% over existing methods.
Revised:  We show that an average compression ratio of 5.1x for AlexNet, 4x for VGG-16, 2.4x for ResNet-34 and 2.2x for MobileNetV2 can be achieved - a gain of 45-70 \% over existing methods.
Edit intent: fluency
Original: In this paper we explore fundamental problems in randomized communication complexity such as computing Set Intersection on sets of size k and Equality Testing between vectors of length k. Brody et al. and Saglam and Tardos  showed that for these types of problems, one can achieve optimal communication volume of O(k) bits, with a randomized protocol that takes O(\log^* k) rounds.
Revised: In this paper we explore fundamental problems in randomized communication complexity such as computing Set Intersection on sets of size k and Equality Testing between vectors of length k. Saglam and Tardos showed that for these types of problems, one can achieve optimal communication volume of O(k) bits, with a randomized protocol that takes O(\log^* k) rounds.
Edit intent: coherence
Original:  Using an integrate-and-fire (I \& F) model , we reproduce relevant results of both experimental measurements and detailed models of early olfaction dynamics and odor discrimination.
Revised:  Using an integrate-and-fire (I F) model , we reproduce relevant results of both experimental measurements and detailed models of early olfaction dynamics and odor discrimination.
Edit intent: fluency
Original:  In this work, we show that a single-layer RNN can perfectly mimic an arbitrarily deep stacked RNN under specific constraints on its weight matrix and a delay between  input and output.
Revised:  In this work, we show that a single-layer RNN that has a delay between input and output.
Edit intent: clarity
Original:  In this work, we show that a single-layer RNN can perfectly mimic an arbitrarily deep stacked RNN under specific constraints on its weight matrix and a delay between  input and output.
Revised:  In this work, we show that a single-layer RNN can perfectly mimic an arbitrarily deep stacked RNN under specific constraints on its weight matrix and a delay between the input and output.
Edit intent: fluency
Original:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like a bidirectional network . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Revised:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality , much like a bidirectional network . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Edit intent: clarity
Original:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like a bidirectional network . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Revised:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like bidirectional networks . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Edit intent: fluency
Original:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like a bidirectional network . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Revised:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like a bidirectional network . Synthetic experiments confirm that the delayed-RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Edit intent: clarity
Original:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like a bidirectional network . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks in perfectly solving some acausal tasks , outperforming them in others.
Revised:  Additionally, we show that weakening weight constraints while keeping the delay gives rise to partial acausality in the single-layer RNN , much like a bidirectional network . Synthetic experiments confirm that the delayed RNN can mimic bidirectional networks , solving some acausal tasks , outperforming them in others.
Edit intent: clarity
Original:  Finally , we show that in a challenging language processing task , the delayed RNN performs within 0.3%DIFDELCMD < \\%%% %DIF < of the accuracy of the bidirectional network while reducing computational costs .
Revised:  Moreover , we show that in a challenging language processing task , the delayed RNN performs within 0.3%DIFDELCMD < \\%%% %DIF < of the accuracy of the bidirectional network while reducing computational costs .
Edit intent: fluency
Original:  Finally , we show that in a challenging language processing task , the delayed RNN performs within 0.3%DIFDELCMD < \\%%% %DIF < of the accuracy of the bidirectional network while reducing computational costs .
Revised:  Finally , we show similar performance to bidirectional networks in a real-world natural language processing task , the delayed RNN performs within 0.3%DIFDELCMD < \\%%% %DIF < of the accuracy of the bidirectional network while reducing computational costs .
Edit intent: clarity