wanyu/IteraTeR_v2 huggingface dataset:
Original:  Data containing sensitive personal information, such as documents with people's profiles or relationships as edges, are prone to privacy leaks from GCNs, as an adversary might reveal the original input from the trained model .
Revised:  Data containing sensitive personal information, such as documents with people's profiles or relationships as edges, are prone to privacy leaks from GCNs, as an adversary might reveal the original input .
Edit intent: clarity
Original:  We demonstrate that the staggered mesh method circumvents a significant error source in the standard method, in which certain quadrature nodes are always placed on points where the integrand is discontinuous  .
Revised:  The staggered mesh method circumvents a significant error source in the standard method, in which certain quadrature nodes are always placed on points where the integrand is discontinuous .
Edit intent: clarity
Original:  This is challenging because modern workloads exhibit dynamic phase behavior - their cache requirements \& sensitivity vary across different execution points.
Revised:  This is challenging because modern workloads exhibit dynamic phase behavior - their cache requirements \& sensitivity vary across different execution points.
Edit intent: fluency
Original:  This is challenging because modern workloads exhibit dynamic phase behavior - their cache requirements \& sensitivity vary across different execution points.
Revised:  This is challenging because modern workloads exhibit dynamic phase behavior - their cache requirements sensitivity vary across different execution points.
Edit intent: fluency
Original:  To tackle this problem, we propose Com-CAS , a compiler-guided cache apportioning system that provides smart cache allocation to co-executing applications in a system.
Revised:  To tackle this problem, we propose Com-CAS , a compiler-guided cache apportioning system that provides smart cache allocation to co-executing applications in a system.
Edit intent: fluency
Original:  The front-end of Com-CAS is primarily a compiler-framework equipped with learning mechanisms to predict cache requirements, while the backend consists of an allocation framework with a pro-active scheduler that apportions cache dynamically to co-executing applications.
Revised:  The front-end of Com-CAS is primarily a compiler-framework equipped with learning mechanisms to predict cache requirements, while the backend consists of an allocation framework with a pro-active scheduler that apportions cache dynamically to co-executing applications.
Edit intent: fluency
Original: For solving Bayesian inverse problems governed by large-scale forward problems, we present an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method , which has the ability to generate approximate samples from the posteriors efficiently.
Revised: In this paper, we propose an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method , which has the ability to generate approximate samples from the posteriors efficiently.
Edit intent: clarity
Original: For solving Bayesian inverse problems governed by large-scale forward problems, we present an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method , which has the ability to generate approximate samples from the posteriors efficiently.
Revised: For solving Bayesian inverse problems governed by large-scale forward problems, we present an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method for solving Bayesian inverse problems. The method can generate approximate samples from the posteriors efficiently.
Edit intent: clarity
Original: For solving Bayesian inverse problems governed by large-scale forward problems, we present an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method , which has the ability to generate approximate samples from the posteriors efficiently.
Revised: For solving Bayesian inverse problems governed by large-scale forward problems, we present an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method , which has the ability to generate approximate samples from posteriors efficiently.
Edit intent: fluency
Original:  Specifically, we introduce the concept of the operator-valued kernel and the corresponding function-valued reproducing kernel Hilbert space (RKHS).
Revised:  Based on the concepts of operator-valued kernel and the corresponding function-valued reproducing kernel Hilbert space (RKHS).
Edit intent: coherence
Original:  Specifically, we introduce the concept of the operator-valued kernel and the corresponding function-valued reproducing kernel Hilbert space (RKHS).
Revised:  Specifically, we introduce the concept of the operator-valued kernels and function-valued reproducing kernel Hilbert space (RKHS).
Edit intent: clarity
Original:  Through the properties of RKHS, we give an explicit meaning of the infinite-dimensional objects ( e.g., the Stein operator ) and prove that the infinite-dimensional objects are indeed the limit of finite-dimensional items.
Revised:  Through the properties of RKHS, we give an explicit meaning of the infinite-dimensional objects , e.g., the Stein operator ) and prove that the infinite-dimensional objects are indeed the limit of finite-dimensional items.
Edit intent: fluency
Original:  Through the properties of RKHS, we give an explicit meaning of the infinite-dimensional objects ( e.g., the Stein operator ) and prove that the infinite-dimensional objects are indeed the limit of finite-dimensional items.
Revised:  Through the properties of RKHS, we give an explicit meaning of the infinite-dimensional objects ( e.g., the Stein operator , which are proved to be the limit of finite-dimensional items.
Edit intent: coherence
Original:  Numerical results confirm the correctness of our theoretical findings and demonstrate the potential usefulness of the proposed approach in the posterior sampling of large-scale nonlinear statistical inverse problems.
Revised:  Numerical results confirm our theoretical findings and demonstrate the potential usefulness of the proposed approach in the posterior sampling of large-scale nonlinear statistical inverse problems.
Edit intent: clarity
Original:  Numerical results confirm the correctness of our theoretical findings and demonstrate the potential usefulness of the proposed approach in the posterior sampling of large-scale nonlinear statistical inverse problems.
Revised:  Numerical results confirm the correctness of our theoretical findings and demonstrate the potential applications of the proposed approach in the posterior sampling of large-scale nonlinear statistical inverse problems.
Edit intent: clarity
Original:  Unlike previous work, our framework is able to prove theorems both end-to-end and from scratch (i. e., without relying on example proofs from human experts).
Revised:  The proposed framework is able to prove theorems both end-to-end and from scratch (i. e., without relying on example proofs from human experts).
Edit intent: clarity
Original:  The agent learns to select promising derivations as well as appropriate tactics within each derivation using deep policy gradients.
Edit intent: clarity
Original:  This structure allows us to introduce a novel backtracking mechanism which enables the agent to efficiently discard (predicted) dead-end derivations and restart the derivation from promising alternatives.
Revised:  This structure allows us to introduce a novel backtracking mechanism which enables the agent to efficiently discard (predicted) dead-end derivations and restart from promising alternatives.
Edit intent: clarity
Original:  We further elaborate the role of each component of the framework using ablation studies.
Revised:  We further elaborate the role of key components of the framework using ablation studies.
Edit intent: clarity
Original: Web-scale repositories of products, patents and scientific papers offer an opportunity for creating automated systems that scour millions of ideas and assist users in discovering inspirationsand solutions.
Revised: Large repositories of products, patents and scientific papers offer an opportunity for creating automated systems that scour millions of ideas and assist users in discovering inspirationsand solutions.
Edit intent: clarity
Original: Web-scale repositories of products, patents and scientific papers offer an opportunity for creating automated systems that scour millions of ideas and assist users in discovering inspirationsand solutions.
Revised: Web-scale repositories of products, patents and scientific papers offer an opportunity for building systems that scour millions of ideas and assist users in discovering inspirationsand solutions.
Edit intent: clarity
Original:  Yet the common representation of ideas is in the form of raw textual descriptions, lacking important structure that is required for supporting creative innovation  . Prior work has pointed to the importance of functional structure -- capturing the mechanisms and purposes of inventions -- for allowing users to discover structural connections across ideas and creatively adapt existing technologies.
Revised:  Yet the common representation of ideas is in the form of unstructured text, lacking key structure that is required for supporting creative innovation . Prior work has pointed to the importance of functional structure -- capturing the mechanisms and purposes of inventions -- for allowing users to discover structural connections across ideas and creatively adapt existing technologies.
Edit intent: clarity
Original:  Yet the common representation of ideas is in the form of raw textual descriptions, lacking important structure that is required for supporting creative innovation  . Prior work has pointed to the importance of functional structure -- capturing the mechanisms and purposes of inventions -- for allowing users to discover structural connections across ideas and creatively adapt existing technologies.
Revised:  Yet the common representation of ideas is in the form of raw textual descriptions, lacking important structure that is required for supporting creative innovation interactions . Prior work has pointed to the importance of functional structure -- capturing the mechanisms and purposes of inventions -- for allowing users to discover structural connections across ideas and creatively adapt existing technologies.
Edit intent: fluency
Original:  However, the use of functional representations was either coarse and limited in expressivity,  or dependent on curated knowledge bases with poor coverage and significant manual effort from users.
Revised:  However, the use of functional representations was either coarse and limited in expressivity, required significant manual effort from users, or dependent on curated knowledge bases with poor coverage and significant manual effort from users.
Edit intent: clarity
Original:  We construct a graph capturing hierarchical relations between purposes and mechanisms across an entire corpus of products, and use the graph to help problem-solvers explore the design space around a focal problem and view related problem perspectives .
Revised:  We construct a graph capturing hierarchical relations between purposes and mechanisms across an entire corpus of products, and use the graph to help problem-solvers explore the design space around a focal problem by viewing related problem perspectives .
Edit intent: coherence
Original:  In empirical user studies, our approach leads to a significant boost in search accuracy and in the quality of creative  inspirations, outperforming strong baselines and state-of-art representations of product texts by 50-60\%.
Revised:  In empirical user studies, our approach boosts the quality of creative inspirations, outperforming strong baselines and state-of-art representations of product texts by 50-60\%.
Edit intent: clarity
Original:  In empirical user studies, our approach leads to a significant boost in search accuracy and in the quality of creative  inspirations, outperforming strong baselines and state-of-art representations of product texts by 50-60\%.
Revised:  In empirical user studies, our approach leads to a significant boost in search accuracy and in the quality of creative inspirations, outperforming strong baselines by 50-60\%.
Edit intent: clarity
Original:  This paper gathers and classifies most of them, summarizing their advantages and disadvantages, using a new way of classification.
Revised:  This paper gathers and classifies them, summarizing their advantages and disadvantages, using a new way of classification.
Edit intent: clarity
Original:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essentials steps is to compare two integers given by power circuits and this problem , in general, is  P-complete.
Revised:  In particular, we establish that the word problem of the Baumslag group can be solved in NC - even though one of the essentials steps is to compare two integers given by power circuits and this problem , in general, is P-complete.
Edit intent: fluency
Original:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essentials steps is to compare two integers given by power circuits and this problem , in general, is  P-complete.
Revised:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essential steps is to compare two integers given by power circuits and this problem , in general, is P-complete.
Edit intent: fluency
Original:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essentials steps is to compare two integers given by power circuits and this problem , in general, is  P-complete.
Revised:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essentials steps is to compare two integers given by power circuits and this , in general, is P-complete.
Edit intent: fluency
Original:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essentials steps is to compare two integers given by power circuits and this problem , in general, is  P-complete.
Revised:  In particular, we establish that the word problem of the Baumslag group can be solved in NC -- even though one of the essentials steps is to compare two integers given by power circuits and this problem , in general, is shown to be P-complete.
Edit intent: coherence
Original:  The key observation here is that the depth of the occurring power circuits is logarithmic and such power circuits , indeed, can be compared in NC.
Revised:  The key observation is that the depth of the occurring power circuits is logarithmic and such power circuits , indeed, can be compared in NC.
Edit intent: coherence
Original:  The key observation here is that the depth of the occurring power circuits is logarithmic and such power circuits , indeed, can be compared in NC.
Revised:  The key observation here is that the depth of the occurring power circuits is logarithmic and such power circuits can be compared in NC.
Edit intent: coherence
Original:  The development of the SNS concept required the introduction of fundamentally new concepts such as a cardinal abstract entity, a cardinal semantic operator, a cardinal abstract object, a numeration space and a multicardinal number .
Revised:  The development of the SNS concept required the introduction of fundamentally new concepts such as a cardinal abstract entity, a cardinal semantic operator, a cardinal abstract object, a numeration space .
Edit intent: clarity
Original:  In order to avoid the high computational cost associated to the solution of the bidomain model in the entire torso, we propose a low-rank approach to solve the uncertainty quantification  problem.
Revised:  In order to avoid the high computational cost associated to the solution of the bidomain model in the entire torso, we propose a low-rank approach to solve the uncertainty quantification (UQ) problem.
Edit intent: clarity
Original:  This versatile approach can be extended for computing topological gradients to estimate the number of sites , or fitting a given ECG.
Revised:  This versatile approach can be extended to estimate the number of sites , or fitting a given ECG.
Edit intent: clarity
Original:  A major challenge towards formalizing this intuition is to define complexity measures that are quantitative yet capture the essence of data that admits generalization.
Revised:  A major challenge in formalizing this intuition is to define complexity measures that are quantitative yet capture the essence of data that admits generalization.
Edit intent: clarity
Original:  We characterize the dynamics that gradient descent induces on the factorization, and establish a bias towards low tensor rank, in compliance with existing empirical evidence.
Revised:  We characterize the dynamics that gradient descent induces on the factorization, and establish a bias towards low tensor rank, in compliance with empirical evidence.
Edit intent: clarity
Original:  This leads us to believe that tensor rank may pave way to explaining both implicit regularization of neural networks, and the properties of real-world data translating it to generalization.
Revised:  This leads us to believe that tensor rank may pave way to explaining both implicit regularization of neural networks, and the properties of real-world data translating this implicit regularization to generalization.
Edit intent: clarity
Original:  We characterize the dynamics that gradient descent induces on the factorization, and establish a bias towards low tensor rank , in compliance with empirical evidence.
Revised:  We circumvent the notorious difficulty of tensor problems by adopting a dynamical systems perspective, and characterizing the evolution induced by gradient descent. The characterization suggests a form of greedy low tensor rank , in compliance with empirical evidence.
Edit intent: clarity
Original:  Then, motivated by tensor rank capturing  implicit regularization of a non-linear neural network, we empirically explore it as a measure of complexity, and find that it stays extremely low when fitting standard datasets .
Revised:  Then, motivated by tensor rank capturing the implicit regularization of a non-linear neural network, we empirically explore it as a measure of complexity, and find that it stays extremely low when fitting standard datasets .
Edit intent: fluency
Original:  This leads us to believe that tensor rank may pave way to explaining both implicit regularization of neural networks , and the properties of real-world data translating this implicit regularization to generalization.
Revised:  This leads us to believe that tensor rank may pave way to explaining both implicit regularization in deep learning , and the properties of real-world data translating this implicit regularization to generalization.
Edit intent: clarity
Original:  Simulations on SPEC CPU 2006 benchmark show that the proposed approach can completely verify the DFI defined in the original seminal work while reducing performance overhead by 4x  on average.
Revised:  Simulations on SPEC CPU 2006 benchmark show that the proposed approach can completely enforce the DFI defined in the original seminal work while reducing performance overhead by 4x on average.
Edit intent: clarity
Original:  Simulations on SPEC CPU 2006 benchmark show that the proposed approach can completely verify the DFI defined in the original seminal work while reducing performance overhead by 4x  on average.
Revised:  Simulations on SPEC CPU 2006 benchmark show that the proposed approach can completely verify the DFI defined in the original seminal work while reducing performance overhead by 4x , on average.
Edit intent: fluency
Original: We revisit the minimum dominating set problem on graphs with arboricity bounded by \alpha.
Revised: We revisit the minimum dominating set problem on graphs with arboricity \alpha.
Edit intent: clarity
Original:  On the other hand, the previous two non-LP-based algorithms, by Lenzen and Wattenhofer [LW10] , and Jones et al.
Revised:  On the other hand, the previous two non-LP-based algorithms, by Lenzen and Wattenhofer [LW10] and Jones et al.
Edit intent: fluency
Original:  There is a similar situation in the distributed setting: While there are poly%DIFDELCMD < \logn%%% -round LP-based O(\alpha)-approximation algorithms [KMW06, DKM19], the best non-LP-based algorithm by Lenzen and Wattenhofer [LW10] is an implementation of their centralized algorithm, providing an O(\alpha^2)-approximation within O(\log n) rounds with high probability.
Revised:  There is a similar situation in the distributed setting: While there %DIFDELCMD < \logn%%% -round LP-based O(\alpha)-approximation algorithms [KMW06, DKM19], the best non-LP-based algorithm by Lenzen and Wattenhofer [LW10] is an implementation of their centralized algorithm, providing an O(\alpha^2)-approximation within O(\log n) rounds with high probability.
Edit intent: fluency
Original:  We address the question of whether one can achieve a simple, elementary O(\alpha)-approximation algorithm  not based on any LP-based methods, either in the centralized setting or in the distributed setting.
Revised:  We address the questions of whether one can achieve a simple, elementary O(\alpha)-approximation algorithm not based on any LP-based methods, either in the centralized setting or in the distributed setting.
Edit intent: fluency
Original:  We address the question of whether one can achieve a simple, elementary O(\alpha)-approximation algorithm  not based on any LP-based methods, either in the centralized setting or in the distributed setting.
Revised:  We address the question of whether one can achieve an O(\alpha)-approximation algorithm not based on any LP-based methods, either in the centralized setting or in the distributed setting.
Edit intent: clarity
Original:  We resolve these questions in the affirmative .
Revised:  We resolve both questions in the affirmative .
Edit intent: clarity
Original:  In the (standard) centralized setting, Bansal and Umboh [BU17] gave an O(\alpha)-approximation LP rounding algorithm, which  translates into a near-linear time algorithm using general-purpose approximation results for explicit covering LPs [KY14, You14, AZO19, Qua20 ].
Revised:  In the (standard) centralized setting, Bansal and Umboh [BU17] gave an O(\alpha)-approximation LP rounding algorithm, which also translates into a near-linear time algorithm using general-purpose approximation results for explicit covering LPs [KY14, You14, AZO19, Qua20 ].
Edit intent: clarity
Original:  On the other hand, the previous two non-LP-based algorithms, by Lenzen and Wattenhofer [LW10]  and Jones et al.
Revised:  On the other hand, the previous two non-LP-based algorithms, by Lenzen and Wattenhofer [LW10] , and Jones et al.
Edit intent: fluency
Original:  There is a similar situation in the distributed setting: While there is an O(\log^2 n)-round LP-based O(\alpha)-approximation algorithms [KMW06 , DKM19 ], the best non-LP-based algorithm by Lenzen and Wattenhofer [LW10] is an implementation of their centralized algorithm, providing an O(\alpha^2)-approximation within O(\log n) rounds with high probability .
Revised:  There is a similar situation in the distributed setting: While there is an O(\log^2 n)-round LP-based O(\alpha)-approximation algorithms [KMW06 ], the best non-LP-based algorithm by Lenzen and Wattenhofer [LW10] is an implementation of their centralized algorithm, providing an O(\alpha^2)-approximation within O(\log n) rounds with high probability .
Edit intent: clarity