wanyu/IteraTeR_v2 huggingface dataset:
Original:  The comparison, performed on the segmented lesions by means of most of the metrics normally used with respect to the ground-truth and the 7 human raters in MSSEG, prove that there is no significant difference between the proposed framework and the other raters.
Revised:  The comparison, performed on the segmented lesions by means of most of the metrics normally used with respect to the ground-truth and the 7 human raters , proves that there is no significant difference between the proposed framework and the other raters.
Edit intent: clarity
Original:  Results are also shown for the uncertainty , though a comparison with the other raters is impossible  .
Revised:  Results are also shown for the uncertainty , though a comparison with the raters is impossible .
Edit intent: clarity
Original:  We compare our approach to various neural image and feature compression baselines in three vision tasks and found that it achieves better supervised rate-distortion performance while also maintaining smaller end-to-end latency.
Revised:  We compare our approach to various neural image and feature compression baselines in three vision tasks and found that it achieves better supervised rate-distortion performance while maintaining smaller end-to-end latency.
Edit intent: clarity
Original:  In the past few years, Transformer neural networks (Transformer) have shown the unique merit of capturing the global long distance dependencies across the entire image as a new deep learning paradigm.
Revised:  In the past few years, Transformer neural networks (Transformer) have shown the unique merit of capturing the global long-distance dependencies across the entire image as a new deep learning paradigm.
Edit intent: fluency
Original:  However, there have been very few, if any, studies that have systematically evaluated the current Transformer based approaches in pathological image segmentation.
Revised:  However, there have been very few, if any, studies that have systematically evaluated the current Transformer-based approaches in pathological image segmentation.
Edit intent: coherence
Original:  In particular, Segmenter, Swin-Transformer and TransUNet, all transformer-based, came out as the best performers among the twelve evaluated models.
Revised:  In particular, Segmenter, Swin-Transformer and TransUNet-all transformer-based-came out as the best performers among the twelve evaluated models.
Edit intent: fluency
Original: We present in this work a fully Transformer-based reinforcement learning generator-evaluator architecture for neural question generation.
Edit intent: coherence
Original:  Question generation is a  task that consists in generating questions given a context and answer.
Revised:  Question generation is a task that consists in generating a context-aware question given a context and answer.
Edit intent: clarity
Original:  Evaluation metrics for language modeling only based on n-gram overlapping do not consider semantic relations between reference and candidate strings .
Revised:  Evaluation metrics for language modelling only based on n-gram overlapping do not consider semantic relations between reference and candidate strings .
Edit intent: fluency
Original:  Evaluation metrics for language modeling only based on n-gram overlapping do not consider semantic relations between reference and candidate strings .
Revised:  Evaluation metrics for language modeling only based on n-gram overlapping do not consider semantic relations between reference and candidate sequences .
Edit intent: clarity
Original:  To improve the evaluation step, we assess our model for both n-gram overlap using BLEU and semantically using BERTScore and NUBIA , a novel state-of-the-art evaluation metric for text generation .
Revised:  To improve the evaluation step, a two-fold evaluation was carried out. On the one side, an n-gram overlap using BLEU and semantically using BERTScore and NUBIA , a novel state-of-the-art evaluation metric for text generation .
Edit intent: coherence
Original:  Question generation could be used in many downstream applications , including in extending question answering datasets,  conversational systems, and educational assessment systems  .
Revised:  Question generation could be used in many downstream applications , including in extending question answering datasets, the improvement of conversational systems, and educational assessment systems .
Edit intent: clarity
Original: This work proposes a numerical method to verify differential privacy in estimation with performance guarantees.
Revised: This work proposes an algorithmic method to verify differential privacy in estimation with performance guarantees.
Edit intent: clarity
Original: This work proposes a numerical method to verify differential privacy in estimation with performance guarantees.
Revised: This work proposes a numerical method to verify differential privacy for estimation mechanisms with performance guarantees.
Edit intent: clarity
Original:  which makes it hard to distinguish outputs produced by close inputs.
Revised:  which makes it hard to distinguish outputs of a mechanism produced by adjacent inputs.
Edit intent: clarity
Original:  While obtaining theoretical conditions that guarantee  privacy may be possible, verifying these in practice can be hard.
Revised:  While obtaining theoretical conditions that guarantee privacy may be possible, evaluating these conditions in practice can be hard.
Edit intent: clarity
Original:  To address this problem, we propose a data-driven, test framework for continuous-range mechanisms that i) finds a highly-likely, compact event set, as well as a partition of this event, and ii) evaluates differential privacy wrt this partition.
Revised:  To address this problem, we propose a data-driven, test framework for continuous range mechanisms first finds a highly-likely, compact event set, as well as a partition of this event, and ii) evaluates differential privacy wrt this partition.
Edit intent: clarity
Original:  To address this problem, we propose a data-driven, test framework for continuous-range mechanisms that i) finds a highly-likely, compact event set, as well as a partition of this event, and ii) evaluates differential privacy wrt this partition.
Revised:  To address this problem, we propose a data-driven, test framework for continuous-range mechanisms that i) finds a highly-likely, compact event set, as well as a partition of this event, and then evaluates differential privacy wrt this partition.
Edit intent: clarity
Original:  This results into a type of approximate differential privacy with high confidence, which we are able to quantify precisely.
Revised:  This results into a type of differential privacy with high confidence, which we are able to quantify precisely.
Edit intent: clarity
Original: In this paper, we  develop a new class of high-order energy-preserving schemes for the Korteweg-de Vries equation based on the quadratic auxiliary variable technique, which can conserve the original energy of the system.
Revised: In this paper, we present a quadratic auxiliary variable approach to develop a new class of high-order energy-preserving schemes for the Korteweg-de Vries equation based on the quadratic auxiliary variable technique, which can conserve the original energy of the system.
Edit intent: clarity
Original: In this paper, we  develop a new class of high-order energy-preserving schemes for the Korteweg-de Vries equation based on the quadratic auxiliary variable technique, which can conserve the original energy of the system.
Revised: In this paper, we develop a new class of energy-preserving schemes for the Korteweg-de Vries equation based on the quadratic auxiliary variable technique, which can conserve the original energy of the system.
Edit intent: clarity
Original:  By introducing a quadratic auxiliary variable , the original system is reformulated into an equivalent form with a modified quadratic energy, where the way of the introduced variable naturally produces a quadratic invariant of the new system.
Revised:  By introducing a quadratic auxiliary variable approach is first proposed to reformulate the original model into an equivalent form with a modified quadratic energy, where the way of the introduced variable naturally produces a quadratic invariant of the new system.
Edit intent: clarity
Original:  A class of Runge-Kutta methods satisfying the symplectic condition is applied to discretize the reformulated model in time, arriving at arbitrarily high-order schemes , which naturally conserve the modified quadratic energy and the produced quadratic invariant .
Revised:  A class of Runge-Kutta methods are directly employed for the reformulated model to arrive at a new kind of time semi-discrete schemes for the original problem .
Edit intent: clarity
Original:  In order to match the high order precision of time , the Fourier pseudo-spectral method is employed for spatial discretization, resulting in fully discrete energy-preserving schemes.
Revised:  In addition , the Fourier pseudo-spectral method is employed for spatial discretization, resulting in fully discrete energy-preserving schemes.
Edit intent: coherence
Original:  In order to match the high order precision of time , the Fourier pseudo-spectral method is employed for spatial discretization, resulting in fully discrete energy-preserving schemes.
Revised:  In order to match the high order precision of time , the Fourier pseudo-spectral method is used for spatial discretization, resulting in fully discrete energy-preserving schemes.
Edit intent: style
Original:  To solve the proposed nonlinear schemes effectively, we present a very efficient practically-structure-preserving iterative technique, which not only greatly saves the calculation cost, but also achieves the purpose of practically preserving structure.
Revised:  To implement the proposed methods effectively, we present a very efficient practically-structure-preserving iterative technique, which not only greatly saves the calculation cost, but also achieves the purpose of practically preserving structure.
Edit intent: clarity
Original:  To solve the proposed nonlinear schemes effectively, we present a very efficient practically-structure-preserving iterative technique, which not only greatly saves the calculation cost, but also achieves the purpose of practically preserving structure.
Revised:  To solve the proposed nonlinear schemes effectively, we present a very efficient iterative technique, which not only greatly saves the calculation cost, but also achieves the purpose of practically preserving structure.
Edit intent: fluency
Original: Efficient processing of high-resolution video streams is safety-critical for many robotics applications such as autonomous driving.
Revised: Efficient processing of high-res video streams is safety-critical for many robotics applications such as autonomous driving.
Edit intent: fluency
Original:  On the autonomous driving datasets Argoverse-HD and BDD100K, we show our proposed method boosts the detection AP over standard Faster R-CNN,  with and without finetuning.
Revised:  On the autonomous driving datasets Argoverse-HD and BDD100K, our proposed method boosts the detection AP over standard Faster R-CNN, with and without finetuning.
Edit intent: clarity
Original:  On the autonomous driving datasets Argoverse-HD and BDD100K, we show our proposed method boosts the detection AP over standard Faster R-CNN,  with and without finetuning.
Revised:  On the autonomous driving datasets Argoverse-HD and BDD100K, we show our proposed method boosts the detection AP over standard Faster R-CNN, both with and without finetuning.
Edit intent: coherence
Original:  Additionally, building on top of the previous state-of-the-art in streaming detection, our method sets a new record for streaming AP on Argoverse-HD (from 17.8 to 23.0 on a GTX 1080 Ti GPU), suggesting that it has achieved a superior accuracy-latency tradeoff .
Revised:  Additionally, building on top of the previous state-of-the-art in streaming detection, our method sets a new record for streaming AP on Argoverse-HD (from 17.8 to 23.0 on a GTX 1080 Ti GPU), a metric designed to capture both accuracy and latency .
Edit intent: clarity
Original:  These methods have been shown to effectively model the semantic matching between queries and passages, also in presence of keyword mismatch, i.e. passages that are relevant to a query but do not contain important query tokens .
Revised:  These methods have been shown to effectively model the semantic matching between queries and passages, also in presence of keyword mismatch, i.e. passages that are relevant to a query but do not contain important query keywords .
Edit intent: clarity
Original: One-stage object detectors rely on the point feature to predict the detection results.
Revised: One-stage object detectors rely on a point feature to predict the detection results.
Edit intent: fluency
Original:  However, the point feature may lack the information of the whole object and lead to a misalignment between the object and the point feature.
Revised:  However, the point feature often lacks the information of the whole object and lead to a misalignment between the object and the point feature.
Edit intent: clarity
Original:  However, the point feature may lack the information of the whole object and lead to a misalignment between the object and the point feature.
Revised:  However, the point feature may lack the information of the whole object , thereby leading to a misalignment between the object and the point feature.
Edit intent: clarity
Original:  In this paper , we propose a simple and plug-in operator that could generate aligned and disentangled features for each task, respectively, without breaking the fully convolutional manner.
Revised:  Both of these two problems hinder the detection performance. In order to solve these two problems , we propose a simple and plug-in operator that could generate aligned and disentangled features for each task, respectively, without breaking the fully convolutional manner.
Edit intent: coherence
Original:  In this paper , we propose a simple and plug-in operator that could generate aligned and disentangled features for each task, respectively, without breaking the fully convolutional manner.
Revised:  In this paper , we propose a simple and plug-in operator that can generate aligned and disentangled features for each task, respectively, without breaking the fully convolutional manner.
Edit intent: fluency
Original:  By predicting two task-aware point sets that are located in each sensitive region, this operator could disentangle the two tasks from the spatial dimension , as well as align the point feature with the object .
Revised:  By predicting two task-aware point sets that are located in each sensitive region, the proposed operator can align the point feature with the object and disentangle the two tasks from the spatial dimension , as well as align the point feature with the object .
Edit intent: clarity
Original:  By predicting two task-aware point sets that are located in each sensitive region, this operator could disentangle the two tasks from the spatial dimension , as well as align the point feature with the object .
Revised:  By predicting two task-aware point sets that are located in each sensitive region, this operator could disentangle the two tasks from the spatial dimension .
Edit intent: clarity
Original:  We also reveal an interesting finding of the opposite effect of the long-range skip-connection for classification and regression , respectively.
Revised:  We also reveal an interesting finding of the opposite effect of the long-range skip connection for classification and regression , respectively.
Edit intent: fluency
Original:  Based on the object-aligned and task-disentangled operator (OAT), we propose OAT-Net, which explicitly exploits point-set features for more accurate detection results.
Revised:  Based on the object-aligned and task-disentangled operator (OAT), we propose OAT-Net, which explicitly exploits point-set features for accurate detection results.
Edit intent: clarity
Original:  Notably, OAT-Net achieves 53.7 AP with Res2Net-101-DCN backbone and shows promising performance gain for small objects .
Revised:  Notably, OAT-Net with Res2Net-101-DCN backbone and shows promising performance gain for small objects .
Edit intent: clarity
Original:  Among the many emerging Post-Moore computing candidates, perhaps none is as salient as the Field-Programmable Gate Array (FPGA), which offers the means of specializing and customizing the hardware to the computation at hand.
Revised:  Among the many emerging Post-Moore computing candidates, perhaps none is as salient as the Field-Programmable Gate Array (FPGA), which offers the means of specializing and customizing the hardware to the computation at hand.
Edit intent: fluency
Original:  Finally, we propose a novel I/O-reducing technique where we compute geometric factors on the fly, which yields significant (700+ GFlop/s) single-precision performance and an upwards of 2x reduction in runtime for the local evaluation of the Laplace operator.
Revised:  Finally, we propose a novel data movement-reducing technique where we compute geometric factors on the fly, which yields significant (700+ GFlop/s) single-precision performance and an upwards of 2x reduction in runtime for the local evaluation of the Laplace operator.
Edit intent: clarity
Original:  Unlike prior work -- which often focuses on accelerating small kernels -- we target the entire unstructured Poisson solver based on the high-fidelity spectral element method (SEM) used in modern state-of-the-art CFD systems.
Revised:  Unlike prior work -- which often focuses on accelerating small kernels -- we target the entire Poisson solver on unstructured meshes based on the high-fidelity spectral element method (SEM) used in modern state-of-the-art CFD systems.
Edit intent: clarity
Original:  Finally, we propose a novel data movement-reducing technique where we compute geometric factors on the fly, which yields significant (700+ GFlop /s) single-precision performance and an upwards of 2x reduction in runtime for the local evaluation of the Laplace operator.
Revised:  Finally, we propose a data movement-reducing technique where we compute geometric factors on the fly, which yields significant (700+ GFlop /s) single-precision performance and an upwards of 2x reduction in runtime for the local evaluation of the Laplace operator.
Edit intent: clarity
Original:  Finally, we propose a novel data movement-reducing technique where we compute geometric factors on the fly, which yields significant (700+ GFlop /s) single-precision performance and an upwards of 2x reduction in runtime for the local evaluation of the Laplace operator.
Revised:  Finally, we propose a novel data movement-reducing technique where we compute geometric factors on the fly, which yields significant (700+ Gflop /s) single-precision performance and an upwards of 2x reduction in runtime for the local evaluation of the Laplace operator.
Edit intent: fluency
Original:  These are coordinate-position independent metrics and suitable for the folded codes introduced by Guruswami and Redra.
Revised:  These are coordinate-position independent pseudometrics and suitable for the folded codes introduced by Guruswami and Redra.
Edit intent: clarity
Original:  These are coordinate-position independent pseudometrics and suitable for the folded codes introduced by Guruswami and Redra .
Revised:  These are coordinate-position independent pseudometrics and suitable for the folded codes introduced by Guruswami and Rudra .
Edit intent: fluency
Original: In this paper motivated from subspace coding we introduce subspace-metric  and subset-metric codes.
Revised: In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes.
Edit intent: fluency
Original:  These are coordinate-position independent pseudometrics and suitable for the folded codes introduced by Guruswami and Rudra .
Revised:  These are coordinate-position independent pseudometrics and suitable for the folded codes .
Edit intent: coherence
Original:  The half-Singleton upper bounds for linear subspace-metric and subset-metric codes are proved.
Revised:  The half-Singleton upper bounds for linear subspace-metric codes and linear subset-metric codes are proved.
Edit intent: clarity
Original:  Our subspace-metric and subset-metric codes can be used to construct systemic explicit well-structured insertion-deletion codes .
Revised:  Our subspace-metric codes or subset-metric codes can be used to construct systemic explicit well-structured insertion-deletion codes .
Edit intent: fluency
Original:  Our subspace-metric and subset-metric codes can be used to construct systemic explicit well-structured insertion-deletion codes .
Revised:  Our subspace-metric and subset-metric codes can be used to construct explicit well-structured insertion-deletion codes .
Edit intent: clarity
Original:  By analysing the subset distances of folded codes from evaluation codes of linear mappings, we prove that they have high subset distances and then are explicit good insertion-deletion codes 
Revised:  By analysing the subset distances of folded codes from evaluation codes of linear mappings, we prove that they have high subset distances and then are explicit good insertion-deletion codes .
Edit intent: fluency
Original: A new metric BaryScore to evaluate text generation based on deep contextualized embeddings (e.g. , BERT, Roberta, ELMo) is introduced.
Revised: A new metric BaryScore to evaluate text generation based on deep contextualized embeddings e.g. , BERT, Roberta, ELMo) is introduced.
Edit intent: fluency
Original: A new metric BaryScore to evaluate text generation based on deep contextualized embeddings (e.g. , BERT, Roberta, ELMo) is introduced.
Revised: A new metric BaryScore to evaluate text generation based on deep contextualized embeddings (e.g. , BERT, Roberta, ELMo) is introduced.
Edit intent: fluency
Original:  This metric is motivated by a new framework relying on optimal transport tools, i.e. , Wasserstein distance and barycenter.
Revised:  This metric is motivated by a new framework relying on optimal transport tools, i.e. , Wasserstein distance and barycenter.
Edit intent: fluency
Original:  In addition, it provides theoretical grounds to our metric and offers an alternative to available solutions (e.g. , MoverScore and BertScore).
Revised:  In addition, it provides theoretical grounds to our metric and offers an alternative to available solutions e.g. , MoverScore and BertScore).
Edit intent: fluency
Original:  In addition, it provides theoretical grounds to our metric and offers an alternative to available solutions (e.g. , MoverScore and BertScore).
Revised:  In addition, it provides theoretical grounds to our metric and offers an alternative to available solutions (e.g. , MoverScore and BertScore).
Edit intent: fluency
Original: As online social platforms increasingly impact society, scholars and activists have criticized the centralized and unaccountable nature of many of their governance structures.
Revised: Many have criticized the centralized and unaccountable nature of many of their governance structures.
Edit intent: clarity
Original:  In this work, we characterize the landscape of different multi-level governance structures in online social platforms, drawing from extensive literature on taxonomies of multi-level offline institutions, including administrative hierarchy, federalism, and polycentricity.
Revised:  In this work, we characterize the landscape of existing platforms through the lens of multi-level governance structures in online social platforms, drawing from extensive literature on taxonomies of multi-level offline institutions, including administrative hierarchy, federalism, and polycentricity.
Edit intent: clarity