wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper, we propose AEGD, a new algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive updates of quadratic energy .
Revised: We propose AEGD, a new algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive updates of quadratic energy .
Edit intent: coherence
Original: In this paper, we propose AEGD, a new algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive updates of quadratic energy .
Revised: In this paper, we propose AEGD, a new algorithm for first-order gradient-based optimization of non-convex objective functions, based on adaptive updates of quadratic energy .
Edit intent: clarity
Original:  Experimental results demonstrate that AEGD works well for various optimization problems: it is robust with respect to initial data, capable of making rapid initial progress , shows comparable and most times better generalization performance than SGD with momentum for deep neural networks.
Revised:  Experimental results demonstrate that AEGD works well for a large variety of optimization problems: it is robust with respect to initial data, capable of making rapid initial progress , shows comparable and most times better generalization performance than SGD with momentum for deep neural networks.
Edit intent: clarity
Original:  Experimental results demonstrate that AEGD works well for various optimization problems: it is robust with respect to initial data, capable of making rapid initial progress , shows comparable and most times better generalization performance than SGD with momentum for deep neural networks.
Revised:  Experimental results demonstrate that AEGD works well for various optimization problems: it is robust with respect to initial data, capable of making rapid initial progress , shows comparable and often better generalization performance than SGD with momentum for deep neural networks.
Edit intent: clarity
Original: Approximation of interacting kernels by sum of Gaussians (SOG) is frequently required in many applications of scientific and engineering computing in order to construct efficient algorithms for kernel summation and convolution problems.
Revised: Approximation of interacting kernels by sum of Gaussians (SOG) is frequently required in many applications of scientific and engineering computing in order to construct efficient algorithms for kernel summation or convolution problems.
Edit intent: fluency
Original:  The SOG works for general interacting kernels and the lower bound of bandwidths of resulted Gaussians is allowed to be tunable so that the Gaussians can be easily summed by fast Gaussian algorithms.
Revised:  The SOG works for general interacting kernels and the lower bound of Gaussian bandwidths is tunable and thus the Gaussians can be easily summed by fast Gaussian algorithms.
Edit intent: coherence
Original:  The number of terms can be further reduced via the model reduction based on square root factorization .
Revised:  The number of terms can be further reduced via the model reduction based on the balanced truncation based on the square root method .
Edit intent: clarity
Original:  In this model, prey particles spread to neighboring empty sites at rate p, and predator particles spread only to neighboring sites occupied by prey particles at rate 1, killing the prey particle present at that site.
Revised:  In this model, prey particles spread to neighboring empty sites at rate p, and predator particles spread only to neighboring sites occupied by prey particles at rate 1, killing the prey particle that existed at that site.
Edit intent: clarity
Original:  It is found that prey can survive for p>p_c with p_c<1.
Revised:  It was found that the prey can survive for p>p_c with p_c<1.
Edit intent: clarity
Original:  We then study the problem starting from an initial condition with predator particles on all lattice points of the line y=0 and prey particles on the line y=1.
Revised:  We then study the problem starting from the line initial condition with predator particles on all lattice points of the line y=0 and prey particles on the line y=1.
Edit intent: fluency
Original:  In this paper, we propose a novel  communicative clustering approach, so-called ComStreamClust for clustering sub-topics inside a broader topic, e.g.  COVID-19.
Revised:  In this paper, we propose a novel communicative clustering approach, so-called ComStreamClust for clustering sub-topics inside a broader topic, e.g. , COVID-19.
Edit intent: fluency
Original:  The results obtained from ComStreamClust approve the effectiveness of the proposed approach when compared to existing methods such as LDA .
Revised:  The results obtained from ComStreamClust approve the effectiveness of the proposed approach when compared to existing methods .
Edit intent: clarity
Original: It is an important decision-making problem for a miner in  blockchain networks if he/she does the mining so that he/she earns a reward by creating a new block earlier than the other miners.
Revised: It is an important decision-making problem for a miner in the blockchain networks if he/she does the mining so that he/she earns a reward by creating a new block earlier than the other miners.
Edit intent: fluency
Original: It is an important decision-making problem for a miner in  blockchain networks if he/she does the mining so that he/she earns a reward by creating a new block earlier than the other miners.
Revised: It is an important decision-making problem for a miner in blockchain networks if he/she participates in the mining so that he/she earns a reward by creating a new block earlier than the other miners.
Edit intent: clarity
Original: It is an important decision-making problem for a miner in  blockchain networks if he/she does the mining so that he/she earns a reward by creating a new block earlier than the other miners.
Revised: It is an important decision-making problem for a miner in blockchain networks if he/she does the mining so that he/she earns a reward by creating a new block earlier than other miners.
Edit intent: fluency
Original:  We formulate the decision-making problem as a non-cooperative game because the probability of creating blocks depends on not only his/her own computational resource but also other miners' computational resources.
Revised:  We formulate this decision-making problem as a non-cooperative game because the probability of creating blocks depends on not only his/her own computational resource but also other miners' computational resources.
Edit intent: fluency
Original:  We formulate the decision-making problem as a non-cooperative game because the probability of creating blocks depends on not only his/her own computational resource but also other miners' computational resources.
Revised:  We formulate the decision-making problem as a noncooperative game, because the probability of creating blocks depends on not only his/her own computational resource but also other miners' computational resources.
Edit intent: fluency
Original:  By the theoretical and numerical analysis , we show a hysteresis phenomenon of Nash equilibria depending on the reward and a jump phenomenon of the decision of the miners by a slight change of the reward.
Revised:  By the theoretical and numerical analyses , we show a hysteresis phenomenon of Nash equilibria depending on the reward and a jump phenomenon of the decision of the miners by a slight change of the reward.
Edit intent: fluency
Original:  By the theoretical and numerical analysis , we show a hysteresis phenomenon of Nash equilibria depending on the reward and a jump phenomenon of the decision of the miners by a slight change of the reward.
Revised:  By the theoretical and numerical analysis , we show a hysteresis phenomenon of Nash equilibria depending on the reward and a jump phenomenon of miner decisions by a slight change of the reward.
Edit intent: fluency
Original:  By the theoretical and numerical analysis , we show a hysteresis phenomenon of Nash equilibria depending on the reward and a jump phenomenon of the decision of the miners by a slight change of the reward.
Revised:  By the theoretical and numerical analysis , we show a hysteresis phenomenon of Nash equilibria depending on the reward and a jump phenomenon of the decision of the miners by a slight change in reward.
Edit intent: fluency
Original:  We also show that the reward for which miners decide to quit mining becomes smaller as the number of miners increases.
Revised:  We also show that the reward for which miners decide not to participate in the mining becomes smaller as the number of miners increases.
Edit intent: clarity
Original:  Modern systems incorporate machine-learned predictions in broader decision-making pipelines, implicating concerns like constrained allocation and strategic behavior that are typically thought of as mechanism designproblems .
Revised:  Modern systems incorporate machine-learned predictions in their pipelines, raising concerns about potential strategic behavior or constrained allocation, concerns usually tackled in the context of mechanism design .
Edit intent: clarity
Original:  Although both machine learning and mechanism design have individually developed frameworks for addressing issues of fairness and equity, in some complex decision-making systems, neither framework is individually sufficient.
Revised:  Although both machine learning and mechanism design have developed frameworks for addressing issues of fairness and equity, in some complex decision-making systems, neither framework is individually sufficient.
Edit intent: fluency
Original:  In this paper, we develop the position that building fair decision-making systems requires overcoming these limitations which, we argue, are inherent to the individual frameworks of machine learning and mechanism design .
Revised:  In this paper, we develop the position that building fair decision-making systems requires overcoming these limitations which, we argue, are inherent to each field .
Edit intent: clarity
Original:  We begin to lay the ground work towards achieving this goal by comparing the perspective each individual discipline takes on fair decision-making, teasing out the lessons each field has taught and can teach the other, and highlighting application domains that require a strong collaboration between these disciplines.
Revised:  We begin to lay the ground work towards this goal by comparing the perspective each individual discipline takes on fair decision-making, teasing out the lessons each field has taught and can teach the other, and highlighting application domains that require a strong collaboration between these disciplines.
Edit intent: clarity
Original:  We begin to lay the ground work towards achieving this goal by comparing the perspective each individual discipline takes on fair decision-making, teasing out the lessons each field has taught and can teach the other, and highlighting application domains that require a strong collaboration between these disciplines.
Revised:  We begin to lay the ground work towards achieving this goal by comparing the perspective each discipline takes on fair decision-making, teasing out the lessons each field has taught and can teach the other, and highlighting application domains that require a strong collaboration between these disciplines.
Edit intent: clarity
Original:  In practice,  identification can be made with an accuracy of more than 90\% depending on the scenario.
Revised:  In practice, our simulation results show that identification can be made with an accuracy of more than 90\% depending on the scenario.
Edit intent: clarity
Original:  The system only needs the user to take a short selfie RGB-D video while rotating his/her head, and can produce a high quality  reconstruction in less than 30 seconds.
Revised:  The system only needs the user to take a short selfie RGB-D video while rotating his/her head, and can produce a high quality head reconstruction in less than 30 seconds.
Edit intent: clarity
Original:  Specifically, given the input video a two-stage frame selection algorithm is first employed to select a few high-quality frames for reconstruction.
Revised:  Specifically, given the input video a two-stage frame selection procedure is first employed to select a few high-quality frames for reconstruction.
Edit intent: clarity
Original:  A novel, differentiable renderer based 3D Morphable Model (3DMM) fitting method is then applied to recover facial geometries from multiview RGB-D data, which takes advantages of  extensive data generation and perturbation.
Revised:  Then a differentiable renderer based 3D Morphable Model (3DMM) fitting method is then applied to recover facial geometries from multiview RGB-D data, which takes advantages of extensive data generation and perturbation.
Edit intent: clarity
Original:  A novel, differentiable renderer based 3D Morphable Model (3DMM) fitting method is then applied to recover facial geometries from multiview RGB-D data, which takes advantages of  extensive data generation and perturbation.
Revised:  A novel, differentiable renderer based 3D Morphable Model (3DMM) fitting algorithm is applied to recover facial geometries from multiview RGB-D data, which takes advantages of extensive data generation and perturbation.
Edit intent: clarity
Original:  Our 3DMM has much larger expressive capacities than conventional 3DMM, allowing us to recover more accurate facial geometry using merely linear bases .
Revised:  Our 3DMM has much larger expressive capacities than conventional 3DMM, allowing us to recover more accurate facial geometry using merely linear basis .
Edit intent: fluency
Original: Several recent studies on speech synthesis have employed generative adversarial networks (GANs) to produce raw waveforms.
Revised: Several recent work on speech synthesis have employed generative adversarial networks (GANs) to produce raw waveforms.
Edit intent: clarity
Original:  In this study , we propose HiFi-GAN, which achieves both efficient and high-fidelity speech synthesis.
Revised:  In this work , we propose HiFi-GAN, which achieves both efficient and high-fidelity speech synthesis.
Edit intent: clarity
Original:  Finally, a small footprint version of HiFi-GAN generates samples 13.4 times faster than real time on CPU with comparable quality to an autoregressive counterpart.
Revised:  Finally, a small footprint version of HiFi-GAN generates samples 13.4 times faster than real-time on CPU with comparable quality to an autoregressive counterpart.
Edit intent: fluency
Original:  Addressing shortcomings flagged by Weidemann (SIAM. J. Numer.
Revised:  Addressing shortcomings flagged by Weideman (SIAM. J. Numer.
Edit intent: fluency
Original:  Numerical tests show that this new method is competitive, in accuracy and computation times, with existing methods for computing w(z) for complex z.
Revised:  Numerical tests suggest that this new method is competitive, in accuracy and computation times, with existing methods for computing w(z) for complex z.
Edit intent: clarity
Original:  What kind of ` rulers' does a cell use to measure the length of these appendages?
Revised:  What kind of ' rulers' does a cell use to measure the length of these appendages?
Edit intent: fluency
Original: This paper presents a methodology for linear embedding of nonlinear systems that bounds the model error in terms of the prediction horizon and the magnitude of the derivatives of the system states.
Revised: This paper presents a generalizable methodology for data-driven identification of nonlinear dynamics that bounds the model error in terms of the prediction horizon and the magnitude of the derivatives of the system states.
Edit intent: clarity
Original:  Using higher-order derivatives of general nonlinear dynamics that need not be known, we construct a Koopman operator-based linear representation and utilize Taylor series accuracy  to derive an error bound.
Revised:  Using higher-order derivatives of general nonlinear dynamics that need not be known, we construct a Koopman operator-based linear representation and utilize Taylor series accuracy analysis to derive an error bound.
Edit intent: clarity
Original:  The  error formula is used to choose the order of derivatives in the basis functions and obtain a data-driven Koopman model using a closed-form expression that can be computed in real time.
Revised:  The resulting error formula is used to choose the order of derivatives in the basis functions and obtain a data-driven Koopman model using a closed-form expression that can be computed in real time.
Edit intent: clarity
Original:  The efficacy of the embedding approach is demonstrated with simulation and experimental results on the control of a tail-actuated robotic fish.
Revised:  The efficacy of the approach is further demonstrated with simulation and experimental results on the control of a tail-actuated robotic fish.
Edit intent: clarity
Original:  In this paper, we investigate the two aspects of adaptivity and parameterization in sublinear-time algorithms for LIS estimation .
Revised:  Despite the significance of the LIS estimation problem and the amount of attention it has received, there are important aspects of the problem that are not yet fully understood. There are no better lower bounds for LIS estimation .
Edit intent: coherence
Original: SQL is one of the most popular tools for data analysis and used by an increasing number of users without having expertise in databases.
Revised: SQL is one of the most popular tools for data analysis , and it is now used by an increasing number of users without having expertise in databases.
Edit intent: coherence
Original:  In order to help such non-experts to write correct SQL queries , several studies have proposed programming-by-example approaches.
Revised:  Several studies have proposed programming-by-example approaches to help such non-experts to write correct SQL queries , several studies have proposed programming-by-example approaches.
Edit intent: coherence
Original:  While existing methods support a variety of SQL features such as aggregation and nested query, they suffer a significant increase in computational cost as the scale of I/O tables increases.
Revised:  While existing methods support a variety of SQL features such as aggregation and nested query, they suffer a significant increase in computational cost as the scale of example tables increases.
Edit intent: clarity
Original:  We adopt a sketch-based synthesis algorithm and focus on the quick inference of the columns used in the projection operator .
Revised:  We adopt a sketch-based synthesis algorithm and focus on the quick inference of appropriate columns in the projection operator .
Edit intent: clarity
Original:  In particular, we restrict the structures of sketches based on transformation rules in relational algebra and propagate a novel form of constraint using the output table in a top-down manner .
Revised:  In particular, we restrict the structures of sketches based on transformation rules in relational algebra and propagate a novel form of constraints and its top-down manner .
Edit intent: clarity
Original:  In particular, we restrict the structures of sketches based on transformation rules in relational algebra and propagate a novel form of constraint using the output table in a top-down manner .
Revised:  In particular, we restrict the structures of sketches based on transformation rules in relational algebra and propagate a novel form of constraint using the output table in a top-down propagation mechanism for efficient sketch completion .
Edit intent: clarity
Original:  Our tool is available at URL .
Revised:  Our tool is available at URL 
Edit intent: fluency
Original:  However, due to the lack of understanding on the communication efficiency between sellers and buyers, there is still a significant gap in benchmarking the data trading protocols in IoT environments.
Revised:  However, due to the lack of understanding of the communication efficiency between sellers and buyers, there is still a significant gap in benchmarking the data trading protocols in IoT environments.
Edit intent: fluency
Original:  We characterize the communication efficiency of three basic DLT-based IoT data trading protocols via NB- IoT connectivity in terms of latency and energy consumption.
Revised:  We characterize the communication efficiency of three basic DLT-based IoT data trading protocols via NB-IoT connectivity in terms of latency and energy consumption.
Edit intent: fluency
Original:  Exchanging probabilistic estimates of news veracity substantially improved individuals and group judgments, with the effect of eliminating polarization in news evaluation.
Revised:  Exchanging probabilistic estimates of news veracity substantially improved individual and group judgments, with the effect of eliminating polarization in news evaluation.
Edit intent: fluency
Original:  We apply this idea to Federated Learning (FL), wherein predefined neural network models with known hyperparameter values are trained on the client/device data.
Revised:  We apply this idea to Federated Learning (FL), wherein predefined neural network models are trained on the client/device data.
Edit intent: clarity
Original:  The finite sample performance is investigated for synthetic and real data resembling experimental findings for cell orientation .
Revised:  The finite sample performance is investigated for synthetic and real data .
Edit intent: clarity
Original:  It is urgent to understand how  vaccines and antibodies in the development would be impacted by mutations .
Revised:  It is imperative to understand how vaccines and antibodies in the development would be impacted by mutations .
Edit intent: clarity
Original:  It is urgent to understand how  vaccines and antibodies in the development would be impacted by mutations .
Revised:  It is urgent to understand how vaccines and antibodies in the development .
Edit intent: clarity
Original:  In this work, we first study the mechanism, frequency, and ratio of mutations on the spike (S ) protein, which is the common target of most COVID-19 vaccines and antibody therapies .
Revised:  In this work, we study the mechanism, frequency, and ratio of mutations on the spike (S ) protein, which is the common target of most COVID-19 vaccines and antibody therapies .
Edit intent: coherence
Original:  In this work, we first study the mechanism, frequency, and ratio of mutations on the spike (S ) protein, which is the common target of most COVID-19 vaccines and antibody therapies .
Revised:  In this work, we first study the mechanism, frequency, and ratio of mutations on the S protein .
Edit intent: coherence
Original:  We consider  three main problems -- model-checking, logical refection (aka global model-checking  ) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively.
Revised:  We consider , for both monadic second-order logic and modal mu-calculus, three main problems -- model-checking, logical refection (aka global model-checking ) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively.
Edit intent: fluency
Original:  We consider  three main problems -- model-checking, logical refection (aka global model-checking  ) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively.
Revised:  We consider three main problems : model-checking, logical refection (aka global model-checking ) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively.
Edit intent: fluency
Original:  We consider  three main problems -- model-checking, logical refection (aka global model-checking  ) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively.
Revised:  We consider three main problems -- model-checking, logical reflection (aka global model-checking ) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively.
Edit intent: fluency