wanyu/IteraTeR_v2 huggingface dataset:
Original:  This distribution on graphs is characterized by independent edge weights parameterized by vertex potentials at each node . Using the general theory of exponential family distributions, we prove the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Revised:  This distribution on graphs is characterized by independent edge weights parameterized by a shared vector of vertex potentials . Using the general theory of exponential family distributions, we prove the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Edit intent: clarity
Original:  This distribution on graphs is characterized by independent edge weights parameterized by vertex potentials at each node . Using the general theory of exponential family distributions, we prove the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Revised:  This distribution on graphs is characterized by independent edge weights parameterized by vertex potentials at each node . Using the general theory of exponential family distributions, we derive the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Edit intent: clarity
Original:  We also prove the consistency of the MLE from a single graph sample , extending the results of Chatterjee, Diaconis, and Sly for unweighted (binary)graphs .
Revised:  We also prove consistency of the MLE from a single graph sample , extending the results of Chatterjee, Diaconis, and Sly for unweighted (binary)graphs .
Edit intent: fluency
Original:  Interestingly, our extensions require an intricate study of the inverses of diagonally dominant positive matrices.
Revised:  Interestingly, our proofs require tight estimates on the norms of inverses of symmetric, diagonally dominant positive matrices.
Edit intent: clarity
Original: The evolution of animals involved a transition from a unicellular transcriptional regime to one supporting developmentally programmed somatic multicellularity.
Revised: The evolution of animals involved a transition from a unicellular transcriptional regime to a transcriptional program supporting developmentally programmed somatic multicellularity.
Edit intent: clarity
Original:  This transition was facilitated by an emergent developmental gene repertoire via gene  family expansion and new gene innovation.
Revised:  This transition was facilitated by an emergent gene family expansion and new gene innovation.
Edit intent: clarity
Original:  This transition was facilitated by an emergent developmental gene repertoire via gene  family expansion and new gene innovation.
Revised:  This transition was facilitated by an emergent developmental gene repertoire via gene family expansion and diversification as well as gene innovation.
Edit intent: clarity
Original:  Unknown, however, is whether this genomic-rewiring was constrained by genetic functions incompatible with key features of animals .
Revised:  Unknown, however, is whether the loss of key genes co-evolved with and/or facilitated this genomic rewiring .
Edit intent: clarity
Original:  We suggest that the loss of these amyloid disaggregases was a necessary step in the evolutionary origin of the asymmetric cell specifications of somatic development .
Revised:  We suggest that the loss of these pathways may explain the loss of dedicated protein folding machinery in the stem-metazoan lineage .
Edit intent: clarity
Original:  Unknown, however, is whether the loss of key genes co-evolved with and/or facilitated this genomic rewiring .
Revised:  Unknown, however, is whether the loss of key genes co-evolved with this developmental reprogramming has not yet been addressed .
Edit intent: clarity
Original:  In our analysis we find that the neural representation in visual area IT is superior to visual area V4 , indicating an increase in representational performance in higher levels of the cortical visual hierarchy .
Revised:  In our analysis we find that the neural representation in visual area IT is superior to visual area V4 .
Edit intent: clarity
Original:  In our analysis of representational learning algorithms, we find that a number of current algorithms approach the representational performance of V4  ]  . Impressively, we find that a recent supervised algorithm [Krizhevsky et al., 2012] achieves performance equal to that of IT for an intermediate level of image variation difficulty, and performs between V4 and IT at a higher difficulty level.
Revised:  In our analysis of representational learning algorithms, we find that a number of current algorithms approach the representational performance of V4 ] . Impressively, we find that a recent supervised algorithm [Krizhevsky et al., 2012] achieves performance comparable to that of IT for an intermediate level of image variation difficulty, and performs between V4 and IT at a higher difficulty level.
Edit intent: clarity
Original:  In our analysis of representational learning algorithms, we find that a number of current algorithms approach the representational performance of V4  ]  . Impressively, we find that a recent supervised algorithm [Krizhevsky et al., 2012] achieves performance equal to that of IT for an intermediate level of image variation difficulty, and performs between V4 and IT at a higher difficulty level.
Revised:  In our analysis of representational learning algorithms, we find that a number of current algorithms approach the representational performance of V4 ] . Impressively, we find that a recent supervised algorithm [Krizhevsky et al., 2012] achieves performance equal to that of IT for an intermediate level of image variation difficulty, and surpasses IT at a higher difficulty level.
Edit intent: clarity
Original:  We believe this result represents a major milestone: it is the first learning algorithm we have found that produces a representation on par with IT on this task of intermediate difficulty .
Revised:  We believe this result represents a major milestone: it is the first learning algorithm we have found that exceeds our current estimate of IT representation performance .
Edit intent: clarity
Original:  Our  approach yields significantly lower complexity than the only previously known delay (rate-function) and throughput optimal scheduling policy , which incurs a high complexity of O(n^5) .
Revised:  Our approach yields significantly lower complexity than the only previously designed delay and throughput optimal scheduling policy , which incurs a high complexity of O(n^5) .
Edit intent: clarity
Original:  Our  approach yields significantly lower complexity than the only previously known delay (rate-function) and throughput optimal scheduling policy , which incurs a high complexity of O(n^5) .
Revised:  Our approach yields significantly lower complexity than the only previously known delay (rate-function) and throughput optimal scheduling policy .
Edit intent: coherence
Original:  In this paper  we argue that the difficulty in speech recognition is primarily caused by the high variability in speech signals.
Revised:  In this paper , we argue that the difficulty in speech recognition is primarily caused by the high variability in speech signals.
Edit intent: fluency
Original:  In this paper we exploit this property and study stochastic HF with small gradient and curvature mini-batches independent of the dataset size for classification .
Revised:  In this paper we exploit this property and study stochastic HF with gradient and curvature mini-batches independent of the dataset size for classification .
Edit intent: clarity
Original:  In this paper we exploit this property and study stochastic HF with small gradient and curvature mini-batches independent of the dataset size for classification .
Revised:  In this paper we exploit this property and study stochastic HF with small gradient and curvature mini-batches independent of the dataset size .
Edit intent: coherence
Original:  We modify Martens' HF for this setting and integrate dropout, a method for preventing co-adaptation of feature detectors, to guard against overfitting.
Revised:  We modify Martens' HF for these settings and integrate dropout, a method for preventing co-adaptation of feature detectors, to guard against overfitting.
Edit intent: fluency
Original:  On classification tasks, dropout stochastic HF achieves accelerated training and competitive results in comparison with dropout SGD without the need to tune learning rates .
Revised:  Stochastic Hessian-free optimization gives an intermediary between SGD and HF that achieves competitive performance on both classification and deep autoencoder experiments .
Edit intent: clarity
Original:  In this review, we present the most recent and pertinent data on the consequences that our current scholarly communication system has had on various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings and retractions).
Revised:  In this review, we present the most recent and pertinent data on the consequences of our current scholarly communication system has had on various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings and retractions).
Edit intent: fluency
Original:  In this review, we present the most recent and pertinent data on the consequences that our current scholarly communication system has had on various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings and retractions).
Revised:  In this review, we present the most recent and pertinent data on the consequences that our current scholarly communication system with respect to various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings and retractions).
Edit intent: clarity
Original:  In this review, we present the most recent and pertinent data on the consequences that our current scholarly communication system has had on various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings and retractions).
Revised:  In this review, we present the most recent and pertinent data on the consequences that our current scholarly communication system has had on various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings or retractions).
Edit intent: fluency
Original:  These data confirm previous suspicions : using journal rank as an assessment tool is bad scientific practice.
Revised:  These data corroborate previous hypotheses : using journal rank as an assessment tool is bad scientific practice.
Edit intent: clarity
Original:  This new system will use modern information technology to vastly improve the filter, sort and discovery function of the current journal system.
Revised:  This new system will use modern information technology to vastly improve the filter, sort and discovery functions of the current journal system.
Edit intent: fluency
Original:  We endeavour to understand which stem-cell specific phenotypic traits govern the loss of homeostasisthat leads to tissue overgrowth (cancer).
Revised:  We identify the regions in phenotype parameter space where these initiating cells are able to cause a disruption in homeostasis, leading to tissue overgrowth (cancer).
Edit intent: clarity
Original:  We present two applications of this result  : one to single-site heat-bath chains for spin systems and one to a heat-bath Markov chain for sampling contingency tables  .
Revised:  We present two applications of this result are presented : one to single-site heat-bath chains for spin systems and one to a heat-bath Markov chain for sampling contingency tables .
Edit intent: clarity
Original: The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs.
Revised: The graph reconstruction conjecture asserts that every finite simple graph on at least 3 vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs.
Edit intent: clarity
Original: The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs.
Revised: The graph reconstruction conjecture asserts that a finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs.
Edit intent: fluency
Original:  Then the difference \psi(n) - d(n) is a measure of how many graphs cannot be reconstructed from their decks.
Revised:  Then the difference \psi(n) - d(n) measures how many graphs cannot be reconstructed from their decks.
Edit intent: clarity
Original:  In particular, the graph reconstruction conjecture holds for n-vertex graphs if and only if \psi(n) = d(n).
Revised:  In particular, the graph reconstruction conjecture is true for n-vertex graphs if and only if \psi(n) = d(n).
Edit intent: clarity
Original:  We prove that if M is a matrix of covering numbers of graphs by sequences of graphs  then d(n) \geq rank_R(M). In particular, all n-vertex graphs are reconstructible if one such matrix has rank \psi(n).
Revised:  We prove that if M is a matrix of covering numbers of graphs by sequences of graphs , then d(n) \geq rank_R(M). In particular, all n-vertex graphs are reconstructible if one such matrix has rank \psi(n).
Edit intent: fluency
Original:  Particular instances of these series compute volumes of moduli spaces of flat bundles over surfaces, and also  multiple zeta values.
Revised:  Particular instances of these series compute volumes of moduli spaces of flat bundles over surfaces, and also certain multiple zeta values.
Edit intent: clarity
Original:  As a consequence, the  computation time of shortest programs associated with this sequence of strings plus programs that are a certain number of bits longer rises (like the Busy Beaver function) faster than any computable  function.
Revised:  As a consequence, the computation time of the associated shortest programs rises faster than any computable function.
Edit intent: clarity
Original: In the coming era of exascale supercomputing, in-situ visualization is an inevitable approach to reduce the output data size.
Revised: In the coming era of exascale supercomputing, in-situ visualization will be crucial approach for reducing the output data size.
Edit intent: clarity
Original:  A problem of the in-situ visualization is that it loses interactivity unless a steering method is  adopted.
Revised:  A problem of in-situ visualization is that it loses interactivity unless a steering method is adopted.
Edit intent: fluency
Original:  A problem of the in-situ visualization is that it loses interactivity unless a steering method is  adopted.
Revised:  A problem of the in-situ visualization is that it loses interactivity if a steering method is adopted.
Edit intent: coherence
Original:  A problem of the in-situ visualization is that it loses interactivity unless a steering method is  adopted.
Revised:  A problem of the in-situ visualization is that it loses interactivity unless a steering method is not adopted.
Edit intent: coherence
Original:  In this paper,  a new method is proposed for interactive analysis of in-situ visualization images produced by a batch simulation job.
Revised:  In this paper, we propose a new method is proposed for interactive analysis of in-situ visualization images produced by a batch simulation job.
Edit intent: clarity
Original:  In this paper,  a new method is proposed for interactive analysis of in-situ visualization images produced by a batch simulation job.
Revised:  In this paper, a new method for the interactive analysis of in-situ visualization images produced by a batch simulation job.
Edit intent: clarity
Original:  A key idea is to apply a lot of--from thousands to millions of--in-situ visualizations at once.
Revised:  A key idea is to apply numerous ( thousands to millions of--in-situ visualizations at once.
Edit intent: clarity
Original:  When each movie is compressed to the order of 10 MB, the total size of one million movies is only the order of 10 TBthat is smaller than the size of  raw numerical data in exascale supercomputing.
Revised:  When each movie is compressed to the order of 10 MB, the total size of one million movies is only the order of 10 TBthat is smaller than the size of the raw numerical data in exascale supercomputing.
Edit intent: fluency
Original:  A feasibility study of the proposed method is performed .
Revised:  We performed a feasibility study using the proposed method is performed .
Edit intent: clarity
Original:  A feasibility study of the proposed method is performed .
Revised:  A feasibility study of the proposed method .
Edit intent: clarity
Original:  Multiple movie files are produced by a simulation and they are analyzed with a specially designed movie player.
Revised:  Multiple movie files were produced by a simulation and they are analyzed with a specially designed movie player.
Edit intent: fluency
Original:  Multiple movie files are produced by a simulation and they are analyzed with a specially designed movie player.
Revised:  Multiple movie files are produced by a simulation and they were analyzed using a specially designed movie player.
Edit intent: fluency
Original:  One can interactively change the view angle, visualization method, and their parameters by retrieving a proper sequence of images form the movie data set .
Revised:  The user could change the viewing angle, the visualization method, and their parameters by retrieving a proper sequence of images form the movie data set .
Edit intent: clarity
Original:  One can interactively change the view angle, visualization method, and their parameters by retrieving a proper sequence of images form the movie data set .
Revised:  One can interactively change the view angle, visualization method, and the parameters interactively by retrieving an appropriate sequence of images form the movie data set .
Edit intent: clarity
Original:  One can interactively change the view angle, visualization method, and their parameters by retrieving a proper sequence of images form the movie data set .
Revised:  One can interactively change the view angle, visualization method, and their parameters by retrieving a proper sequence of images from the movie dataset .
Edit intent: clarity
Original: In the coming era of exascale supercomputing, in-situ visualization will be  crucial approach for reducing the output data size.
Revised: In the coming era of exascale supercomputing, in-situ visualization will be a crucial approach for reducing the output data size.
Edit intent: fluency
Original:  We propose a simple model in which the number of citations of a publication correlates with the scientific impact of the publication but also depends on other 'random' factors.
Revised:  We propose a simple model in which the number of citations of a publication depends not only on the scientific impact of the publication but also depends on other 'random' factors.
Edit intent: clarity
Original:  We propose a simple model in which the number of citations of a publication correlates with the scientific impact of the publication but also depends on other 'random' factors.
Revised:  We propose a simple model in which the number of citations of a publication correlates with the scientific impact of the publication but also on other 'random' factors.
Edit intent: coherence
Original:  The participants were able to simultaneously regulate their BOLD fMRI activation of the left amygdala and frontal EEG power asymmetry in the high-beta band using the rtfMRI-EEG-nf.
Revised:  The participants were able to simultaneously regulate their BOLD fMRI activation in the left amygdala and frontal EEG power asymmetry in the high-beta band using the rtfMRI-EEG-nf.
Edit intent: clarity
Original: For a nonnegative matrix A and real diagonal matrix D, two known inequalities on the spectral radius, r(A^2 D^2) >= r(AD)^2 and r(A), r(A D^2) >= r(AD)^2, leave open the question of what determines the order of r(A^2 D^2) with respect to r(A)  r(A D^2).
Revised: For a nonnegative matrix A and real diagonal matrix D, two known inequalities on the spectral radius, r(A^2 D^2) >= r(AD)^2 and r(A), r(A D^2) >= r(AD)^2, leave open the question of what determines the order of r(A^2 D^2) with respect to r(A) , r(A D^2).
Edit intent: fluency
Original:  For a  symmetrizable nonnegative matrix A with all positive eigenvalues and nonnegative D, r(A^2 D) <= r(A)  r(AD).
Revised:  For a symmetrizable nonnegative matrix A with all positive eigenvalues and nonnegative D, r(A^2 D) <= r(A) , r(AD).
Edit intent: fluency
Original:  This is a particular case of the more general result that r(A [(1-m)  r(B)  I + m B] D) is monotonic in m when all non-Perron eigenvalues  have the same sign --- decreasing for positive signs and increasing for negative signs, for symmetrizable nonnegative A and B that commute.
Revised:  This is a particular case of the more general result that r(A [(1-m) , r(B) I + m B] D) is monotonic in m when all non-Perron eigenvalues have the same sign --- decreasing for positive signs and increasing for negative signs, for symmetrizable nonnegative A and B that commute.
Edit intent: fluency
Original:  This is a particular case of the more general result that r(A [(1-m)  r(B)  I + m B] D) is monotonic in m when all non-Perron eigenvalues  have the same sign --- decreasing for positive signs and increasing for negative signs, for symmetrizable nonnegative A and B that commute.
Revised:  This is a particular case of the more general result that r(A [(1-m) r(B) , I + m B] D) is monotonic in m when all non-Perron eigenvalues have the same sign --- decreasing for positive signs and increasing for negative signs, for symmetrizable nonnegative A and B that commute.
Edit intent: fluency
Original:  This is a particular case of the more general result that r(A [(1-m)  r(B)  I + m B] D) is monotonic in m when all non-Perron eigenvalues  have the same sign --- decreasing for positive signs and increasing for negative signs, for symmetrizable nonnegative A and B that commute.
Revised:  This is a particular case of the more general result that r(A [(1-m) r(B) I + m B] D) is monotonic in m when all non-Perron eigenvalues of A have the same sign --- decreasing for positive signs and increasing for negative signs, for symmetrizable nonnegative A and B that commute.
Edit intent: clarity
Original:  Commuting matrices include the Kronecker products A, B \in {i=1^L M_i^{t_i}}, t_i \in {0, 1, 2, ...}, which comprise a class of application for these results.
Revised:  Commuting matrices include the Kronecker products A, B in {i=1^L M_i^{t_i}}, t_i \in {0, 1, 2, ...}, which comprise a class of application for these results.
Edit intent: fluency
Original:  Commuting matrices include the Kronecker products A, B \in {i=1^L M_i^{t_i}}, t_i \in {0, 1, 2, ...}, which comprise a class of application for these results.
Revised:  Commuting matrices include the Kronecker products A, B \in {i=1^L M_i^{t_i}}, t_i in {0, 1, 2, ...}, which comprise a class of application for these results.
Edit intent: fluency
Original:  This machinery allows analysis of the sign of d/d m_j r({i=1 ^L (1-m_i) r(A_i) I_i + m_i A_i }D).
Revised:  This machinery allows analysis of the sign of d/d m_j r({i=1 (1-m_i) r(A_i) I_i + m_i A_i }D).
Edit intent: clarity
Original: For a nonnegative matrix A and real diagonal matrix D, two known inequalities on the spectral radius, r(A^2 D^2) >= r(AD)^2 and r(A) , r(A D^2) >= r(AD)^2, leave open the question of what determines the order of r(A^2 D^2) with respect to r(A) , r(A D^2).
Revised: For a nonnegative matrix A and real diagonal matrix D, two known inequalities on the spectral radius, r(A^2 D^2) >= r(AD)^2 and r(A) r(A D^2) >= r(AD)^2, leave open the question of what determines the order of r(A^2 D^2) with respect to r(A) , r(A D^2).
Edit intent: fluency