wanyu/IteraTeR_v2 huggingface dataset:
Original: When random search heuristics (RSH) cannot locate precise globally optimal solutions with satisfactory performances, hitting time/running time analysis method is not flexible enough to accommodate the requirement of theoretical performance study .
Revised: When random search heuristics (RSH) cannot locate precise globally optimal solutions with satisfactory performances, hitting time/running time analysis is not flexible enough to accommodate the requirement of theoretical performance study .
Edit intent: clarity
Original:  Thus,  an alternative routine is needed to bridge the gap between theoretical analysis and algorithm implementation .
Revised:  Thus, it is necessary to propose an alternative routine is needed to bridge the gap between theoretical analysis and algorithm implementation .
Edit intent: coherence
Original:  Then, A general framework for estimation of expected approximation errors can be proposed.
Revised:  Then, A general framework for estimation of expected approximation errors is proposed.
Edit intent: clarity
Original:  Using several standard image datasets and established attack mechanisms, we conduct an empirical analysis of deep representations under attack , and find that the attack causes the internal representation to shift closer to the "false" class.
Revised:  We conduct an empirical analysis of deep representations under attack , and find that the attack causes the internal representation to shift closer to the "false" class.
Edit intent: clarity
Original:  Motivated by this observation, we propose to regularize the representation space under attack with metric learning in order to produce more robust classifiers.
Revised:  Motivated by this observation, we propose to regularize the representation space under attack with metric learning to produce more robust classifiers.
Edit intent: coherence
Original:  By carefully sampling examples for metric learning, our learned representation not only increases robustness, but also can detect previously unseen adversarial samples.
Revised:  By carefully sampling examples for metric learning, our learned representation not only increases robustness, but also detects previously unseen adversarial samples.
Edit intent: clarity
Original:  The size of the kernel matrix is O( n2 ), where the sample size is n, so that the calculation of the data using the kernel method requires a long time.
Revised:  The size of the kernel matrix is O( n^2 ), where the sample size is n, so that the calculation of the data using the kernel method requires a long time.
Edit intent: clarity
Original:  The latter two tasks rely on call graphs of library and application code to check whether vulnerable methods found in the open source components are called by applications.
Revised:  The latter two tasks rely on call graphs of application and library code to check whether vulnerable methods found in the open source components are called by applications.
Edit intent: fluency
Original:  The latter two tasks rely on call graphs of library and application code to check whether vulnerable methods found in the open source components are called by applications.
Revised:  The latter two tasks rely on call graphs of library and application code to check whether vulnerability-specific sinks identified in libraries are used by applications.
Edit intent: clarity
Original:  In this paper, we develop a novel, modular means of combining statically- and dynamically-constructed call graphs via instrumentation to improve the performance of false positive elimination.
Revised:  In this paper, we develop a novel, modular means of combining call graphs derived from both static and dynamic analysis to improve the performance of false positive elimination.
Edit intent: clarity
Original:  Our experiments indicate significant performance improvements , but that instrumentation-based call graphs are less readily applicable in practice .
Revised:  Our experiments indicate significant performance improvements .
Edit intent: clarity
Original:  However, when a DNN is distributed over physical nodes, failure of the physical nodes causes the failure of the DNN units that are placed on those nodes.
Revised:  However, when a DNN is distributed over physical nodes, failure of the physical nodes causes the failure of the DNN units that are placed on these nodes.
Edit intent: coherence
Original:  Next, our extensive experiments using two existing datasets for the state-of-the-art sensing and vision applications confirm the ability of deepFogGuard to provide resiliency for distributed DNNs in edge-cloud networks.
Revised:  Next, our extensive experiments using two existing datasets for the sensing and vision applications confirm the ability of deepFogGuard to provide resiliency for distributed DNNs in edge-cloud networks.
Edit intent: clarity
Original:  The LOCAlization and TrAcking (LOCATA) Challenge is aiming at an open-access framework for the objective evaluation and benchmarking of broad classes of algorithms for sound source localization and tracking.
Revised:  The LOCAlization and TrAcking (LOCATA) Challenge is an open-access framework for the objective evaluation and benchmarking of broad classes of algorithms for sound source localization and tracking.
Edit intent: coherence
Original:  This paper provides a review of relevant localization and tracking algorithms , and, within the context of the existing literature, a detailed evaluation and dissemination of the LOCATA submissions.
Revised:  This paper provides a review of relevant localization and tracking algorithms and, within the context of the existing literature, a detailed evaluation and dissemination of the LOCATA submissions.
Edit intent: fluency
Original:  This paper provides a review of relevant localization and tracking algorithms and, within the context of the existing literature, a detailed evaluation and dissemination of the LOCATA submissions.
Revised:  This article provides a review of relevant localization and tracking algorithms and, within the context of the existing literature, a detailed evaluation and dissemination of the LOCATA submissions.
Edit intent: fluency
Original:  Prior efforts directly use pre-trained embeddings or simplistically adapt techniques from natural language processing to obtain relational embeddings .
Revised:  Some methods directly use pre-trained embeddings or simplistically adapt techniques from natural language processing to obtain relational embeddings .
Edit intent: clarity
Original:  In this work, we propose algorithms for obtaining local embeddings that are effective for data integration tasks on relational data .
Revised:  In this work, we propose algorithms for obtaining local embeddings that are effective for data integration tasks on relational databases .
Edit intent: clarity
Original:  We make three major contributions.
Revised:  We make four major contributions.
Edit intent: clarity
Original:  First, we describe a compact graph-based representation that allows the specification of a rich set of relationships inherent in  relational world.
Revised:  First, we describe a compact graph-based representation that allows the specification of a rich set of relationships inherent in the relational world.
Edit intent: fluency
Original:  Second, we propose how to derive sentences from such  graph that effectively describe the similarity across elements (tokens, attributes, rows) across the two datasets.
Revised:  Second, we propose how to derive sentences from such a graph that effectively describe the similarity across elements (tokens, attributes, rows) across the two datasets.
Edit intent: fluency
Original:  Second, we propose how to derive sentences from such  graph that effectively describe the similarity across elements (tokens, attributes, rows) across the two datasets.
Revised:  Second, we propose how to derive sentences from such graph that effectively "describe" the similarity across elements (tokens, attributes, rows) across the two datasets.
Edit intent: fluency
Original:  Second, we propose how to derive sentences from such  graph that effectively describe the similarity across elements (tokens, attributes, rows) across the two datasets.
Revised:  Second, we propose how to derive sentences from such graph that effectively describe the similarity across elements (tokens, attributes, rows) in the two datasets.
Edit intent: clarity
Original:   Finally, we propose a diverse collection of criteria to evaluate relational embeddings and perform  extensive set of experiments validating them  .
Revised:  Finally, we propose a diverse collection of criteria to evaluate relational embeddings and perform an extensive set of experiments validating them .
Edit intent: coherence
Original:  Our experiments show that our system , EmbDI, produces meaningful results for data integration tasks and our embeddings improve the result quality for existing state of the art methods .
Revised:  Our experiments show that our framework , EmbDI, produces meaningful results for data integration tasks and our embeddings improve the result quality for existing state of the art methods .
Edit intent: clarity
Original:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and experimental execution time measurements into a study of accuracy vs. \ execution time trade-off.
Revised:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and experimental execution time measurements into a study of accuracy vs. execution time trade-off.
Edit intent: fluency
Original: The RBF-FD solution of a Poisson problem with mixed boundary conditions is analyzed in 1D, 2D and 3D domains discretized with scattered nodes .
Revised: The RBF-FD solution of a Poisson problem with mixed boundary conditions in 1D, 2D and 3D domains discretized with scattered nodes .
Edit intent: clarity
Original:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and experimental execution time measurements  into a study of accuracy vs. execution time trade-off .
Revised:  The results are further combined with theoretical complexity analyses and experimental execution time measurements into a study of accuracy vs. execution time trade-off .
Edit intent: coherence
Original:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and experimental execution time measurements  into a study of accuracy vs. execution time trade-off .
Revised:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and with conforming execution time measurements into a study of accuracy vs. execution time trade-off .
Edit intent: clarity
Original:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and experimental execution time measurements  into a study of accuracy vs. execution time trade-off .
Revised:  The results are presented in terms of convergence analyses for different orders of RBF-FD approximation, which are further combined with theoretical complexity analyses and experimental execution time measurements , into a study of accuracy vs. execution time trade-off .
Edit intent: fluency
Original: End-to-end speech synthesis method such as Tacotron, Tacotron2 and Transformer-TTS already achieves close to human quality performance.
Revised: End-to-end speech synthesis methods already achieve close-to-human quality performance.
Edit intent: coherence
Original:  However compared to HMM-based method or NN-based frame-to-frame regression method, it is prone to some bad cases , such as missing words, repeating words and incomplete synthesis.
Revised:  However compared to HMM-based and NN-based frame-to-frame regression method, it is prone to some bad cases , such as missing words, repeating words and incomplete synthesis.
Edit intent: fluency
Original:  However compared to HMM-based method or NN-based frame-to-frame regression method, it is prone to some bad cases , such as missing words, repeating words and incomplete synthesis.
Revised:  However compared to HMM-based method or NN-based frame-to-frame regression methods, they are prone to some bad cases , such as missing words, repeating words and incomplete synthesis.
Edit intent: coherence
Original:  However compared to HMM-based method or NN-based frame-to-frame regression method, it is prone to some bad cases , such as missing words, repeating words and incomplete synthesis.
Revised:  However compared to HMM-based method or NN-based frame-to-frame regression method, it is prone to some synthesis errors , such as missing words, repeating words and incomplete synthesis.
Edit intent: clarity
Original:  However compared to HMM-based method or NN-based frame-to-frame regression method, it is prone to some bad cases , such as missing words, repeating words and incomplete synthesis.
Revised:  However compared to HMM-based method or NN-based frame-to-frame regression method, it is prone to some bad cases , such as missing or repeating words and incomplete synthesis.
Edit intent: fluency
Original:  More seriously, we cannot know whether such errors exist in a synthesized waveform or not unless we listen to it.
Edit intent: coherence
Original:  We attribute the comparatively high sentence error rate to the local information preference of conditional autoregressive models  .
Revised:  We attribute the comparatively high utterance error rate to the local information preference of conditional autoregressive models .
Edit intent: clarity
Original:  Inspired by the success of InfoGANin learning interpretable representation by a mutual information regularization, in this paper, we propose to maximize the mutual information between the  predicted acoustic features and the input text for end-to-end speech synthesis methods to address the local information preference problem and avoid such bad cases.
Revised:  Inspired by InfoGAN, we propose to maximize the mutual information between the predicted acoustic features and the input text for end-to-end speech synthesis methods to address the local information preference problem and avoid such bad cases.
Edit intent: coherence
Original:  What is more, we provide an indicator to detect errors in the predicted acoustic features as a byproduct . Experiment results show that our method can reduce the rate of bad cases and provide a reliable indicator to detect bad cases automatically .
Revised:  What is more, we provide an indicator to detect errors in the predicted acoustic features as a byproduct . Experiment results show that our method can reduce the utterance error rate .
Edit intent: clarity
Original:  Importantly, the temporal aspect results in a rich set of optimization criteria for "shortest" walks.
Revised:  Taking into account the temporal aspect results in a rich set of optimization criteria for "shortest" walks.
Edit intent: clarity
Original:  Importantly, the temporal aspect results in a rich set of optimization criteria for "shortest" walks.
Revised:  Importantly, the temporal aspect leads to a rich set of optimization criteria for "shortest" walks.
Edit intent: fluency
Original:  Extending and significantly broadening state-of-the-art work of Wu et al. [IEEE TKDE 2016], we provide a quasi-linear-time algorithm for shortest walk computation that is capable to deal with various optimization criteria and any linear combination of these.
Revised:  Extending and significantly broadening state-of-the-art work of Wu et al. [IEEE TKDE 2016], we provide an algorithm for computing optimal walks that is capable to deal with various optimization criteria and any linear combination of these.
Edit intent: clarity
Original:  To prove these results  we restate them in terms of affine projections of the hypersimplex that preserve its vertices .
Revised:  To prove these results , we restate them in terms of affine projections of the hypersimplex that preserve its vertices .
Edit intent: fluency
Original:  To prove these results  we restate them in terms of affine projections of the hypersimplex that preserve its vertices .
Revised:  To prove these results we restate them in terms of affine projections that preserve the vertices of the hypersimplex .
Edit intent: clarity
Original:  More generally, we study projections that preserve higher dimensional skeleta .
Revised:  More generally, we provide a full characterization of the projections that preserve higher dimensional skeleta .
Edit intent: clarity
Original:  More generally, we study projections that preserve higher dimensional skeleta .
Revised:  More generally, we study projections that preserve its i-dimensional skeleton .
Edit intent: clarity
Original:  Classical (voltage/current but also flux/charge) models are easily obtained as particular cases of our general homogeneous model.
Revised:  Classical (voltage/current but also flux/charge) models are easily obtained as particular cases of a general homogeneous model.
Edit intent: clarity
Original: While the backpropagation of error algorithm allowed for a rapid rise in the development and deployment of artificial neural networks, two key issues currently preclude biological plausibility: (i) symmetry is required between forward and backward weights, which is known as the weight transport problem, and (ii) updates are locked before both the forward and backward passes have been completed.
Revised: While the backpropagation of error algorithm enables deep neural network training, it implies (i) symmetry is required between forward and backward weights, which is known as the weight transport problem, and (ii) updates are locked before both the forward and backward passes have been completed.
Edit intent: clarity
Original: While the backpropagation of error algorithm allowed for a rapid rise in the development and deployment of artificial neural networks, two key issues currently preclude biological plausibility: (i) symmetry is required between forward and backward weights, which is known as the weight transport problem, and (ii) updates are locked before both the forward and backward passes have been completed.
Revised: While the backpropagation of error algorithm allowed for a rapid rise in the development and deployment of artificial neural networks, two key issues currently preclude biological plausibility: (i) bidirectional synaptic weight transport and (ii) updates are locked before both the forward and backward passes have been completed.
Edit intent: clarity
Original: While the backpropagation of error algorithm allowed for a rapid rise in the development and deployment of artificial neural networks, two key issues currently preclude biological plausibility: (i) symmetry is required between forward and backward weights, which is known as the weight transport problem, and (ii) updates are locked before both the forward and backward passes have been completed.
Revised: While the backpropagation of error algorithm allowed for a rapid rise in the development and deployment of artificial neural networks, two key issues currently preclude biological plausibility: (i) symmetry is required between forward and backward weights, which is known as the weight transport problem, and (ii) update locking until the forward and backward passes have been completed.
Edit intent: clarity
Original: In this paper, an SIR model with spatial dependence is studied , and results regarding its stability and numerical approximation are presented.
Revised: In this paper, an SIR model with spatial dependence is studied and results regarding its stability and numerical approximation are presented.
Edit intent: fluency
Original:  The uniqueness and qualitatively properties of the continuous model are analyzed.
Revised:  The uniqueness and qualitative properties of the continuous model are analyzed.
Edit intent: fluency
Original:  Furthermore, different choices of spatial and temporal discretizations are deployed , and step-size restrictions for population conservation, positivity  and monotonicity preservation of the discrete model are investigated.
Revised:  Furthermore, different choices of spatial and temporal discretizations are employed , and step-size restrictions for population conservation, positivity and monotonicity preservation of the discrete model are investigated.
Edit intent: clarity
Original:  Furthermore, different choices of spatial and temporal discretizations are deployed , and step-size restrictions for population conservation, positivity  and monotonicity preservation of the discrete model are investigated.
Revised:  Furthermore, different choices of spatial and temporal discretizations are deployed , and step-size restrictions for population conservation, positivity , and monotonicity preservation of the discrete model are investigated.
Edit intent: fluency
Original: It is widely believed that the adoption behavior of a decision-maker in a social network is related to the number of signals it receives from its peers in the social network.
Revised: It is widely believed that one's peers influence product adoption behaviors. This relationship has been linked to the number of signals it receives from its peers in the social network.
Edit intent: clarity
Original:  It is unclear if these same principles hold when the "pattern" by which they receive these signals vary and when potential decisions have different utilities.
Revised:  It is unclear if these same principles hold when the "pattern" by it receives these signals vary and when potential decisions have different utilities.
Edit intent: clarity
Original:  We analyze its effect through a controlled game where each participant makes a decision to select one option when presented with six choices with differing utilities , with one choice having the most utility.
Revised:  We analyze its effect through a controlled game where each participant makes a decision among choices with differing utilities , with one choice having the most utility.
Edit intent: clarity
Original:  (1) even in the presence of monetary risks and previously acquired knowledge of the six choices, decision-makers tend to deviate from the obvious optimal decision when their peers make similar choices , (2)
Revised:  (1) even in the presence of monetary risks and previously acquired knowledge of the choices, decision-makers tend to deviate from the obvious optimal decision when their peers make similar choices , (2)
Edit intent: clarity
Original:  when the quantity of social signals vary over time, the probability that a participant selects the decision similar to the one reflected by the social signals and therefore being responsive to social influence does not necessarily correlate proportionally to the absolute quantity of signals and (3) an early subjugation to higher quantity of peer social signals turned out to be a more effective strategy of social influence when aggregated over the rounds .
Revised:  when the quantity of social signals vary over time, the forwarding probability of the influence decision and therefore being responsive to social influence does not necessarily correlate proportionally to the absolute quantity of signals and (3) an early subjugation to higher quantity of peer social signals turned out to be a more effective strategy of social influence when aggregated over the rounds .
Edit intent: clarity
Original:  This relationship has been linked to the number of signals a decision-maker receives in a social network , but it is unclear if these same principles hold when the "pattern " by it receives these signals vary and when potential decisions have different utilities .
Revised:  This relationship has been linked to the number of signals a decision-maker receives in a social network . But it is unclear if these same principles hold when the "pattern " by it receives these signals vary and when potential decisions have different utilities .
Edit intent: fluency