wanyu/IteraTeR_v2 huggingface dataset:
Original:  Considering fundamental problems such as finding the minima of intersecting sets of elements or sorting them  , as well as the minimum spanning tree problem , we discuss different measures for the prediction accuracy and design algorithms with performance guarantees that improve with the accuracy of predictions and that are robust with respect to very poor prediction quality  .
Revised:  We consider fundamental problems such as finding the minima of intersecting sets of elements or sorting them , as well as the minimum spanning tree problem , we discuss different measures for the prediction accuracy and design algorithms with performance guarantees that improve with the accuracy of predictions and that are robust with respect to very poor prediction quality .
Edit intent: coherence
Original:  Considering fundamental problems such as finding the minima of intersecting sets of elements or sorting them  , as well as the minimum spanning tree problem , we discuss different measures for the prediction accuracy and design algorithms with performance guarantees that improve with the accuracy of predictions and that are robust with respect to very poor prediction quality  .
Revised:  Considering fundamental problems such as finding the minima of intersecting sets of elements or sorting them , as well as the minimum spanning tree problem . We discuss different measures for the prediction accuracy and design algorithms with performance guarantees that improve with the accuracy of predictions and that are robust with respect to very poor prediction quality .
Edit intent: fluency
Original:  For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases---below a critical density, the rate is almost zero, while above the threshold the rate increases linearly with the density   .
Revised:  For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases -- below a critical density, the rate is almost zero, while above the threshold the rate increases linearly with the density .
Edit intent: fluency
Original:  As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes need to grow with the network scale.
Revised:  As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to grow with the network scale.
Edit intent: fluency
Original:  For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases -- below a critical density, the rate is almost zero, while above the threshold the rate increases linearly with the density.
Revised:  For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases---below a critical density, the rate is almost zero, while above the threshold the rate increases linearly with the density.
Edit intent: fluency
Original:  Notably, our prediction of the critical density is one-order-of-magnitude higher than that in the recent work Phys.
Revised:  Phys.
Edit intent: clarity
Original: 124, 210501 (2020)%DIFDELCMD < ]%%% . Surprisingly, above the threshold the typical communication capacity between two nodes is independent of the distance between them, due to multi-path routing enabled by the quantum network.
Revised: 124, 210501 (2020)%DIFDELCMD < ]%%% Surprisingly, above the threshold the typical communication capacity between two nodes is independent of the distance between them, due to multi-path routing enabled by the quantum network.
Edit intent: fluency
Original:  In contrast, for less connected networks such as scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increase , and always decays with the distance ;
Revised:  In contrast, for less connected networks such as scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increases , and always decays with the distance ;
Edit intent: fluency
Original:  In contrast, for less connected networks such as scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increase , and always decays with the distance ;
Revised:  In contrast, for less connected networks such as scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increase , and always decays with the distance .
Edit intent: fluency
Original:  Our results are based on capacity evaluations, therefore is universal for general architectures and protocols of quantum networks.
Revised:  Our results are based on capacity evaluations, therefore the minimum density requirement for an appreciable capacity applies to any general protocols of quantum networks.
Edit intent: clarity
Original:  A key novelty of HILUNG is to incorporate an accurate and stable multilevel preconditioner called HILUCSI, which is particularly effective for solving saddle-point problems . HILUCSI enables robust and rapid convergence of the inner iterations in Newton-GMRES.
Revised:  A key novelty of HILUNG is to incorporate an accurate and stable multilevel preconditioner called HILUCSI, which is particularly effective for saddle-point problems . HILUCSI enables robust and rapid convergence of the inner iterations in Newton-GMRES.
Edit intent: clarity
Original:  A key novelty of HILUNG is to incorporate an accurate and stable multilevel preconditioner called HILUCSI, which is particularly effective for solving saddle-point problems . HILUCSI enables robust and rapid convergence of the inner iterations in Newton-GMRES.
Revised:  A key novelty of HILUNG is to incorporate an accurate and stable multilevel preconditioner called HILUCSI, which is particularly effective for solving saddle-point problems and can enable robust and rapid convergence of the inner iterations in Newton-GMRES.
Edit intent: coherence
Original:  We further use Oseen iterations to hot-start Newton-GMRES to achieve global convergence, also preconditioned using HILUCSI.
Revised:  We further use Picard iterations with the Oseen systems to hot-start Newton-GMRES to achieve global convergence, also preconditioned using HILUCSI.
Edit intent: clarity
Original:  The main focus  is on the specification and computation of maximum-responsibility counterfactual explanations, with responsibility becoming an explanation score for features of entities under classification .
Revised:  The main focus of this work is on the specification and computation of maximum-responsibility counterfactual explanations, with responsibility becoming an explanation score for features of entities under classification .
Edit intent: clarity
Original: This paper identifies connections between predictive coding, from theoretical neuroscience, and variational autoencoders, from machine learning .
Revised: This paper reviews predictive coding, from theoretical neuroscience, and variational autoencoders, from machine learning .
Edit intent: clarity
Original:  These connections imply striking correspondences for biological neural circuits, suggesting that pyramidal dendrites are functionally analogous to non-linear  deep networks and lateral inhibition is functionally analogous to normalizing flows.
Revised:  These connections imply striking correspondences for biological neural circuits, suggesting that pyramidal dendrites are functionally analogous to non-linear ) deep networks and lateral inhibition is functionally analogous to normalizing flows.
Edit intent: fluency
Original:  These connections imply striking correspondences for biological neural circuits, suggesting that pyramidal dendrites are functionally analogous to non-linear  deep networks and lateral inhibition is functionally analogous to normalizing flows.
Revised:  These connections imply striking correspondences for biological neural circuits, suggesting that pyramidal dendrites are functionally analogous to non-linear deep networks and lateral inhibition as analogous to normalizing flows.
Edit intent: fluency
Original:  Connecting these areas provides new directions for further investigations  .
Revised:  These connections may provide new directions for further investigations .
Edit intent: clarity
Original:  We also obtain an adversarially robust algorithm for the L_2-heavy hitters problem using \mathcal{O \mathcal{O} \left(\frac{\log n}{\epsilon^2}\right) bits of space.
Revised:  We also obtain an adversarially robust algorithm for the L_2-heavy hitters problem using \mathcal{O} \left(\frac{\log n}{\epsilon^2}\right) bits of space.
Edit intent: fluency
Original: 5}} dependence of Hassidim , et al. (NeurIPS 2020, oral presentation).
Revised: 5}} dependence of Hassidim et al. (NeurIPS 2020, oral presentation).
Edit intent: fluency
Original:  Our bounds are optimal up to poly(\log\log n+\log(1/\epsilon)) factors, and improve the 1{\epsilon^3 Ben-Eliezer et  al.
Revised:  Our bounds are optimal up to poly(\log\log n+\log(1/\epsilon)) factors, and improve the 1{\epsilon^3 Ben-Eliezer et . al.
Edit intent: fluency
Original:  (PODS 2020, best paper award) and the \frac{1{\epsilon^{2.
Revised:  (PODS 2020, best paper award) {\epsilon^{2.
Edit intent: coherence
Original: Having suitable (approximate) explicit analytic solutions of the well known epidemic model SIR( D) would help in studying the data through easy fit.
Revised: The SIR( D) would help in studying the data through easy fit.
Edit intent: clarity
Original: The SIR(D) epidemiological model is defined through transcendental equations not solvable by elementary functions.
Revised: The SIR(D) epidemiological model is defined through a system of transcendental equations, not solvable by elementary functions.
Edit intent: clarity
Original: Automatic techniques in the context of motor speech disorders ~ (MSDs) are typically two-class techniques aiming to discriminate between dysarthria and neurotypical speech or between dysarthria and apraxia of speech (AoS).
Revised: Automatic techniques in the context of motor speech disorders (MSDs) are typically two-class techniques aiming to discriminate between dysarthria and neurotypical speech or between dysarthria and apraxia of speech (AoS).
Edit intent: fluency
Original:  Further, although such techniques are proposed to support the perceptual assessment of clinicians, the automatic and perceptual classification accuracy have never been compared.
Revised:  Further, although such techniques are proposed to support the perceptual assessment of clinicians, the automatic and perceptual classification accuracy has never been compared.
Edit intent: fluency
Original:  In this paper, we propose a three-class automatic technique and a set of handcrafted features for the discrimination of dysarthria, AoS and neurotypical speech.
Revised:  In this paper, we investigate a three-class automatic technique and a set of handcrafted features for the discrimination of dysarthria, AoS and neurotypical speech.
Edit intent: clarity
Original:  The presented results show that the proposed hierarchical classification approach yields a higher classification accuracy than baseline One-versus-One and One-versus-Rest approaches.
Revised:  The presented results show that the hierarchical classification approach yields a higher classification accuracy than baseline One-versus-One and One-versus-Rest approaches.
Edit intent: clarity
Original:  Further, the presented results show that the proposed approach yields a higher classification accuracy than the perceptual assessment of speech and language pathologists, demonstrating the potential advantages of integrating automatic tools in clinical practice.
Revised:  Further, the presented results show that the automatic approach yields a higher classification accuracy than the perceptual assessment of speech and language pathologists, demonstrating the potential advantages of integrating automatic tools in clinical practice.
Edit intent: clarity
Original: Transparency of algorithmic systems entails exposing system properties to various stakeholders for purposes that include understanding, improving, and /or contesting predictions.
Revised: Algorithmic transparency entails exposing system properties to various stakeholders for purposes that include understanding, improving, and /or contesting predictions.
Edit intent: clarity
Original: Transparency of algorithmic systems entails exposing system properties to various stakeholders for purposes that include understanding, improving, and /or contesting predictions.
Revised: Transparency of algorithmic systems entails exposing system properties to various stakeholders for purposes that include understanding, improving, and contesting predictions.
Edit intent: fluency
Original:  With this work, we seek to encourage researchers to study uncertainty as a form of transparency and practitioners to communicate uncertainty estimates to stakeholders . First, we discuss methods for assessing uncertainty.
Revised:  With this work, we seek to encourage researchers to study uncertainty as a form of transparency by estimating and communicating the uncertainty associated with model predictions . First, we discuss methods for assessing uncertainty.
Edit intent: clarity
Original:  Then, we describe the utility of uncertainty for mitigating model unfairness, augmenting decision-making, and building trustworthy systems.
Revised:  Then, we characterize how uncertainty can be used to mitigate model unfairness, augmenting decision-making, and building trustworthy systems.
Edit intent: clarity
Original:  Then, we describe the utility of uncertainty for mitigating model unfairness, augmenting decision-making, and building trustworthy systems.
Revised:  Then, we describe the utility of uncertainty for mitigating model unfairness, augment decision-making, and building trustworthy systems.
Edit intent: fluency
Original:  Then, we describe the utility of uncertainty for mitigating model unfairness, augmenting decision-making, and building trustworthy systems.
Revised:  Then, we describe the utility of uncertainty for mitigating model unfairness, augmenting decision-making, and build trustworthy systems.
Edit intent: fluency
Original:  We also review methods for displaying uncertainty to stakeholders and discuss how to collect information required for incorporating uncertainty into existing ML pipelines.
Revised:  Finally, we outline methods for displaying uncertainty to stakeholders and discuss how to collect information required for incorporating uncertainty into existing ML pipelines.
Edit intent: clarity
Original:  We also review methods for displaying uncertainty to stakeholders and discuss how to collect information required for incorporating uncertainty into existing ML pipelines.
Revised:  We also review methods for displaying uncertainty to stakeholders and recommend how to collect information required for incorporating uncertainty into existing ML pipelines.
Edit intent: clarity
Original:  Our contribution is an interdisciplinary review to inform how to measure, communicate, and use uncertainty as a form of transparency.
Revised:  This work constitutes an interdisciplinary review to inform how to measure, communicate, and use uncertainty as a form of transparency.
Edit intent: clarity
Original:  This work constitutes an interdisciplinary review drawn from literature spanning machine learning, visualization/HCI,  decision-making  and fairness.
Revised:  This work constitutes an interdisciplinary review drawn from literature spanning machine learning, visualization/HCI, decision-making , and fairness.
Edit intent: fluency
Original: We design well-balanced numerical algorithms with first-, second-, and third-order of accuracy for the spherically symmetry evolution of a compressible fluid  on a Schwarzschild black hole .
Revised: For the evolution of a compressible fluid on a Schwarzschild black hole .
Edit intent: clarity
Original:  Our schemes follow the finite volume methodology and preserve the stationary solutions and allow us to investigate the global asymptotic behavior of such flows and reach definite conclusions about the behavior of the mass density and velocity field  .
Revised:  Our schemes follow the finite volume methodology and preserve the stationary solutions and allow us to investigate the global asymptotic behavior of such flows and determine the asymptotic behavior of the mass density and velocity field .
Edit intent: clarity
Original: It is challenging to parameterize the force field for calcium ions (Ca2+) in calcium-binding proteins because of its unique coordination chemistry that involves  surrounding atoms required for its stability.
Revised: It is challenging to parameterize the force field for calcium ions (Ca2+) in calcium-binding proteins because of their unique coordination chemistry that involves surrounding atoms required for its stability.
Edit intent: fluency
Original: It is challenging to parameterize the force field for calcium ions (Ca2+) in calcium-binding proteins because of its unique coordination chemistry that involves  surrounding atoms required for its stability.
Revised: It is challenging to parameterize the force field for calcium ions (Ca2+) in calcium-binding proteins because of its unique coordination chemistry that involves the surrounding atoms required for its stability.
Edit intent: fluency
Original: It is challenging to parameterize the force field for calcium ions (Ca2+) in calcium-binding proteins because of its unique coordination chemistry that involves  surrounding atoms required for its stability.
Revised: It is challenging to parameterize the force field for calcium ions (Ca2+) in calcium-binding proteins because of its unique coordination chemistry that involves surrounding atoms required for stability.
Edit intent: fluency
Original:  Ca2+ charges are derived by fitting to the ESP in the context of  classical or polarizable force field (PFF).
Revised:  Ca2+ charges were derived by fitting to the ESP in the context of classical or polarizable force field (PFF).
Edit intent: fluency
Original:  Ca2+ charges are derived by fitting to the ESP in the context of  classical or polarizable force field (PFF).
Revised:  Ca2+ charges are derived by fitting to the ESP in the context of a classical or polarizable force field (PFF).
Edit intent: fluency
Original:  Specially, we find that the fitted atomic charges of Ca2+ in the context of PFF depend on the coordinating geometry of electronegative atoms from the amino acids in the loop.
Revised:  Specifically, we found that the fitted atomic charges of Ca2+ in the context of PFF depend on the coordinating geometry of electronegative atoms from the amino acids in the loop.
Edit intent: fluency
Original:  Although the nearby water molecules do not influence the atomic charge of Ca2+, they are crucial for compensating  the coordination of Ca2+ due to the conformational flexibility in the EF-hand loop.
Revised:  Although nearby water molecules do not influence the atomic charge of Ca2+, they are crucial for compensating the coordination of Ca2+ due to the conformational flexibility in the EF-hand loop.
Edit intent: fluency
Original:  Although the nearby water molecules do not influence the atomic charge of Ca2+, they are crucial for compensating  the coordination of Ca2+ due to the conformational flexibility in the EF-hand loop.
Revised:  Although the nearby water molecules do not influence the atomic charge of Ca2+, they are crucial for compensating for the coordination of Ca2+ due to the conformational flexibility in the EF-hand loop.
Edit intent: fluency
Original:  Our method advances the development of force fields for metal ions and the protein binding sites in dynamical environments.
Revised:  Our method advances the development of force fields for metal ions and protein binding sites in dynamical environments.
Edit intent: fluency
Original:  Our method advances the development of force fields for metal ions and the protein binding sites in dynamical environments.
Revised:  Our method advances the development of force fields for metal ions and the protein binding sites in dynamic environments.
Edit intent: clarity
Original: In this paper , we establish an exact expression of the sin\Theta angle for the singular subspace perturbation.
Revised: In this paper , we establish a useful formula for the sin\Theta angle for the singular subspace perturbation.
Edit intent: clarity
Original:  Explicitly , we establish a useful formula for the sin\Theta angles between the perturbed and the original singular subspaces.
Revised:  Explicitly , we establish a useful set of formulae for the \sin\Theta distance between the original and the perturbed singular subspaces.
Edit intent: clarity
Original: With the rapid emergence of graph representation learning, the construction of new large-scale datasets are necessary to distinguish model capabilities and accurately assess the strengths and weaknesses of each technique.
Revised: With the rapid emergence of graph representation learning, the construction of new large-scale datasets is necessary to distinguish model capabilities and accurately assess the strengths and weaknesses of each technique.
Edit intent: fluency
Original:  To date, no single graph database offers all of these desired properties.
Revised:  To date, no single graph database offers all these desired properties.
Edit intent: fluency
Original:  Compared to the popular REDDIT-12K database, MalNet offers 105x more graphs, 44x larger graphs on average, and 63x the classes.
Revised:  Compared to the popular REDDIT-12K database, MalNet offers 105x more graphs, 44x larger graphs on average, and 63x more classes.
Edit intent: clarity
Original:  The unprecedented scale and diversity of MalNet offers exciting opportunities to advance the frontiers of graph representation learning---enabling new discoveries and research into imbalanced classification, explainability and the impact of class hardness.
Revised:  The unprecedented scale and diversity of MalNet offers exciting opportunities to advance the frontiers of graph representation learning--enabling new discoveries and research into imbalanced classification, explainability and the impact of class hardness.
Edit intent: fluency
Original:  The database is publically available at www.mal-net.org.
Revised:  The database is publicly available at www.mal-net.org.
Edit intent: clarity
Original: The aim of this paper is to resolve numericallyusing meshless method via Radial Basis Functions a time-space-fractional  Black-Scholes equation .
Revised: The aim of this paper is to solve numerically, using the meshless method via Radial Basis Functions a time-space-fractional Black-Scholes equation .
Edit intent: fluency
Original: The aim of this paper is to resolve numericallyusing meshless method via Radial Basis Functions a time-space-fractional  Black-Scholes equation .
Revised: The aim of this paper is to resolve numericallyusing meshless method via radial basis functions, time-space-fractional Black-Scholes equation .
Edit intent: fluency
Original: The aim of this paper is to resolve numericallyusing meshless method via Radial Basis Functions a time-space-fractional  Black-Scholes equation .
Revised: The aim of this paper is to resolve numericallyusing meshless method via Radial Basis Functions a time-space-fractional Black-Scholes .
Edit intent: clarity
Original:  The (exact ) Cholesky factorization for the matrix introduces a clique in the associated graph after eliminating every row/column.
Revised:  The exact Cholesky factorization for the matrix introduces a clique in the associated graph after eliminating every row/column.
Edit intent: fluency
Original:  By randomization, %DIFDELCMD < {\tt %%% rchol samples a subset of the edges in the clique  .
Revised:  By randomization, %DIFDELCMD < {\tt %%% samples a subset of the edges in the clique .
Edit intent: fluency
Original:  We prove %DIFDELCMD < {\tt %%% rchol is breakdown free and apply it to solving  linear systems with symmetric diagonally-dominant matrices.
Revised:  We prove %DIFDELCMD < {\tt %%% RCHOL is breakdown free and apply it to solving linear systems with symmetric diagonally-dominant matrices.
Edit intent: fluency