wanyu/IteraTeR_v2 huggingface dataset:
Original: The graph is a natural representation of data in a variety of real-world applications, for example as a knowledge graph , a social network , or a biological network .
Revised: Graph is a natural representation of data in a variety of real-world applications, for example as a knowledge graph , a social network , or a biological network .
Edit intent: clarity
Original: The graph is a natural representation of data in a variety of real-world applications, for example as a knowledge graph , a social network , or a biological network .
Revised: The graph is a natural representation of data for a variety of real-world applications, for example as a knowledge graph , a social network , or a biological network .
Edit intent: clarity
Original:  In this paper, we propose a novel approach,  Customized Graph Embedding (CGE) , to tackle this problem.
Revised:  In this paper, we propose a novel approach, namely Customized Graph Embedding (CGE) , to tackle this problem.
Edit intent: coherence
Original:  In this paper, we propose a novel approach,  Customized Graph Embedding (CGE) , to tackle this problem.
Revised:  In this paper, we propose a novel approach, Customized Graph Embedding (CGE) to tackle this problem.
Edit intent: fluency
Original:  The CGE algorithm learns a customized vector representation of the graph by differentiating the varying importance of distinct graph paths . Experiments are carried out on a diverse set of node classification datasets and strong performance is demonstrated .
Revised:  The CGE algorithm learns customized vector representations of graph nodes by differentiating the varying importance of distinct graph paths . Experiments are carried out on a diverse set of node classification datasets and strong performance is demonstrated .
Edit intent: clarity
Original:  The CGE algorithm learns a customized vector representation of the graph by differentiating the varying importance of distinct graph paths . Experiments are carried out on a diverse set of node classification datasets and strong performance is demonstrated .
Revised:  The CGE algorithm learns a customized vector representation of the graph by differentiating the importance of distinct graph paths . Experiments are carried out on a diverse set of node classification datasets and strong performance is demonstrated .
Edit intent: clarity
Original:  Different from existing works, we develop a new and direct approach for the weak error analysis, which does not rely on the  associated Kolmogorov equation  .
Revised:  Different from existing works, we develop a new and direct approach for the weak error analysis, which does not rely on the use of the associated Kolmogorov equation .
Edit intent: clarity
Original:  More specifically, a small set of acoustic features are extracted from the reference audio and then used to condition a TC2 synthesizer.
Revised:  More specifically, a small set of acoustic features are extracted from reference audio and then used to condition a TC2 synthesizer.
Edit intent: fluency
Original:  The trained model is evaluated using subjective listening tests and novel objective evaluations of prosody transfer are proposed.
Revised:  The trained model is evaluated using subjective listening tests and a novel objective evaluation of prosody transfer are proposed.
Edit intent: fluency
Original:  The trained model is evaluated using subjective listening tests and novel objective evaluations of prosody transfer are proposed.
Revised:  The trained model is evaluated using subjective listening tests and novel objective evaluations of prosody transfer is proposed.
Edit intent: fluency
Original:  The proposed approaches were validated against data from the detailed personalized model of  human torso electrophysiology.
Revised:  The proposed approaches were validated on data from the detailed personalized model of human torso electrophysiology.
Edit intent: clarity
Original:  The proposed approaches were validated against data from the detailed personalized model of  human torso electrophysiology.
Revised:  The proposed approaches were validated against data from the detailed personalized model of the human torso electrophysiology.
Edit intent: fluency
Original:  The current paper includes a visualization of the phase map based on our approach and shows the robustness of the proposed approaches in the analysis of the complex non-stationary periodic activity of the excitable cardiac tissue.
Revised:  This paper includes visualization of the phase map based on our approach and shows the robustness of the proposed approaches in the analysis of the complex non-stationary periodic activity of the excitable cardiac tissue.
Edit intent: coherence
Original:  As the performance of such systems greatly depends on the decisions made by the individual users - often leading to undesirable system behaviour - a natural question arises: How can we design incentives to promote efficient use of the existing infrastructure?
Revised:  As the performance of such systems greatly depends on the decisions made by the users - often leading to undesirable system behaviour - a natural question arises: How can we design incentives to promote efficient use of the existing infrastructure?
Edit intent: clarity
Original:  Here, we answer this question in relation to the well-studied class of congestion games, used to model a variety of problems arising in theory and practice  including traffic routing.
Revised:  Here, we answer this question in relation to the well-studied class of congestion games, used to model a variety of problems arising in theory and practice , including traffic routing.
Edit intent: fluency
Original:  In this context, a methodology for designing efficient mechanisms is so far missing , in spite of the vast scientific interest.
Revised:  In this context, a methodology for designing optimal congestion pricing mechanisms is so far missing , in spite of the vast scientific interest.
Edit intent: clarity
Original:  In this context, a methodology for designing efficient mechanisms is so far missing , in spite of the vast scientific interest.
Revised:  In this context, a methodology for designing efficient mechanisms is so far missing in spite of the vast scientific interest.
Edit intent: fluency
Original:  Additionally, we show how mechanisms that perform optimally in the continuous-flow approximation (marginal cost tolls), worsen the performance when applied to the original discrete setup.
Revised:  Additionally, mechanisms that perform optimally in the continuous-flow approximation (marginal cost tolls), worsen the performance when applied to the original discrete setup.
Edit intent: coherence
Original:  As the performance of such systems greatly depends on the decisions made by the users - often leading to undesirable system behaviour - a natural question arises: How can we design incentives to promote efficient use of the existing infrastructure ?
Revised:  As the performance of such systems greatly depends on the decisions made by the users - often leading to undesirable system behaviour - a natural question arises: How can we design mechanisms to promote efficient use of the existing infrastructure ?
Edit intent: clarity
Original:  As the performance of such systems greatly depends on the decisions made by the users - often leading to undesirable system behaviour - a natural question arises: How can we design incentives to promote efficient use of the existing infrastructure ?
Revised:  As the performance of such systems greatly depends on the decisions made by the users - often leading to undesirable system behaviour - a natural question arises: How can we design incentives to promote efficient use of shared resources ?
Edit intent: clarity
Original:  Here, we answer this question in relation to the well-studied class of  congestion games, used to model a variety of problems arising in theory and practice , including traffic routing.
Revised:  Here, we answer this question in relation to the well-studied class of congestion games, used to model a variety of problems , including traffic routing.
Edit intent: clarity
Original:  In this context, a methodology for designing optimal congestion pricing mechanisms is so far missing in spite of the vast scientific interest.
Revised:  Within this context, a methodology for designing optimal congestion pricing mechanisms is so far missing in spite of the vast scientific interest.
Edit intent: fluency
Original:  In this context, a methodology for designing optimal congestion pricing mechanisms is so far missing in spite of the vast scientific interest.
Revised:  In this context, a methodology for designing optimal congestion pricing mechanisms is so far missing in spite of the scientific interest.
Edit intent: clarity
Original:  In this manuscript , we resolve this problem by means of an elegant and computationally tractable approach, subsuming and generalizing a number of existing results . ]  Surprisingly, optimal mechanisms designed using local information perform closely to those designed using global information .
Revised:  In this manuscript we resolve this problem by means of an elegant and computationally tractable approach, subsuming and generalizing a number of existing results . ] Surprisingly, optimal mechanisms designed using local information perform closely to those designed using global information .
Edit intent: fluency
Original:  In this manuscript , we resolve this problem by means of an elegant and computationally tractable approach, subsuming and generalizing a number of existing results . ]  Surprisingly, optimal mechanisms designed using local information perform closely to those designed using global information .
Revised:  In this manuscript , we resolve this problem by means of an elegant and computationally tractable approach, subsuming and generalizing a number of existing results . ] Surprisingly, optimal tolling mechanism using only local information perform closely to those designed using global information .
Edit intent: clarity
Original: Integrating modalities, such as video signalswith speech, has been shown to provide a standard quality and intelligibility for speech enhancement (SE).
Revised: Previous studies have proven that integrating video signals, as a complementary modality, can facilitate improved performance for speech enhancement (SE).
Edit intent: clarity
Original:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Revised:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources and thus may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Edit intent: coherence
Original:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Revised:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the SE system. As an alternative source , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Edit intent: clarity
Original:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Revised:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while manifesting speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Edit intent: fluency
Original:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart , benefiting the enhancement .
Revised:  However, video clips usually contain large amounts of data and pose a high cost in terms of computational resources , which may complicate the respective SE . By contrast , a bone-conducted speech signal has a moderate data size while it manifests speech-phoneme structures, and thus complements its air-conducted counterpart .
Edit intent: coherence
Original:  In addition, we examine two  strategies, early fusion  and late fusion (LF), to process the two types of speech signals, and adopt a deep learning-based fully convolutional network to conduct the enhancement.
Revised:  In addition, we examine two strategies, early fusion and late fusion (LF), to integrate the two types of speech signals, and adopt a deep learning-based fully convolutional network to conduct the enhancement.
Edit intent: clarity
Original:  We model the problem using ARA for the non-strategic play and the Bayes Nash equilibrium (BNE) solution concepts.
Revised:  We model the problem using ARA for non-strategic play and the Bayes Nash equilibrium (BNE) solution concepts.
Edit intent: fluency
Original:  While most prior work on covering codes has focused on the Hamming metric, we consider the problem of designing covering codes defined in terms of insertions and deletions.
Revised:  While most prior work on covering codes has focused on the Hamming metric, we consider the problem of designing covering codes defined in terms of either insertions or deletions.
Edit intent: clarity
Original:  Our study first concentrate on the analysis of  static game with a fixed number of sellers and buyers, then we model  real-world setting towards a dynamic game.
Revised:  Our study first concentrates on the analysis of static game with a fixed number of sellers and buyers, then we model real-world setting towards a dynamic game.
Edit intent: fluency
Original:  Our study first concentrate on the analysis of  static game with a fixed number of sellers and buyers, then we model  real-world setting towards a dynamic game.
Revised:  Our study first concentrate on the analysis of the static game with a fixed number of sellers and buyers, then we model real-world setting towards a dynamic game.
Edit intent: fluency
Original:  Our study first concentrate on the analysis of  static game with a fixed number of sellers and buyers, then we model  real-world setting towards a dynamic game.
Revised:  Our study first concentrate on the analysis of static game with a fixed number of sellers and buyers, then we model a real-world setting towards a dynamic game.
Edit intent: fluency
Original:  On top of our analysis, we conclude at least one Nash equilibrium can be reached in the bribery game of  rating system.
Revised:  On top of our analysis, we conclude at least one Nash equilibrium can be reached in the bribery game of the rating system.
Edit intent: fluency
Original:  On top of our analysis, we conclude  at least one Nash equilibrium can be reached in the bribery game of the rating system.
Revised:  On top of our analysis, we conclude that at least one Nash equilibrium can be reached in the bribery game of the rating system.
Edit intent: fluency
Original: A speculative agent with Prospect Theory preference chooses the optimal time to purchase and then to sell an indivisible risky asset as to maximize the expected utility of the round-trip profit net of transaction costs.
Revised: A speculative agent with Prospect Theory preference chooses the optimal time to purchase and then to sell an indivisible risky asset to maximize the expected utility of the round-trip profit net of transaction costs.
Edit intent: coherence
Original:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be " buy and hold ", " buy low sell high ", " buy high sell higher " or "no trading".
Revised:  Depending on the preference and market parameters , the optimal strategy can be " buy and hold ", " buy low sell high ", " buy high sell higher " or "no trading".
Edit intent: clarity
Original:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be " buy and hold ", " buy low sell high ", " buy high sell higher " or "no trading".
Revised:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be `` buy and hold ", " buy low sell high ", " buy high sell higher " or "no trading".
Edit intent: fluency
Original:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be " buy and hold ", " buy low sell high ", " buy high sell higher " or "no trading".
Revised:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be " buy and hold '', `` buy low sell high ", " buy high sell higher " or "no trading".
Edit intent: coherence
Original:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be " buy and hold ", " buy low sell high ", " buy high sell higher " or "no trading".
Revised:  Depending on the preference and market parameters as well as the initial price of the asset , the optimal strategy can be " buy and hold ", " buy low sell high '', `` buy high sell higher " or "no trading".
Edit intent: fluency
Original:  For example, while a large proportional transaction cost on sale can unambiguously suppress trading participation, introducing a fixed market entry fee will indeed encourage tradingwhen the asset price level is high .
Revised:  For example, increasing the market entry fee will indeed encourage tradingwhen the asset price level is high .
Edit intent: clarity
Original:  In this work, the transmission of the Fabry-Perot Inferometer (FPI) is proposed as a low power, low footprint activation function unit.
Revised:  In this work, the transmission of the Fabry-Perot Interferometer (FPI) is proposed as a low power, low footprint activation function unit.
Edit intent: fluency
Original:  We prove worst-case recovery guarantees with high probability and improve on the recent new upper bounds by Krieg, M. Ullrich for general sampling numbers by explicitly controlling all the involved constants with respect to the underlying spatial dimension d.
Revised:  We prove worst-case recovery guarantees and improve on the recent new upper bounds by Krieg, M. Ullrich for general sampling numbers by explicitly controlling all the involved constants with respect to the underlying spatial dimension d.
Edit intent: clarity
Original:  We prove worst-case recovery guarantees with high probability and improve on the recent new upper bounds by Krieg, M. Ullrich for general sampling numbers by explicitly controlling all the involved constants with respect to the underlying spatial dimension d.
Revised:  We prove worst-case recovery guarantees with high probability and improve on the recent new upper bounds for sampling numbers in Krieg, M. Ullrich for general sampling numbers by explicitly controlling all the involved constants with respect to the underlying spatial dimension d.
Edit intent: clarity
Original:  We prove worst-case recovery guarantees with high probability and improve on the recent new upper bounds by Krieg, M. Ullrich for general sampling numbers by explicitly controlling all the involved constants with respect to the underlying spatial dimension d.
Revised:  We prove worst-case recovery guarantees with high probability and improve on the recent new upper bounds by Krieg, M. Ullrich by explicitly controlling all the involved constants with respect to the underlying spatial dimension d.
Edit intent: clarity
Original:  As a further application we reconsider the analysis of a cubature method based on plain random points with optimal weights introduced by Oettershagen in 2017.
Revised:  As a further application we reconsider the analysis of a cubature method based on plain random points with optimal weights introduced by Oettershagen .
Edit intent: coherence
Original: We consider a least squares regression algorithm for the recovery of complex-valued functions belonging to a reproducing kernel Hilbert space H(K) from random data measuring the error in L_2(D,\varrho_D).
Revised: We construct a least squares regression algorithm for the recovery of complex-valued functions belonging to a reproducing kernel Hilbert space H(K) from random data measuring the error in L_2(D,\varrho_D).
Edit intent: clarity
Original: We consider a least squares regression algorithm for the recovery of complex-valued functions belonging to a reproducing kernel Hilbert space H(K) from random data measuring the error in L_2(D,\varrho_D).
Revised: We consider a least squares approximation method for the recovery of complex-valued functions belonging to a reproducing kernel Hilbert space H(K) from random data measuring the error in L_2(D,\varrho_D).
Edit intent: clarity
Original: We consider a least squares regression algorithm for the recovery of complex-valued functions belonging to a reproducing kernel Hilbert space H(K) from random data measuring the error in L_2(D,\varrho_D).
Revised: We consider a least squares regression algorithm for the recovery of complex-valued functions from a reproducing kernel Hilbert space H(K) from random data measuring the error in L_2(D,\varrho_D).
Edit intent: clarity
Original:  We prove worst-case recovery guarantees and improve on the recent new upper bounds for sampling numbers in Krieg, M. Ullrich by explicitly controlling all the involved constants with respect to the underlying spatial dimension d . This leads to new preasymptotic recovery bounds with high probability for the error of Hyperbolic Fourier Regression for multivariate functions .
Revised:  We prove worst-case recovery guarantees by explicitly controlling all the involved constants with respect to the underlying spatial dimension d . This leads to new preasymptotic recovery bounds with high probability for the error of Hyperbolic Fourier Regression for multivariate functions .
Edit intent: coherence
Original:  We prove worst-case recovery guarantees and improve on the recent new upper bounds for sampling numbers in Krieg, M. Ullrich by explicitly controlling all the involved constants with respect to the underlying spatial dimension d . This leads to new preasymptotic recovery bounds with high probability for the error of Hyperbolic Fourier Regression for multivariate functions .
Revised:  We prove worst-case recovery guarantees and improve on the recent new upper bounds for sampling numbers in Krieg, M. Ullrich by explicitly controlling all the involved constants . This leads to new preasymptotic recovery bounds with high probability for the error of Hyperbolic Fourier Regression for multivariate functions .
Edit intent: clarity