wanyu/IteraTeR_v2 huggingface dataset:
Original:  comparing the graph for the subgroup with that for the full population gives some sense of how the averages for the subgroup deviate from the averages for the full population.
Revised:  comparing the graph for the subpopulation with that for the full population gives some sense of how the averages for the subgroup deviate from the averages for the full population.
Edit intent: fluency
Original:  comparing the graph for the subgroup with that for the full population gives some sense of how the averages for the subgroup deviate from the averages for the full population.
Revised:  comparing the graph for the subgroup with that for the full population gives some sense of how the averages for the subpopulation deviate from the averages for the full population.
Edit intent: fluency
Original:  Unfortunately, real data sets contain only finitely many observations, limiting the usable resolution of the bins, and so the conventional methods can obscure important variations due to the choice of bins .
Revised:  Unfortunately, real data sets contain only finitely many observations, limiting the usable resolution of the bins, and so the conventional methods can obscure important variations due to the binning .
Edit intent: clarity
Original:  Fortunately, plotting cumulative deviation of the subgroup from the full population  sidesteps the problematic  binning.
Revised:  Fortunately, plotting cumulative deviation of the subpopulation from the full population sidesteps the problematic binning.
Edit intent: clarity
Original:  The cumulative plots encode subgroup deviation directly as the slopes of secant lines for the graphs.
Revised:  The cumulative plots encode subpopulation deviation directly as the slopes of secant lines for the graphs.
Edit intent: clarity
Original:  The cumulative approach avoids binning that smooths over deviations of the subgroup from the full population  .
Revised:  The cumulative approach avoids binning that smooths over deviations of the subpopulation from the full population .
Edit intent: clarity
Original:  Under realistic  assumptions on the mesh grading in three dimensions we show W^{1,2}-stability for all polynomial degrees greater than one .
Revised:  Under realistic assumptions on the mesh grading in three dimensions we show W^{1,2}-stability for all polynomial degrees .
Edit intent: clarity
Original: Motivation: Antibodies are widely used reagents to test for expression of proteins  .
Revised:  Antibodies are widely used reagents to test for expression of proteins .
Edit intent: coherence
Original:  While many proposals have been developed to deal with the problem of antibody specificity, they may not scale well to deal with the millions of antibodies that are available to researchers.
Revised:  While many proposals have been developed to deal with the problem of antibody specificity, it is still challenging to cover the millions of antibodies that are available to researchers.
Edit intent: clarity
Original:  In this study, we investigate the feasibility of automatically generating a report to alert users of problematic antibodies by extracting statements about antibody specificity reported in the literature.
Revised:  In this study, we investigate the feasibility of automatically generating alerts to users of problematic antibodies by extracting statements about antibody specificity reported in the literature.
Edit intent: clarity
Original:  Given an input article, the first task is to identify snippets about antibody specificity and classify if the snippets report that any antibody exhibits nonspecificity , and thus is problematic.
Revised:  Given an input article, the first task is to identify snippets about antibody specificity and classify if the snippets report that any antibody exhibits non-specificity , and thus is problematic.
Edit intent: fluency
Original: During the course of an epidemic , individuals constantly make decisions on how to fight against epidemic spreading.
Revised: The outcome of an epidemic , individuals constantly make decisions on how to fight against epidemic spreading.
Edit intent: clarity
Original:  Here, we introduce a novel parsimonious  model, grounded in evolutionary game theory, able to capture decision-making dynamics over heterogeneous time scales.
Revised:  Here, we introduce a novel parsimonious model, grounded in evolutionary game theory, in which decision-making dynamics over heterogeneous time scales.
Edit intent: clarity
Original:  Our motivation lies in that this metric has the far simpler numerical tests which can lead to computational speedups for high-dimensional data analysis.
Edit intent: coherence
Original:  We also introduce two new complexes which we call the Alpha clique and Minibox complexes .
Revised:  We also introduce two new complexes which we call the Alpha flag and Minibox complexes .
Edit intent: fluency
Original: Proximity complexes and filtrations are a central construction in topological data analysis.
Revised: Proximity complexes and filtrations are central constructions in topological data analysis.
Edit intent: fluency
Original:  Built using distance functions  or more generally metrics, they are often used to infer connectivity information from point clouds.
Revised:  Built using distance functions , or more generally metrics, they are often used to infer connectivity information from point clouds.
Edit intent: fluency
Original:  We investigate proximity complexes and filtrations built over the Chebyshev metric, also known as the maximum metric or \infty metric, rather than the classical Euclidean metric.
Revised:  Here we investigate proximity complexes and filtrations built over the Chebyshev metric, also known as the maximum metric or \infty metric, rather than the classical Euclidean metric.
Edit intent: fluency
Original:  We define two new families of flag complexes, which we call the Alpha flag and Minibox complexes, and prove their equivalence with Cech complexes in homological dimensions zero and one.
Revised:  We define two new families of flag complexes, which we call the Alpha flag and Minibox complexes, and prove their equivalence to Cech complexes in homological dimensions zero and one.
Edit intent: fluency
Original:  We define two new families of flag complexes, which we call the Alpha flag and Minibox complexes, and prove their equivalence with Cech complexes in homological dimensions zero and one.
Revised:  We define two new families of flag complexes, which we call the Alpha flag and Minibox complexes, and prove their equivalence with Cech complexes in homological degrees zero and one.
Edit intent: clarity
Original:  Moreover, we provide algorithms for finding Minibox edges for two, three and higher dimensional points.
Revised:  Moreover, we provide algorithms for finding Minibox edges of two, three and higher dimensional points.
Edit intent: fluency
Original:  Moreover, we provide algorithms for finding Minibox edges for two, three and higher dimensional points.
Revised:  Moreover, we provide algorithms for finding Minibox edges for two, three , and higher-dimensional points.
Edit intent: fluency
Original:  Finally we run computational experiments on random points, which show that Minibox filtrations can often be used to reduce the number of simplices included in Cech filtrations, and so speed up persistent homology computations  .
Revised:  Finally , we present computational experiments on random points, which show that Minibox filtrations can often be used to reduce the number of simplices included in Cech filtrations, and so speed up persistent homology computations .
Edit intent: clarity
Original:  Finally we run computational experiments on random points, which show that Minibox filtrations can often be used to reduce the number of simplices included in Cech filtrations, and so speed up persistent homology computations  .
Revised:  Finally we run computational experiments on random points, which shows that Minibox filtrations can often be used to reduce the number of simplices included in Cech filtrations, and so speed up persistent homology computations .
Edit intent: fluency
Original:  Finally we run computational experiments on random points, which show that Minibox filtrations can often be used to reduce the number of simplices included in Cech filtrations, and so speed up persistent homology computations  .
Revised:  Finally we run computational experiments on random points, which show that Minibox filtrations can often be used to speed up persistent homology computations .
Edit intent: coherence
Original:  In addition, objects on the DWeb are indexed using blockchain technology, which allows for secure storage of immutable object references, and integrity checking of the data being served to users.
Revised:  In addition, objects on the DWeb are indexed using Bblockchain technology, which allows for secure storage of immutable object references, and integrity checking of the data being served to users.
Edit intent: clarity
Original: In this work, we investigate underlay radar-massive MIMO cellular coexistence in LoS/near-LoS channels, where both systems are capable of 3D beamforming .
Revised: In this work, we study underlay radar-massive MIMO cellular coexistence in LoS/near-LoS channels, where both systems are capable of 3D beamforming .
Edit intent: clarity
Original: In this work, we investigate underlay radar-massive MIMO cellular coexistence in LoS/near-LoS channels, where both systems are capable of 3D beamforming .
Revised: In this work, we investigate underlay radar-massive MIMO cellular coexistence in LoS/near-LoS channels, where both systems have 3D beamforming .
Edit intent: clarity
Original:  This is based on a novel construction in which each Poisson Voronoi (PV) cell is bounded by its circumcircle in order to bound the effect of the random cell shapes on average interference.
Revised:  This is based on a novel construction in which each Poisson Voronoi (PV) cell is bounded by its circumcircle to bound the effect of the random cell shapes on average interference.
Edit intent: coherence
Original:  However, this model is intractable for characterizing the interference distribution, due to the correlation between the shapes/sizes of adjacent PV cells .
Revised:  Since this model is intractable for characterizing the interference distribution, due to the correlation between the shapes/sizes of adjacent PV cells .
Edit intent: coherence
Original:  However, this model is intractable for characterizing the interference distribution, due to the correlation between the shapes/sizes of adjacent PV cells .
Revised:  However, this model is intractable for further analysis due to the correlation between the shapes/sizes of adjacent PV cells .
Edit intent: clarity
Original:  However, this model is intractable for characterizing the interference distribution, due to the correlation between the shapes/sizes of adjacent PV cells .
Revised:  However, this model is intractable for characterizing the interference distribution, due to the correlation between adjacent PV cells .
Edit intent: clarity
Original:  Hence , we propose a tractable nominal interference model where each PV cell is modeled as a circular disk with  area equal to the average area of the typical cell.
Revised:  Hence , we propose a tractable nominal interference model , where we model each PV cell is modeled as a circular disk with area equal to the average area of the typical cell.
Edit intent: fluency
Original:  Hence , we propose a tractable nominal interference model where each PV cell is modeled as a circular disk with  area equal to the average area of the typical cell.
Revised:  Hence , we propose a tractable nominal interference model where each PV cell as a circular disk with area equal to the average area of the typical cell.
Edit intent: clarity
Original:  Hence , we propose a tractable nominal interference model where each PV cell is modeled as a circular disk with  area equal to the average area of the typical cell.
Revised:  Hence , we propose a tractable nominal interference model where each PV cell is modeled as a circular disk with an area equal to the average area of the typical cell.
Edit intent: fluency
Original:  We quantify the gap in the average interference power between these two models , and show that the upper bound is tight for realistic deployment parameters.
Revised:  We quantify the gap in the average interference power between these two models and show that the upper bound is tight for realistic deployment parameters.
Edit intent: fluency
Original:   Under the nominal interference model, we derive the equal interference contour in closed-form, and characterize the interference distribution using the dominant interferer approximation  .
Revised:  Under the nominal interference model, we characterize the interference distribution using the dominant interferer approximation .
Edit intent: coherence
Original:  Finally, we use tractable expressions for the interference distribution to characterize important radarperformance metrics such as the spatial probability of false alarm/detection in a quasi-static target tracking scenario.
Revised:  Finally, we use tractable expressions for the interference distribution to characterize radar's spatial probability of false alarm/detection in a quasi-static target tracking scenario.
Edit intent: clarity
Original:  We validate the accuracy of our analytical approximations using numerical results , which reveal useful trends in the average interference as a function of the deployment parameters , and provide useful system design insights in the form of radar receiver operating characteristic (ROC)curves for current and future radar-cellular spectrum sharing scenarios .
Revised:  Our results reveal useful trends in the average interference as a function of the deployment parameters , and provide useful system design insights in the form of radar receiver operating characteristic (ROC)curves for current and future radar-cellular spectrum sharing scenarios .
Edit intent: clarity
Original: We employ the mobility data released by Google and Apple to investigate the effects of social distancing on the spreading dynamics of COVID-19 in Europe.
Revised: We employ the Google and Apple to investigate the effects of social distancing on the spreading dynamics of COVID-19 in Europe.
Edit intent: clarity
Original: We prove that the generic framework for specifying and solving finite-horizon, monadic sequential decision problems proposed in ( Botta et al. , 2017 ) is semantically correct.
Revised: We prove that the generic framework for specifying and solving finite-horizon, monadic sequential decision problems proposed in ( Botta et al. 2017 ) is semantically correct.
Edit intent: fluency
Original:  In Bottaet al. 2017, the authors propose a generic framework for finite horizon, monadic SDPs together with a verified monadic version of backward induction for solving such SDPs.
Revised:  In Bottaet al. 2017, the authors propose a generic framework for finite horizon, monadic SDPs together with a monadic version of backward induction for solving such SDPs.
Edit intent: clarity
Original:  Our development is formalized in Idris as an extension of the  framework and the sources are available as supplementary material.
Revised:  Our development is formalised in Idris as an extension of the framework and the sources are available as supplementary material.
Edit intent: fluency
Original:  Especially in nano-scale biosystems, where the generated data sets are too vast and complex to mentally parse without computational assist, ML is instrumental in analyzing and extracting new insights, accelerating material and structure discoveries  and designing experience as well as supporting nano-scale communications and networks.
Revised:  Especially in nano-scale biosystems, where the generated data sets are too vast and complex to mentally parse without computational assist, ML is instrumental in analyzing and extracting new insights, accelerating material and structure discoveries , and designing experience as well as supporting nano-scale communications and networks.
Edit intent: fluency
Original:  These challenges are classified in the three aforementioned main categories.
Revised:  These challenges are classified into the three aforementioned main categories.
Edit intent: fluency
Original:  For each of the presented methodologies, special emphasis is given to its principles, applications  and limitations.
Revised:  For each of the presented methodologies, special emphasis is given to its principles, applications , and limitations.
Edit intent: fluency
Original:  Finally, we conclude the article with insightful discussions, that reveals research gaps and highlights possible future research directions.
Revised:  Finally, we conclude the article with insightful discussions, that reveal research gaps and highlights possible future research directions.
Edit intent: fluency
Original:  Finally, we conclude the article with insightful discussions, that reveals research gaps and highlights possible future research directions.
Revised:  Finally, we conclude the article with insightful discussions, that reveals research gaps and highlight possible future research directions.
Edit intent: fluency
Original: We show that the transformer attention mechanism is the update rule of a modern Hopfield network with continuous states .
Revised: We introduce a modern Hopfield network with continuous states .
Edit intent: coherence
Original:  This new Hopfield network can store exponentially (with the dimension  ) many patterns, converges with one update, and has exponentially small retrieval errors.
Revised:  This new Hopfield network can store exponentially (with the dimension ) many patterns, retrieves the pattern with one update, and has exponentially small retrieval errors.
Edit intent: clarity
Original:  Transformer and BERT modelsoperate in their first layers preferably in the global averaging regime, while they operate in higher layers in metastable states.
Revised:  Transformer and BERT modelsoperate in their first layers preferably global averaging and in higher layers in metastable states.
Edit intent: clarity
Original:  Transformer and BERT modelsoperate in their first layers preferably in the global averaging regime, while they operate in higher layers in metastable states.
Revised:  Transformer and BERT modelsoperate in their first layers preferably in the global averaging regime, while they operate in higher layers partial averaging via metastable states.
Edit intent: clarity
Original:  Neural networks with Hopfield networks outperform other methods on immune repertoire classification , where the Hopfield net stores several hundreds of thousands of patterns.
Revised:  Neural networks with Hopfield networks outperform other methods on immune repertoire classification with several hundreds of thousands of patterns.
Edit intent: coherence
Original:  Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical points strictly faster than regular gradient descent.
Revised:  Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical points faster than regular gradient descent.
Edit intent: clarity
Original: We establish a near-optimal rapid mixing bound for the random-cluster Glauber dynamics on random \Delta-regular graphs for all q\ge 1 and p<p_u(q,\Delta), where the threshold p_u(q,\Delta) corresponds to a uniqueness/non-uniqueness phase transition for the random-cluster model on the (infinite) \Delta-regular tree.
Revised: We establish rapid mixing of the random-cluster Glauber dynamics on random \Delta-regular graphs for all q\ge 1 and p<p_u(q,\Delta), where the threshold p_u(q,\Delta) corresponds to a uniqueness/non-uniqueness phase transition for the random-cluster model on the (infinite) \Delta-regular tree.
Edit intent: clarity
Original:  It is expected that for q>2 this threshold is sharp, and  the Glauber dynamics on random \Delta-regular graphs undergoes an exponential slowdown at p_u(q,\Delta).
Revised:  It is expected that for q>2 this threshold is sharp, and for q>2 the Glauber dynamics on random \Delta-regular graphs undergoes an exponential slowdown at p_u(q,\Delta).
Edit intent: fluency
Original:  This requires connecting physical and social world knowledge to value judgements, a capability that may enable us to filter out needlessly inflammatory chatbot outputs or eventually regularize open-ended reinforcement learning agents.
Revised:  This requires connecting physical and social world knowledge to value judgements, a capability that may enable us to steer chatbot outputs or eventually regularize open-ended reinforcement learning agents.
Edit intent: clarity
Original:  With the ETHICS dataset, we find that current language models have a promising but incomplete understanding of basic ethical knowledge .
Revised:  With the ETHICS dataset, we find that current language models have a promising but incomplete ability to predict basic human ethical judgements .
Edit intent: clarity
Original:  We take a different approach: by combining a heterogeneous set of fast and low-cost storage technologies within the same system, we can achieve a Pareto-efficient balance between performance and cost-per-bit.
Revised:  We take a different approach: by combining multiple tiers of fast and low-cost storage technologies within the same system, we can achieve a Pareto-efficient balance between performance and cost-per-bit.
Edit intent: clarity
Original:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree  key-value store that exploits the full spectrum of heterogeneous storage technologies simultaneously .
Revised:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree key-value store that exploits a full spectrum of heterogeneous storage technologies simultaneously .
Edit intent: fluency
Original:  Correspondingly, data systems that employ these new technologies are  optimized either to be fast (but expensive) or cheap (but slow).
Revised:  Correspondingly, data systems that employ these new technologies are typically optimized either to be fast (but expensive) or cheap (but slow).
Edit intent: coherence
Original:  We take a different approach: by combining multiple tiers of fast and low-cost storage technologies within the same system , we can achieve a Pareto-efficient balance between performance and cost-per-bit.
Revised:  We take a different approach: by combining multiple tiers of fast and low-cost storage technologies , we can achieve a Pareto-efficient balance between performance and cost-per-bit.
Edit intent: clarity
Original:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree based key-value store that exploits a full spectrum of heterogeneous storage technologies ( from 3D XPoint to QLC NAND)  .
Revised:  This paper presents the design and implementation of PrismDB, a novel key-value store that exploits a full spectrum of heterogeneous storage technologies ( from 3D XPoint to QLC NAND) .
Edit intent: coherence
Original:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree based key-value store that exploits a full spectrum of heterogeneous storage technologies ( from 3D XPoint to QLC NAND)  .
Revised:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree based key-value store that exploits a full spectrum of heterogeneous storage technologies ( 3D XPoint to QLC NAND) .
Edit intent: coherence
Original:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree based key-value store that exploits a full spectrum of heterogeneous storage technologies ( from 3D XPoint to QLC NAND)  .
Revised:  This paper presents the design and implementation of PrismDB, a novel log-structured merge tree based key-value store that exploits a full spectrum of heterogeneous storage technologies ( from 3D XPoint and QLC NAND) .
Edit intent: fluency