wanyu/IteraTeR_v2 huggingface dataset:
Original:  This fundamentally different approach has already been deployed in a publicly downloadable app . It brings a new tool to bear on the pandemic , powered by network theory.
Revised:  This fundamentally different approach has already been deployed in a publicly downloadable app . It brings a new tool to bear on pandemic control , powered by network theory.
Edit intent: clarity
Original:  Like a weather satellite providing early warning of incoming hurricanes, it empowers individuals to see transmission approaching from far away, and  to directly avoid exposure in the first place .
Revised:  Like a weather satellite providing early warning of incoming hurricanes, it empowers individuals to see transmission approaching from far away, and to directly avoid exposure .
Edit intent: clarity
Original:  Consequently, our new system could solve the behavior coordination problem which has hampered many other app-based interventions to date.
Revised:  Consequently, our new system solves the behavior coordination problem which has hampered many other app-based interventions to date.
Edit intent: clarity
Original: The urgency of mitigating COVID-19  has spawned a large and diverse body of scientific literature that is challenging for researchers to navigate.
Revised: The COVID-19 has spawned a large and diverse body of scientific literature that is challenging for researchers to navigate.
Edit intent: clarity
Original: The urgency of mitigating COVID-19  has spawned a large and diverse body of scientific literature that is challenging for researchers to navigate.
Revised: The urgency of mitigating COVID-19 has spawned a diverse body of scientific literature that is challenging for researchers to navigate.
Edit intent: clarity
Original:  This explosion of information has stimulated interest in automated tools to help identify useful knowledge.
Revised:  This explosion of information has stimulated interest in automated tools to help find useful knowledge.
Edit intent: clarity
Original:  We seek to identify concepts in COVID-19 and related literature which represent activities, functions , associations and causal relations, ranging from cellular processes to economic impacts.
Revised:  We seek to identify concepts in COVID-19 and related literature which represent activities, functions and causal relations, ranging from cellular processes to economic impacts.
Edit intent: clarity
Original: Transfer Optimization is an incipient research area dedicated to the simultaneous solving of multiple optimization tasks  .
Revised: Transfer Optimization is an incipient research area dedicated to solving multiple optimization tasks .
Edit intent: clarity
Original: Transfer Optimization is an incipient research area dedicated to the simultaneous solving of multiple optimization tasks  .
Revised: Transfer Optimization is an incipient research area dedicated to the simultaneous solving of multiple optimization tasks simultaneously .
Edit intent: clarity
Original:  In this paper we introduce a novel adaptive metaheuristic algorithm for dealing with Evolutionary Multitasking environments coined as Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm (AT-MFCGA).
Revised:  In this paper we introduce a novel adaptive metaheuristic algorithm to deal with Evolutionary Multitasking environments coined as Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm (AT-MFCGA).
Edit intent: fluency
Original:  AT-MFCGA relies on cellular automata to implement mechanisms for exchanging knowledge among the optimization problems under consideration.
Revised:  AT-MFCGA relies on cellular automata to implement mechanisms in order to exchange knowledge among the optimization problems under consideration.
Edit intent: clarity
Original:  Furthermore, our approach is able to explain by itself the synergies among tasks that were encountered and exploited during the search, which helps  understand interactions between related optimization tasks.
Revised:  Furthermore, our approach is able to explain by itself the synergies among tasks that were encountered and exploited during the search, which helps us to understand interactions between related optimization tasks.
Edit intent: fluency
Original:  A comprehensive experimental setup is designed for assessing and comparing the performance of AT-MFCGA to that of other renowned evolutionary multitasking alternatives (MFEA and MFEA-II).
Revised:  A comprehensive experimental setup is designed to assess and compare the performance of AT-MFCGA to that of other renowned evolutionary multitasking alternatives (MFEA and MFEA-II).
Edit intent: fluency
Original:  Experiments comprise 11 multitasking scenarios composed by 20 instances of 4 combinatorial optimization problems, yielding the largest discrete multitasking environment solved to date.
Revised:  Experiments comprise 11 multitasking scenarios composed of 20 instances of 4 combinatorial optimization problems, yielding the largest discrete multitasking environment solved to date.
Edit intent: fluency
Original:  Results are conclusive in regards to the superior quality of solutions provided by AT-MFCGA with respect to the rest of  methods, which are complemented by a quantitative examination of the genetic transferability among tasks along the search process.
Revised:  Results are conclusive in regard to the superior quality of solutions provided by AT-MFCGA with respect to the rest of methods, which are complemented by a quantitative examination of the genetic transferability among tasks along the search process.
Edit intent: fluency
Original:  Results are conclusive in regards to the superior quality of solutions provided by AT-MFCGA with respect to the rest of  methods, which are complemented by a quantitative examination of the genetic transferability among tasks along the search process.
Revised:  Results are conclusive in regards to the superior quality of solutions provided by AT-MFCGA with respect to the rest of the methods, which are complemented by a quantitative examination of the genetic transferability among tasks along the search process.
Edit intent: fluency
Original:  Results are conclusive in regards to the superior quality of solutions provided by AT-MFCGA with respect to the rest of  methods, which are complemented by a quantitative examination of the genetic transferability among tasks along the search process.
Revised:  Results are conclusive in regards to the superior quality of solutions provided by AT-MFCGA with respect to the rest of methods, which are complemented by a quantitative examination of the genetic transferability among tasks throughout the search process.
Edit intent: clarity
Original:  We show that a convolutional neural network autoencoder provides a straightforward and elegant way to learn a robust representation of brain streamlines, which can be used to filter undesired samples with a nearest neighbor algorithm.
Edit intent: coherence
Original:  We demonstrate the ability of FINTA to discriminate between "plausible" and "implausible" streamlinesas well as to recover individual streamline group instances from a raw tractogram, from both synthetic and real human brain diffusion MRI tractography data , including partial tractograms\\%DIF >  . Results reveal that FINTA has a superior filtering performance compared to  state-of-the-art methods .
Revised:  We demonstrate the ability of FINTA to discriminate between "plausible" and "implausible" streamlinesas well as to recover individual streamline group instances from a raw tractogram, from both synthetic and in vivo human brain diffusion MRI tractography data , including partial tractograms\\%DIF > . Results reveal that FINTA has a superior filtering performance compared to state-of-the-art methods .
Edit intent: clarity
Original:  It sets the foundations for opening up new prospects towards more accurate and robust tractometry and connectivity diffusion MRI analyses, which may ultimately lead to improve the imaging of the white matter anatomy .
Revised:  It sets the foundations for opening up new prospects towards more accurate and robust tractometry and connectivity analyses .
Edit intent: clarity
Original:  In fact our algorithms succeed where convex surrogates fail in the sense that we show strong lower bounds categorically for the existing approaches.
Revised:  In fact our algorithms succeed where convex surrogates fail in the sense that we show strong lower bounds for the existing approaches.
Edit intent: clarity
Original: In this work we revisit two classic high-dimensional online learning problems, namely regression and linear contextual bandits, from the perspective of adversarial robustness.
Revised: In this work we revisit two classic high-dimensional online learning problems, namely linear regression and contextual bandits, from the perspective of adversarial robustness.
Edit intent: fluency
Original:  We answer this question in the affirmative for both regression and linear contextual bandits.
Revised:  We answer this question in the affirmative for both linear regression and contextual bandits.
Edit intent: fluency
Original:  In fact our algorithms succeed where convex surrogates failin the sense that we show strong lower bounds for the existing approaches .
Revised:  In fact our algorithms succeed where conventional methods fail. In particular we show strong lower bounds for the existing approaches .
Edit intent: clarity
Original:  Our approach is based on a novel alternating minimization scheme that interleaves ordinary least-squares with a semidefinite program for finding appropriate reweightings of the distribution .
Revised:  Our approach is based on a novel alternating minimization scheme that interleaves ordinary least-squares with a simple convex program that finds the optimal reweighting of the distribution .
Edit intent: clarity
Original: In this paper we study the problem of recovering a tensor network decomposition of a given tensor \mathcal{T the tensors at the vertices of the network are orthogonally decomposable.
Revised: In this paper we study the problem of decomposing a given tensor \mathcal{T the tensors at the vertices of the network are orthogonally decomposable.
Edit intent: clarity
Original: In this paper we study the problem of recovering a tensor network decomposition of a given tensor \mathcal{T the tensors at the vertices of the network are orthogonally decomposable.
Revised: In this paper we study the problem of recovering a tensor network decomposition of a given tensor \mathcal{T the tensors at the vertices are orthogonally decomposable.
Edit intent: clarity
Original:  Specifically, we consider tensor networks in the form of tensor trains (aka matrix product states).
Edit intent: coherence
Original:  When the tensor train has length 2 , and the orthogonally decomposable tensors at the two vertices of the network are symmetric, we show how to recover the decomposition by considering random linear combinations of slices.
Revised:  When the tensor train has length two , and the orthogonally decomposable tensors at the two vertices of the network are symmetric, we show how to recover the decomposition by considering random linear combinations of slices.
Edit intent: fluency
Original:  When the tensor train has length 2 , and the orthogonally decomposable tensors at the two vertices of the network are symmetric, we show how to recover the decomposition by considering random linear combinations of slices.
Revised:  When the tensor train has length 2 , and the orthogonally decomposable tensors at the two vertices are symmetric, we show how to recover the decomposition by considering random linear combinations of slices.
Edit intent: clarity
Original:  When the tensor train has length 2 , and the orthogonally decomposable tensors at the two vertices of the network are symmetric, we show how to recover the decomposition by considering random linear combinations of slices.
Revised:  When the tensor train has length 2 , and the orthogonally decomposable tensors at the two vertices of the network are symmetric, we recover the decomposition by considering random linear combinations of slices.
Edit intent: clarity
Original:  Furthermore, if the tensors at the vertices are symmetric  but not orthogonally decomposable, we show that a whitening procedure can transform the problem into an orthogonal one, thereby yielding a solution for the decomposition of the tensor .
Revised:  Furthermore, if the tensors at the vertices are symmetric but not orthogonally decomposable, we show that a whitening procedure can transform the problem into the orthogonal case .
Edit intent: clarity
Original:  When the tensor network has length 3 or more and the tensors at the vertices are symmetric and orthogonally decomposable, we provide an algorithm for recovering them subject to some rank conditions.
Revised:  When the tensor network has length three or more and the tensors at the vertices are symmetric and orthogonally decomposable, we provide an algorithm for recovering them subject to some rank conditions.
Edit intent: fluency
Original:  Finally, in the case of tensor trains of length two in which the tensors at the vertices are orthogonally decomposable but not necessarily symmetric, we show that the decomposition problem reduces to the problem of a novel matrix decomposition, that of an orthogonal matrix multiplied by diagonal matrices on either side.
Revised:  Finally, in the case of tensor trains of length two in which the tensors at the vertices are orthogonally decomposable but not necessarily symmetric, we show that the decomposition problem reduces to the novel problem of decomposing a matrix into an orthogonal matrix multiplied by diagonal matrices on either side.
Edit intent: clarity
Original:  We provide two solutions for the full-rank tensor case using Sinkhorn's theorem and  Procrustes' algorithm , respectively, and show that the Procrustes-based solution can be generalized to any rank case .
Revised:  We provide two solutions for the full-rank tensor case using Sinkhorn's theorem and Procrustes' algorithm .
Edit intent: coherence
Original: This paper is focused on the finetuning of acoustic models for speaker adap-tation based on a given gender.
Revised: This paper is focused on the finetuning of acoustic models for speaker adaptation goals on a given gender.
Edit intent: fluency
Original:  Moreover, we adapted our general model on the full L2 Arctic dataset of accented speech and finetuned it for particular speakers and male and female genders separately.
Revised:  Moreover, we adapted our base model on the full L2 Arctic dataset of accented speech and finetuned it for particular speakers and male and female genders separately.
Edit intent: clarity
Original:  Moreover, we adapted our general model on the full L2 Arctic dataset of accented speech and finetuned it for particular speakers and male and female genders separately.
Revised:  Moreover, we adapted our general model on the full L2 Arctic dataset of accented speech and fine-tuned it for particular speakers and male and female genders separately.
Edit intent: fluency
Original:  Finally, we tested the concatenation of the pretrained x-vector voice embeddings and embeddings from  conventional encoder, but its gain in accuracy is not significant.
Revised:  Finally, we tested the concatenation of the pretrained x-vector voice embeddings and embeddings from a conventional encoder, but its gain in accuracy is not significant.
Edit intent: fluency
Original:  functional magnetic resonance imaging was performed on healthy subjects while they listened to self-selected music to which they felt a positive emotional attachment,
Revised:  functional magnetic resonance imaging was performed on healthy participants while they listened to self-selected music to which they felt a positive emotional attachment,
Edit intent: clarity
Original:  as well as culturally familiar music , culturally unfamiliar music, and several excerpts of speech. J.S. Bach 's 2-part Invention in C-Major BWV 772 was chosen as the culturally familiar example, and Gagaku , the court music of medieval Japan , served as the culturally unfamiliar example because of its conspicuous differences from the traditional Western musical experience of the subjects .
Revised:  as well as culturally familiar music ( J.S. Bach 's 2-part Invention in C-Major BWV 772 was chosen as the culturally familiar example, and Gagaku , the court music of medieval Japan , served as the culturally unfamiliar example because of its conspicuous differences from the traditional Western musical experience of the subjects .
Edit intent: coherence
Original:  as well as culturally familiar music , culturally unfamiliar music, and several excerpts of speech. J.S. Bach 's 2-part Invention in C-Major BWV 772 was chosen as the culturally familiar example, and Gagaku , the court music of medieval Japan , served as the culturally unfamiliar example because of its conspicuous differences from the traditional Western musical experience of the subjects .
Revised:  as well as culturally familiar music , culturally unfamiliar music, and several excerpts of speech. J.S. Bach ), culturally unfamiliar music (Gagaku court music of medieval Japan , served as the culturally unfamiliar example because of its conspicuous differences from the traditional Western musical experience of the subjects .
Edit intent: coherence
Original:  as well as culturally familiar music , culturally unfamiliar music, and several excerpts of speech. J.S. Bach 's 2-part Invention in C-Major BWV 772 was chosen as the culturally familiar example, and Gagaku , the court music of medieval Japan , served as the culturally unfamiliar example because of its conspicuous differences from the traditional Western musical experience of the subjects .
Revised:  as well as culturally familiar music , culturally unfamiliar music, and several excerpts of speech. J.S. Bach 's 2-part Invention in C-Major BWV 772 was chosen as the culturally familiar example, and Gagaku , the court music of medieval Japan ), and several excerpts of speech .
Edit intent: coherence
Original:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Revised:  There was a marked contrast among the whole-brain networks during the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Edit intent: clarity
Original:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Revised:  There was a marked contrast among the responses to the different types of auditory pieces, in particular for the unfamiliar music . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Edit intent: clarity
Original:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Revised:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, participants' whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Edit intent: clarity
Original:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Revised:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain networks exhibited modular organization that was significantly coordinated with the network 's flexibility.
Edit intent: fluency
Original:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network 's flexibility.
Revised:  There was a marked contrast among the responses to the different types of music, whereby the brain treated the unfamiliar musicas an outlier . During the self-selected and Bach tracks, a subject' s whole-brain network exhibited modular organization that was significantly coordinated with the network flexibility.
Edit intent: fluency
Original:  Given the strikingly different whole-brain responses, the results suggest that music cognition is strongly impacted by enculturation and exposure .
Revised:  Given the strikingly different whole-brain activity have the potential to lead to new insights into the complex neural function that occurs during music perception of real-world songs .
Edit intent: clarity
Original: In this paper, we In this paper, we obtain the existence, uniqueness and positivity of the solution to delayed stochastic differential equations with jumps.
Revised: In this paper, we obtain the existence, uniqueness and positivity of the solution to delayed stochastic differential equations with jumps.
Edit intent: fluency
Original:  This equation is then applied to model the price movement of the risky asset in a financial market and the Black-Scholes formula for the price of European option is obtained together with the hedging portfolios.
Revised:  This equation is then applied to model the price movement of the risky asset in a financial market and the Black-Scholes formula for the price of European options is obtained together with the hedging portfolios.
Edit intent: fluency
Original:  But in general  there is no analytical expression for the option price.
Revised:  But in general , there is no analytical expression for the option price.
Edit intent: fluency
Original:  To this end  we need to simulate the delayed stochastic differential equations with jumps.
Revised:  To this end , we need to simulate the delayed stochastic differential equations with jumps.
Edit intent: fluency
Original:  Matched filtering is known to be optimal under certain conditions, yet in practice, these conditions are only approximately satisfied while the algorithm is computationally expensive.
Edit intent: coherence
Original:  Despite the success of matched filtering for signal detection , due to these limitations , there has been recent interest in developing deep convolutional neural networks (CNNs) for signal detection.
Revised:  Despite the success of matched filtering , due to these limitations , there has been recent interest in developing deep convolutional neural networks (CNNs) for signal detection.
Edit intent: fluency
Original:  We propose and develop a new method for hyperparameter optimization based on genetic algorithms (GAs).
Revised:  We propose a new method for hyperparameter optimization based on genetic algorithms (GAs).
Edit intent: clarity