wanyu/IteraTeR_v2 huggingface dataset:
Original:  Systems are likely to have an order of magnitude more NVRAM than traditional memory (DRAM) , allowing large graph problems to be solved efficiently at a modest cost on a single machine  .
Revised:  Systems are likely to have an order of magnitude more NVRAM than traditional memory (DRAM) , allowing large graph problems to be solved on a single machine .
Edit intent: clarity
Original:  Systems are likely to have an order of magnitude more NVRAM than traditional memory (DRAM) , allowing large graph problems to be solved efficiently at a modest cost on a single machine  .
Revised:  Systems are likely to have an order of magnitude more NVRAM than traditional memory (DRAM) , allowing large graph problems to be solved efficiently at a modest cost on a single machine , at a modest cost .
Edit intent: coherence
Original:  However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be significantly more expensive than NVRAM reads.
Revised:  However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads.
Edit intent: clarity
Original:  We also show that our algorithms running on NVRAM nearly match the fastest prior algorithms running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.
Revised:  We also show that Sage nearly matches the fastest prior algorithms running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.
Edit intent: clarity
Original:  We also show that our algorithms running on NVRAM nearly match the fastest prior algorithms running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.
Revised:  We also show that our algorithms running on NVRAM nearly match the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.
Edit intent: clarity
Original:  An alternative approach to is to regard CP decomposition as a nonlinear least squares problem and employ Newton-like methods.
Revised:  An alternative approach is to regard CP decomposition as a nonlinear least squares problem and employ Newton-like methods.
Edit intent: fluency
Original:  We evaluate the performance of both sequential and parallel versions of both approaches, and study the parallel scalability on the Stampede2 supercomputer.
Revised:  We evaluate the performance of sequential and parallel versions of both approaches, and study the parallel scalability on the Stampede2 supercomputer.
Edit intent: fluency
Original:  These algorithms minimize the moment map (a non-commutative notion of the usual gradient) and test membership in  moment polytopes (a vast class of polytopes, typically of exponential vertex and facet complexity, which arise from this a-priori non-convex, non-linear setting).
Revised:  These algorithms minimize the moment map (a non-commutative notion of the usual gradient) and test membership in moment polytopes (a vast class of polytopes, typically of exponential vertex and facet complexity, which arise from this a priori non-convex, non-linear setting).
Edit intent: fluency
Original:  The main technical work , again unifying and extending much of the previous literature, goes into identifying the key parameters of the underlying group actions which control convergence to the optimum in each of these methods.
Revised:  The main technical work goes into identifying the key parameters of the underlying group actions which control convergence to the optimum in each of these methods.
Edit intent: clarity
Original:  We show how  bound these parameters in several general cases .
Revised:  We show how to bound these parameters in several general cases .
Edit intent: fluency
Original:  Demonstrating the effectiveness of these tools on real-world DNNs is an important step towards their wider adoption.
Revised:  Demonstrating the effectiveness of these engines on real-world DNNs is an important step towards their wider adoption.
Edit intent: clarity
Original:  We focus here on the recently proposed Marabou verification tool , and demonstrate its usage for a novel application: simplifying neural networks, by reducing the size of a DNN without harming its accuracy.
Revised:  We present a tool that can leverage existing verification engines in performing a novel application: simplifying neural networks, by reducing the size of a DNN without harming its accuracy.
Edit intent: clarity
Original:  We focus here on the recently proposed Marabou verification tool , and demonstrate its usage for a novel application: simplifying neural networks, by reducing the size of a DNN without harming its accuracy.
Revised:  We focus here on the recently proposed Marabou verification tool , and demonstrate its usage for a novel application: neural network simplification, through the reduction of the size of a DNN without harming its accuracy.
Edit intent: clarity
Original:  We report on the work-flow of the simplification process, and on its potential significance and applicability to domains of interest .
Revised:  We report on the work-flow of the simplification process, and demonstrate its potential significance and applicability to domains of interest .
Edit intent: clarity
Original:  In this paper, we discuss the lower bound of modulo-m degree of Boolean functions.
Revised:  In this paper, we investigate the lower bound of modulo-m degree of Boolean functions.
Edit intent: clarity
Original: Wide neural networks with random weights and biases are Gaussian processes, as  observed by Neal (1995) for shallow networks, and more recently by Lee et al. (2018) and Matthews et al. (2018) for deep fully-connected networks, as well as by Novak et al. (2019) and Garriga-Alonso et al. (2019) for deep convolutional networks.
Revised: Wide neural networks with random weights and biases are Gaussian processes, as observed by Neal (1995) and more recently by Lee et al. (2018) and Matthews et al. (2018) for deep fully-connected networks, as well as by Novak et al. (2019) and Garriga-Alonso et al. (2019) for deep convolutional networks.
Edit intent: clarity
Original:  A generalized Green's identity for H^m inner product  m>n is derived, which is essential to devise the H^m-nonconforming virtual elements.
Revised:  A generalized Green's identity for H^m inner product with m>n is derived, which is essential to devise the H^m-nonconforming virtual elements.
Edit intent: clarity
Original:  The dimension of the H^m-nonconforming virtual elements can reduced by the Serendipity approach.
Edit intent: coherence
Original:  Finally, the optimal error estimates for the H^m-nonconforming virtual element methods are achieved from an estimate of the weak continuity and the error estimate of the canonical interpolation  .
Revised:  The optimal error estimates for the H^m-nonconforming virtual element methods are achieved from an estimate of the weak continuity and the error estimate of the canonical interpolation .
Edit intent: coherence
Original:  Current neural network models (such as predictive coding models) have poor processing efficiency, and are limited to one input type, neither of which is bio-realistic.
Edit intent: coherence
Original: Quickly determining shortest paths in networks is an important ingredient for many routing applications .
Revised: We study exact, efficient and practical algorithms for route planning in large road networks. Routing applications often require integrating the current traffic situation, planning ahead with traffic predictions for the future, respecting forbidden turns, and many other features depending on the exact application .
Edit intent: coherence
Original:  While Dijkstra's algorithm can be used to solve these problems, it is too slow for many practical problems . A* is an extension to Dijkstra's algorithm.
Revised:  While Dijkstra's algorithm can be used to solve these problems, it is too slow for many applications . A* is an extension to Dijkstra's algorithm.
Edit intent: clarity
Original: Suicide is a critical issue in the modern society.
Revised: Suicide is a critical issue in modern society.
Edit intent: fluency
Original:  Early detection and prevention of suicide attempt should be addressed to save people's life.
Revised:  Early detection and prevention of suicide attempts should be addressed to save people's life.
Edit intent: fluency
Original:  Current suicidal ideation detection methods include clinical methods based on the interaction between social workers or experts and the targeted individuals , and machine learning techniques with feature engineering or deep learning for automatic detection based on online social contents.
Revised:  Current suicidal ideation detection methods include clinical methods based on the interaction between social workers or experts and the targeted individuals and machine learning techniques with feature engineering or deep learning for automatic detection based on online social contents.
Edit intent: fluency
Original:  This  is the first survey that comprehensively introduces and discusses the methods from these categories.
Revised:  This paper is the first survey that comprehensively introduces and discusses the methods from these categories.
Edit intent: fluency
Original:  Domain-specific applications of suicidal ideation detection are also reviewed according to their data sources, i.e., questionnaires, electronic health records, suicide notes, and online user content.
Revised:  Domain-specific applications of suicidal ideation detection are reviewed according to their data sources, i.e., questionnaires, electronic health records, suicide notes, and online user content.
Edit intent: clarity
Original:  To facilitate further research, several specific tasks and datasets are introduced and summarized  .
Revised:  Several specific tasks and datasets are introduced and summarized .
Edit intent: clarity
Original:  To facilitate further research, several specific tasks and datasets are introduced and summarized  .
Revised:  To facilitate further research, several specific tasks and datasets are introduced and summarized to facilitate further research .
Edit intent: fluency
Original:  The proposed SoftGAN method aims at reducing the impact of the generator on the discriminator and vice versa during training , so both can learn more gradually and efficiently during training , in particular avoiding a training not in tandem.
Revised:  The proposed SoftGAN method aims at reducing the impact of the generator on the discriminator , so both can learn more gradually and efficiently during training , in particular avoiding a training not in tandem.
Edit intent: coherence
Original:  This created the need of an ASR system that can operate in realistic crowded environments.
Revised:  This created the need for an ASR system that can operate in realistic crowded environments.
Edit intent: fluency
Original:  Thus, speech enhancement is now considered as a fundamental building block in newly developed ASR systems .
Revised:  Thus, speech enhancement is a fundamental building block in newly developed ASR systems .
Edit intent: clarity
Original:  A new architecture based on CasNet generator and  additional perceptual loss is incorporated to get realistically denoised speech phonetics.
Revised:  A new architecture based on CasNet generator and an additional perceptual loss is incorporated to get realistically denoised speech phonetics.
Edit intent: fluency
Original:  A new architecture based on CasNet generator and  additional perceptual loss is incorporated to get realistically denoised speech phonetics.
Revised:  A new architecture based on CasNet generator and additional perceptual loss are incorporated to get realistically denoised speech phonetics.
Edit intent: fluency
Original:  Thus, speech enhancement is a fundamental building block in ASR systems and other applications such as hearing aids, smartphones and teleconferencing systems.
Revised:  Thus, speech enhancement is a valuable building block in ASR systems and other applications such as hearing aids, smartphones and teleconferencing systems.
Edit intent: clarity
Original:  A new architecture based on CasNet generator and an additional perceptual loss are incorporated to get realistically denoised speech phonetics.
Revised:  A new architecture based on CasNet generator and an additional feature-based loss are incorporated to get realistically denoised speech phonetics.
Edit intent: clarity
Original: In the mathematical study of reaction networks, many of the classical results pertain to models that have a deficiency of zero  .
Revised: In the mathematical study of reaction networks, the most classical results are those pertaining to models that have a deficiency of zero .
Edit intent: clarity
Original:  Given that deficiency zero models play such a significant role in the mathematical study of reaction networks, a natural question is  how prevalent are they?
Revised:  Given that deficiency zero models play such a significant role in the mathematical study of reaction networks, a natural question is : how prevalent are they?
Edit intent: fluency
Original:  We establish a function, r(n), termed a threshold function \textit{ , such that the probability of the random network being deficiency zero converges to 1 if p_n \ll r(n) and converges to 0 if p_n \gg r(n).
Revised:  We establish a function, r(n), termed a \textit{ , such that the probability of the random network being deficiency zero converges to 1 if p_n \ll r(n) and converges to 0 if p_n \gg r(n).
Edit intent: clarity
Original:  We establish a function, r(n), termed a\textit{threshold function , such that the probability of the random network being deficiency zero converges to 1 if p_n \ll r(n ){r(n)}}\to \to  and converges to 0 if p_n \gg{r(n)}}\to \to  r(n)  .
Revised:  We establish a function, r(n), termed a\textit{ , such that the probability of the random network being deficiency zero converges to 1 if p_n \ll r(n ){r(n)}}\to \to and converges to 0 if p_n \gg{r(n)}}\to \to r(n) .
Edit intent: clarity
Original:  In most previous works, researchers have mainly aimed at finding a meaning for the three parameters of the EGF  in relation to psychological phenomena.
Revised:  In most previous works, researchers have mainly aimed at finding a meaning for the parameters of the EGF in relation to psychological phenomena.
Edit intent: clarity
Original:  In most previous works, researchers have mainly aimed at finding a meaning for the three parameters of the EGF  in relation to psychological phenomena.
Revised:  In most previous works, researchers have mainly aimed at finding a meaning for the three parameters of the EGF function in relation to psychological phenomena.
Edit intent: clarity
Original:  We will focus on interpreting the reaction times ( RT ) of a group of individuals rather than a single person's RT  which is relevant for the different contexts of social sciences.
Revised:  We will focus on interpreting the reaction times ( RTs ) of a group of individuals rather than a single person's RT which is relevant for the different contexts of social sciences.
Edit intent: clarity
Original:  We will focus on interpreting the reaction times ( RT ) of a group of individuals rather than a single person's RT  which is relevant for the different contexts of social sciences.
Revised:  We will focus on interpreting the reaction times ( RT ) of a group of individuals rather than a single person's RT , which is relevant for the different contexts of social sciences.
Edit intent: fluency
Original:  The dynamics of both systems is driven by the interaction with their respective thermostats, which are characterized by a temperature in the system of particles and by a thermostat-like entity, that we have called time driver for the group of individuals.
Edit intent: coherence
Original:  Similarly, we come across a Maxwell-Boltzmann-type distribution for the system of brains which provides a more complete characterization of the collective time response than has ever been provided before.
Revised:  Similarly, we came across a Maxwell-Boltzmann-type distribution for the system of brains which provides a more complete characterization of the collective time response than has ever been provided before.
Edit intent: fluency
Original:  Another step taken is that now we are able to know about the behavior of a single individual in relation to the coetaneous group to which they belong and through the application of a physical law.
Revised:  Thus, we are able to know about the behavior of a single individual in relation to the coetaneous group to which they belong and through the application of a physical law.
Edit intent: coherence
Original:  Another step taken is that now we are able to know about the behavior of a single individual in relation to the coetaneous group to which they belong and through the application of a physical law.
Revised:  Another step taken is that now we are able to know about the behaviour of a single individual in relation to the coetaneous group to which they belong and through the application of a physical law.
Edit intent: fluency
Original:  To  our knowledge, this is the first work  reporting on the emergence of a physical theory (IG) from human RT experimental data.
Revised:  To the best of our knowledge, this is the first work reporting on the emergence of a physical theory (IG) from human RT experimental data.
Edit intent: clarity
Original: We study the problem of computing shortest paths in massive road networks with traffic predictions.
Revised: We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions.
Edit intent: clarity
Original:   Existing techniques follow a two phase approach: In an offline, preprocessing step, a database index is built.
Revised:  Existing techniques follow a two-phase approach: In an offline, preprocessing step, a database index is built.
Edit intent: fluency
Original:   Existing techniques follow a two phase approach: In an offline, preprocessing step, a database index is built.
Revised:  Existing techniques follow a two phase approach: In a preprocessing step, a database index is built.
Edit intent: clarity
Original:   Existing techniques follow a two phase approach: In an offline, preprocessing step, a database index is built.
Revised:  Existing techniques follow a two phase approach: In an offline, preprocessing step, an index is built.
Edit intent: clarity
Original:  The index only depends on the road network and the traffic patterns .
Revised:  The index depends on the road network and the traffic patterns .
Edit intent: clarity
Original:  The path start and end  are the input of the query phase, in which shortest-paths are computed.
Revised:  The path start and end . The latter are the input of the query phase, in which shortest-paths are computed.
Edit intent: clarity
Original:  The path start and end  are the input of the query phase, in which shortest-paths are computed.
Revised:  The path start and end are the input of the query phase, in which shortest paths are computed.
Edit intent: fluency
Original:  All existing techniques have a large index size, slow query running times , or may compute suboptimal paths.
Revised:  All existing techniques have large index size, slow query running times , or may compute suboptimal paths.
Edit intent: fluency
Original:  All existing techniques have a large index size, slow query running times , or may compute suboptimal paths.
Revised:  All existing techniques have a large index size, slow query running times or may compute suboptimal paths.
Edit intent: fluency
Original:   We perform an extensive experimental study on a set of real world instances and compare our approach with state-of-the-art techniques.
Revised:  We perform an experimental study on a set of real world instances and compare our approach with state-of-the-art techniques.
Edit intent: clarity
Original:  The proposed framework consists of a "recommender" and a "virtual user . " The recommender is formulizd as a collaborative-filtering method , recommending items according to observed user behavior.
Revised:  The proposed framework consists of a "recommender" and a "virtual user " The recommender is formulizd as a collaborative-filtering method , recommending items according to observed user behavior.
Edit intent: fluency
Original:  The proposed framework consists of a "recommender" and a "virtual user . " The recommender is formulizd as a collaborative-filtering method , recommending items according to observed user behavior.
Revised:  The proposed framework consists of a "recommender" and a "virtual user . " . The "recommender" is formulated as a CF model , recommending items according to observed user behavior.
Edit intent: clarity
Original:  The recommender  connected with the virtual user constructs a closed loop, that recommends users with items and imitates the unobserved feedback of the users to the recommended items.
Revised:  The recommender connected with the "virtual user" constructs a closed loop, that recommends users with items and imitates the unobserved feedback of the users to the recommended items.
Edit intent: fluency
Original:  The recommender  connected with the virtual user constructs a closed loop, that recommends users with items and imitates the unobserved feedback of the users to the recommended items.
Revised:  The recommender connected with the virtual user constructs a closed loop, that recommends users with items and imitates the unobserved feedback of the users to the recommended items.
Edit intent: fluency
Original:  The synthetic feedback is used to augment observed user behavior and improve recommendation results.
Revised:  The synthetic feedback is used to augment the observed user preference and improve recommendation results.
Edit intent: clarity
Original:  Such a model can be interpreted as the inverse reinforcement learning, which can be learned effectively via rollout (simulation).
Revised:  Theoretically, such model design can be interpreted as the inverse reinforcement learning, which can be learned effectively via rollout (simulation).
Edit intent: clarity
Original:  Such a model can be interpreted as the inverse reinforcement learning, which can be learned effectively via rollout (simulation).
Revised:  Such a model can be interpreted as inverse reinforcement learning, which can be learned effectively via rollout (simulation).
Edit intent: fluency
Original: Ensemble Kalman sampling (EKS) is a method to find  i.i.d. samples from a target distribution.
Revised: Ensemble Kalman Sampler (EKS) is a method to find i.i.d. samples from a target distribution.
Edit intent: fluency
Original:   In this paper, we analyze the continuous version of EKS, a coupled SDE system, and justify its mean-filed limit is a Fokker-Planck equation, whose equilibrium state is the target distribution.
Revised:  In this paper, we analyze the continuous version of EKS, a coupled SDE system, justify its mean-field limit is a Fokker-Planck equation, whose equilibrium state is the target distribution.
Edit intent: fluency
Original:   In this paper, we analyze the continuous version of EKS, a coupled SDE system, and justify its mean-filed limit is a Fokker-Planck equation, whose equilibrium state is the target distribution.
Revised:  In this paper, we analyze the continuous version of EKS, a coupled SDE system, and justify its mean-filed limit is a Fokker-Planck equation, whose long time equilibrium is the target distribution.
Edit intent: clarity
Original:  In this paper, we prove the well-posedness of the SDE system, justify its mean-field limit is a Fokker-Planck equation, whose long time equilibrium is the target distribution.
Revised:  In this paper, we prove the wellposedness of the SDE system, justify its mean-field limit is a Fokker-Planck equation, whose long time equilibrium is the target distribution.
Edit intent: fluency