wanyu/IteraTeR_v2 huggingface dataset:
Original:  In these examples, the accelerated stochastic gradient descent method using MCLA converges to local maxima in fewer model evaluations by up to five orders of magnitude  than gradient descent with DLMC.
Revised:  In these examples, the accelerated stochastic gradient descent method using MCLA converges to local maxima in fewer model evaluations by up to five orders of magnitude fewer model evaluations than gradient descent with DLMC.
Edit intent: clarity
Original:  The global {\em  model of differential privacy, which assumes that users trust the data collector, provides strong privacy guarantees and introduces small errors in the output.
Revised:  The {\em model of differential privacy, which assumes that users trust the data collector, provides strong privacy guarantees and introduces small errors in the output.
Edit intent: clarity
Original:  In contrast, applications of differential privacy in commercial systems by Apple, Google, and Microsoft, use the local model {\em  .
Revised:  In contrast, applications of differential privacy in commercial systems by Apple, Google, and Microsoft, use the {\em .
Edit intent: clarity
Original:  If in addition the adhesive category possesses a strict initial object, the resulting rule algebra is also unital .
Revised:  If in addition a given such category possess an M-initial object, the resulting rule algebra is also unital .
Edit intent: clarity
Original:  We demonstrate that in this setting the canonical representation of the rule algebras is obtainable, which opens the possibility of applying the concept to define and compute the evolution of statistical moments of observables in stochastic DPO rewriting systems.
Revised:  We demonstrate that in this setting a canonical representation of the rule algebras is obtainable, which opens the possibility of applying the concept to define and compute the evolution of statistical moments of observables in stochastic DPO rewriting systems.
Edit intent: fluency
Original: The volume, veracity, variability  and velocity of data produced from the ever increasing network of sensors connected to Internet pose challenges for power management, scalability  and sustainability of cloud computing infrastructure.
Revised: The volume, veracity, variability , and velocity of data produced from the ever increasing network of sensors connected to Internet pose challenges for power management, scalability and sustainability of cloud computing infrastructure.
Edit intent: fluency
Original: The volume, veracity, variability  and velocity of data produced from the ever increasing network of sensors connected to Internet pose challenges for power management, scalability  and sustainability of cloud computing infrastructure.
Revised: The volume, veracity, variability and velocity of data produced from the ever-increasing network of sensors connected to Internet pose challenges for power management, scalability and sustainability of cloud computing infrastructure.
Edit intent: fluency
Original: The volume, veracity, variability  and velocity of data produced from the ever increasing network of sensors connected to Internet pose challenges for power management, scalability  and sustainability of cloud computing infrastructure.
Revised: The volume, veracity, variability and velocity of data produced from the ever increasing network of sensors connected to Internet pose challenges for power management, scalability , and sustainability of cloud computing infrastructure.
Edit intent: fluency
Original:  Increasing the data processing capability of edge computing devices at lower power requirements can reduce the overheads for cloud computing solutions.
Revised:  Increasing the data processing capability of edge computing devices at lower power requirements can reduce several overheads for cloud computing solutions.
Edit intent: clarity
Original:  We discuss why the neuromorphic architectures are useful for edge devices and show the advantages, drawbacks and open problems in the field of memristive circuit and architectures in terms of edge computingperspective .
Revised:  We discuss why the neuromorphic architectures are useful for edge devices and show the advantages, drawbacks and open problems in the field of neuro-memristive circuits for edge computing .
Edit intent: clarity
Original: We propose and study a method for learning interpretable features via stochastic optimization of feature architectures .
Revised: We propose and study a method for learning interpretable representations for the task of regression .
Edit intent: clarity
Original:  Features are represented as  multi-type expression trees using a set of activation functions common in neural networks in addition to other elementary functions.
Revised:  Features are represented as networks of multi-type expression trees using a set of activation functions common in neural networks in addition to other elementary functions.
Edit intent: clarity
Original:  Features are represented as  multi-type expression trees using a set of activation functions common in neural networks in addition to other elementary functions.
Revised:  Features are represented as multi-type expression trees comprised of activation functions common in neural networks in addition to other elementary functions.
Edit intent: clarity
Original:  Continuous features are trained via gradient descent, and the performance of features in ML models is used to weight the rate of change among subcomponents of representations .
Revised:  Differentiable features are trained via gradient descent, and the performance of features in ML models is used to weight the rate of change among subcomponents of representations .
Edit intent: clarity
Original:  Continuous features are trained via gradient descent, and the performance of features in ML models is used to weight the rate of change among subcomponents of representations .
Revised:  Continuous features are trained via gradient descent, and the performance of features in ML models is used to weight the rate of change among subcomponents of each representation .
Edit intent: clarity
Original:  We benchmark these variants on many real-world regression problems in comparison to other machine learning approaches.
Revised:  We benchmark these variants on 99 open-source regression problems in comparison to other machine learning approaches.
Edit intent: clarity
Original:  We benchmark these variants on many real-world regression problems in comparison to other machine learning approaches.
Revised:  We benchmark these variants on many real-world regression problems in comparison to state-of-the-art machine learning approaches.
Edit intent: clarity
Original:  We also report a negative result in which attempts to directly optimize the disentanglement of the representation results in more highly correlated features.
Revised:  We also report a negative result in which attempts to directly optimize the disentanglement of the representation result in more highly correlated features.
Edit intent: fluency
Original:  The most widely used metric, normalized mutual information (NMI), was proved to have finite size effect, and its improved form rNMI has reverse finite size effect. cNMI is thus proposed and has neither finite size effect nor reverse finite size effect.
Revised:  The most widely used metric, normalized mutual information (NMI), was proved to have finite size effect, and its improved form relative normalized mutual information (rNMI) has reverse finite size effect. cNMI is thus proposed and has neither finite size effect nor reverse finite size effect.
Edit intent: clarity
Original:  In this paper, we map the computed community labels to the ground-truth ones through integer linear programming, then use Kappa index and F-score to evaluate the detected community structures.
Revised:  In this paper, we map the computed community labels to the ground-truth ones through integer linear programming, then use kappa index and F-score to evaluate the detected community structures.
Edit intent: fluency
Original:  Experimental results demonstrate the rationality of our method.
Revised:  Experimental results demonstrate the advantages of our method.
Edit intent: clarity
Original:  The goal is then to identify a subset of k users that need to be convinced to adopt the limiting campaign so as to minimize the number of people that adopt the "bad" campaign at the end of both propagation processes.
Revised:  The goal is to identify a subset of k users that need to be convinced to adopt the limiting campaign so as to minimize the number of people that adopt the "bad" campaign at the end of both propagation processes.
Edit intent: coherence
Original:  The goal is then to identify a subset of k users that need to be convinced to adopt the limiting campaign so as to minimize the number of people that adopt the "bad" campaign at the end of both propagation processes.
Revised:  The goal is then to identify a set of k users that need to be convinced to adopt the limiting campaign so as to minimize the number of people that adopt the "bad" campaign at the end of both propagation processes.
Edit intent: clarity
Original:  This work presents RPS (Reverse Prevention Sampling), an algorithm that provides a scalable solution to the misinformation prevention problem.
Revised:  This work presents RPS (Reverse Prevention Sampling), an algorithm that provides a scalable solution to the misinformation mitigation problem.
Edit intent: clarity
Original:  This demonstrates that misinformation prevention can be made practical while still offering strong theoretical guarantees.
Revised:  This demonstrates that misinformation mitigation can be made practical while still offering strong theoretical guarantees.
Edit intent: clarity
Original: This paper solves the optimal investment and consumption strategies for an ambiguity-averse agent in an incomplete financial market .
Revised: This paper solves the optimal investment and consumption strategies for a risk-averse and ambiguity-averse agent in an incomplete financial market .
Edit intent: clarity
Original:  The market incompleteness arises from investment constraints of the agent.
Edit intent: coherence
Original:  The aim of this paper was to use this probability and other parameters derived from the percentile-based power law function to investigate research success in the USA, the EU, and other countries in hot medical, biochemical, and biotechnological topics.
Revised:  The aim of this paper was to use these metrics and other parameters derived from the percentile-based power law function to investigate research success in the USA, the EU, and other countries in hot medical, biochemical, and biotechnological topics.
Edit intent: clarity
Original:  It is known that if G is 3-connected it admits an OPVR with vertex complexity at most twelve, while a vertex complexity at least two may be required in some cases.
Revised:  It is known that 3-connected it admits an OPVR with vertex complexity at most twelve, while a vertex complexity at least two may be required in some cases.
Edit intent: clarity
Original:  It is known that if G is 3-connected it admits an OPVR with vertex complexity at most twelve, while a vertex complexity at least two may be required in some cases.
Revised:  It is known that if G is 3-connected it admits an OPVR with vertex complexity at most twelve, while vertex complexity at least two may be required in some cases.
Edit intent: fluency
Original:  In this paper  we reduce this gap by showing that vertex complexity five is always sufficient, while vertex complexity four may be required in some cases.
Revised:  In this paper , we reduce this gap by showing that vertex complexity five is always sufficient, while vertex complexity four may be required in some cases.
Edit intent: fluency
Original: Given a 2-edge connected  undirected graph G with n vertices and m edges, a \sigma-tree spanner is a spanning tree  of G in which the ratio between the distance in T of any pair of vertices and the corresponding distance in G is upper bounded by \sigma.
Revised: Given a 2-edge connected undirected graph G with n vertices and m edges, a \sigma-tree spanner is a spanning tree T of G in which the ratio between the distance in T of any pair of vertices and the corresponding distance in G is upper bounded by \sigma.
Edit intent: fluency
Original:  Previously, an O(n^2 \log^4 n) time and O(n^2+m\log^2n) space algorithm was known for edge-weighted graphs ( Bil\`o et al., ISAAC 2017 ) . Even if our improvements on both the time and space complexities are of a polylogarithmic factor, we stress the fact that the design of a o(n^2) time and space algorithm would be considered a breakthrough.
Revised:  Previously, an O(n^2 \log^4 n) time and O(n^2+m\log^2n) space algorithm was known for edge-weighted graphs Bil\`o et al., ISAAC 2017 ) . Even if our improvements on both the time and space complexities are of a polylogarithmic factor, we stress the fact that the design of a o(n^2) time and space algorithm would be considered a breakthrough.
Edit intent: fluency
Original:  Previously, an O(n^2 \log^4 n) time and O(n^2+m\log^2n) space algorithm was known for edge-weighted graphs ( Bil\`o et al., ISAAC 2017 ) . Even if our improvements on both the time and space complexities are of a polylogarithmic factor, we stress the fact that the design of a o(n^2) time and space algorithm would be considered a breakthrough.
Revised:  Previously, an O(n^2 \log^4 n) time and O(n^2+m\log^2n) space algorithm was known for edge-weighted graphs ( Bil\`o et al., ISAAC 2017 . Even if our improvements on both the time and space complexities are of a polylogarithmic factor, we stress the fact that the design of a o(n^2) time and space algorithm would be considered a breakthrough.
Edit intent: fluency
Original: We develop and analyze new protocols to verify the correctness of various computations on matrices over  F[x] , where F is a field .
Revised: We design and analyze new protocols to verify the correctness of various computations on matrices over F[x] , where F is a field .
Edit intent: clarity
Original: We develop and analyze new protocols to verify the correctness of various computations on matrices over  F[x] , where F is a field .
Revised: We develop and analyze new protocols to verify the correctness of various computations on matrices over the ring F[x] , where F is a field .
Edit intent: clarity
Original:  The properties we verify concern an F x%DIFDELCMD < ]%%% -module and therefore cannot simply rely on previously-developed linear algebra certificates which work only for vector spaces .
Revised:  The properties we verify x%DIFDELCMD < ]%%% -module and therefore cannot simply rely on previously-developed linear algebra certificates which work only for vector spaces .
Edit intent: clarity
Original:  The properties we verify concern an F x%DIFDELCMD < ]%%% -module and therefore cannot simply rely on previously-developed linear algebra certificates which work only for vector spaces .
Revised:  The properties we verify concern an F %DIFDELCMD < ]%%% -module and therefore cannot simply rely on previously-developed linear algebra certificates which work only for vector spaces .
Edit intent: fluency
Original:  Our protocols are interactive certificates , often randomized, and featuring a constant number of rounds of communication between the prover and verifier .
Revised:  Our protocols are interactive , often randomized, and featuring a constant number of rounds of communication between the prover and verifier .
Edit intent: clarity
Original:  Our protocols are interactive certificates , often randomized, and featuring a constant number of rounds of communication between the prover and verifier .
Revised:  Our protocols are interactive certificates , often randomized, and feature a constant number of rounds of communication between the prover and verifier .
Edit intent: fluency
Original:  Our protocols are interactive certificates , often randomized, and featuring a constant number of rounds of communication between the prover and verifier .
Revised:  Our protocols are interactive certificates , often randomized, and featuring a constant number of rounds of communication between the Prover and Verifier .
Edit intent: fluency
Original:  The main tools we use are reductions to existing linear algebra certificates and a new protocol to verify that a given vector is in the F[x] -linear span of a given matrix.
Revised:  The main tools we use are reductions to existing linear algebra verification protocols and a new protocol to verify that a given vector is in the F[x] -linear span of a given matrix.
Edit intent: clarity
Original:  The semantic labels could be properties, classes in knowledge bases  or labeled data  are manually annotated by domain experts.
Revised:  The semantic labels could be properties, classes in knowledge bases , or labeled data are manually annotated by domain experts.
Edit intent: fluency
Original:  The semantic labels could be properties, classes in knowledge bases  or labeled data  are manually annotated by domain experts.
Revised:  The semantic labels could be properties, classes in knowledge bases or labeled data that are manually annotated by domain experts.
Edit intent: fluency
Original:  In this space, the Euclidean distance can be used to measure "semantic similarity " of two columns.
Revised:  In this space, the Euclidean distance can be used to measure "semantic similarities " of two columns.
Edit intent: fluency
Original:  This includes a meta-data aware decimation algorithm which is general for collapsing simplices of any dimension.
Revised:  This includes a metadata aware decimation algorithm which is general for collapsing simplices of any dimension.
Edit intent: clarity
Original:  But, so far, this mechanism has not  been studied theoretically.
Revised:  This mechanism has not been studied theoretically.
Edit intent: coherence
Original:  But, so far, this mechanism has not  been studied theoretically.
Revised:  But, so far, this mechanism has not yet been studied theoretically.
Edit intent: coherence
Original:  Our theoretical model provide a simple description of neuronal electrical activity including the tonic activity of  NMDA receptors and a cytosolic calcium compartment.
Revised:  Our theoretical model provides a simple description of neuronal electrical activity including the tonic activity of NMDA receptors and a cytosolic calcium compartment.
Edit intent: fluency
Original:  Our theoretical model provide a simple description of neuronal electrical activity including the tonic activity of  NMDA receptors and a cytosolic calcium compartment.
Revised:  Our theoretical model provide a simple description of neuronal electrical activity that takes into account the tonic activity of NMDA receptors and a cytosolic calcium compartment.
Edit intent: clarity
Original:  We show that calcium influx through NMDA-R can directly be coupled to activation of calcium-activated potassium channels providing an overall inhibitory effect on neuronal excitability.
Revised:  We show that calcium influx through NMDA-R can be coupled directly to the activation of calcium-activated potassium channels providing an overall inhibitory effect on neuronal excitability.
Edit intent: fluency
Original:  We show that calcium influx through NMDA-R can directly be coupled to activation of calcium-activated potassium channels providing an overall inhibitory effect on neuronal excitability.
Revised:  We show that calcium influx through NMDA-R can directly be coupled to activation of calcium-activated potassium channels , resulting in an overall inhibitory effect on neuronal excitability.
Edit intent: clarity
Original:  They also shed light on the way by which beta-amyloids can decrease neuronal activity when interfering with NMDA-R in Alzheimer's disease  .
Revised:  They also shed light on the way by which \beta-amyloids can alter neuronal activity when interfering with NMDA-R in Alzheimer's disease .
Edit intent: clarity
Original:  Traditional least-squares finite element methods using continuous finite element approximations will introduce unnecessary extra error for discontinuous solutions  .
Revised:  Traditional LSFEMs using continuous finite element approximations will introduce unnecessary extra error for discontinuous solutions .
Edit intent: clarity
Original:  With this reformulation, the continuities of the flux and the solution can be handled separately and in natural H(div;\Omega)\times L^2(\Omega) conforming finite element spaces.
Revised:  With this reformulation, the continuities of the flux and the solution can be handled separately in natural H(div;\Omega)\times L^2(\Omega) conforming finite element spaces.
Edit intent: coherence
Original:  With the reformulation, the least-squares finite element methods can handle discontinuous solutions  much better than the traditional  continuous polynomial approximations.
Revised:  With the reformulation, the new LSFEMs can handle discontinuous solutions much better than the traditional continuous polynomial approximations.
Edit intent: clarity
Original:  With natural least-squares functionals as a posteriori error estimators, the methods can resolve the discontinuity even when the mesh is not aligned with discontinuity .
Revised:  With least-squares functionals as a posteriori error estimators, the methods can resolve the discontinuity even when the mesh is not aligned with discontinuity .
Edit intent: clarity
Original:  Tensor completion aims to recover an incomplete tensor data from its partially observed entries.
Revised:  Tensor completion algorithms aim to recover the incomplete data from its partially observed entries.
Edit intent: clarity
Original:  The simulation results show that TR-WOPT performs well and is robust to high-dimension tensor.
Revised:  The simulation results show that TR-WOPT performs well in various high-dimension tensor.
Edit intent: clarity
Original:  Image completion results show that the proposed algorithm outperforms the state-of-the-art algorithms in many situations , especially when the image is tensorized to a higher-dimension, better performance can be obtained from our TR-WOPT algorithm .
Revised:  Image completion results show that our proposed algorithm outperforms the state-of-the-art algorithms in many situations , especially when the image is tensorized to a higher-dimension, better performance can be obtained from our TR-WOPT algorithm .
Edit intent: fluency
Original: We present exact analytical results for the degree distribution and for the distribution of shortest path lengths (DSPL) in a directed network model that grows by node duplication  .
Revised: We present exact results for the degree distribution and for the distribution of shortest path lengths (DSPL) in a directed network model that grows by node duplication .
Edit intent: clarity
Original: We present exact analytical results for the degree distribution and for the distribution of shortest path lengths (DSPL) in a directed network model that grows by node duplication  .
Revised: We present exact analytical results for the degree distribution in a directed network model that grows by node duplication .
Edit intent: clarity
Original:  Such models are useful in the study of the structure and growth dynamics of gene regulatory  and scientific citation networks.
Revised:  Such models are useful in the study of the structure and growth dynamics of gene regulatory networks and scientific citation networks.
Edit intent: fluency
Original:  Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication.
Revised:  Starting from an initial seed network, at each time step a random node, a mother node, is selected for duplication.
Edit intent: coherence
Original:  Its daughter node is added to the network and duplicates , with probability p, each one of the outgoing links of the mother node  .
Revised:  Its daughter node is added to the network and duplicates each outgoing link of the mother node .
Edit intent: clarity