wanyu/IteraTeR_v2 huggingface dataset:
Original: In smooth strongly convex optimization, or in the presence of H\"olderian error bounds, knowledge of the curvature parameter is critical for obtaining simple methods with accelerated rates.
Revised: In smooth strongly convex optimization, or in the presence of H\"olderian error bounds, knowledge of the strong convexity parameter is critical for obtaining simple methods with accelerated rates.
Edit intent: clarity
Original: In [McDonald, Pestana and Wathen, SIAM J. Sci. Comput., 40 (2018), pp. A1012--A1033], a block circulant preconditioner is proposed for all-at-once linear systems arising from evolutionary partial differential equations, in which the preconditioned matrix is proven to be diagonalizable and to have identity-plus-low-rank decomposition under the setting of heat equation.
Revised: In [McDonald, Pestana and Wathen, SIAM J. Sci. Comput., 40 (2018), pp. A1012--A1033], a block circulant preconditioner is proposed for all-at-once linear systems arising from evolutionary partial differential equations, in which the preconditioned matrix is proven to be diagonalizable and to have identity-plus-low-rank decomposition in the case of the heat equation.
Edit intent: clarity
Original:  (iii) GMRES method for the preconditioned system has a linear convergence rate independent of size of the linear system when \epsilon is taken to be smaller or comparable with square root of time-step size.
Revised:  (iii) GMRES method for the preconditioned system has a linear convergence rate independent of size of the linear system when \epsilon is taken to be smaller than or comparable to square root of time-step size.
Edit intent: clarity
Original:  This result holds with average degree of the graphs in O(1) and correlation parameter s  bounded away from 1, conditions under which random graph alignment is particularly challenging.
Revised:  This result holds with average degree of the graphs in O(1) and correlation parameter s that can be bounded away from 1, conditions under which random graph alignment is particularly challenging.
Edit intent: clarity
Original:  We empirically show that  graph neural networks induce a better compositional language prior and a stronger generalization to out-of-domain data.
Revised:  We empirically show that agents parametrized by graph neural networks induce a better compositional language prior and a stronger generalization to out-of-domain data.
Edit intent: clarity
Original:  At the same time, much of our language use is partner-specific: we know that words may be understood differently by different people based on local common ground .
Revised:  At the same time, much of our language use is partner-specific: we know that words may be understood differently by different people based on our shared history .
Edit intent: clarity
Original:  We propose a hierarchical Bayesian model of convention to explain how speakers and listeners abstract away meanings that seem to be shared across partners .
Revised:  We propose a hierarchical Bayesian model to explain how speakers and listeners abstract away meanings that seem to be shared across partners .
Edit intent: clarity
Original:  We propose a hierarchical Bayesian model of convention to explain how speakers and listeners abstract away meanings that seem to be shared across partners .
Revised:  We propose a hierarchical Bayesian model of convention to explain how speakers and listeners solve this inductive problem .
Edit intent: clarity
Original:  We examine several measures of generalization across partners, and find key signatures of local adaptation as well as collective convergence .
Revised:  We examine several measures of generalization and find key signatures of local adaptation as well as collective convergence .
Edit intent: clarity
Original:  These results suggest that local partner-specific learning is not only compatible with global convention formation but may facilitate it when coupled with a powerful hierarchical inductive mechanism.
Revised:  These results suggest that partner-specificity is not only compatible with global convention formation but may facilitate it when coupled with a powerful hierarchical inductive mechanism.
Edit intent: clarity
Original:  These results suggest that local partner-specific learning is not only compatible with global convention formation but may facilitate it when coupled with a powerful hierarchical inductive mechanism.
Revised:  These results suggest that local partner-specific learning is not only compatible with global convention formation but may facilitate it when coupled with a powerful inductive mechanism.
Edit intent: clarity
Original:  To determine if a biological network is robust and/or evolvable, the comparison of its functions before and after mutations is required .
Revised:  To determine if a biological network is robust and/or evolvable, it is required to compare its functions before and after mutations is required .
Edit intent: coherence
Original:  To determine if a biological network is robust and/or evolvable, the comparison of its functions before and after mutations is required .
Revised:  To determine if a biological network is robust and/or evolvable, the comparison of its functions before and after mutations .
Edit intent: clarity
Original:  However, it has an increasing computational cost as  network size grows.
Revised:  However, this sometimes takes a high computational cost as network size grows.
Edit intent: clarity
Original:  However, it has an increasing computational cost as  network size grows.
Revised:  However, it has an increasing computational cost as the network size grows.
Edit intent: fluency
Original:  Here we aim to develop a predictor to estimate the robustness and evolvability of biological networks without an explicit comparison of functions.
Revised:  Here we develop a predictive method to estimate the robustness and evolvability of biological networks without an explicit comparison of functions.
Edit intent: clarity
Original:  Antifragility is a property to improve the capability of a system through external perturbations.
Revised:  Antifragility occurs when a system benefits from external perturbations.
Edit intent: clarity
Original:  Thus, we conclude that our antifragility measure can be used as a significant predictor of the robustness and evolvability of biological networks.
Revised:  Thus, we conclude that our antifragility measure can be used as a predictor of the robustness and evolvability of biological networks.
Edit intent: clarity
Original:  We establish exponential convergence of the method and derive error estimates for the approximate forces that do not explicitly depend on the number of dielectric particles N. Consequently, the proposed method requires only O(N) operations to compute the electrostatic forces acting on N dielectric particles up to any given and fixed average error.
Revised:  We establish exponential convergence of the method and derive error estimates for the approximate forces that do not explicitly depend on the number of dielectric particles N. Consequently, the proposed method requires only O(N) operations to compute the electrostatic forces acting on N dielectric particles up to any given and fixed relative error.
Edit intent: clarity
Original: The paper deals with Age of Information  in a network of multiple sources and parallel servers/ queues with buffering capabilities, preemption in service and losses in served packets.
Revised: The paper deals with Age of Information in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets.
Edit intent: clarity
Original:  The servers do not communicate between each other and the packets are dispatched through the servers according to a predefined probabilistic routing.
Revised:  The servers do not communicate between each other and the packets are dispatched through the queues according to a predefined probabilistic routing.
Edit intent: clarity
Original:  We show  known results of packets delay in Queuing Theory do not hold for Age of Information .
Revised:  We show that known results of packets delay in Queuing Theory do not hold for Age of Information .
Edit intent: fluency
Original:  We show  known results of packets delay in Queuing Theory do not hold for Age of Information .
Revised:  We show known results of packets delay in Queuing Theory do not hold for the AoI .
Edit intent: clarity
Original:  Unfortunately, the complexity of computing the Age of Information using the SHS method increases highly with the number of queues.
Revised:  Unfortunately, the complexity of computing the average AoI using the SHS method increases highly with the number of queues.
Edit intent: clarity
Original:  We therefore provide an upper bound of the average Age of Information in a parallel server system of an arbitrary number of M/M/1/(N+1) queues and  its tightness in various regimes.
Revised:  We therefore provide an upper bound of the average AoI in a system of an arbitrary number of M/M/1/(N+1) queues and its tightness in various regimes.
Edit intent: clarity
Original:  Instead, they will rely on combinatorial-geometric arguments, such as discretised versions of Kaufman's } "potential theoretic" argument, and the pigeonhole principle  .
Revised:  Instead, they will rely on combinatorial-geometric arguments, such as discretised versions of Kaufman's } "potential theoretic" method, the pigeonhole principle .
Edit intent: clarity
Original:  Statistics of the peak load are presented as well as the size and shape of an active zone at the time when the maximum load is attained.
Revised:  Statistics of the peak load are presented as well as the size and shape of the fracture process zone at the time when the maximum load is attained.
Edit intent: clarity
Original:  Statistics of the peak load are presented as well as the size and shape of an active zone at the time when the maximum load is attained.
Revised:  Statistics of the peak load are presented as well as the size and shape of an active zone at the moment when the maximum load is attained.
Edit intent: clarity
Original:  The active zone is a region that is dissipating energy at a certain loading stage, it is understood as an instantaneous contribution to the fracture process zone.
Edit intent: coherence
Original:  Our goal is to correctly associate a set of messages posted in a small radius around a given location with their corresponding location type, e.g., school, church, restaurant or museum.
Revised:  Our goal is to correctly associate a set of messages posted in a small radius around a given location with the corresponding location type, e.g., school, church, restaurant or museum.
Edit intent: clarity
Original:  We explore two approaches to the problem: (a) a pipeline approach  where each message is first classified, and then the location associated with the message set is inferred from the individual message labels;
Revised:  We explore two approaches to the problem: (a) a pipeline approach , where each message is first classified, and then the location associated with the message set is inferred from the individual message labels;
Edit intent: fluency
Original:  We claim that, rather than combining different features that originate from waveforms, it is more effective to use waveforms directly predicting corresponding head motion.
Revised:  We show that, rather than combining different features that originate from waveforms, it is more effective to use waveforms directly predicting corresponding head motion.
Edit intent: clarity
Original: This paper presents Polylidar, an efficient algorithm to extract non-convex polygons from 2D point sets  . Polylidar is able to extract multiple disjoint polygons and capture interior holes.
Revised: This paper presents Polylidar, an efficient algorithm to extract non-convex polygons from 2D point sets . 
Edit intent: coherence
Original:  Next, connected triangles are extracted into triangular meshes representing the shape of the point set.
Revised:  Next, connected triangles are extracted into triangular mesh regions representing the shape of the point set.
Edit intent: clarity
Original:  This paper describes Polylidar and provides benchmarks to comparatively evaluate its speed and accuracy.
Revised:  This paper describes Polylidar and provides benchmarks to comparatively evaluate Polylidar speed and accuracy.
Edit intent: clarity
Original: Pass Transistor Logic (PTL) provides decreased device count relative to conventional complementary circuit structures, but the buffering inverters required for cascading PTL gates diminishes this advantage.
Revised: Pass Transistor Logic (PTL) family reduces the number of transistors required to perform logic functions, thereby reducing both area and power consumption. However, this logic family requires inter-stage inverters to ensure signal integrity in cascaded logic circuits, and inverters must be used to provide each logical input signal in its complementary form. These inverters and complementary signals increase the device count and significantly degrade overall system efficiency.
Edit intent: clarity
Original:  Session types are interpreted as domains of bidirectional communications.
Edit intent: coherence
Original:  We use polarity to naturally relate these to pairs of domains of unidirectional communications  . Processes denote continuous functions between domains of unidirectional communication.
Revised:  We use polarity to naturally relate these to pairs of domains of unidirectional communications . Processes denote continuous functions between domains of unidirectional communication . Processes denote continuous functions between domains of unidirectional communication.
Edit intent: fluency
Original: The polarized SILL programming language uniformly integrates functional programming and session-based concurrency.
Revised: The polarized SILL programming language uniformly integrates functional programming and session-typed message-passing concurrency.
Edit intent: clarity
Original:  Our semantics validates many expected program equivalences.
Revised:  We illustrate our semantics by validating expected program equivalences.
Edit intent: clarity
Original:  These hierarchical models are commonly used to model population dynamics and animal movement, and  are now increasingly being used to model other ecological processes.
Revised:  These hierarchical models are commonly used to model population dynamics , animal movement, and are now increasingly being used to model other ecological processes.
Edit intent: fluency
Original: The task of filling-in or predicting missing entries of a matrix, from a subset of known entries, is known asmatrix completion .
Revised: matrix completion .
Edit intent: clarity
Original: The task of filling-in or predicting missing entries of a matrix, from a subset of known entries, is known asmatrix completion .
Revised: The task of filling-in or predicting missing entries of a matrix, from a subset of known entries, is known as .
Edit intent: clarity
Original: The task of filling-in or predicting missing entries of a matrix, from a subset of known entries, is known asmatrix completion .
Revised: The task of filling-in or predicting missing entries of a matrix, from a subset of known entries, is known asmatrix completion 
Edit intent: fluency
Original:   In recent work, a modification to the standard nuclear norm minimization  for matrix completion has been made to take into account structural differences between observed and unobserved entries.
Revised:  In recent work, a modification to the standard nuclear norm minimization for matrix completion has been developed to take into account structural differences between observed and unobserved entries.
Edit intent: clarity
Original:   In recent work, a modification to the standard nuclear norm minimization  for matrix completion has been made to take into account structural differences between observed and unobserved entries.
Revised:  In recent work, a modification to the standard nuclear norm minimization for matrix completion has been made to take into account between observed and unobserved entries.
Edit intent: clarity
Original:  One example of such structural difference is when the probability that an entry is observed or not depends mainly on the value of the entry.
Revised:  One example of such structural difference is when the probability that an entry is observed or not depends on the value of the entry.
Edit intent: clarity
Original:  We propose adjusting an Iteratively Reweighted Least Squares (IRLS) algorithm for low-rank matrix completion to take into account sparsity-based structure in the missing entries.
Revised:  We propose adjusting an Iteratively Reweighted Least Squares (IRLS) algorithm for low-rank matrix completion to take into account sparsity-based structure in the missing entries.
Edit intent: fluency
Original:  In today's data-driven world, data completion is essential whether it is the main goal or a pre-processing step.
Revised: . In today's data-driven world, data completion is essential whether it is the main goal or a pre-processing step.
Edit intent: fluency
Original:  In recent work, a modification to the standard nuclear norm minimization (NNM) for matrix completion has been developed to take into account sparsity-based structure in the missing entries.
Revised:  In recent work, a modification to the standard nuclear norm minimization (NNM) for matrix completion has been developed to take into account sparsity-based structure in the missing entries.
Edit intent: fluency
Original:  This notion of structure is motivated in many settings including recommender systems, where the probability that an entry is observed or not depends on the value of the entry.
Revised:  This notion of structure is motivated in many settings including recommender systems, where the probability that an entry is observed depends on the value of the entry.
Edit intent: clarity
Original:  This paper introduces a decentralized marketplace for trading personal sensing data , generated by resource-constrained IoT devices in real-time.
Revised:  Typically, marketplaces are centralized systems that raise concerns of privacy, single point of failure, little transparency and involve trusted intermediaries to be fair. Furthermore, the battery-operated IoT devices limit the amount of IoT data to be traded in real-time that affects buyer/seller satisfaction and hence, impacting the sustainability and usability of such a marketplace. This work proposes to utilize blockchain technology to realize a trusted and transparent decentralized marketplace for trading personal sensing data , generated by resource-constrained IoT devices in real-time.
Edit intent: coherence
Original:  Moreover, we present a proof-of-concept implementation of the blockchain frameworkin Ethereum.
Revised:  Moreover, we present a proof-of-concept implementation in Ethereum to demonstrate the feasibility of the framework. We investigated the blockchain frameworkin Ethereum.
Edit intent: clarity
Original:  However, we empirically find that the two most common designs in GCNs --- feature transformation and nonlinear activation --- contribute little to the performance of collaborative filtering.
Revised:  However, we empirically find that the two most common designs in GCNs -- feature transformation and nonlinear activation --- contribute little to the performance of collaborative filtering.
Edit intent: fluency
Original:  However, we empirically find that the two most common designs in GCNs --- feature transformation and nonlinear activation --- contribute little to the performance of collaborative filtering.
Revised:  However, we empirically find that the two most common designs in GCNs --- feature transformation and nonlinear activation -- contribute little to the performance of collaborative filtering.
Edit intent: fluency
Original:  We propose a new model named LightGCN, including only the most essential component in GCN --- neighborhood aggregation --- for collaborative filtering.
Revised:  We propose a new model named LightGCN, including only the most essential component in GCN -- neighborhood aggregation -- for collaborative filtering.
Edit intent: fluency
Original:  Such simple, linear, and neat model is much easier to implement and train, exhibiting substantial improvements (about 16.5 \\% relative improvement on average) over Neural Graph Collaborative Filtering (NGCF) --- a state-of-the-art GCN-based recommender model --- under exactly the same experimental setting.
Revised:  Such simple, linear, and neat model is much easier to implement and train, exhibiting substantial improvements (about 16.5 \\% relative improvement on average) over Neural Graph Collaborative Filtering (NGCF) -- a state-of-the-art GCN-based recommender model --- under exactly the same experimental setting.
Edit intent: fluency
Original:  Such simple, linear, and neat model is much easier to implement and train, exhibiting substantial improvements (about 16.5 \\% relative improvement on average) over Neural Graph Collaborative Filtering (NGCF) --- a state-of-the-art GCN-based recommender model --- under exactly the same experimental setting.
Revised:  Such simple, linear, and neat model is much easier to implement and train, exhibiting substantial improvements (about 16.5 \\% relative improvement on average) over Neural Graph Collaborative Filtering (NGCF) --- a state-of-the-art GCN-based recommender model -- under exactly the same experimental setting.
Edit intent: fluency
Original:  We  numerically prove the existence of asymmetric solutions of the H\'enon equation for several parameters representing the ratio of transverse to radial velocity.
Revised:  We numerically prove the existence of solutions of the H\'enon equation for several parameters representing the ratio of transverse to radial velocity.
Edit intent: clarity
Original: Advances in Data Science are lately permeating every field of Transportation Science and Engineering, making it straightforward to imagine that developments in the transportation sector will be data-driven.
Revised: Advances in Data Science permeate every field of Transportation Science and Engineering, making it straightforward to imagine that developments in the transportation sector will be data-driven.
Edit intent: coherence
Original:  The present work aims to describe how data, coming from diverse ITS sources, can be used to learn and adapt data-driven models for efficiently operating ITS assets, systems and processes;
Revised:  This work aims to describe how data, coming from diverse ITS sources, can be used to learn and adapt data-driven models for efficiently operating ITS assets, systems and processes;
Edit intent: clarity
Original:  We deliberately generalize model learning to be adaptive, since, in the core of our paper is the firm conviction that most learners will have to adapt to the everchanging phenomenon scenario underlying the majority of ITS applications.
Revised:  We deliberately generalize model learning to be adaptive, since, in the core of our paper is the firm conviction that most learners will have to adapt to the ever-changing phenomenon scenario underlying the majority of ITS applications.
Edit intent: fluency
Original:  Finally, we provide a prospect of current research lines within the Data Science realm that can bring notable advances to data-based ITS modeling, which will eventually bridge the gap towards the practicality and actionability of such models.
Revised:  Finally, we provide a prospect of current research lines within Data Science that can bring notable advances to data-based ITS modeling, which will eventually bridge the gap towards the practicality and actionability of such models.
Edit intent: clarity
Original: Advances in Data Science permeate every field of Transportation Science and Engineering, making it straightforward to imagine that developments in the transportation sector will be  data-driven.
Revised: Advances in Data Science permeate every field of Transportation Science and Engineering, resulting in developments in the transportation sector will be data-driven.
Edit intent: coherence