wanyu/IteraTeR_v2 huggingface dataset:
Original: As the compute demands for machine learning and artificial intelligence applications continue to grow, co-design techniques and neuromorphic hardware have been touted as potential solutions .
Revised: As the compute demands for machine learning and artificial intelligence applications continue to grow, co-design techniques and neuromorphic hardware have been touted as a potential solution .
Edit intent: fluency
Original:  The time is ideal for a significant re-think of neuromorphic hardware design.
Edit intent: clarity
Original:  In this paper we will use a Description-Design framework to analyze past successes , under-stand current problems and identify solutions  . Engineering systems with these emerging devices might require the modification of both the type of descriptions of learning that we will design for, and the design methodologies we employ in order to realize these new descriptions.
Revised:  In this paper we will introduce a Description<->Design framework to analyze past successes , under-stand current problems and identify solutions . Engineering systems with these emerging devices might require the modification of both the type of descriptions of learning that we will design for, and the design methodologies we employ in order to realize these new descriptions.
Edit intent: clarity
Original:  In this paper we will use a Description-Design framework to analyze past successes , under-stand current problems and identify solutions  . Engineering systems with these emerging devices might require the modification of both the type of descriptions of learning that we will design for, and the design methodologies we employ in order to realize these new descriptions.
Revised:  In this paper we will use a Description-Design framework to analyze past successes , under-stand current problems and identify solutions moving forward . Engineering systems with these emerging devices might require the modification of both the type of descriptions of learning that we will design for, and the design methodologies we employ in order to realize these new descriptions.
Edit intent: clarity
Original:  We will explore  the advantages and challenges of complexity engineering over traditional approaches to neurmorphic design , the various changes that will accompany it and offer a possible path forward.
Revised:  We will explore the advantages and challenges they offer over traditional approaches to neurmorphic design , the various changes that will accompany it and offer a possible path forward.
Edit intent: clarity
Original:  Success will represent a radical shift in now hardware is designed and pave the way for  new paradigm.
Revised:  Success will represent a radical shift in now hardware is designed and pave the way for a new paradigm.
Edit intent: fluency
Original: Exploring complex social contagion, especially the social reinforcement dynamics when exposing to multiple sources , is of vital importance for understanding the spread of complicated collective behaviors nowadays.
Revised: Social reinforcement mechanism, which characterizes the promoting effects when exposing to multiple sources , is of vital importance for understanding the spread of complicated collective behaviors nowadays.
Edit intent: clarity
Original:  To this end, we incorporate multilayer  reinforcement into ignorant-spreader-ignorant (SIS) model on multiplex networks.
Revised:  To this end, we incorporate multilayer social reinforcement into ignorant-spreader-ignorant (SIS) model on multiplex networks.
Edit intent: clarity
Original:  Our results show the powerful and non-negligible impacts of complex dynamical mechanisms, which provides valuable insights toward the spreading behaviors in the digital age .
Revised:  Our results unveil the non-negligible impacts of complex dynamical mechanisms, which provides valuable insights toward the spreading behaviors in the digital age .
Edit intent: clarity
Original:  Thus, this article develops an optimal beam association framework for the mmWave vehicular networks under high mobility.
Revised:  Thus, this article develops an optimal beam association framework for mmWave vehicular networks under high mobility.
Edit intent: fluency
Original:  Specifically, we use the semi-Markov decision process (SMDP) to capture the dynamics and uncertainty of the environment.
Revised:  Specifically, we use the semi-Markov decision process to capture the dynamics and uncertainty of the environment.
Edit intent: clarity
Original:  Hence , we leverage the fact that there are usually multiple vehicles on the road to speed up the convergence to the optimal solution .
Revised:  Hence , we leverage the fact that there are usually multiple vehicles on the road to speed up the learning process .
Edit intent: clarity
Original:   Typical scenarios are explored using UK Office of National Statistics life tables , showing the behaviour of these characteristics under varying degrees of constant relative risk aversion .
Revised:  Typical scenarios are explored using UK Office of National Statistics life tables .
Edit intent: clarity
Original:  Our experimental results show thatSynthesizer is competitive against vanilla Transformer models across a range of tasks, including MT (EnDe, EnFr), language modeling(LM1B), abstractive summarization (CNN/Dailymail), dialogue generation (PersonaChat) and Multi-task language understanding (GLUE, SuperGLUE )\\%DIF > faster but also improves perplexity by a \\%DIF > . Finally, we show that simple factorized Synthesizers can  .
Revised:  Synthesizer is competitive against vanilla Transformer models across a range of tasks, including MT (EnDe, EnFr), language modeling(LM1B), abstractive summarization (CNN/Dailymail), dialogue generation (PersonaChat) and Multi-task language understanding (GLUE, SuperGLUE )\\%DIF > faster but also improves perplexity by a \\%DIF > . Finally, we show that simple factorized Synthesizers can .
Edit intent: coherence
Original:  Our experimental results show thatSynthesizer is competitive against vanilla Transformer models across a range of tasks, including MT (EnDe, EnFr), language modeling(LM1B), abstractive summarization (CNN/Dailymail), dialogue generation (PersonaChat) and Multi-task language understanding (GLUE, SuperGLUE )\\%DIF > faster but also improves perplexity by a \\%DIF > . Finally, we show that simple factorized Synthesizers can  .
Revised:  Our experimental results show that is competitive against vanilla Transformer models across a range of tasks, including MT (EnDe, EnFr), language modeling(LM1B), abstractive summarization (CNN/Dailymail), dialogue generation (PersonaChat) and Multi-task language understanding (GLUE, SuperGLUE )\\%DIF > faster but also improves perplexity by a \\%DIF > . Finally, we show that simple factorized Synthesizers can .
Edit intent: fluency
Original:  Our experimental results show thatSynthesizer is competitive against vanilla Transformer models across a range of tasks, including MT (EnDe, EnFr), language modeling(LM1B), abstractive summarization (CNN/Dailymail), dialogue generation (PersonaChat) and Multi-task language understanding (GLUE, SuperGLUE )\\%DIF > faster but also improves perplexity by a \\%DIF > . Finally, we show that simple factorized Synthesizers can  .
Revised:  Our experimental results show thatSynthesizer In our experiments, we first show that simple Synthesizers achieve highly competitive performance when compared against vanilla Transformer models across a range of tasks, including MT (EnDe, EnFr), language modeling(LM1B), abstractive summarization (CNN/Dailymail), dialogue generation (PersonaChat) and Multi-task language understanding (GLUE, SuperGLUE )\\%DIF > faster but also improves perplexity by a \\%DIF > . Finally, we show that simple factorized Synthesizers can .
Edit intent: clarity
Original: In this paper, a stochastic network based information propagation model is developed.
Revised: In this paper, a network based stochastic information propagation model is developed.
Edit intent: fluency
Original:  The characteristics of the information propagation were analyzed in scale-free and Erd\H os--R\'enyi networks.
Revised:  The characteristics of the information propagation were analyzed in scale-free and Erdos--Renyi networks.
Edit intent: fluency
Original:  The validity and accuracy of the model are justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos--Renyi networks.
Revised:  The validity and accuracy of the model are justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos-Renyi networks.
Edit intent: fluency
Original: In this paper, a network based stochastic information propagation model is developed.
Revised: In this paper, a network-based stochastic information propagation model is developed.
Edit intent: fluency
Original:  Information flow is modeled by a probabilistic differential equation system.
Revised:  The information flow is modeled by a probabilistic differential equation system.
Edit intent: clarity
Original:  The validity and accuracy of the model are justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos-Renyi  networks.
Revised:  The validity of the model are justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos-Renyi networks.
Edit intent: clarity
Original:  The validity and accuracy of the model are justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos-Renyi  networks.
Revised:  The validity and accuracy of the model is justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos-Renyi networks.
Edit intent: fluency
Original:  The validity and accuracy of the model are justified by Monte Carlo network simulations through the analysis of information propagation in scale-free and Erdos-Renyi  networks.
Revised:  The validity and accuracy of the model are justified by Monte Carlo network simulation through the analysis of information propagation in scale-free and Erdos-Renyi networks.
Edit intent: fluency
Original: Pre-trained language models ( PTLM) have impressive performance on commonsense inference benchmarks, but their ability to practically employ commonsense to communicate with humans is fiercely debated.
Revised: Pre-trained language models ( PTLMs) have achieved impressive performance on commonsense inference benchmarks, but their ability to practically employ commonsense to communicate with humans is fiercely debated.
Edit intent: clarity
Original: Pre-trained language models ( PTLM) have impressive performance on commonsense inference benchmarks, but their ability to practically employ commonsense to communicate with humans is fiercely debated.
Revised: Pre-trained language models ( PTLM) have impressive performance on commonsense inference benchmarks, but their ability to employ commonsense to communicate with humans is fiercely debated.
Edit intent: clarity
Original: In the literature, there is a strong interest to identify and define activation functions which can improve neural network performance.
Revised: In neural networks literature, there is a strong interest to identify and define activation functions which can improve neural network performance.
Edit intent: fluency
Original: In the literature, there is a strong interest to identify and define activation functions which can improve neural network performance.
Revised: In the literature, there is a strong interest in identifying and defining activation functions which can improve neural network performance.
Edit intent: fluency
Original:  In recent years there is a renovated interest of the scientific community in investigating activation functions which can be trained during the learning process, usually referred as trainable, learnable or adaptable activation functions.
Revised:  In recent years there has been a renovated interest of the scientific community in investigating activation functions which can be trained during the learning process, usually referred as trainable, learnable or adaptable activation functions.
Edit intent: fluency
Original:  In recent years there is a renovated interest of the scientific community in investigating activation functions which can be trained during the learning process, usually referred as trainable, learnable or adaptable activation functions.
Revised:  In recent years there is a renovated interest of the scientific community in investigating activation functions which can be trained during the learning process, usually referred to as "trainable", "learnable" or "adaptable" activation functions.
Edit intent: fluency
Original:  Starting from a discussion on the use of the term "activation function" in literature, we propose a taxonomy of trainable activation functions, highlight common and distinctive proprieties of recent and past models, and discuss on main advantages and limitations of this type of approach.
Revised:  Starting from a discussion on the use of the term "activation function" in literature, we propose a taxonomy of trainable activation functions, highlight common and distinctive proprieties of recent and past models, and discuss main advantages and limitations of this type of approach.
Edit intent: fluency
Original:  We show that many of the proposed approaches are equivalent to add neuron layers which use fixed activation functions (nontrainable activation functions ) and some simple local rule constrains the corresponding weight layers.
Revised:  We show that many of the proposed approaches are equivalent to adding neuron layers which use fixed activation functions (nontrainable activation functions ) and some simple local rule constrains the corresponding weight layers.
Edit intent: fluency
Original:  We show that many of the proposed approaches are equivalent to add neuron layers which use fixed activation functions (nontrainable activation functions ) and some simple local rule constrains the corresponding weight layers.
Revised:  We show that many of the proposed approaches are equivalent to add neuron layers which use fixed (non-trainable) activation functions and some simple local rule constrains the corresponding weight layers.
Edit intent: fluency
Original:  We show that many of the proposed approaches are equivalent to add neuron layers which use fixed activation functions (nontrainable activation functions ) and some simple local rule constrains the corresponding weight layers.
Revised:  We show that many of the proposed approaches are equivalent to add neuron layers which use fixed activation functions (nontrainable activation functions ) and some simple local rule that constraints the corresponding weight layers.
Edit intent: clarity
Original:  We propose a simple negative drift theorem for multiplicative drift scenarios and show that it simplifies many existing results .
Revised:  We propose a simple negative drift theorem for multiplicative drift scenarios and show that it can simplify existing analyses .
Edit intent: clarity
Original:  As one particular result, we apply this method and a novel domination argument to show an exponential lower bound for the runtime of the mutation-only simple GA on \onemax for arbitrary population size.
Revised:  As one particular result, we apply this method and a novel domination argument to show an exponential lower bound for the runtime of the mutation-only simple genetic algorithm on \onemax for arbitrary population size.
Edit intent: clarity
Original:  The disk graph G_D for D is the undirected graph with vertex set D in which two disks are joined by an edge if and only if they intersect.
Revised:  The disk graph G_D for D is the undirected graph with vertex set D in which two disks are joined by an edge if and only if they intersect.
Edit intent: fluency
Original:  The directed transmission graph G^{\rightarrow}_D for D is the directed graph with vertex set D in which there is an edge from a disk D_1 \in D to a disk D_2 \in D if and only if D_1 contains the center of D_2. Given D and two non-intersecting disks s, t \in D, we show that a minimum s-t vertex cut in G_D or in G^{\rightarrow}_D can be found in O(n^{3/2} %DIFDELCMD < \operatorname{polylog} %DIFDELCMD < %%%  n) expected time.
Revised:  The directed transmission graph G^{\rightarrow}_D for D is the directed graph with vertex set D in which there is an edge from a disk D_1 \in D to a disk D_2 \in D if and only if D_1 contains the center of D_2. Given D and two non-intersecting disks s, t \in D, we show that a minimum s-t vertex cut in G_D or in G^{\rightarrow}_D can be found in O(n^{3/2} %DIFDELCMD < \operatorname{polylog} %DIFDELCMD < %%% n) expected time.
Edit intent: fluency
Original:  As an application, we consider the \emph{barrier resilience problem in a rectangular domain.
Revised:  As an application, we consider the \emph{barrier resilience problem in a rectangular domain.
Edit intent: fluency
Original:  We find that a simple optimisation of the training label set improves recognition performance without additional compute .
Revised:  We find that a simple optimisation of the training label set improves recognition performance without additional computation .
Edit intent: fluency
Original: Fast and accurate calculation for the distributions of Quadratic forms of centered Gaussian variables is of interest in computational statistics .
Revised: Fast and accurate calculation for the distributions of the quadratic forms of Gaussian random variables .
Edit intent: clarity
Original:  The new method may facilitate the hypothesis testing in the analysis of big data , where efficient and accurate calculation of  small p-values is desired.
Revised:  The new method may facilitate the hypothesis testing in big data analysis , where efficient and accurate calculation of small p-values is desired.
Edit intent: fluency
Original:  The numerical methods are verified and validated with two numerical experiments : (1) a simulation of water waves in the vicinity of the Faro-Olh\~ao inlet of the Ria Formosa lagoon in Portugal, (2) an experiment that measures the flow and bed morphology induced by a solitary wave over a sloping beach .
Revised:  The numerical solution algorithms are validated with numerical experiments to demonstrate the ability of the algorithms to accurately resolve hydrodynamics of solitary and regular waves, and morphodynamic changes induced by such waves .
Edit intent: clarity
Original: We propose an epidemic model SIPHERD in which three categories of infection carriers Symptomatic, Purely Asymptomatic  and Exposed are considered with different rates of transmission of infection that are taken dependent on the lockdown and social distancing.
Revised: We propose an epidemic model SIPHERD in which three categories of infection carriers Symptomatic, Purely Asymptomatic , and Exposed are considered with different rates of transmission of infection that are taken dependent on the lockdown and social distancing.
Edit intent: fluency
Original: Ill-posed linear inverse problems appear in many fields of imaging science and engineering , and are typically addressed by solving optimization problems, which are composed of  fidelity and prior terms or constraints.
Revised: Ill-posed linear inverse problems appear in many scientific setups , and are typically addressed by solving optimization problems, which are composed of fidelity and prior terms or constraints.
Edit intent: clarity
Original: Ill-posed linear inverse problems appear in many fields of imaging science and engineering , and are typically addressed by solving optimization problems, which are composed of  fidelity and prior terms or constraints.
Revised: Ill-posed linear inverse problems appear in many fields of imaging science and engineering , and are typically addressed by solving optimization problems, which are composed of data fidelity and prior terms or constraints.
Edit intent: clarity
Original:  However, recently a few works have considered a back-projection (BP) based fidelity term as an alternative to the LS , and demonstrated excellent reconstruction results for popular inverse problems.
Revised:  However, recently a few works have considered a back-projection (BP) based fidelity term as an alternative to the LS , and demonstrated excellent results for popular inverse problems.
Edit intent: clarity
Original:  These prior works have also empirically shown that using the BP term, rather than the LS term, requires fewer iterations of plain and accelerated proximal gradient algorithms.
Revised:  These works have also empirically shown that using the BP term, rather than the LS term, requires fewer iterations of plain and accelerated proximal gradient algorithms.
Edit intent: clarity
Original:  These prior works have also empirically shown that using the BP term, rather than the LS term, requires fewer iterations of plain and accelerated proximal gradient algorithms.
Revised:  These prior works have also empirically shown that using the BP term, rather than the LS term, requires fewer iterations of optimization algorithms.
Edit intent: clarity
Original:  In the current paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to  the LS objective .
Revised:  In this paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to the LS objective .
Edit intent: clarity
Original:  In the current paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to  the LS objective .
Revised:  In the current paper, we examine the convergence rate of the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to the LS objective .
Edit intent: clarity
Original:  In the current paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to  the LS objective .
Revised:  In the current paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm for the BP objective. Our analysis allows to identify an inherent source for its faster convergence compared to the LS objective .
Edit intent: clarity
Original:  In the current paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to  the LS objective .
Revised:  In the current paper, we examine the convergence rate of the BP objective for the projected gradient descent (PGD) algorithm and identify an inherent source for its faster convergence compared to using the LS objective .
Edit intent: clarity
Original: Disparities in authorship and citations across genders can have substantial adverse consequences not just on the disadvantaged gender , but also on the field of study as a whole.
Revised: Disparities in authorship and citations across gender can have substantial adverse consequences not just on the disadvantaged gender , but also on the field of study as a whole.
Edit intent: fluency
Original: Disparities in authorship and citations across genders can have substantial adverse consequences not just on the disadvantaged gender , but also on the field of study as a whole.
Revised: Disparities in authorship and citations across genders can have substantial adverse consequences not just on the disadvantaged genders , but also on the field of study as a whole.
Edit intent: fluency
Original:  We hope that recording citation and participation gaps across demographic groups will improve awareness of gender gaps and encourage more inclusiveness and fairness in research .
Revised:  Finally, we discuss the ethical considerations involved in automatic demographic analysis .
Edit intent: clarity