wanyu/IteraTeR_v2 huggingface dataset:
Original:  It is an essential ability for efficient social interactions, including  cooperation, competition, and communication.
Revised:  It is an essential ability for social interactions, including cooperation, competition, and communication.
Edit intent: clarity
Original:  It is an essential ability for efficient social interactions, including  cooperation, competition, and communication.
Revised:  It is an essential ability for efficient social interactions, including efficient cooperation, competition, and communication.
Edit intent: fluency
Original:  In this work, we present our progress toward building artificial agents with such abilities.
Revised:  Here we present our progress toward building artificial agents with such abilities.
Edit intent: clarity
Original:  To this end we implemented a perspective taking task that was inspired by experiments done with chimpanzees.
Revised:  We implemented a perspective taking task that was inspired by experiments done with chimpanzees.
Edit intent: coherence
Original:  To this end we implemented a perspective taking task that was inspired by experiments done with chimpanzees.
Revised:  To this end we implemented a perspective taking task inspired by experiments done with chimpanzees.
Edit intent: clarity
Original:  In particular, this ability is more readily learned when the agent has allocentric information about the objects in the environment.
Revised:  We studied whether this ability is more readily learned when the agent has allocentric information about the objects in the environment.
Edit intent: clarity
Original:  Building artificial agents with perspective taking ability will help to reverse engineer how computations underlying theory of mind might be accomplished in our brains .
Revised:  Building artificial agents with perspective taking ability can help us develop artificial intelligence that is more human-like and easier to communicate with .
Edit intent: clarity
Original:  Both a Galerkin and a Petrov-Galerkin variant with only modified test functions are analyzed.
Edit intent: coherence
Original:  We study the weighted distance between two vertices chosen uniformly at random, called the typical weighted distance, and the number of edges on this path, the typical hopcount.
Revised:  We study the weighted distance between two vertices chosen uniformly at random, the typical weighted distance, and the number of edges on this path, the typical hopcount.
Edit intent: clarity
Original:  In the conservative class, we prove that the typical weighted distance tends to infinity  and we give an explicit expression for the main growth term, as well as for the hopcount.
Revised:  In the conservative class, we prove that the typical weighted distance tends to infinity , and we give an explicit expression for the main growth term, as well as for the hopcount.
Edit intent: fluency
Original:  For two of the three models we prove that the fluctuations around the main term are tight under a mild extra condition on the weight distribution .
Revised:  Under a mild assumption on the weight distribution .
Edit intent: clarity
Original:  In this paper , we investigate the use of high-frame-rate features extraction in end-to-end ASR. High frame rates of 200 and 400 frames/second are used in the features extraction and provide additional information for end-to-end ASR.
Revised:  In this report , we investigate the use of high-frame-rate features extraction in end-to-end ASR. High frame rates of 200 and 400 frames/second are used in the features extraction and provide additional information for end-to-end ASR.
Edit intent: clarity
Original: The goal of research in  image popularity assessment (IPA) is to develop computational models that can automatically predict the potential of a social image being popular over the Internet.
Revised: The goal of research in image popularity assessment (IPA) is to develop computational models that can accurately predict the potential of a social image being popular over the Internet.
Edit intent: clarity
Original: The goal of research in  image popularity assessment (IPA) is to develop computational models that can automatically predict the potential of a social image being popular over the Internet.
Revised: The goal of research in image popularity assessment (IPA) is to develop computational models that can automatically predict the potential of a social image to go viral on the Internet.
Edit intent: clarity
Original:  Here, we aim to single out the contribution of visual content to image popularity, i.e., intrinsic image popularity that is of great practical importance . Specifically, we first describe a probabilistic method to generate massive popularity-discriminable image pairs, based on which the first large-scale  database for intrinsic IPA (I^2PA) is established.
Revised:  Here, we aim to single out the contribution of visual content to image popularity, i.e., intrinsic image popularity . Specifically, we first describe a probabilistic method to generate massive popularity-discriminable image pairs, based on which the first large-scale database for intrinsic IPA (I^2PA) is established.
Edit intent: clarity
Original:  Here, we aim to single out the contribution of visual content to image popularity, i.e., intrinsic image popularity that is of great practical importance . Specifically, we first describe a probabilistic method to generate massive popularity-discriminable image pairs, based on which the first large-scale  database for intrinsic IPA (I^2PA) is established.
Revised:  Here, we aim to single out the contribution of visual content to image popularity, i.e., intrinsic image popularity that is of great practical importance . Specifically, we first describe a probabilistic method to generate massive popularity-discriminable image pairs, based on which the first large-scale image database for intrinsic IPA (I^2PA) is established.
Edit intent: fluency
Original:  We then learn computational models for I^2PA by optimizing deep neural networks  for ranking consistency with millions of popularity-discriminable image pairs.
Revised:  We then develop computational models for I^2PA by optimizing deep neural networks for ranking consistency with millions of popularity-discriminable image pairs.
Edit intent: clarity
Original:  We then learn computational models for I^2PA by optimizing deep neural networks  for ranking consistency with millions of popularity-discriminable image pairs.
Revised:  We then learn computational models for I^2PA based on deep neural networks for ranking consistency with millions of popularity-discriminable image pairs.
Edit intent: clarity
Original:  We then learn computational models for I^2PA by optimizing deep neural networks  for ranking consistency with millions of popularity-discriminable image pairs.
Revised:  We then learn computational models for I^2PA by optimizing deep neural networks , optimizing for ranking consistency with millions of popularity-discriminable image pairs.
Edit intent: clarity
Original:  Experiments on Instagram and other social platforms demonstrate that the optimized model outperforms state-of-the-art methodsand humans, and exhibits reasonable generalizability .
Revised:  Experiments on Instagram and other social platforms demonstrate that the optimized model performs favorably against existing methods, exhibits reasonable generalizability .
Edit intent: clarity
Original:  Our algorithm combines the mirror-prox method and a novel variance-reduced gradient estimator based on "sampling from the difference" between the current iterate and a reference point.
Revised:  Our algorithm combines the mirror-prox method and a novel reduced-variance gradient estimator based on "sampling from the difference" between the current iterate and a reference point.
Edit intent: fluency
Original:  Such points are sufficient to resolve half-integer TSP in general and they have been conjectured to demonstrate the largest integrality gap for the subtour relaxation.
Revised:  Such points are sufficient to resolve TSP in general and they have been conjectured to demonstrate the largest integrality gap for the subtour relaxation.
Edit intent: clarity
Original:  and we make it publicly available at URL
Revised:  it is available at URL
Edit intent: clarity
Original:  This enables a semantics for conditionals founded on a calculus of intervention, and axiomatization of causal reasoning for rich, expressive generative models---including those in which a causal representation exists only implicitly---in an open-universe setting.
Revised:  This enables a semantics for conditionals founded on a calculus of intervention, and axiomatization of causal reasoning for rich, expressive generative models -- including those in which a causal representation exists only implicitly---in an open-universe setting.
Edit intent: fluency
Original:  This enables a semantics for conditionals founded on a calculus of intervention, and axiomatization of causal reasoning for rich, expressive generative models---including those in which a causal representation exists only implicitly---in an open-universe setting.
Revised:  This enables a semantics for conditionals founded on a calculus of intervention, and axiomatization of causal reasoning for rich, expressive generative models---including those in which a causal representation exists only implicitly -- in an open-universe setting.
Edit intent: fluency
Original: Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most computational experiments still focus on determining a single best algorithm configuration based on aggregate results such as the average.
Revised: Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most researchers still focus on determining a single best algorithm configuration based on aggregate results such as the average.
Edit intent: clarity
Original: Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most computational experiments still focus on determining a single best algorithm configuration based on aggregate results such as the average.
Revised: Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most computational experiments still focus on determining a single best algorithmic configuration based on aggregate results such as the average.
Edit intent: fluency
Original:  These techniques allow to automatically : (i) find the most important problem features to determine problem classes;
Revised:  These techniques allow to automatically : (i) discerning the most important problem features to determine problem classes;
Edit intent: clarity
Original:  (ii) group the problems into classes and (iii) select the best algorithm configuration for each class.
Revised:  (ii) grouping the problems into classes and (iii) select the best algorithm configuration for each class.
Edit intent: fluency
Original:  To evaluate this new approach, extensive computational experiments were executed using the linear programming algorithms implemented in the COIN-OR Branch & Cut solver in a comprehensive set of instances, including all MIPLIB benchmark instances.
Revised:  To evaluate this new approach, extensive computational experiments were executed using the linear programming algorithms implemented in the COIN-OR Branch & Cut solver across a comprehensive set of instances, including all MIPLIB benchmark instances.
Edit intent: clarity
Original:  The results exceeded our initial expectations.
Revised:  The results exceeded our expectations.
Edit intent: clarity
Original:  While  the single best parameter setting discovered decreased the total running time by 22\%, our approach decreased the total running time by 40\% in average in 10-fold cross validation experiments.
Revised:  While selecting the single best parameter setting discovered decreased the total running time by 22\%, our approach decreased the total running time by 40\% in average in 10-fold cross validation experiments.
Edit intent: clarity
Original:  While  the single best parameter setting discovered decreased the total running time by 22\%, our approach decreased the total running time by 40\% in average in 10-fold cross validation experiments.
Revised:  While the single best parameter setting discovered decreased the total running time by 22\%, our approach decreased the total running time by 40\% on average across 10-fold cross validation experiments.
Edit intent: clarity
Original:  We then apply the local compensated convex transforms to image inpainting and shape interrogation.
Revised:  We then apply the local compensated convex transforms to image processing and shape interrogation.
Edit intent: clarity
Original: This paper introduces infotheory: a package that implements multivariate information theoretic measures for discrete and continuous data.
Revised: This paper introduces infotheory: a package that implements multivariate information theoretic analyses of discrete and continuous data.
Edit intent: clarity
Original:  Specifically, on a database of size n, our algorithm guarantees O(1) multiplicative error and \approx n^{1/2+a} additive error for an arbitrarily small constant a , whereas all previous algorithms in the local model on had additive error \approx n^{2/3+a}.
Revised:  Specifically, on a database of size n, our algorithm guarantees O(1) multiplicative error and \approx n^{1/2+a} additive error for an arbitrarily small constant a , whereas all previous algorithms in the local model had additive error \approx n^{2/3+a}.
Edit intent: fluency
Original:  We give a simple lower bound showing that additive error of \approx\sqrt{n k-means algorithms in the local model (at least for algorithms with a constant number of interaction rounds, which is the setting we consider in this paper) .
Revised:  We give a simple lower bound showing that additive error of \approx\sqrt{n k-means objective must have additive error at least \approxn .
Edit intent: clarity
Original:  What is an emotion?
Revised: " What is an emotion?
Edit intent: fluency
Original:   an old riddle  repeatedly being attempted with advance modern tools and understanding of the age.
Revised:  ", an old riddle repeatedly being attempted with advance modern tools and understanding of the age.
Edit intent: fluency
Original:   an old riddle  repeatedly being attempted with advance modern tools and understanding of the age.
Revised:  an old riddle is repeatedly being attempted with advance modern tools and understanding of the age.
Edit intent: clarity
Original:  With the new advancement old theories are tested and with correction new is formed.
Revised:  With the new advancements old theories are tested and with correction new is formed.
Edit intent: fluency
Original:  With the new advancement old theories are tested and with correction new is formed.
Revised:  With the new advancement old theories are tested and new ones are formed.
Edit intent: clarity
Original:  Such is the case with defining emotion broadly shifting from classical definite marker theory to statistically context situated conceptual theory.
Revised:  Such is the case with theorizing and modeling emotion which is broadly shifting from classical definite marker theory to statistically context situated conceptual theory.
Edit intent: clarity
Original:   In this article  we present a  cognition-affect integrated model of emotion including many cortical and subcortical regions.
Revised:  In this article , we present a cognition-affect integrated model of emotion including many cortical and subcortical regions.
Edit intent: fluency
Original:   In this article  we present a  cognition-affect integrated model of emotion including many cortical and subcortical regions.
Revised:  In this article we present a ' cognition-affect integrated model of emotion including many cortical and subcortical regions.
Edit intent: fluency
Original:   In this article  we present a  cognition-affect integrated model of emotion including many cortical and subcortical regions.
Revised:  In this article we present a cognition-affect integrated model of emotion ' which includes many cortical and subcortical regions.
Edit intent: coherence
Original:  The model along with  analytical and anatomical support is presented.
Revised:  The model along with the analytical and anatomical support is presented.
Edit intent: fluency
Original:  Article concludes with the future questions coming out of the proposed model .
Revised:  The article concludes with the future questions coming out of the proposed model .
Edit intent: fluency
Original:  Article concludes with the future questions coming out of the proposed model .
Revised:  Article concludes with the future research questions .
Edit intent: clarity
Original:  Second, cognition and affect modulate each other throughout the generation of meaningful instance  situated in the current context.
Revised:  Second, cognition and affect modulate each other throughout the generation of meaningful instance which is situated in the current context.
Edit intent: clarity
Original:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections plays an important role in emotion responses in terms of physiological activities and their duration .
Revised:  And, finally, the structural and temporal hierarchies in the brain's organization and anatomical projections plays an important role in emotion responses in terms of physiological activities and their duration .
Edit intent: clarity
Original:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections plays an important role in emotion responses in terms of physiological activities and their duration .
Revised:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections play an important role in emotion responses in terms of physiological activities and their duration .
Edit intent: fluency
Original:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections plays an important role in emotion responses in terms of physiological activities and their duration .
Revised:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections plays an important role in emotion responses in terms of hierarchical activities and their duration .
Edit intent: clarity
Original:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections plays an important role in emotion responses in terms of physiological activities and their duration .
Revised:  And, finally, the structural and temporal hierarchy in brain organization and anatomical projections plays an important role in emotion responses in terms of physiological activities and their durations .
Edit intent: fluency
Original:  The model  along with the analytical and anatomical support  is presented.
Revised:  The model , along with the analytical and anatomical support is presented.
Edit intent: fluency
Original:  The model  along with the analytical and anatomical support  is presented.
Revised:  The model along with the analytical and anatomical support , is presented.
Edit intent: fluency
Original:  Nevertheless, it is still unclear what proportion of these statements actually contain well-formed links to data, for example via a URL or permanent identifier, and if there is an added value in providing them .
Revised:  Nevertheless, it is still unclear what proportion of these statements actually contain well-formed links to data, for example via a URL or permanent identifier, and if there is an added value in providing such links .
Edit intent: clarity
Original:  We consider 531,889 journal articles published by PLOS and BMC which are part of the PubMed Open Access collection, categorize their data availability statements according to  their content and  analyze the citation advantage of different statement categories via regression.
Revised:  We consider 531,889 journal articles published by PLOS and BMC , develop an automatic system for labelling their data availability statements according to their content and analyze the citation advantage of different statement categories via regression.
Edit intent: clarity
Original:  We also find that articles with these statements, in particular, can have up to 25.36 \% higher \\%DIF > higher citation impact on average: an encouraging result for all publishers and authors who make the effort of sharing their data.
Revised:  We also find that articles with these statements, in particular, can have up to 25.36 \\%DIF > higher citation impact on average: an encouraging result for all publishers and authors who make the effort of sharing their data.
Edit intent: clarity
Original:  We find that, following mandated publisher policies, data availability statements have become common by now,yet statements containing a link to  a repository are still just a fraction of the total.
Revised:  We find that, following mandated publisher policies, data availability statements have become common by now,yet statements containing a link to a fraction of the total.
Edit intent: clarity
Original:  For the complexities of real geometries, internal interfaces , nonlinear boundary and interface conditions, discontinuities and sharp wave fronts  become fundamental features of the solutions.
Revised:  As a result of the complexities of real geometries, internal interfaces , nonlinear boundary and interface conditions, discontinuities and sharp wave fronts become fundamental features of the solutions.
Edit intent: clarity
Original:  For the complexities of real geometries, internal interfaces , nonlinear boundary and interface conditions, discontinuities and sharp wave fronts  become fundamental features of the solutions.
Revised:  For the complexities of real geometries, internal interfaces and nonlinear boundary and interface conditions, discontinuities and sharp wave fronts become fundamental features of the solutions.
Edit intent: fluency
Original:  For the complexities of real geometries, internal interfaces , nonlinear boundary and interface conditions, discontinuities and sharp wave fronts  become fundamental features of the solutions.
Revised:  For the complexities of real geometries, internal interfaces , nonlinear boundary and interface conditions, discontinuities and sharp wave fronts may become fundamental features of the solutions.
Edit intent: clarity
Original:   Using a physics-based numerical penalty-flux, we develop a  provably energy-stable discontinuous Galerkin  approximation of the elastic wave equation in complex and discontinuous media.
Revised:  Using a physics-based numerical penalty-flux, we develop a provably energy-stable discontinuous Galerkin approximation of the elastic wave equation in geometrically complex and heterogenous media.
Edit intent: clarity
Original:  The discrete energy estimate holds for conforming and non-conforming curvilinear elements .
Revised:  The ability to treat conforming and non-conforming curvilinear elements .
Edit intent: clarity
Original:  The numerical scheme has been implemented in ExaHyPE, a simulation engine for hyperbolic PDEs on adaptive Cartesian meshes , for exascale supercomputers .
Revised:  The numerical scheme has been implemented in ExaHyPE, a simulation engine for hyperbolic PDEs on adaptive Cartesian meshes .
Edit intent: clarity
Original:  Finally, we present a regional geophysical wave propagation problem in a 3D Earth model with geometrically complex free-surface topography  .
Revised:  Finally, we present a regional geophysical wave propagation problem in a 3D model including the geometrically complex free-surface topography .
Edit intent: clarity