wanyu/IteraTeR_v2 huggingface dataset:
Original:  For the parity task, our symmetry-aware RC obtains zero error using an exponentially reduced artificial neurons and training data, greatly speeding up the time-to-result and outperforming hand crafted artificial neural networks (ANN)\leq7 . For the inference task, the performance is orders-of-magnitude better than regular RCs.
Revised:  For the parity task, our symmetry-aware RC obtains zero error using an exponentially reduced artificial neurons and training data, greatly speeding up the time to result and outperforming hand crafted artificial neural networks (ANN)\leq7 . For the inference task, the performance is orders-of-magnitude better than regular RCs.
Edit intent: fluency
Original:  For the parity task, our symmetry-aware RC obtains zero error using an exponentially reduced artificial neurons and training data, greatly speeding up the time-to-result and outperforming hand crafted artificial neural networks (ANN)\leq7 . For the inference task, the performance is orders-of-magnitude better than regular RCs.
Revised:  For the parity task, our symmetry-aware RC obtains zero error using an exponentially reduced artificial neurons and training data, greatly speeding up the time-to-result and outperforming hand crafted artificial neural networks (ANN)\leq7 . For the inference task, the performance is orders-of-magnitude smaller than regular RCs.
Edit intent: clarity
Original:   We anticipate that generalizations of our procedure will have widespread applicability in information processing with ANNs .
Revised:  We anticipate that generalizations of our procedure can be applied in information processing with ANNs .
Edit intent: clarity
Original:  [ NIPS19 ]).
Revised:  [ NeurIPS19 ]).
Edit intent: fluency
Original:  However, a crucial fact is  missing in most prior studies that games in the real world are typically played simultaneously and interactively rather than separately as assumed.
Revised:  A crucial fact is missing in most prior studies that games in the real world are typically played simultaneously and interactively rather than separately as assumed.
Edit intent: coherence
Original:  We show that as the game-game interaction becomes important, the cooperation phase transition dramatically improves, a fairly high level of cooperation is reached for all involved games when interaction goes to be extremely strong.
Revised:  We show that as the game-game interaction becomes important, the cooperation phase transition dramatically improves, a fairly high level of cooperation is reached for all involved games when interaction goes to be strong.
Edit intent: clarity
Original:  A mean-field theory indicates that a new mechanism -- the dynamical reciprocity \emph{ , as a counterpart to the well-known network reciprocity, is at work to foster cooperation, which is confirmed by the detailed analysis.
Revised:  A mean-field theory indicates that a new mechanism -- \emph{ , as a counterpart to the well-known network reciprocity, is at work to foster cooperation, which is confirmed by the detailed analysis.
Edit intent: clarity
Original:  A mean-field theory indicates that a new mechanism -- the dynamical reciprocity \emph{ , as a counterpart to the well-known network reciprocity, is at work to foster cooperation, which is confirmed by the detailed analysis.
Revised:  A mean-field theory indicates that a new mechanism -- the dynamical reciprocity \emph{the dynamical reciprocity , as a counterpart to the well-known network reciprocity, is at work to foster cooperation, which is confirmed by the detailed analysis.
Edit intent: clarity
Original:  Our findings point out the great potential towards high cooperation for many issues occurred in the real world, and may also provide clues to resolve those imminent crises like the climate change and trade wars .
Revised:  Our findings point out the great potential towards high cooperation for many issues occurred in the real world, and also the possibility of sustaining decent cooperation even in extremely adverse circumstances .
Edit intent: clarity
Original: We study the evolution  two mutually interacting games with both pairwise games as well as the public goods game on different topologies.
Revised: We study the evolution of two mutually interacting games with both pairwise games as well as the public goods game on different topologies.
Edit intent: fluency
Original:  their combination put cooperators at a persistent advantage position, which boosts the cooperation.
Revised:  their combination puts cooperators at a persistent advantage position, which boosts the cooperation.
Edit intent: fluency
Original: We present a rigorous framework for automatically testing application-layer protocols.
Revised: We present a principled automatic testing framework for application-layer protocols.
Edit intent: clarity
Original:  These models are defined in Gallina, the language of the Coq interactive theorem prover, supporting a smooth transition from testing to formal verification.
Revised:  These models are defined within the Coq interactive theorem prover, supporting a smooth transition from testing to formal verification.
Edit intent: clarity
Original:  Given a server model, we show how to automatically derive a testing program that probes the server for unexpected behaviors.
Revised:  Given a server model, we show how to automatically derive a tester that probes the server for unexpected behaviors.
Edit intent: clarity
Original:  On the other hand, the fact that deep networks can efficiently express a target function does not mean  this target function can be learned efficiently by deep neural networks.
Revised:  On the other hand, the fact that deep networks can efficiently express a target function does not mean that this target function can be learned efficiently by deep neural networks.
Edit intent: fluency
Original:  In this work, we present a new practical technique to help users make informed and cost-efficient GPU selections: make performance predictions using the help of a GPU that the user already has.
Revised:  In this work, we present a new practical technique to help users make informed and cost-efficient GPU selections: make performance predictions with the help of a GPU that the user already has.
Edit intent: fluency
Original:  Surfer currently supports PyTorch, is easy to use, and requires only a few lines of code .
Revised:  Surfer currently supports PyTorch, is easy to use, and is open source .
Edit intent: clarity
Original:  Conclusion: A Gaussian basis function based data driven model for re-framing the inverse problem of electrocardiography as a regression problem is successful and produces promising time series and activation map predictions of real-world recordings even when only trained using Guassian data\pm1\\%DIF > \pm11 . Significance: The HSPs predicted by the neural network can be used to create activation maps to identify cardiac dysfunctions during clinical assessment .
Revised:  Conclusion: A Gaussian basis function based data driven model for re-framing the inverse problem of electrocardiography as a regression problem is successful and produces promising time series and activation map predictions of real-world recordings even when only trained using Guassian data\pm1\\%DIF > \pm11 . Significance: The HSPs predicted by the neural network can be used to generate activation maps that non-invasively identify features of cardiac electrical dysfunction and can guide subsequent treatment options .
Edit intent: clarity
Original: Explaining to users why some items are recommended is critical, as it helps users to make better decisions, increase their satisfaction, and gain their trust in recommender systems (RS).
Revised: Explaining to users why some items are recommended is critical, as it can help users to make better decisions, increase their satisfaction, and gain their trust in recommender systems (RS).
Edit intent: clarity
Original:  However, existing explainable RS usually consider explanations as side outputs of the recommendation model, which has two problems: (1) it is difficult to evaluate the produced explanations because they are usually model-dependent, and (2) as a result, the possible impacts of those explanations are less investigated.
Revised:  However, existing explainable RS usually consider explanation as a side output of the recommendation model, which has two problems: (1) it is difficult to evaluate the produced explanations because they are usually model-dependent, and (2) as a result, the possible impacts of those explanations are less investigated.
Edit intent: fluency
Original:  However, existing explainable RS usually consider explanations as side outputs of the recommendation model, which has two problems: (1) it is difficult to evaluate the produced explanations because they are usually model-dependent, and (2) as a result, the possible impacts of those explanations are less investigated.
Revised:  However, existing explainable RS usually consider explanations as side outputs of the recommendation model, which has two problems: (1) it is difficult to evaluate the produced explanations because they are usually model-dependent, and (2) as a result, how the explanations impact the recommendation performance is less investigated.
Edit intent: clarity
Original:  A great challenge, however, is that the sparsity issue in the user-item-explanation data would be  severer than that in traditional user-item relation data, since not every user-item pair can associate with multiple explanations.
Revised:  A great challenge, however, is that the sparsity issue in the user-item-explanation data would be inevitably severer than that in traditional user-item relation data, since not every user-item pair can associate with multiple explanations.
Edit intent: clarity
Original:  A great challenge, however, is that the sparsity issue in the user-item-explanation data would be  severer than that in traditional user-item relation data, since not every user-item pair can associate with multiple explanations.
Revised:  A great challenge, however, is that the sparsity issue in the user-item-explanation data would be severer than that in traditional user-item interaction data, since not every user-item pair can associate with multiple explanations.
Edit intent: clarity
Original:  A great challenge, however, is that the sparsity issue in the user-item-explanation data would be  severer than that in traditional user-item relation data, since not every user-item pair can associate with multiple explanations.
Revised:  A great challenge, however, is that the sparsity issue in the user-item-explanation data would be severer than that in traditional user-item relation data, since not every user-item pair can be associated with all explanations.
Edit intent: clarity
Original:  In addition, our user-item-explanation datasets open up new ways of modeling and evaluating recommendation explanations.
Edit intent: coherence
Original:  To facilitate the development of explainable RS, we will make our datasets and code publicly available.
Revised:  To facilitate the development of explainable RS, we plan to make our code publicly available.
Edit intent: clarity
Original: Global Positioning Systems are now a standard module in mobile devices, and their ubiquity is fueling  rapid growth of location-based services (LBSs).
Revised: Global Positioning Systems are now a standard module in mobile devices, and their ubiquity is fueling the rapid growth of location-based services (LBSs).
Edit intent: fluency
Original:  They are  complementary for limiting the leakage of location information.
Revised:  They are shown to be complementary for limiting the leakage of location information.
Edit intent: clarity
Original:  In this paper, we continue to study the differential privacy preservation of location obfuscation mechanism based on PIVE framework proposed by Yu, Liu and Pu on ISOC Network and Distributed System Security Symposium (NDSS) in 2017.
Revised:  In this paper, we continue to study the differential privacy problem of PIVE framework proposed by Yu, Liu and Pu on ISOC Network and Distributed System Security Symposium (NDSS) in 2017.
Edit intent: clarity
Original:  Since PIVE fails to offer differential privacy guarantees on adaptive protection location set (PLS) as claimed , we develop DPIVE , a regionalized location obfuscation mechanism with two phases.
Revised:  Since PIVE fails to provide differential privacy guarantees on adaptive protection location set (PLS) as claimed , we develop DPIVE , a regionalized location obfuscation mechanism with two phases.
Edit intent: fluency
Original:  Since PIVE fails to offer differential privacy guarantees on adaptive protection location set (PLS) as claimed , we develop DPIVE , a regionalized location obfuscation mechanism with two phases.
Revised:  Since PIVE fails to offer differential privacy guarantees on adaptive protection location set (PLS) as claimed , we develop DPIVE with two phases.
Edit intent: clarity
Original:  This approach utilizes the relationship between two privacy notions based on the user-defined inference error threshold and the prior knowledge about user's location.
Edit intent: coherence
Original:  Moreover, we introduce PDPIVE, a personalized privacy framework, to achieve that each location has its own privacy level on two privacy control knobs, minimum inference error and differential privacy parameter.
Revised:  Moreover, we improve DPIVE with refined location partition and fine-grained personalization, in which each location has its own privacy level on two privacy control knobs, minimum inference error and differential privacy parameter.
Edit intent: clarity
Original:  The tendency is to move from traditional buyer--seller markets to subscription-based on-demand "smart" matching platforms enabled by pervasive ICTs.
Revised:  The tendency is to move from traditional buyer-seller markets to subscription-based on-demand "smart" matching platforms enabled by pervasive ICTs.
Edit intent: fluency
Original: Recent researches on both utterance-level and phone-level prosody modelling successfully improve the voice quality and naturalness in text-to-speech synthesis.
Revised: Generating natural speech with diverse and smooth prosody pattern is a challenging task. Although random sampling with phone-level prosody modelling successfully improve the voice quality and naturalness in text-to-speech synthesis.
Edit intent: coherence
Original:  In this work, we focus on phone-level prosody modelling where we introduce a Gaussian mixture model(GMM ) based mixture density network .
Revised:  In this work, we propose a novel approach that models phone-level prosody modelling where we introduce a Gaussian mixture model(GMM ) based mixture density network .
Edit intent: clarity
Original:  In this work, we focus on phone-level prosody modelling where we introduce a Gaussian mixture model(GMM ) based mixture density network .
Revised:  In this work, we focus on phone-level prosodies with GMM based mixture density network .
Edit intent: clarity
Original:  Partition function is a boolean function that is equivalent to the number partition problem with number range restricted.
Revised:  The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.
Edit intent: clarity
Original:  To  understand the computational complexity of the number partition problem and  partition function is quite important and hard.
Revised:  To fully understand the computational complexity of the number partition problem and partition function is quite important and hard.
Edit intent: clarity
Original:  To  understand the computational complexity of the number partition problem and  partition function is quite important and hard.
Revised:  To understand the computational complexity of the number partition problem and the partition function is quite important and hard.
Edit intent: fluency
Original:  In our recent research on  universal learning machine \cite{paper5, paper8}, we developed some tools, namely, fitting extremum, proper sampling set, boolean function with parameters (used in trial-and-error fashion).
Revised:  In our recent research on the universal learning machine \cite{paper5, paper8}, we developed some tools, namely, fitting extremum, proper sampling set, boolean function with parameters (used in trial-and-error fashion).
Edit intent: fluency
Original:  We show\chi that there exist two constants a_1 and a_2 such that, a_1\sqrt{-c}{\log(-c)} \leq \chi(\Sigma) \leq a_2 \sqrt{\frac{-c{\log(-c)}} } }{\log(-c)} } for every surface \Sigma with Euler characteristic c\leq -2.
Revised:  We show\chi(\Sigma) by showing that there exist two constants a_1 and a_2 such that, a_1\sqrt{-c}{\log(-c)} \leq \chi(\Sigma) \leq a_2 \sqrt{\frac{-c{\log(-c)}} } }{\log(-c)} } for every surface \Sigma with Euler characteristic c\leq -2.
Edit intent: clarity
Original:  We show\chi that there exist two constants a_1 and a_2 such that, a_1\sqrt{-c}{\log(-c)} \leq \chi(\Sigma) \leq a_2 \sqrt{\frac{-c{\log(-c)}} } }{\log(-c)} } for every surface \Sigma with Euler characteristic c\leq -2.
Revised:  We show\chi that there exist constants a_1 and a_2 such that, a_1\sqrt{-c}{\log(-c)} \leq \chi(\Sigma) \leq a_2 \sqrt{\frac{-c{\log(-c)}} } }{\log(-c)} } for every surface \Sigma with Euler characteristic c\leq -2.
Edit intent: clarity
Original:  We show\chi that there exist two constants a_1 and a_2 such that, a_1\sqrt{-c}{\log(-c)} \leq \chi(\Sigma) \leq a_2 \sqrt{\frac{-c{\log(-c)}} } }{\log(-c)} } for every surface \Sigma with Euler characteristic c\leq -2.
Revised:  We show\chi that there exist two constants a_1 and a_2 such that, a_1\sqrt{-c}{\log(-c)} \leq \chi(\Sigma) \leq a_2 \sqrt{\frac{-c{\log(-c)}} } \frac{\sqrt{-c}{\log(-c)} } for every surface \Sigma with Euler characteristic c\leq -2.
Edit intent: fluency
Original:  We also consider the complexity of deciding whether a given digraph or oriented graph embedabble in a fixed surface is k-dicolourable.
Revised:  We also consider the complexity of deciding whether a given digraph or oriented graph embeddable on a fixed surface is k-dicolourable.
Edit intent: fluency
Original:  In particular, we show that for any  surface, deciding whether a digraph embeddable on this surface is 2-dicolourable is NP-complete, and that deciding whether a planar oriented graph is 2-dicolourable is NP-complete unless all planar oriented graphs are 2-dicolourable (which was conjectured by Neumann-Lara).
Revised:  In particular, we show that for any fixed surface, deciding whether a digraph embeddable on this surface is 2-dicolourable is NP-complete, and that deciding whether a planar oriented graph is 2-dicolourable is NP-complete unless all planar oriented graphs are 2-dicolourable (which was conjectured by Neumann-Lara).
Edit intent: clarity
Original:  Such assumptions include that 1) accuracy and fairness are in inherent opposition to one another, 2) strict notions of mathematical equality can adequately model fairness, 3) it is possible to measure the accuracy and fairness of decisions independent from historical context, and 4) collecting more data on marginalized individuals is a reasonable solution to mitigate the effects of the trade-off.
Revised:  Such assumptions presume that 1) accuracy and fairness are in inherent opposition to one another, 2) strict notions of mathematical equality can adequately model fairness, 3) it is possible to measure the accuracy and fairness of decisions independent from historical context, and 4) collecting more data on marginalized individuals is a reasonable solution to mitigate the effects of the trade-off.
Edit intent: clarity
Original: Audio event classification is an active research area and has a wide range of applications.
Revised: Audio tagging is an active research area and has a wide range of applications.
Edit intent: clarity
Original:  Since the release of AudioSet, great progress has been made in advancing the classification accuracy , which mostly comes from the development of novel model architectures and attention modules.
Revised:  Since the release of AudioSet, great progress has been made in advancing model performance , which mostly comes from the development of novel model architectures and attention modules.
Edit intent: clarity
Original:  We also formally show the security guarantee provided by T^3AB , and analyze the privacy guarantee and trustworthiness it provides.
Revised:  We also formally show the security guarantee provided by T3AB , and analyze the privacy guarantee and trustworthiness it provides.
Edit intent: fluency
Original: Characterization of the long-time behavior of an inviscid incompressible fluid evolving on a two-dimensional domain is a long-standing problem in  physics.
Revised: Characterization of the long-time behavior of an inviscid incompressible fluid evolving on a two dimensional domain is a long-standing problem in physics.
Edit intent: fluency
Original:  In both experiments and numerical simulations, coherent vortex structures, or blobs, typically form after some stage of initial mixing.
Revised:  In both experiments and numerical simulations, coherent vortex structures, or blobs, typically emerge after some stage of initial mixing.
Edit intent: clarity
Original:  Here we show that Euler's equations possess a natural, intrinsic splitting of the vorticity function.
Revised:  Here we show that Euler's equations posses a natural, intrinsic splitting of the vorticity function.
Edit intent: fluency
Original:  In addition to theoretical insight, the canonical scale separation dynamics might be used as a foundation for stochastic model reduction, where the small scales are modelled by suitable multiplicative noise.
Revised:  In addition to theoretical insight, the canonical scale separation dynamics might be used as a foundation for stochastic model reduction, where the small scales are modeled by suitable multiplicative noise.
Edit intent: fluency
Original: According to a hard-steps model of advanced life timing , humans seem puzzlingly early.
Revised: The hard-steps model of advanced life timing , humans seem puzzlingly early.
Edit intent: clarity
Original:  We offer an explanation: an early deadline is set by 'grabby' civilizations (GC), who expand rapidly, never die alone, change the appearance of the volumesthey control, and who are not born within other GC volumes .
Revised:  We offer an explanation: an early deadline is set by 'grabby' civilizations (GC), who expand fast and long, and change their volumes' appearances, set an early deadline .
Edit intent: clarity
Original:  If we might soon become grabby, then today is near a sample origin date of such a GC . A selection effect explains why we don't see themeven though they probably control over a third of the universe now.
Revised:  If we might soon become grabby, today is near a sample origin date of such a GC . A selection effect explains why we don't see themeven though they probably control over a third of the universe now.
Edit intent: coherence
Original:  If we might soon become grabby, then today is near a sample origin date of such a GC . A selection effect explains why we don't see themeven though they probably control over a third of the universe now.
Revised:  If we might soon become grabby, then today is near a sample GC birthdate. Fast GC expansion explains why we don't see themeven though they probably control over a third of the universe now.
Edit intent: clarity
Original:  If GCs arise from non-grabby civilizations (NGCs) , a depressingly low transition chance (~10^-4) seems required to expect  even one other NGC ever active in our galaxy  .
Revised:  If GCs arise from non-grabby civilizations (NGCs) , a depressingly low transition chance (~10^-4) is required to expect even one other NGC ever active in our galaxy .
Edit intent: clarity
Original:  If GCs arise from non-grabby civilizations (NGCs) , a depressingly low transition chance (~10^-4) seems required to expect  even one other NGC ever active in our galaxy  .
Revised:  If GCs arise from non-grabby civilizations (NGCs) , a depressingly low transition chance (~10^-4) seems required to expect that even one other NGC ever active in our galaxy .
Edit intent: fluency