wanyu/IteraTeR_v2 huggingface dataset:
Original:  an open-source tool that implements a novel framework to learn a cell-to-cell similarity measure from single-cell RNA-seq data . SIMLR can be effectively used to perform tasks such as dimension reduction,
Revised:  an open-source tool that implements a novel framework to learn a sample-to-sample similarity measure from single-cell RNA-seq data . SIMLR can be effectively used to perform tasks such as dimension reduction,
Edit intent: clarity
Original:  clustering, and visualization of heterogeneous populations of cells . SIMLR was benchmarked against state-of-the-art methods for these three tasks on several public datasets, showing it to be scalable and capable of greatly improving clustering performance, as well as providing valuable insights by making the data more interpretable via better a visualization.
Revised:  clustering, and visualization of heterogeneous populations of samples . SIMLR was benchmarked against state-of-the-art methods for these three tasks on several public datasets, showing it to be scalable and capable of greatly improving clustering performance, as well as providing valuable insights by making the data more interpretable via better a visualization.
Edit intent: clarity
Original:  Availability and Implementation : SIMLR is available on GitHub in both R and MATLAB implementations.
Revised:  Availability and Implementation SIMLR is available on GitHub in both R and MATLAB implementations.
Edit intent: fluency
Original:  Finally, from the min-max objectives we derive novel formulations of dimensionality reduction using fractional matrix exponents .
Revised:  Finally, from the min-max optimization problem. We introduce a novel dimensionality reduction objective using fractional matrix exponents. To illustrate the generality of our approach, we apply it to a novel formulation of dimensionality reduction using fractional matrix exponents .
Edit intent: clarity
Original:  The computational role of zero synapses in unsupervised feature learning of unlabeled noisy data is still unclear, yet important to understand how the sparseness of synaptic activity is shaped during learning and its relationship with receptive field formation.
Revised:  The computational role of zero synapses in unsupervised feature learning of unlabeled noisy data is still unclear, thus it is important to understand how the sparseness of synaptic activity is shaped during learning and its relationship with receptive field formation.
Edit intent: coherence
Original:  Here, we formulate this kind of sparse feature learning by  statistical mechanics approach.
Revised:  Here, we formulate this kind of sparse feature learning by a statistical mechanics approach.
Edit intent: fluency
Original:  We find that learning decreases the fraction of zero synapses, and when the fraction decreases rapidly around a critical data size, the intrinsically structured receptive field starts to develop.
Revised:  We find that learning decreases the fraction of zero synapses, and when the fraction decreases rapidly around a critical data size, an intrinsically structured receptive field starts to develop.
Edit intent: fluency
Original:  This feature is discovered not only in  a handwritten digits dataset, but also in  retinal neural activity measured in a natural movie stimuli experiment.
Revised:  This phenomenon is discovered not only in a handwritten digits dataset, but also in retinal neural activity measured in a natural movie stimuli experiment.
Edit intent: clarity
Original:  This feature is discovered not only in  a handwritten digits dataset, but also in  retinal neural activity measured in a natural movie stimuli experiment.
Revised:  This feature is discovered not only in learning a handwritten digits dataset, but also in retinal neural activity measured in a natural movie stimuli experiment.
Edit intent: clarity
Original:  This feature is discovered not only in  a handwritten digits dataset, but also in  retinal neural activity measured in a natural movie stimuli experiment.
Revised:  This feature is discovered not only in a handwritten digits dataset, but also in retinal neural activity measured in a natural-movie-stimuli experiment.
Edit intent: fluency
Original:  We describe four families of problems for which some of the commonly used existing algorithms fail or suffer significant difficulty .
Revised:  We describe four families of problems for which some of the commonly used existing algorithms fail or suffer from significant difficulties .
Edit intent: fluency
Original:  In this paper, we propose a novel framework, called Semi-supervised Embedding in Attributed Networks with Outliers (SEANO), to learn a robust low-dimensional vector representation that  captures the topological proximity, attribute affinity and label similarity of vertices in a PLAN while accounting for outliers.
Revised:  In this paper, we propose a novel framework, called Semi-supervised Embedding in Attributed Networks with Outliers (SEANO), to learn a low-dimensional vector representation that captures the topological proximity, attribute affinity and label similarity of vertices in a PLAN while accounting for outliers.
Edit intent: clarity
Original:  In this paper, we propose a novel framework, called Semi-supervised Embedding in Attributed Networks with Outliers (SEANO), to learn a robust low-dimensional vector representation that  captures the topological proximity, attribute affinity and label similarity of vertices in a PLAN while accounting for outliers.
Revised:  In this paper, we propose a novel framework, called Semi-supervised Embedding in Attributed Networks with Outliers (SEANO), to learn a robust low-dimensional vector representation that systematically captures the topological proximity, attribute affinity and label similarity of vertices in a PLAN while accounting for outliers.
Edit intent: clarity
Original:  Experimental results on various datasets  demonstrate the advantages of SEANO over state-of-the-art methods in semi-supervised classification under both transductive and inductive settings.
Revised:  Experimental results on various datasets demonstrate the advantages of SEANO over state-of-the-art methods in semi-supervised classification under transductive as well as inductive settings.
Edit intent: clarity
Original:  We also show as a byproduct that SEANO can significantly outperform other methods when applied to the task of outlier detection .
Revised:  We also show as a byproduct that SEANO can significantly outperform baseline methods when applied to the task of outlier detection .
Edit intent: clarity
Original:  We also show as a byproduct that SEANO can significantly outperform other methods when applied to the task of outlier detection .
Revised:  We also show as a byproduct that SEANO can significantly outperform other methods when applied for detecting network outliers .
Edit intent: clarity
Original:  Finally, we present the use of SEANO in a challenging real-world setting - flood mapping of satellite images .
Revised:  Finally, we present the use of SEANO in a challenging real-world setting -- flood mapping of satellite images .
Edit intent: fluency
Original:  Qualitatively, we find that SEANO is able to outperform state-of-the-art remote sensing algorithms on this task.
Revised:  Qualitatively, we find that SEANO is able to outperform modern remote sensing algorithms on this task.
Edit intent: clarity
Original:  Qualitatively, we find that SEANO is able to outperform state-of-the-art remote sensing algorithms on this task.
Revised:  Qualitatively, we find that SEANO is able to outperform state-of-the-art remote sensing algorithms for this task.
Edit intent: fluency
Original: This paper introduces a novel method for automatically tuning the selection of compiler flags in order to optimize the performance of software that is intended to run on particular hardware platforms.
Revised: This paper introduces a novel method for automatically tuning the selection of compiler flags to optimize the performance of software that is intended to run on particular hardware platforms.
Edit intent: coherence
Original: This paper introduces a novel method for automatically tuning the selection of compiler flags in order to optimize the performance of software that is intended to run on particular hardware platforms.
Revised: This paper introduces a novel method for automatically tuning the selection of compiler flags in order to optimize the performance of software intended to run on particular hardware platforms.
Edit intent: clarity
Original: This paper introduces a novel method for automatically tuning the selection of compiler flags in order to optimize the performance of software that is intended to run on particular hardware platforms.
Revised: This paper introduces a novel method for automatically tuning the selection of compiler flags in order to optimize the performance of software that is intended to run on embedded hardware platforms.
Edit intent: clarity
Original:  and we show how our method outperforms the current industry standard -O3 optimization level across a diverse embedded system benchmark suitecalled BEEBS.
Revised:  and we show how our method outperforms the industry standard -O3 optimization level across a diverse embedded system benchmark suitecalled BEEBS.
Edit intent: clarity
Original:  We begin by conducting an investigatory study to quantify the potential gains by using existing iterative compilation approaches that time-intensively search for optimal configurations for each given benchmark.
Revised:  We begin by conducting an investigatory study to quantify the potential gains by using existing iterative compilation approaches that time-intensively search for optimal configurations for each benchmark.
Edit intent: clarity
Original:  Then we adapt iterative compilation to output a single configuration that optimizes performance across the entire benchmark suite as a whole .
Revised:  Then we adapt iterative compilation to output a single configuration that optimizes performance across the entire benchmark suite .
Edit intent: clarity
Original: Estimating distributions of labels associated with nodes (e.g., number of connections or citizenship of users in a social network ) in large graphs via sampling is a vital part of the study of complex networks.
Revised: Estimating distributions of node characteristics (labels) such as number of connections or citizenship of users in a social network ) in large graphs via sampling is a vital part of the study of complex networks.
Edit intent: clarity
Original:  Due to their low cost, sampling via random walks (RWs ) has been proposed as an attractive solution to this task.
Revised:  Due to its low cost, sampling via random walks (RWs ) has been proposed as an attractive solution to this task.
Edit intent: fluency
Original:  Due to their low cost, sampling via random walks (RWs ) has been proposed as an attractive solution to this task.
Revised:  Due to their low cost, sampling via a random walk (RW ) has been proposed as an attractive solution to this task.
Edit intent: fluency
Original:  We also propose an improved estimator of vertex label distributions which combines information from the initial walker locations with subsequent RW observations.
Revised:  We also propose an improved estimator of node label distributions that combines information from the initial walker locations with subsequent RW observations.
Edit intent: clarity
Original:  We evaluate DUFS, comparing it against other RW methods, investigating the impact of its parameters on estimation accuracy and providing practical guidelines for choosing them.
Revised:  We evaluate DUFS, compare it to other RW methods, investigating the impact of its parameters on estimation accuracy and providing practical guidelines for choosing them.
Edit intent: fluency
Original:  We evaluate DUFS, comparing it against other RW methods, investigating the impact of its parameters on estimation accuracy and providing practical guidelines for choosing them.
Revised:  We evaluate DUFS, comparing it against other RW methods, investigate the impact of its parameters on estimation accuracy and providing practical guidelines for choosing them.
Edit intent: fluency
Original:  We evaluate DUFS, comparing it against other RW methods, investigating the impact of its parameters on estimation accuracy and providing practical guidelines for choosing them.
Revised:  We evaluate DUFS, comparing it against other RW methods, investigating the impact of its parameters on estimation accuracy and provide practical guidelines for choosing them.
Edit intent: fluency
Original:  In estimating out-degree distributions, DUFS yields significantly better estimates of the head  than other methods, while matching or exceeding estimation accuracy of the tail.
Revised:  In estimating out-degree distributions, DUFS yields significantly better estimates of the head of the distribution than other methods, while matching or exceeding estimation accuracy of the tail.
Edit intent: clarity
Original:  Last, we show that DUFS outperforms VS when estimating distributions of node labels of the top 10\% largest degree nodes, even when uniform vertex sampling has the same cost as RW steps 
Revised:  Last, we show that DUFS outperforms uniform node sampling when estimating distributions of node labels of the top 10\% largest degree nodes, even when uniform vertex sampling has the same cost as RW steps 
Edit intent: clarity
Original:  Last, we show that DUFS outperforms VS when estimating distributions of node labels of the top 10\% largest degree nodes, even when uniform vertex sampling has the same cost as RW steps 
Revised:  Last, we show that DUFS outperforms VS when estimating distributions of node labels of the top 10\% largest degree nodes, even when sampling a node uniformly has the same cost as RW steps 
Edit intent: clarity
Original:  Last, we show that DUFS outperforms VS when estimating distributions of node labels of the top 10\% largest degree nodes, even when uniform vertex sampling has the same cost as RW steps 
Revised:  Last, we show that DUFS outperforms VS when estimating distributions of node labels of the top 10\% largest degree nodes, even when uniform vertex sampling has the same cost as RW steps .
Edit intent: fluency
Original: In ~ 1969, V. Strassen improves theclassical~2x2 matrix multiplication algorithm.
Revised: In 1969, V. Strassen improves theclassical~2x2 matrix multiplication algorithm.
Edit intent: fluency
Original:  Thecurrent upper bound for ~ 3x3 matrix multiplication wasreached by J.B. \ Laderman in 1976.
Revised:  Thecurrent upper bound for 3x3 matrix multiplication wasreached by J.B. \ Laderman in 1976.
Edit intent: clarity
Original:  Thecurrent upper bound for ~ 3x3 matrix multiplication wasreached by J.B. \ Laderman in 1976.
Revised:  Thecurrent upper bound for ~ 3x3 matrix multiplication wasreached by J.B. Laderman in 1976.
Edit intent: fluency
Original: In 1969, V. Strassen improves theclassical ~2x2 matrix multiplication algorithm.
Revised: In 1969, V. Strassen improves the classical ~2x2 matrix multiplication algorithm.
Edit intent: fluency
Original:  Thecurrent upper bound for 3x3 matrix multiplication wasreached by J.B. Laderman in 1976.
Revised:  The current upper bound for 3x3 matrix multiplication wasreached by J.B. Laderman in 1976.
Edit intent: fluency
Original:  Thecurrent upper bound for 3x3 matrix multiplication wasreached by J.B. Laderman in 1976.
Revised:  Thecurrent upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976.
Edit intent: fluency
Original:  This note presents a geometric relationship between Strassen andLaderman algorithms.
Revised:  This note presents a geometric relationship between Strassen and Laderman algorithms.
Edit intent: fluency
Original:  By doing so, we retrieve a geometric formulation ofresults very similar to those presented by O.
Revised:  By doing so, we retrieve a geometric formulation of results very similar to those presented by O.
Edit intent: fluency
Original:  With the expansion and improvement of video streaming services, cloud-based video is evolving into a necessary feature of any successful business for reaching internal and external audiences.
Revised:  With the expansion and improvement of video-streaming services, cloud-based video is evolving into a necessary feature of any successful business for reaching internal and external audiences.
Edit intent: fluency
Original:  Therefore based on the mentioned cases, we are going to review general issues of the design of an UASN in this paper.
Revised:  Therefore based on the mentioned cases, we are going to review general issues of the design of a UASN in this paper.
Edit intent: fluency
Original:  It has been established that the length of run is decided by a stiff response to temporal sensing of chemical cues along the pathway.
Revised:  It has been established that the length of run is decided by a stiff response to a temporal sensingof chemical cues along the pathway.
Edit intent: fluency
Original:  Thanks to both analytical arguments and numerical simulations, we show that the stationary homogeneous state of population density is destabilized in realistic ranges of parameters.
Edit intent: coherence
Original:  Other indicators are shown for traffic and communication performances in the case of a road network control where high gains are experienced in the simulation results.
Revised:  Other indicators are shown for road traffic performances in the case of a road network control where high gains are experienced in the simulation results.
Edit intent: clarity
Original:  Other indicators are shown for traffic and communication performances in the case of a road network control where high gains are experienced in the simulation results.
Revised:  Other indicators are shown for traffic and communication performances in the road network case, where high gains are experienced in the simulation results.
Edit intent: clarity
Original: 11p communication performances (end-to-end delay, output rate, throughput, and packet error delivery ratio ) are derived and illustrated in three dimension maps.
Revised: 11p communication performances (end-to-end delay, throughput ) are derived and illustrated in three dimension maps.
Edit intent: clarity
Original: The human brain is one of the most complex dynamic systems that enables us to communicate in natural language .
Revised: For the complex human brain that enables us to communicate in natural language .
Edit intent: clarity
Original:  We have a good understanding of some principles underlying natural languages and language processing, some knowledge about socio-cultural conditions framing acquisition, and some insights about where activity is occurring in the brain.
Revised:  We have a good understanding of some principles underlying natural languages and language processing, some knowledge about socio-cultural conditions , and insights about activity patterns in the brain.
Edit intent: clarity
Original:  In an effort to bridge the gap between insights from behavioural psychology and neuroscience, the goal of this paper is to contribute a computational understanding of the appropriate characteristics that favour language acquisition , in a brain-inspired neural architecture .
Revised:  In bridging the insights from behavioural psychology and neuroscience, the goal of this paper is to contribute a computational understanding of the appropriate characteristics that favour language acquisition , in a brain-inspired neural architecture .
Edit intent: clarity
Original:  In an effort to bridge the gap between insights from behavioural psychology and neuroscience, the goal of this paper is to contribute a computational understanding of the appropriate characteristics that favour language acquisition , in a brain-inspired neural architecture .
Revised:  In an effort to bridge the gap between insights from behavioural psychology and neuroscience, the goal of this paper is to contribute a computational understanding of appropriate characteristics that favour language acquisition , in a brain-inspired neural architecture .
Edit intent: fluency
Original:  In an effort to bridge the gap between insights from behavioural psychology and neuroscience, the goal of this paper is to contribute a computational understanding of the appropriate characteristics that favour language acquisition , in a brain-inspired neural architecture .
Revised:  In an effort to bridge the gap between insights from behavioural psychology and neuroscience, the goal of this paper is to contribute a computational understanding of the appropriate characteristics that favour language acquisition .
Edit intent: coherence
Original:  The model is capable of learning language production grounded in both, temporal dynamic somatosensation and vision.
Edit intent: coherence
Original:  Thus, this model features hierarchical concept abstraction in sensation as well as concept decompositionin production , multi-modal integration, and self-organisation of latent representations.
Revised:  Thus, this model features hierarchical concept abstraction , concept decomposition , multi-modal integration, and self-organisation of latent representations.
Edit intent: clarity
Original:  R-language software for our proposal is now available at URL and will be available soon on CRAN in the package LZeroSpikeInference.
Revised:  R-language software for our proposal is available on CRAN in the package LZeroSpikeInference.
Edit intent: clarity
Original:  Furthermore, our proposal leads to substantially better results than the previous \ell_1 proposal, on synthetic data as well as on two calcium imaging data sets.
Revised:  Furthermore, our proposal leads to substantial improvements over the previous \ell_1 proposal, on synthetic data as well as on two calcium imaging data sets.
Edit intent: clarity
Original:  Furthermore, our proposal leads to substantially better results than the previous \ell_1 proposal, on synthetic data as well as on two calcium imaging data sets.
Revised:  Furthermore, our proposal leads to substantially better results than the previous \ell_1 proposal, in simulations as well as on two calcium imaging data sets.
Edit intent: clarity
Original:  The search for the molecular mechanism of diauxie led to the discovery of the lac operon and gene regulation in general .
Revised:  The search for the molecular mechanism of diauxie led to the discovery of the lac operon .
Edit intent: clarity
Original:  However,  why microbes would bother to have different strategies of taking up nutrients remained a mystery .
Revised:  However, questions remain as why microbes would bother to have different strategies of taking up nutrients remained a mystery .
Edit intent: clarity
Original:  However,  why microbes would bother to have different strategies of taking up nutrients remained a mystery .
Revised:  However, why microbes would bother to have different strategies of taking up nutrients .
Edit intent: clarity
Original:  A model of optimal allocation of protein resources to achieve maximum growth quantitatively explains why and how the cell makes the choice when facing multiple carbon sources .
Revised:  A model of optimal allocation of protein resources quantitatively explains why and how the cell makes the choice when facing multiple carbon sources .
Edit intent: clarity
Original:  The transition is found to be the most cooperative and first-order like for sequences forming fibril-like structures.
Revised:  The transition is found to be the most cooperative for sequences forming fibril-like structures.
Edit intent: clarity
Original: In discrete modelling of biological network, Boolean variables are mainly used and many tools and theorems are available for analysis of  Boolean models.
Revised: Many discrete models of biological networks rely exclusively on Boolean variables and many tools and theorems are available for analysis of Boolean models.
Edit intent: clarity
Original:  We apply our method to construct a new Boolean counter-example to the  conjecture that a local negative circuit is necessary to generate sustained oscillations.
Revised:  We apply our method to construct a new Boolean counter-example to the well-known conjecture that a local negative circuit is necessary to generate sustained oscillations.
Edit intent: clarity