wanyu/IteraTeR_v2 huggingface dataset:
Original:  On the other hand, there are very challenging tasks to find reduced-order form of a large-scale system with a minimized H_2 error norm and attain the rapid rate of convergence.
Revised:  On the other hand, there are very challenging tasks to find reduced-order form of a large-scale second-order systems with the optimal H_2 error norm and attain the rapid rate of convergence.
Edit intent: clarity
Original:  To overcome these problems, this paper discusses competent techniques to determine the optimal H_2 error norm efficiently for the second-order system.
Revised:  To overcome these problems, this paper discusses competent techniques to determine the optimal H_2 error norms efficiently for the second-order system.
Edit intent: fluency
Original:  The efficiency and applicability of the proposed techniques are validated by applying them to several large-scale dynamical systems .
Revised:  The efficiency and applicability of the proposed techniques are validated by applying them to some large-scale dynamical systems .
Edit intent: clarity
Original: Element-wise activation functions play a critical role in deep neural networks by affecting the expressivity power and the learning dynamics.
Revised: Element-wise activation functions play a critical role in deep neural networks via affecting the expressivity power and the learning dynamics.
Edit intent: fluency
Original: Cancers of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic disease where the primary site of origin cannot be determined.
Revised: Cancer of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic disease where the primary site of origin cannot be determined.
Edit intent: fluency
Original: Cancers of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic disease where the primary site of origin cannot be determined.
Revised: Cancers of unknown primary (CUP) is an enigmatic disease where the primary site of origin cannot be determined.
Edit intent: coherence
Original: Cancers of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic disease where the primary site of origin cannot be determined.
Revised: Cancers of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic group of diagnoses where the primary site of origin cannot be determined.
Edit intent: clarity
Original: Cancers of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic disease where the primary site of origin cannot be determined.
Revised: Cancers of unknown primary (CUP) , represent 1-3\% of all cancers and is an enigmatic disease where the primary anatomical site of tumor origin cannot be determined.
Edit intent: clarity
Original:  Modern cancer therapeutics including immune checkpoint inhibitor therapies are specific to the primary tumor hence broad-spectrum chemotherapy remains the standard-of-care for CUP patients\mbox{ massard2011carcinomas .
Revised:  Modern cancer therapeutics including immune checkpoint inhibitor therapies are specific to the primary tumor .
Edit intent: coherence
Original:  Recent work has focused on using genomics and transcriptomics for identification of tumors of unknown primary .
Revised:  Recent work has focused on using genomics and transcriptomics for identification of tumor origins .
Edit intent: clarity
Original:  However, genomic testing  lacks clinical penetration in low resource settings and may not be available at scale for every patient.
Revised:  However, genomic testing is not conducted for every patient and lacks clinical penetration in low resource settings and may not be available at scale for every patient.
Edit intent: clarity
Original:  Here we show that deep learning-based weakly supervised and multi-task computational pathology on H E slides can be used to determine the metastatic status and site of origin for tumors of unknown primary .
Revised:  Here we show that deep learning-based E slides can be used to determine the metastatic status and site of origin for tumors of unknown primary .
Edit intent: clarity
Original:  We used 17,486 gigapixel whole slide images  spread over 18 different organs for training a multi-task deep model to simultaneously identify  primary or metastatic status and site of origin.
Revised:  We used 17,486 gigapixel whole slide images spread over 18 common origins to train a multi-task deep model to simultaneously identify primary or metastatic status and site of origin.
Edit intent: clarity
Original:  We used 17,486 gigapixel whole slide images  spread over 18 different organs for training a multi-task deep model to simultaneously identify  primary or metastatic status and site of origin.
Revised:  We used 17,486 gigapixel whole slide images spread over 18 different organs for training a multi-task deep model to simultaneously identify primary or metastatic and predict its site of origin.
Edit intent: clarity
Original:  We further curated a CUP dataset of 717 cases form 202 different medical centers and identified a subset of 290 cases for which a differential diagnosis was assigned.
Revised:  We further curated a dataset of 717 cases form 202 different medical centers and identified a subset of 290 cases for which a differential diagnosis was assigned.
Edit intent: clarity
Original:  Our model predictions resulted in concordance for 50\% of cases ( \kappa =0.4 when adjusted for agreement by chance) and a top-3 agreement of 75\%.
Revised:  Our model predictions resulted in concordance for 50\% of cases ( \k{appa =0.4 when adjusted for agreement by chance) and a top-3 agreement of 75\%.
Edit intent: fluency
Original:  Our proposed method can be used as a diagnostic mechanism in contrast with or in lieu of immunohistochemical staining and may also reduce the occurrence of CUP cases .
Revised:  Our proposed method can be used as a diagnostic mechanism in contrast with or in lieu of immunohistochemical staining and may also reduce the occurrence of CUP .
Edit intent: clarity
Original:  In particular, I test whether the emotional content of firm-specific messages posted on social media just prior to a firm's earnings announcement explains its earnings and announcement returns.
Revised:  In particular, I test whether the emotional content of firm-specific messages posted on social media just prior to a firm's earnings announcement predicts its earnings and announcement returns.
Edit intent: clarity
Original: The design of deep neural network (DNN) accelerators , i.e., specialized hardware for inference, has received considerable attention in past years due to saved cost, area, and energy compared to mainstream hardware.
Revised: Deep neural network (DNN) accelerators , i.e., specialized hardware for inference, has received considerable attention in past years due to saved cost, area, and energy compared to mainstream hardware.
Edit intent: clarity
Original: The design of deep neural network (DNN) accelerators , i.e., specialized hardware for inference, has received considerable attention in past years due to saved cost, area, and energy compared to mainstream hardware.
Revised: The design of deep neural network (DNN) accelerators received considerable attention in past years due to saved cost, area, and energy compared to mainstream hardware.
Edit intent: clarity
Original: The design of deep neural network (DNN) accelerators , i.e., specialized hardware for inference, has received considerable attention in past years due to saved cost, area, and energy compared to mainstream hardware.
Revised: The design of deep neural network (DNN) accelerators , i.e., specialized hardware for inference, has received considerable attention in past years due to saved energy compared to mainstream hardware.
Edit intent: clarity
Original:  On BABEL, our approach improves word error rate by 16\% relative compared to the strongest comparable system.
Revised:  On BABEL, our approach improves word error rate by 16\% relative compared to a comparable system.
Edit intent: clarity
Original: Discontinuous Galerkin methods, based on piecewise polynomials of degree q \qq \geq 0, are investigated for temporal semi-discretization for second order hyperbolic equations.
Revised: Standard discontinuous Galerkin methods, based on piecewise polynomials of degree q \qq \geq 0, are investigated for temporal semi-discretization for second order hyperbolic equations.
Edit intent: clarity
Original: Discontinuous Galerkin methods, based on piecewise polynomials of degree q \qq \geq 0, are investigated for temporal semi-discretization for second order hyperbolic equations.
Revised: Discontinuous Galerkin methods, based on piecewise polynomials of degree \qq \geq 0, are investigated for temporal semi-discretization for second order hyperbolic equations.
Edit intent: clarity
Original: Discontinuous Galerkin methods, based on piecewise polynomials of degree q \qq \geq 0, are investigated for temporal semi-discretization for second order hyperbolic equations.
Revised: Discontinuous Galerkin methods, based on piecewise polynomials of degree q \qq \geq 0, are considered for temporal semi-discretization for second order hyperbolic equations.
Edit intent: clarity
Original: We first consider the problem of approximating a few eigenvalues of a proper rational matrix-valued function closest to a prescribed target.
Revised: We first consider the problem of approximating a few eigenvalues of a rational matrix-valued function closest to a prescribed target.
Edit intent: clarity
Original:  In particular, it is shown that a phase separation phenomenon appears when there is an excess of small discs.
Revised:  A phase separation phenomenon appears when there is an excess of small discs.
Edit intent: coherence
Original:  We propose a solution for this problem based on incremental codes implemented by rate adaptive channel codes.
Revised:  We propose a solution for this problem based on incremental codes implemented by rate-adaptive channel codes.
Edit intent: fluency
Original:  Therefore, only the information that is needed to be displayed at the user's side is transmitted during the user's request  as if the request was already known at the encoder.
Revised:  Therefore, only the information that is needed to be displayed at the user's side is transmitted during the user's request , as if the request was already known at the encoder.
Edit intent: fluency
Original:  The experimental results demonstrate that our coder obtains  better transmission rate than the state-of-the-art tile-based methods at a small cost in storage.
Revised:  The experimental results demonstrate that our coder obtains a better transmission rate than the state-of-the-art tile-based methods at a small cost in storage.
Edit intent: fluency
Original:  We show that, for every premium priciple , there exists a maximal risk measure capturing all risky components covered by the insurance prices.
Revised:  We show that, for every premium principle , there exists a maximal risk measure capturing all risky components covered by the insurance prices.
Edit intent: fluency
Original:  In a second step, we consider dual representations of convex risk measures consistent with the premium priciple .
Revised:  In a second step, we consider dual representations of convex risk measures consistent with the premium principle .
Edit intent: fluency
Original: In this paper, we provide an axiomatic approach to general premium principles giving rise to a decomposition into risk , as a generalization of the expected value, and deviation , as a generalization of the variance.
Revised: We provide an axiomatic approach to general premium principles giving rise to a decomposition into risk , as a generalization of the expected value, and deviation , as a generalization of the variance.
Edit intent: coherence
Original:  We show that, for every premium principle, there exists a maximal risk measure capturing all risky components covered by the insurance prices.
Revised:  One can uniquely identify a maximal risk measure capturing all risky components covered by the insurance prices.
Edit intent: clarity
Original:  Moreover, these algorithms are efficient and allow the computation of bounds in high-dimensional scenarios (e.g. when d=60).
Revised:  These algorithms are efficient and allow the computation of bounds in high-dimensional scenarios (e.g. when d=60).
Edit intent: coherence
Original:   Numerical experiments using synthetic data showcase the efficiency of these algorithms, while they also allow to understand the reduction of model-risk by including additional information, in the form of known derivative prices.
Revised:  Numerical experiments using synthetic data showcase the efficiency of these algorithms, while they also allow to understand the reduction of model risk by including additional information, in the form of known derivative prices.
Edit intent: fluency
Original:  Also known as antibody or health certificates, there is a clear demand for this technology that could allow people to return to work  without placing others at risk.
Revised:  Also known as antibody or health certificates, there is a clear demand for any technology that could allow people to return to work without placing others at risk.
Edit intent: clarity
Original:  One of the major criticisms of health certificates is that they could be misused to unfairly discriminate against those without immunity, allowing the formation of an `immuno-privileged' class of people.
Revised:  One of the major criticisms of such systems is that they could be misused to unfairly discriminate against those without immunity, allowing the formation of an `immuno-privileged' class of people.
Edit intent: clarity
Original:  In particular, we evaluate the viability of our approach in the context of constant-flow and batched use cases and then consider a number of possible attacks.
Revised:  We evaluate the viability of our approach in the context of constant-flow and batched use cases and then consider a number of possible attacks.
Edit intent: coherence
Original: We introduce a simple neural network architecture modification that enables composite pattern learning , increases expressiveness, and reduces training time.
Revised: A recently introduced architecture transformation, called the architope modification, was shown to bypass the composite pattern learning , increases expressiveness, and reduces training time.
Edit intent: coherence
Original:  In contrast, most feed-forward neural network architectures with sigmoid activation functions are shown not to be dense in this space.
Revised:  In contrast, most feed-forward architectures fail to be dense in this space.
Edit intent: clarity
Original:  Although the Q-NET does not have any learnable parameters, we use this abstraction to derive a family of elegant parametric formulae that represent the marginal distributions of the input function over arbitrary subsets of input dimensions   in functional form .
Revised:  Although the Q-NET does not have any learnable parameters, we use this abstraction to derive a family of elegant parametric formulae that represent the marginal distributions of the input function over arbitrary subsets of input dimensionsproxy in functional form .
Edit intent: fluency
Original:  Notably, our metric is insensitive to shortest and average path distances, thus giving new information compared to existing metrics.
Revised:  Notably, our metric is insensitive to shortest and average walk distances, thus giving new information compared to existing metrics.
Edit intent: clarity
Original:  We propose designing capacity pooling contracts to facilitate horizontal cooperation among operators to mitigate those costs and improve service resilience .
Revised:  We propose designing capacity pooling contracts to facilitate horizontal cooperation to mitigate those costs and improve service resilience .
Edit intent: clarity
Original:  Using the proposed method, we identify stable cost allocations among four operating agencies that could yield a 44\% improvement in overall network performance over not having any risk pooling contract in place  .
Revised:  Using the proposed method, we identify stable cost allocations among four operating agencies that could yield a 44\% improvement in overall network performance over not having any risk-pooling contract in place .
Edit intent: fluency
Original: In the auditory streaming paradigm alternating identical sequences of pure tones can be perceived as a single galloping rhythm (integration) or as two sequences with separated low and high tones (segregation).
Revised: In the auditory streaming paradigm alternating sequences of pure tones can be perceived as a single galloping rhythm (integration) or as two sequences with separated low and high tones (segregation).
Edit intent: clarity
Original:  With the aim of identifying a plausible minimal neural circuit that captures this phenomenon, we investigate a firing rate model consisting of two periodically forced neural populations coupled by fast direct excitation and slow delayed inhibition.
Revised:  With the aim of identifying a plausible minimal neural circuit that captures this phenomenon, we propose a firing rate model consisting of two periodically forced neural populations coupled by fast direct excitation and slow delayed inhibition.
Edit intent: clarity
Original:  With the aim of identifying a plausible minimal neural circuit that captures this phenomenon, we investigate a firing rate model consisting of two periodically forced neural populations coupled by fast direct excitation and slow delayed inhibition.
Revised:  With the aim of identifying a plausible minimal neural circuit that captures this phenomenon, we investigate a firing rate model with two periodically forced neural populations coupled by fast direct excitation and slow delayed inhibition.
Edit intent: clarity
Original:  We impose plausible parameter restrictions and link all states with perceptual interpretations based on the detection of threshold crossings . Regions of stimulus parameters occupied by states linked with each percept matches those found in behavioral experiments.
Revised:  We impose plausible parameter restrictions and link all states with perceptual interpretations . Regions of stimulus parameters occupied by states linked with each percept matches those found in behavioral experiments.
Edit intent: clarity
Original: We show that a randomly initialized neural network of *any architecture* has its Tangent Kernel  converge to a deterministic limit, as the network widths tend to infinity.
Revised: We prove that a randomly initialized neural network of *any architecture* has its Tangent Kernel converge to a deterministic limit, as the network widths tend to infinity.
Edit intent: clarity
Original:  To do so, we identify a commonly satisfied condition that rigorously justifies the usage of the  *gradient independence assumption (GIA)* (i. e. when a random matrix is assumed independent from its transpose) in this calculation .  Conversely, we give an example where this condition failsand GIA leads to incorrect answers.
Revised:  To do so, we identify a commonly satisfied condition that rigorously justifies the usage of the *gradient independence assumption (GIA)* . Conversely, we give an example where this condition failsand GIA leads to incorrect answers.
Edit intent: coherence
Original:  Based on this lemma, we derive Madam---a multiplicative version of the Adam optimiser---and show that it can train state of the art neural network architectures without learning rate tuning.
Revised:  Based on this lemma, we derive Madam -- a multiplicative version of the Adam optimiser---and show that it can train state of the art neural network architectures without learning rate tuning.
Edit intent: fluency
Original:  Based on this lemma, we derive Madam---a multiplicative version of the Adam optimiser---and show that it can train state of the art neural network architectures without learning rate tuning.
Revised:  Based on this lemma, we derive Madam---a multiplicative version of the Adam optimiser -- and show that it can train state of the art neural network architectures without learning rate tuning.
Edit intent: fluency
Original: Evolutionary game theory attempts to understand the stability of cooperation in spatially restricted populations.
Revised: The maintenance of cooperation in spatially restricted populations.
Edit intent: clarity
Original:  It is well recognised that the underlying graph topology significantly influences the outcome of such games .
Revised:  It is well-established that the underlying graph topology significantly influences the outcome of such games .
Edit intent: clarity
Original:  It is well recognised that the underlying graph topology significantly influences the outcome of such games .
Revised:  It is well recognised that the underlying graph topology can significantly influence the outcome of such games .
Edit intent: clarity
Original:  A natural yet unexplored question is whether the topology of the underlying structures on which the games are played possess no role whatsoever in the determination of payoffs.
Revised:  A natural yet unexplored question is whether the topology of the underlying structures on which the games are played , possesses no role whatsoever in the determination of payoffs.
Edit intent: fluency
Original:  We demonstrate that even with such a weak dependence, the basic game dynamics and indeed the very nature of the game may be altered  .
Revised:  We demonstrate that even with such a weak dependence, the fundamental game dynamics and indeed the very nature of the game may be altered .
Edit intent: fluency
Original:  If instead, we consider the average-case learning complexity, the bounds have a dependency on n as \Theta(n) for i.i.d. queries and \Theta(d \log(n)) for actively chosen queries by the learner.
Revised:  If instead, we consider the average-case learning complexity, the bounds have a dependency on n as \Theta(n) for queries and \Theta(d \log(n)) for actively chosen queries by the learner.
Edit intent: clarity
Original:  Prior works on MIMO-radar-MIMO-communications (MRMC) problem either focus on colocated MIMO radars and half-duplex/single-user MIMO communications, seek coexistence solutions, do not jointly design waveforms and receiver processing  or omit practical system constraints.
Revised:  Prior works on MIMO-radar-MIMO-communications (MRMC) problem either focus on colocated MIMO radars and half-duplex/single-user MIMO communications, seek coexistence solutions, do not jointly design radar codes and receiver processing or omit practical system constraints.
Edit intent: clarity
Original:  Prior works on MIMO-radar-MIMO-communications (MRMC) problem either focus on colocated MIMO radars and half-duplex/single-user MIMO communications, seek coexistence solutions, do not jointly design waveforms and receiver processing  or omit practical system constraints.
Revised:  Prior works on MIMO-radar-MIMO-communications (MRMC) problem either focus on colocated MIMO radars and half-duplex/single-user MIMO communications, seek coexistence solutions, do not jointly design waveforms and receiver processing , or omit practical system constraints.
Edit intent: fluency
Original:  To this end, we employ a novel performance measure, namely compounded-and-weighted sum mutual information (CWSM) , that is subjected to multiple practical constraints of UL/DL transmit power, UL/DL quality of service, and peak-to-average-power-ratio.
Revised:  To this end, we employ a novel performance measure, namely compounded-and-weighted sum mutual information , that is subjected to multiple practical constraints of UL/DL transmit power, UL/DL quality of service, and peak-to-average-power-ratio.
Edit intent: clarity