wanyu/IteraTeR_v2 huggingface dataset:
Original:  The current practice is that scholars and practitioners  screen thousands of studies by hand to find which studies to include in their review.
Revised:  The current practice is that scholars and practitioners screen thousands of studies by hand to determine which studies to include in their review.
Edit intent: clarity
Original:  This  is error prone and inefficient .
Revised:  This process is error prone and inefficient .
Edit intent: clarity
Original:  Currently, scholars and practitioners might screen thousands of studies by hand to determine which studies to include in their review .
Revised:  Currently, scholars and practitioners screen thousands of studies by hand to determine which studies to include in their review .
Edit intent: clarity
Original:  This process is error prone and inefficient , because of the extremely imbalanced data: only a very small fraction of the studies screened will be relevant.
Revised:  This process is error prone and inefficient because of extremely imbalanced data: only a very small fraction of the studies screened will be relevant.
Edit intent: fluency
Original:  This process is error prone and inefficient , because of the extremely imbalanced data: only a very small fraction of the studies screened will be relevant.
Revised:  This process is error prone and inefficient , because of the extremely imbalanced data: only a fraction of the studies screened will be relevant.
Edit intent: clarity
Original:  This process is error prone and inefficient , because of the extremely imbalanced data: only a very small fraction of the studies screened will be relevant.
Revised:  This process is error prone and inefficient , because of the extremely imbalanced data: only a very small fraction of the screened studies is relevant.
Edit intent: clarity
Original:  We demonstrate by means of simulation studies that ASReview can yield far more efficient reviewing than manual reviewing, while exhibiting adequate quality.
Revised:  We demonstrate by means of simulation studies that ASReview can yield far more efficient reviewing than manual reviewing, while providing high quality.
Edit intent: clarity
Original:  Furthermore, we describe the different options of the free and open source research software , we show how it can be used for screening the COVID19 literature, and we present the results from a series of user experience tests.
Revised:  Furthermore, we describe the options of the free and open source research software , we show how it can be used for screening the COVID19 literature, and we present the results from a series of user experience tests.
Edit intent: coherence
Original:  Furthermore, we describe the different options of the free and open source research software , we show how it can be used for screening the COVID19 literature, and we present the results from a series of user experience tests.
Revised:  Furthermore, we describe the different options of the free and open source research software and present the results from a series of user experience tests.
Edit intent: coherence
Original:  Furthermore, we describe the different options of the free and open source research software , we show how it can be used for screening the COVID19 literature, and we present the results from a series of user experience tests.
Revised:  Furthermore, we describe the different options of the free and open source research software , we show how it can be used for screening the COVID19 literature, and we present the results from user experience tests.
Edit intent: clarity
Original:  We invite the community to contribute to open source projects such as our own , that provide measurable and reproducible improvement over current practice.
Revised:  We invite the community to contribute to open source projects such as our own that provide measurable and reproducible improvement over current practice.
Edit intent: fluency
Original:  We invite the community to contribute to open source projects such as our own , that provide measurable and reproducible improvement over current practice.
Revised:  We invite the community to contribute to open source projects such as our own , that provide measurable and reproducible improvements over current practice.
Edit intent: fluency
Original: The problem of exploding and vanishing gradients has been a long-standing obstacle that hinders the effective training of neural networks.
Revised: The problem of vanishing and exploding gradients has been a long-standing obstacle that hinders the effective training of neural networks.
Edit intent: fluency
Original:  We provide a rigorous result that shows, under mild conditions, how the exploding/vanishinggradient problem disappears with high probability if the neural networks have sufficient width.
Revised:  We provide a rigorous result that shows, under mild conditions, how the vanishing/exploding gradients problem disappears with high probability if the neural networks have sufficient width.
Edit intent: fluency
Original:  Various measures and policies such as lock-down and social-distancing are implemented by governments to combat the disease during the pandemic period.
Revised:  Various measures and policies such as lockdown and social-distancing are implemented by governments to combat the disease during the pandemic period.
Edit intent: fluency
Original: Droubay, Justin and Pirillo that each word of length n contains at most n+1 distinct palindromes.
Revised: It is known that each word of length n contains at most n+1 distinct palindromes.
Edit intent: clarity
Original:  A finite "rich word " is a word with maximal number of palindromic factors.
Revised:  A finite rich word is a word with maximal number of palindromic factors.
Edit intent: fluency
Original:  Sturmian words and Rote complementary symmetric sequences form two classes of binary rich words, while episturmian words and words coding  d-interval exchange transformations give us other examples on larger alphabets.
Revised:  Sturmian words and Rote complementary symmetric sequences form two classes of binary rich words, while episturmian words and words coding symmetric d-interval exchange transformations give us other examples on larger alphabets.
Edit intent: clarity
Original:  In this paper we look for homomorphisms of the free monoid, which allow to construct new rich words from already known rich words.
Revised:  In this paper we look for morphisms of the free monoid, which allow to construct new rich words from already known rich words.
Edit intent: clarity
Original:  In particular we study two types of morphisms : Arnoux-Rauzy morphisms and morphisms from Class P_{ret}.
Revised:  We focus on morphisms in Class P_{ret}.
Edit intent: coherence
Original: Recent work showed that the initial coronavirus disease 2019 ( COVID-19 ) data from China followed a subexponential power-law increase in the number of confirmed cases.
Revised: Recent work showed that the initial COVID-19 ) data from China followed a subexponential power-law increase in the number of confirmed cases.
Edit intent: clarity
Original: Recent work showed that the initial coronavirus disease 2019 ( COVID-19 ) data from China followed a subexponential power-law increase in the number of confirmed cases.
Revised: Recent work showed that the initial coronavirus disease 2019 ( COVID-19 data from China followed a subexponential power-law increase in the number of confirmed cases.
Edit intent: fluency
Original:  Reasonable agreement with available data is attained by incorporating small-world-like connections in the simulations.
Revised:  We show that reasonable agreement with other data can be attained by incorporating small-world-like connections in the simulations.
Edit intent: clarity
Original: Recent work showed that the initial COVID-19 data from China  followed a subexponential power-law increase in the number of confirmed cases.
Revised: Recent analysis of COVID-19 data from China followed a subexponential power-law increase in the number of confirmed cases.
Edit intent: clarity
Original: Recent work showed that the initial COVID-19 data from China  followed a subexponential power-law increase in the number of confirmed cases.
Revised: Recent work showed that the initial COVID-19 data from China showed that the number of confirmed cases followed a subexponential power-law increase in the number of confirmed cases.
Edit intent: fluency
Original:  This was attributed to a combination of effective containment and mitigation measures employed as well as behaviorial changes by the population.
Revised:  This was attributed to a combination of effective containment and mitigation measures employed as well as behavioral changes by the population.
Edit intent: fluency
Original:  In view of this , we performed a Monte Carlo random walk study to better understand proximity-based infectious disease spread, particularly under restrictions.
Revised:  In this work, we report a random walk Monte Carlo simulation study of proximity-based infectious disease spread, particularly under restrictions.
Edit intent: clarity
Original:  Three\langle \rangle growth regimes (quadratic,  power-law and exponential)  emerge naturally from our simulations.
Revised:  Three\langle \rangle growth regimes (quadratic, power-law and exponential) are shown to emerge naturally from our simulations.
Edit intent: clarity
Original:  These\langle \rangle\lesssim \langle \rangle results suggest that the early containment of the disease within China was close to optimal and could not have been significantly improved upon .
Revised:  These\langle \rangle\lesssim \langle r\rangle results suggest that the early containment of the disease within China was close to optimal and could not have been significantly improved upon .
Edit intent: clarity
Original:  We show that reasonable agreement with other data can be attained by incorporating small-world-like connections in the simulations.
Revised:  We show that reasonable agreement with these data can be attained by incorporating small-world-like connections in the simulations.
Edit intent: clarity
Original:  We show that reasonable agreement with other data can be attained by incorporating small-world-like connections in the simulations.
Revised:  We show that reasonable agreement with other data can be obtained by incorporating small-world-like connections in the simulations.
Edit intent: clarity
Original:   Together with available data, these results suggest that the early containment of the disease within China was close to optimal.
Revised:  \% Together with available data, these results suggest that the early containment of the disease within China was close to optimal.
Edit intent: fluency
Original: Low Earth Orbit (LEO) satellite constellations combine great flexibility and global coverage with short propagation delays when compared to satellite networks deployed in higher orbits.
Revised: Low Earth Orbit (LEO) satellite constellations combine great flexibility and global coverage with short propagation delays when compared to satellites deployed in higher orbits.
Edit intent: clarity
Original: Min-max optimization , with a nonconvex-nonconcave objective function f: R^d \times R^d \rightarrow R , arises in many areas, including optimization, economics, and deep learning.
Revised: Min-max optimization of an objective function f: R^d \times R^d \rightarrow R , arises in many areas, including optimization, economics, and deep learning.
Edit intent: clarity
Original:  Thus, most algorithms seek to obtain a certain notion of local }  min-max point where, roughly speaking, each player optimizes her payoff in a local sense .
Revised:  Thus, most algorithms seek to obtain a certain notion of local } min-max optimization model .
Edit intent: clarity
Original:  However, the classes of local min-max solutions which prior algorithms seek are only guaranteed to exist under very strong assumptions on f, such as convexity or monotonicity.
Revised:  However, many of the alternative models have solution points which are only guaranteed to exist under very strong assumptions on f, such as convexity or monotonicity.
Edit intent: clarity
Original:  However, the classes of local min-max solutions which prior algorithms seek are only guaranteed to exist under very strong assumptions on f, such as convexity or monotonicity.
Revised:  However, the classes of local min-max solutions which prior algorithms seek are only guaranteed to exist under strong assumptions on f, such as convexity or monotonicity.
Edit intent: clarity
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Edit intent: fluency
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy adversarial equilibrium if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Edit intent: clarity
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is an \varepsilon-approximate local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Edit intent: clarity
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) , and x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Edit intent: coherence
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is an \varepsilon-approximate local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Edit intent: clarity
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a "greedy approximation" to the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Edit intent: clarity
Original:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using greedy algorithms.
Revised:  Informally , we say that a point (x^\star, y^\star) is an \varepsilon-greedy min-max equilibrium point of a function f: R^d \times R^d \rightarrow R if y^\star is a second-order local maximum for f(x^\star,\cdot) and, roughly, x^\star is a local minimum for a greedy optimization version of the function \max _y f(x, y ) which can be efficiently estimated using second-order optimization algorithms.
Edit intent: clarity
Original:  In many of these applications f may be nonconvex-nonconcave, and finding a global min-max point may be computationally intractable.
Revised:  In many applications f may be nonconvex-nonconcave, and finding a global min-max point may be computationally intractable.
Edit intent: clarity
Original:  In this paper, we propose an optimization model, the \varepsilon-greedy adversarial equilibrium, which can serve as a computationally tractable alternative to the min-max optimization model.
Revised:  We propose an optimization model, the \varepsilon-greedy adversarial equilibrium, which can serve as a computationally tractable alternative to the min-max optimization model.
Edit intent: coherence
Original:  While the stochastic version of the problem is well-understood, the general version with adversarially chosen rewards is not.
Revised:  While the stochastic version of the problem is well-understood, the general version with adversarial rewards is not.
Edit intent: clarity
Original:  Further, an application of our algorithm to dynamic pricing ( a version in which the algorithm repeatedly adjusts prices for a product) enjoys these regret bounds without any smoothness assumptions.
Revised:  Further, an application of our algorithm to dynamic pricing ( where a seller repeatedly adjusts prices for a product) enjoys these regret bounds without any smoothness assumptions.
Edit intent: clarity
Original:  A central theme here is the adaptive discretization of the action space, which gradually "zooms in" on the more promising regions thereof.
Revised:  A central theme here is the adaptive discretization of the action space, which gradually ``zooms in'' on the more promising regions thereof.
Edit intent: fluency
Original:  The goal is to take advantage of "nicer" problem instances, while retaining near-optimal worst-case performance.
Revised:  The goal is to take advantage of ``nicer'' problem instances, while retaining near-optimal worst-case performance.
Edit intent: fluency
Original:  In this paper, we seek to provide a sound foundation for stablecoin theory, with a risk-based functional characterization of the economic structure of stablecoins.
Revised:  We seek to provide a sound foundation for stablecoin theory, with a risk-based functional characterization of the economic structure of stablecoins.
Edit intent: coherence
Original: Questions regarding whether, and if so, under what conditions, groups exhibit '' crowd wisdom'' have spurred numerous studies in many disciplines, including management and organizational science, psychology, sociology, complex systems, and computer science.
Revised: Whether, and under what conditions, groups exhibit '' crowd wisdom'' have spurred numerous studies in many disciplines, including management and organizational science, psychology, sociology, complex systems, and computer science.
Edit intent: clarity
Original: Questions regarding whether, and if so, under what conditions, groups exhibit '' crowd wisdom'' have spurred numerous studies in many disciplines, including management and organizational science, psychology, sociology, complex systems, and computer science.
Revised: Questions regarding whether, and if so, under what conditions, groups exhibit `` crowd wisdom'' have spurred numerous studies in many disciplines, including management and organizational science, psychology, sociology, complex systems, and computer science.
Edit intent: fluency
Original:  Substantial effort in previous research on these questions has focused on investigating the role of social influence in promoting the wisdom of the crowd or, conversely, leading the crowd astray .
Revised:  Substantial effort in previous research on these questions has focused on the role of social influence in promoting the wisdom of the crowd or, conversely, leading the crowd astray .
Edit intent: clarity
Original:  Substantial effort in previous research on these questions has focused on investigating the role of social influence in promoting the wisdom of the crowd or, conversely, leading the crowd astray .
Revised:  Substantial effort in previous research on these questions has focused on investigating the role of social influence in promoting the wisdom of the crowd versus leading the crowd astray .
Edit intent: coherence
Original:  Based on our theoretical analysis, numerical simulation, and reanalysis of four previously published experiments (which included a total of 4,002 human participants, organized in 131 independent groups ), we demonstrate that the wisdom of crowds in estimation tasks depends on the interaction between the following two factors:
Revised:  Based on our theoretical analysis, numerical simulation, and reanalysis of four experimental datasets (totaling 4,002 human participants, organized in 131 independent groups ), we demonstrate that the wisdom of crowds in estimation tasks depends on the interaction between the following two factors:
Edit intent: clarity
Original:  Based on our theoretical analysis, numerical simulation, and reanalysis of four previously published experiments (which included a total of 4,002 human participants, organized in 131 independent groups ), we demonstrate that the wisdom of crowds in estimation tasks depends on the interaction between the following two factors:
Revised:  Based on our theoretical analysis, numerical simulation, and reanalysis of four previously published experiments (which included a total of 4,002 human subjects ), we demonstrate that the wisdom of crowds in estimation tasks depends on the interaction between the following two factors:
Edit intent: clarity