wanyu/IteraTeR_v2 huggingface dataset:
Original:  More importantly, we successfully use curve and network clustering techniques to enhance the accuracy of the predictions, to recover good population mapping potential and to reduce the collection of informative data for planning to substantially smaller samples.
Revised:  More importantly, we successfully use curve and network clustering techniques to enhance the accuracy of the predictions, to recover good population mapping potential and to reduce the collection of required data to substantially smaller samples.
Edit intent: clarity
Original: We demonstrate the possibility of what we call sparse learning: accelerated training of deep neural networks that maintain sparse weights throughout training while achieving performance levels competitive with dense networks .
Revised: We demonstrate the possibility of what we call sparse learning: accelerated training of deep neural networks that maintain sparse weights throughout training while achieving dense performance levels .
Edit intent: clarity
Original: Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in the purely topological persistence diagrams (also termed as barcodes ).
Revised: Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagrams (also termed as barcodes ).
Edit intent: fluency
Original: Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in the purely topological persistence diagrams (also termed as barcodes ).
Revised: Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in the purely topological persistence diagram (also termed as barcodes ).
Edit intent: fluency
Original: Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in the purely topological persistence diagrams (also termed as barcodes ).
Revised: Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in the purely topological persistence diagrams (also termed as barcode ).
Edit intent: fluency
Original:  CallE supports both flexible and fine grained control over such behaviour, in a way designed to minimise the complexity of annotations.
Revised:  CallE supports both flexible and fine-grained control over such behaviour, in a way designed to minimise the complexity of annotations.
Edit intent: fluency
Original: Genomics is the critical key to enable the precision medicine, ensure the global food security and enforce the wildlife conservation.
Revised: Genomics is the critical key to enabling precision medicine, ensure the global food security and enforce the wildlife conservation.
Edit intent: fluency
Original: Genomics is the critical key to enable the precision medicine, ensure the global food security and enforce the wildlife conservation.
Revised: Genomics is the critical key to enable the precision medicine, ensuring global food security and enforce the wildlife conservation.
Edit intent: fluency
Original: Genomics is the critical key to enable the precision medicine, ensure the global food security and enforce the wildlife conservation.
Revised: Genomics is the critical key to enable the precision medicine, ensure the global food security and enforcing wildlife conservation.
Edit intent: fluency
Original:  The state-of-the-art genome analysis adopts the FM-Index that augments the space-efficient BWT with additional data structures permitting fast EPM operations.
Revised:  State-of-the-art genome analysis adopts the FM-Index that augments the space-efficient BWT with additional data structures permitting fast EPM operations.
Edit intent: coherence
Original:  But the FM-Index is notorious for the poor spatial locality and massive random memory accesses.
Revised:  But the FM-Index is notorious for poor spatial locality and massive random memory accesses.
Edit intent: fluency
Original:  We build a reliable and energy-efficient Hamming distance unit to accelerate the computing kernel of FM-Index search by commodity ReRAM chips without introducing extra CMOS logic.
Revised:  We build a reliable and energy-efficient Hamming distance unit to accelerate the computing kernel of FM-Index search using commodity ReRAM chips without introducing extra CMOS logic.
Edit intent: fluency
Original:  Here we explore the interplay between these opposing driving forces  and in particular the phase transitions that emerge in the periodic geometry of stacked thylakoid membrane disks .
Revised:  Here we explore the interplay between these opposing driving forces , and in particular the phase transitions that emerge in the periodic geometry of stacked thylakoid membrane disks .
Edit intent: fluency
Original:  Here we explore the interplay between these opposing driving forces  and in particular the phase transitions that emerge in the periodic geometry of stacked thylakoid membrane disks .
Revised:  Here we explore the interplay between these opposing driving forces and in particular the phase transitions that emerge in the periodic geometry of stacked thylakoid membrane discs .
Edit intent: fluency
Original:  Mean field analysis and computer simulation reveal rich phase behavior for this simple model, featuring a broken-symmetry stripe phase that is disrupted at both high and low extremes of chemical potential.
Revised:  Mean field analysis and computer simulation reveal rich phase behavior for this simple model, featuring a broken-symmetry striped phase that is disrupted at both high and low extremes of chemical potential.
Edit intent: fluency
Original:  Our algorithm employs dynamic programming , with Algebraic Decision Diagrams as the primary data structure.
Revised:  Our algorithm employs dynamic programming and uses Algebraic Decision Diagrams as the primary data structure.
Edit intent: coherence
Original:  This technique is implemented in ADDMC, a new model counter.
Revised:  We implement this technique in ADDMC, a new model counter.
Edit intent: clarity
Original:  We empirically evaluate various heuristics that can be used with ADDMC. We also compare ADDMC to state-of-the-art exact  model counters (Cachet, c2d, d4, miniC2D, and sharpSAT) on the two largest CNF model counting benchmark families (BayesNet and Planning).
Revised:  We empirically evaluate various heuristics that can be used with ADDMC. We then compare ADDMC to state-of-the-art exact model counters (Cachet, c2d, d4, miniC2D, and sharpSAT) on the two largest CNF model counting benchmark families (BayesNet and Planning).
Edit intent: clarity
Original:  We then fully characterize the trees that achieve this minimum value and we introduce both an algorithm to generate them and a recurrence to count them.
Revised:  We then fully characterize the tree shapes that achieve this minimum value and we introduce both an algorithm to generate them and a recurrence to count them.
Edit intent: clarity
Original: To mitigate the performance gap between the CPU and the main memory, multi-level cache architectures are widely used in modern processors.
Revised: To mitigate the performance gap between CPU and the main memory, multi-level cache architectures are widely used in modern processors.
Edit intent: fluency
Original:  In this paper we propose REACT, a distributed framework for reactive network resilience, that is, allowing a network to reconfigure itself in the event of a security incident so that the risk of further damage is mitigated.
Revised:  In this paper we propose REACT, a distributed framework for reactive network resilience, which allows networks to reconfigure themselves in the event of a security incident so that the risk of further damage is mitigated.
Edit intent: coherence
Original:  In this paper we propose REACT, a distributed framework for reactive network resilience, that is, allowing a network to reconfigure itself in the event of a security incident so that the risk of further damage is mitigated.
Revised:  In this paper we propose REACT, a distributed framework for reactive network resilience, that is, allowing a network to reconfigure itself in the event of a security incidents so that the risk of further damage is mitigated.
Edit intent: fluency
Original:  The proposed framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion to agree on a new, more resilient configuration of the network in the event of an attack.
Revised:  Our framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion to agree on a new, more resilient configuration of the network in the event of an attack.
Edit intent: clarity
Original:  The proposed framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion to agree on a new, more resilient configuration of the network in the event of an attack.
Revised:  The proposed framework takes advantage of a risk model based on multilayer networks , as well as a graph-coloring problem conversion to agree on a new, more resilient configuration of the network in the event of an attack.
Edit intent: coherence
Original:  The proposed framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion to agree on a new, more resilient configuration of the network in the event of an attack.
Revised:  The proposed framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion , to identify new, more resilient configuration of the network in the event of an attack.
Edit intent: clarity
Original:  The proposed framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion to agree on a new, more resilient configuration of the network in the event of an attack.
Revised:  The proposed framework takes advantage of a risk model based on multilayer networks and of a graph-coloring problem conversion to agree on a new, more resilient configurations for networks in the event of an attack.
Edit intent: clarity
Original:  We provide two different perspectives to the resulting problem, and propose two different  , network-guided approaches, which we compare in both perspectives with a number of centralized optimization techniques.
Revised:  We propose two different , network-guided approaches, which we compare in both perspectives with a number of centralized optimization techniques.
Edit intent: coherence
Original:  We provide two different perspectives to the resulting problem, and propose two different  , network-guided approaches, which we compare in both perspectives with a number of centralized optimization techniques.
Revised:  We provide two different perspectives to the resulting problem, and propose two different , with a number of centralized optimization techniques.
Edit intent: coherence
Original:  Experiments show that our approaches outperform the reference approaches in terms of both risk mitigation and performance.
Revised:  Experiments show that our approaches outperform the reference approaches in terms of risk mitigation and performance.
Edit intent: clarity
Original:  Given a game , this article considers equivalence relations over histories of played actions.
Revised:  Given a concurrent two-player win/lose game of infinite duration , this article considers equivalence relations over histories of played actions.
Edit intent: clarity
Original:  Three corollaries follow for games with states and colors .
Revised:  Several corollaries follow for games with states and colors .
Edit intent: fluency
Original: Features play an important role in most prediction tasks of e-commerce recommendations.
Revised: Features play an important role in the prediction tasks of e-commerce recommendations.
Edit intent: clarity
Original:  To guarantee the consistence of off-line training and on-line serving, we usually utilize the same features that are both available.
Revised:  To guarantee the consistency of off-line training and on-line serving, we usually utilize the same features that are both available.
Edit intent: fluency
Original:  However, the consistence in turn neglects some discriminative features.
Revised:  However, the consistency in turn neglects some discriminative features.
Edit intent: fluency
Original:  For example, when estimating the conversion rate (CVR), i.e., the probability that a user would purchase the item after she has clicked it, features like dwell time on the item detailed page can be very informative.
Revised:  For example, when estimating the conversion rate (CVR), i.e., the probability that a user would purchase the item if she clicked it, features like dwell time on the item detailed page can be very informative.
Edit intent: clarity
Original:  For example, when estimating the conversion rate (CVR), i.e., the probability that a user would purchase the item after she has clicked it, features like dwell time on the item detailed page can be very informative.
Revised:  For example, when estimating the conversion rate (CVR), i.e., the probability that a user would purchase the item after she has clicked it, features like dwell time on the item detailed page are informative.
Edit intent: clarity
Original:  Here we define the features that are discriminative but only available during training as the privileged features.
Revised:  We define the features that are discriminative but only available during training as the privileged features.
Edit intent: coherence
Original:  Knowledge distilled from the more accurate teacher is transferred to the student , which helps to improve its prediction accuracy.
Revised:  Knowledge distilled from the more accurate teacher is transferred to the student to improve its prediction accuracy.
Edit intent: coherence
Original:  Knowledge distilled from the more accurate teacher is transferred to the student , which helps to improve its prediction accuracy.
Revised:  Knowledge distilled from the more accurate teacher is transferred to the student , which helps to improve its accuracy.
Edit intent: clarity
Original:  To validate the effectiveness of PFD, we conduct experiments on two fundamental prediction tasks in Taobao recommendations, i.e., click-through rate (CTR) at coarse-grained ranking and CVR at fine-grained ranking.
Revised:  To validate the effectiveness of PFD, we conduct experiments on two fundamental prediction tasks at Taobao recommendations, i.e., click-through rate (CTR) at coarse-grained ranking and CVR at fine-grained ranking.
Edit intent: fluency
Original: We propose and study generalizations to the well-known problem of polyline simplification.
Revised: We propose and study a generalization to the well-known problem of polyline simplification.
Edit intent: fluency
Original:  A plethora of statistical and machine learning techniques have been demonstrated in this domain.
Revised:  Many statistical and machine learning techniques have been demonstrated in this domain.
Edit intent: clarity
Original:  We also evaluated the use of genetic programming to design and optimise learning models without human guidance , finding that performance matched that of models hand-crafted by human experts.
Revised:  We also evaluated the use of genetic programming to design and optimise models without human guidance , finding that performance matched that of models hand-crafted by human experts.
Edit intent: clarity
Original:  We also evaluated the use of genetic programming to design and optimise learning models without human guidance , finding that performance matched that of models hand-crafted by human experts.
Revised:  We also evaluated the use of genetic programming to design and optimise learning models without human guidance . Remarkably, these were found to match the performance of the best models hand-crafted by human experts.
Edit intent: clarity
Original:  Many statistical and machine learning techniques have been demonstrated in this domain.
Revised:  Many machine learning techniques have been demonstrated in this domain.
Edit intent: clarity
Original:  Support vectors and linear regression were consistently amongst the top performers in both datasets and performed comparably to recent ensemble approaches .
Revised:  Support vectors and linear regression were amongst the top performers in both datasets and performed comparably to recent ensemble approaches .
Edit intent: clarity
Original:  We also evaluated the use of genetic programming to design and optimise models without human guidance.
Revised:  We also introduced genetic programming to design and optimise models without human guidance.
Edit intent: clarity
Original:  Remarkably, these were found to match the performance of the best models hand-crafted by human experts.
Revised:  Remarkably, the generated models were found to match the performance of the best models hand-crafted by human experts.
Edit intent: clarity
Original: We present Imitation-Projected Policy Gradient (IPPG), an algorithmic framework for learningpolicies that are parsimoniously represented in a structured programming language.
Revised: We study the problem of programmatic reinforcement learning, in which policies are represented as short programs in a symbolic language.
Edit intent: clarity
Original:  IPPG, our response to this challenge , is based on three insights.
Revised:  Our approach to this challenge , is based on three insights.
Edit intent: clarity
Original:  We present theoretical convergence results for IPPG, as well as an empirical evaluation in three continuous control domains.
Revised:  We present theoretical convergence results for PROPEL and empirically evaluate the approach in three continuous control domains.
Edit intent: clarity
Original:  Such programmatic policies can be more interpretable, generalizable, and amenable to formal verification than neural policies;
Revised:  Programmatic policies can be more interpretable, generalizable, and amenable to formal verification than neural policies;
Edit intent: coherence
Original:  however, designing rigorous learning approaches for programmatic policies remains a challenge.
Revised:  however, designing rigorous learning approaches for such policies remains a challenge.
Edit intent: clarity
Original:  Our approach to this challenge - a meta-algorithm called PROPEL - is based on three insights.
Revised:  Our approach to this challenge -- a meta-algorithm called PROPEL - is based on three insights.
Edit intent: fluency
Original:  Our approach to this challenge - a meta-algorithm called PROPEL - is based on three insights.
Revised:  Our approach to this challenge - a meta-algorithm called PROPEL -- is based on three insights.
Edit intent: fluency
Original:  We introduce two new algorithmic techniques to approximate all eccentricities in  distance-hereditary graphs, including a linear time additive 1-approximation .
Revised:  We introduce two new algorithmic techniques to approximate all eccentricities in a distance-hereditary graphs, including a linear time additive 1-approximation .
Edit intent: fluency
Original:  We introduce two new algorithmic techniques to approximate all eccentricities in  distance-hereditary graphs, including a linear time additive 1-approximation .
Revised:  We introduce two new algorithmic techniques to approximate all eccentricities in distance-hereditary graph .
Edit intent: coherence
Original: The spectrum of a matrix contains important structural information about the underlying data, and hence there is considerable interest in computing various functions of the matrix spectrum.
Revised: Spectral functions of large matrices contains important structural information about the underlying data, and hence there is considerable interest in computing various functions of the matrix spectrum.
Edit intent: clarity
Original:  Large matrices representing real-world data are often sparse (most entries are zeros) or doubly sparse , i.e., sparse in both rows and columns .
Revised:  Large matrices representing real-world data are sparse (most entries are zeros) or doubly sparse , i.e., sparse in both rows and columns .
Edit intent: clarity
Original:  Large matrices representing real-world data are often sparse (most entries are zeros) or doubly sparse , i.e., sparse in both rows and columns .
Revised:  Large matrices representing real-world data are often sparse or doubly sparse , i.e., sparse in both rows and columns .
Edit intent: coherence
Original:  Large matrices representing real-world data are often sparse (most entries are zeros) or doubly sparse , i.e., sparse in both rows and columns .
Revised:  Large matrices representing real-world data are often sparse (most entries are zeros) or doubly sparse ( i.e., sparse in both rows and columns .
Edit intent: fluency
Original:  In this setting, where space (memory) is the limiting resource, computing spectral functions is an expensive task and known algorithms require space that is polynomial in the dimension of the matrix, even for sparse matrices.
Revised:  In this setting, where space (memory) is the limiting resource, all known algorithms require space that is polynomial in the dimension of the matrix, even for sparse matrices.
Edit intent: clarity
Original:  We further prove that multiple passes are unavoidable in this setting and show several extensions of our primary technique, including stronger upper bounds for special matrix families, algorithms for the more difficult turnstile model, and a trade-off between space requirements and number of passes.
Revised:  We further prove that multiple passes are unavoidable in this setting , and show extensions of our primary technique, including stronger upper bounds for special matrix families, algorithms for the more difficult turnstile model, and a trade-off between space requirements and number of passes.
Edit intent: clarity
Original:  We further prove that multiple passes are unavoidable in this setting and show several extensions of our primary technique, including stronger upper bounds for special matrix families, algorithms for the more difficult turnstile model, and a trade-off between space requirements and number of passes.
Revised:  We further prove that multiple passes are unavoidable in this setting and show several extensions of our primary technique, including a trade-off between space requirements and number of passes.
Edit intent: clarity
Original: We consider the following general scheduling problem : there are m identical machines and n jobs all released at time 0. Each job j has a processing time p_j , and an arbitrary non-decreasing  function f_j that specifies the cost incurred for j, for each possible completion time.
Revised: We consider the following general scheduling problem : there are m identical machines and n jobs all released at time 0, where job j has a processing time p_j , and an arbitrary non-decreasing function f_j that specifies the cost incurred for j, for each possible completion time.
Edit intent: clarity
Original: We consider the following general scheduling problem : there are m identical machines and n jobs all released at time 0. Each job j has a processing time p_j , and an arbitrary non-decreasing  function f_j that specifies the cost incurred for j, for each possible completion time.
Revised: We consider the following general scheduling problem : there are m identical machines and n jobs all released at time 0. Each job j has size p_j and an associated arbitrary non-decreasing function f_j that specifies the cost incurred for j, for each possible completion time.
Edit intent: clarity