wanyu/IteraTeR_v2 huggingface dataset:
Original:  The theory is checked by testing a vision model that actually follows the modular program suggested in Carandini& Heeger12 .
Revised:  The theory is checked by testing a vision model that actually follows the modular program suggested by Carandini& Heeger12 .
Edit intent: fluency
Original:  To stress the generality of this modular setting we show examples where some of the canonical Divisive Normalization modules are substituted by equivalent modules such as the Wilson-Cowan model %DIFDELCMD < [%%% Wilson Cowan J.Biophys.
Revised:  To stress the generality of this modular setting we show examples where some of the canonical Divisive Normalization layers are substituted by equivalent modules such as the Wilson-Cowan model %DIFDELCMD < [%%% Wilson Cowan J.Biophys.
Edit intent: clarity
Original:  To stress the generality of this modular setting we show examples where some of the canonical Divisive Normalization modules are substituted by equivalent modules such as the Wilson-Cowan model %DIFDELCMD < [%%% Wilson Cowan J.Biophys.
Revised:  To stress the generality of this modular setting we show examples where some of the canonical Divisive Normalization modules are substituted by equivalent layers such as the Wilson-Cowan model %DIFDELCMD < [%%% Wilson Cowan J.Biophys.
Edit intent: clarity
Original:  To stress the generality of this modular setting we show examples where some of the canonical Divisive Normalization modules are substituted by equivalent modules such as the Wilson-Cowan model %DIFDELCMD < [%%% Wilson Cowan J.Biophys.
Revised:  To stress the generality of this modular setting we show examples where some of the canonical Divisive Normalization modules are substituted by equivalent modules such as the Wilson-Cowan model %DIFDELCMD < [%%% Cowan J.Biophys.
Edit intent: fluency
Original: 72%DIFDELCMD < ] %%% (at the V1 cortex) or a tone-mapping model %DIFDELCMD < [%%% Cyriac SPIE 15 ( at the retina ).
Revised: 72%DIFDELCMD < ] %%% at V1 cortex) or a tone-mapping model %DIFDELCMD < [%%% Cyriac SPIE 15 ( at the retina ).
Edit intent: fluency
Original: 72%DIFDELCMD < ] %%% (at the V1 cortex) or a tone-mapping model %DIFDELCMD < [%%% Cyriac SPIE 15 ( at the retina ).
Revised: 72%DIFDELCMD < ] %%% (at the V1 , or a tone-mapping model %DIFDELCMD < [%%% Cyriac SPIE 15 ( at the retina ).
Edit intent: clarity
Original: 72%DIFDELCMD < ] %%% (at the V1 cortex) or a tone-mapping model %DIFDELCMD < [%%% Cyriac SPIE 15 ( at the retina ).
Revised: 72%DIFDELCMD < ] %%% (at the V1 cortex) or a tone-mapping model %DIFDELCMD < [%%% Cyriac SPIE 15 at the retina ).
Edit intent: fluency
Original:  We discuss three illustrative applications: (a) we show how the Jacobian (w.r.t. the input) allows novel psychophysics based on the geometry of the neural representation (as in Malo%DIFDELCMD < &%%% Simoncelli SPIE 15 );
Revised:  We discuss three illustrative applications: (a) we show how the Jacobian (w.r.t. the input) allows novel psychophysics based on the geometry of the neural representation (as in %DIFDELCMD < &%%% Simoncelli SPIE 15 );
Edit intent: fluency
Original:  We directly model the signal in the time-domain using  encoder-decoder framework and perform the source separation on nonnegative encoder outputs.
Revised:  We directly model the signal in the time-domain using an encoder-decoder framework and perform the source separation on nonnegative encoder outputs.
Edit intent: fluency
Original:  In our approach, the representation of a nucleobase consists of a point particle for the phosphate group and an anisotropic particle for the nucleoside.
Revised:  In our approach, the representation of a nucleotide consists of a point particle for the phosphate group and an anisotropic particle for the nucleoside.
Edit intent: clarity
Original:  We compare, using numerical experiments, the presented algorithm to state-of-the-art algorithms for regression over manifolds and show its potential.
Revised:  Using numerical experiments, the presented algorithm to state-of-the-art algorithms for regression over manifolds and show its potential.
Edit intent: coherence
Original:  We compare, using numerical experiments, the presented algorithm to state-of-the-art algorithms for regression over manifolds and show its potential.
Revised:  We compare, using numerical experiments, we compare the presented method to state-of-the-art algorithms for regression over manifolds and show its potential.
Edit intent: clarity
Original:  The approximation scheme is based upon the Manifold Moving Least-Squares (MMLS) . The proposed algorithm is resistant to noise in both the domain and function values.
Revised:  We use the Manifold Moving Least-Squares (MMLS) . The proposed algorithm is resistant to noise in both the domain and function values.
Edit intent: clarity
Original:  In addition, the proposed algorithm is linear in time with respect to the ambient-space's dimension.
Revised:  In addition, the proposed algorithm has linear time complexity with respect to the ambient-space's dimension.
Edit intent: clarity
Original:  Thus, in case of extremely large ambient space dimension, we are able to avoid the curse of dimensionality without having to perform non-linear dimension reduction, which  introduces distortions to the manifold data.
Revised:  Thus, we are able to avoid the curse of dimensionality without having to perform non-linear dimension reduction, which introduces distortions to the manifold data.
Edit intent: coherence
Original:  Most videos lack sound event labels at segment level, however, a significant number of them do respond to text queries, from a match found to their metadata by the search engine .
Revised:  Most videos lack sound event labels at segment level, however, a significant number of them do respond to text queries, from a match found using metadata by search engines .
Edit intent: clarity
Original:  In this paper we explore the extent to which a search query could be used as the true label for the presence of sound events in the videos.
Revised:  In this paper we explore the extent to which a search query can be used as the true label for the presence of sound events in the videos.
Edit intent: fluency
Original:  In this paper we explore the extent to which a search query could be used as the true label for the presence of sound events in the videos.
Revised:  In this paper we explore the extent to which a search query could be used as the true label for detection of sound events in the videos.
Edit intent: clarity
Original:  The datasets are used to train three classifiers, which were then run on 3.7 million  video segments.
Revised:  The datasets are used to train three classifiers, and we obtain a prediction on 3.7 million video segments.
Edit intent: clarity
Original:  We evaluated performance using the search query as the true label and compare it (on a subset) with human labeling.
Revised:  We evaluated performance using the search query as true label and compare it (on a subset) with human labeling.
Edit intent: fluency
Original:  We evaluated performance using the search query as the true label and compare it (on a subset) with human labeling.
Revised:  We evaluated performance using the search query as the true label and compare it with human labeling.
Edit intent: clarity
Original:  Both types  exhibited close performance, to within 10\%, and similar performance trends as the number of evaluated segments increased .
Revised:  Both types exhibited close performance, to within 10\%, and similar performance trend with increasing number of evaluated segments increased .
Edit intent: clarity
Original:  Both types  exhibited close performance, to within 10\%, and similar performance trends as the number of evaluated segments increased .
Revised:  Both types exhibited close performance, to within 10\%, and similar performance trends as the number of evaluated segments .
Edit intent: clarity
Original:  Hence, our experiments show potential for using search query as a preliminary true label for sound events in web videos.
Revised:  Hence, our experiments show potential for using search query as a preliminary true label for sound event recognition in web videos.
Edit intent: clarity
Original: In this note we propose an efficient method to compress a high dimensional function into a tensor ring format, based on alternating least-squares (ALS).
Revised: In this paper we propose an efficient method to compress a high dimensional function into a tensor ring format, based on alternating least-squares (ALS).
Edit intent: clarity
Original:  We also show that a related problem of checking whether a partial DFA is synchronizing is PSPACE-complete .
Revised:  We also consider a related problem of checking whether a partial DFA is synchronizing is PSPACE-complete .
Edit intent: clarity
Original:  We also show that a related problem of checking whether a partial DFA is synchronizing is PSPACE-complete .
Revised:  We also show that a related problem of checking whether a partial DFA .
Edit intent: clarity
Original: We revisit the behavior of a prototypical model of balanced activity in networks of spiking neurons .
Revised: We revisit the dynamics of a prototypical model of balanced activity in networks of spiking neurons .
Edit intent: clarity
Original:  A detailed study of an appropriate thermodynamic limit for fixed density of connections  shows that, when inhibition prevails, the asymptotic regime is  characterized by a self-sustained irregular, macroscopic (collective) dynamics rather than being asynchronous.
Revised:  A detailed investigation of the thermodynamic limit for fixed density of connections shows that, when inhibition prevails, the asymptotic regime is characterized by a self-sustained irregular, macroscopic (collective) dynamics rather than being asynchronous.
Edit intent: clarity
Original:  A detailed study of an appropriate thermodynamic limit for fixed density of connections  shows that, when inhibition prevails, the asymptotic regime is  characterized by a self-sustained irregular, macroscopic (collective) dynamics rather than being asynchronous.
Revised:  A detailed study of an appropriate thermodynamic limit for fixed density of connections shows that, when inhibition prevails, the asymptotic regime is not asynchronous but rather characterized by a self-sustained irregular, macroscopic (collective) dynamics rather than being asynchronous.
Edit intent: clarity
Original: Cooperation is ubiquitous in every level of living organisms.
Revised: Cooperation is ubiquitous at every level of living organisms.
Edit intent: clarity
Original:  To address this problem, a previous study proposed a numerical metric, called Average Gradient of Selection (AGoS) . AGoS can characterize and forecast the evolutionary fate of cooperation at a population level .
Revised:  To address this problem, a previous study proposed a numerical metric, Average Gradient of Selection (AGoS) . AGoS can characterize and forecast the evolutionary fate of cooperation at a population level .
Edit intent: coherence
Original:  Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may occur to strategies of individuals on networks.
Revised:  Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks.
Edit intent: clarity
Original:  Moreover, we found that scale-free networks are  most vulnerable to mutation and thus the dynamics of cooperation is altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.
Revised:  Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation is altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.
Edit intent: fluency
Original:  Moreover, we found that scale-free networks are  most vulnerable to mutation and thus the dynamics of cooperation is altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.
Revised:  Moreover, we found that scale-free networks are most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.
Edit intent: fluency
Original:  A recently proposed numerical metric, Average Gradient of Selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space.
Revised:  A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space.
Edit intent: fluency
Original: Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces  transfer.
Revised: Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer.
Edit intent: clarity
Original:  To address this issue we introduce the routing network paradigm, a novel neural network unit and training algorithm.
Revised:  To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm.
Edit intent: clarity
Original:  Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when the router decides to stop or a fixed recursion depth is reached.
Revised:  Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when a fixed recursion depth is reached.
Edit intent: clarity
Original:  Our experiments demonstrate  significant improvement in accuracy  with sharper convergence over challenging joint training baselines for these tasks .
Revised:  Our experiments demonstrate a significant improvement in accuracy with sharper convergence over challenging joint training baselines for these tasks .
Edit intent: fluency
Original:  Our experiments demonstrate  significant improvement in accuracy  with sharper convergence over challenging joint training baselines for these tasks .
Revised:  Our experiments demonstrate significant improvement in accuracy , with sharper convergence over challenging joint training baselines for these tasks .
Edit intent: fluency
Original:  The first of these results implies that the Legitimate Deck Problem (from the study of graph reconstruction) is in LWPP (and thus low for PP, i.e., \rm PP ^\mbox{Legitimate Deck = PP) if the weakened version of the Reconstruction Conjecture holds in which the number of nonisomorphic preimages is assumed merely to be polynomially bounded.
Revised:  The first of these results implies that the Legitimate Deck Problem (from the study of graph reconstruction) is in LWPP (and thus low for PP, i.e., \rm PP ^{\mbox{Legitimate Deck = PP) if the weakened version of the Reconstruction Conjecture holds in which the number of nonisomorphic preimages is assumed merely to be polynomially bounded.
Edit intent: fluency
Original:  Moreover, in this process we also set state-of-art results on Audioset dataset .
Revised:  Moreover, we show that our methods are helpful in capturing semantic meanings and relations as well .
Edit intent: clarity
Original:  Our model trains efficiently from audios of variable lengths which ;
Revised:  Our model trains efficiently from audios of variable lengths ;
Edit intent: clarity
Original:  We show that even off-the-shelf representations using the proposed CNN model generalizes well enough to reach human level accuracy on ESC-50 sound events dataset  .
Revised:  We show that the learned representations using the proposed CNN model generalizes well enough to reach human level accuracy on ESC-50 sound events dataset .
Edit intent: clarity
Original:  We further use them for acoustic scene classification task and once again show that our proposed approaches suits well for this task as well.
Revised:  We further use them for acoustic scene classification task and once again show that our proposed approaches suit well for this task as well.
Edit intent: fluency
Original:  Moreover, we show that our methods are helpful in capturing semantic meanings and relations as well  .
Revised:  We also show that our methods are helpful in capturing semantic meanings and relations as well .
Edit intent: coherence
Original: Falsely identifying different authors as one is called merging error in the name disambiguation of coauthorship networks . Research on the measurement and distribution of merging errors helps to collect high quality coauthorship networks.
Revised: Robust analysis of coauthorship networks . Research on the measurement and distribution of merging errors helps to collect high quality coauthorship networks.
Edit intent: clarity
Original: It has been well established the theoretical analysis for the noise-induced consensus of the local-rule based Hegselmann-Krause (HK) dynamics in finite space.
Revised: The Hegselmann-Krause (HK) dynamics in finite space.
Edit intent: coherence
Original:  However, when system states are allowed in the infinite space, severe mathematical difficulties arise , and the problem remains open .
Revised:  However, when system states are allowed to exist in an unbounded space, mathematical difficulties arise , and the problem remains open .
Edit intent: clarity
Original:  One such active mechanism inherent to many liquid environments is fluid flow.
Edit intent: clarity
Original:  Flow models are often over-simplified, e.g., assuming one-dimensional diffusion with constant drift.
Revised:  Flow models are often over-simplified, assuming one-dimensional diffusion with constant drift.
Edit intent: coherence
Original:  For a qualitative understanding of the relevant physical effects inherent to these channels a systematic framework is provided based on the Peclet number and the ratio of transmitter-receiver distance to duct radius.
Revised:  For a qualitative understanding of the relevant physical effects inherent to these channels , based on the Peclet number and the ratio of transmitter-receiver distance to duct radius.
Edit intent: clarity
Original:  For a qualitative understanding of the relevant physical effects inherent to these channels a systematic framework is provided based on the Peclet number and the ratio of transmitter-receiver distance to duct radius.
Revised:  For a qualitative understanding of the relevant physical effects inherent to these channels a systematic framework is provided based on the Peclet number and the transmitter-receiver distance to duct radius.
Edit intent: clarity
Original:  For several molecular communication setups, we highlight the effect of different flow scenarios on the channel impulse response  .
Revised:  For these two regimes, analytical expressions for the channel impulse response .
Edit intent: clarity
Original: We define a novel metric, mutual information in frequency (MI-in-frequency), to detect and quantify the statistical dependence between different frequency components in the data  and apply it to electrophysiological recordings from the brain to infer cross-frequency coupling.
Revised: We define a metric, mutual information in frequency (MI-in-frequency), to detect and quantify the statistical dependence between different frequency components in the data and apply it to electrophysiological recordings from the brain to infer cross-frequency coupling.
Edit intent: clarity
Original:  The current metrics used to quantify the cross-frequency coupling in neuroscience cannot detect statistical independence in frequency between nonlinear recordings .
Revised:  The current metrics used to quantify the cross-frequency coupling in neuroscience cannot detect if two frequency components in non-Gaussian brain recordings are statistically independent or not .
Edit intent: clarity
Original:  Our MI-in-frequency metric, based on Shannon's mutual information between the Cram\'{e 's representation of stochastic processes, overcomes this shortcoming .
Revised:  Our MI-in-frequency metric, based on Shannon's mutual information between the Cramer 's representation of stochastic processes, overcomes this shortcoming .
Edit intent: fluency
Original:  We describe two data-driven estimators of MI-in-frequency: one based on kernel density estimation and the other based on the nearest neighbor algorithm and validate their performance on linear and nonlinear models .
Revised:  We describe two data-driven estimators of MI-in-frequency: one based on kernel density estimation and the other based on the nearest neighbor algorithm and validate their performance on simulated data .
Edit intent: clarity
Original:  We then use MI-in-frequency to estimate mutual information between two data streams that are dependent across time, without making  parametric model assumptions.
Revised:  We then use MI-in-frequency to estimate mutual information between two data streams that are dependent across time, without making any parametric model assumptions.
Edit intent: coherence
Original:  Finally, we use the MI-in-frequency metric to investigate the cross-frequency coupling in seizure onset zone from electrocorticographic recordings during seizures.
Revised:  Finally, we use the MI-in- frequency metric to investigate the cross-frequency coupling in seizure onset zone from electrocorticographic recordings during seizures.
Edit intent: fluency
Original:   For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations.
Revised:  and For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations.
Edit intent: fluency
Original:   For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations.
Revised:  For the class of 2-terminal directed acyclic graphs (TDAGs) our two definitions coincide, and the class is closed under both operations.
Edit intent: clarity
Original:  The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with parallel-width at most k , which generalizes earlier characterizations of series-parallel graphs .
Revised:  The usefulness of our directed minor operations is demonstrated by characterizing all TDAGs with parallel-width at most k , which generalizes earlier characterizations of series-parallel graphs .
Edit intent: clarity
Original:  The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with parallel-width at most k , which generalizes earlier characterizations of series-parallel graphs .
Revised:  The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with serial-parallel width at most k , which generalizes earlier characterizations of series-parallel graphs .
Edit intent: clarity
Original:  We show NP-hardness for several classic graph problems on point visibility graphs such as Feedback Vertex Set, Longest Induced Path, Bisection and F-free Vertex Deletion (for certain sets ~ F).
Revised:  We show NP-hardness for several classic graph problems on point visibility graphs such as Feedback Vertex Set, Longest Induced Path, Bisection and F-free Vertex Deletion (for certain sets F).
Edit intent: clarity
Original: This article describes a method for quickly computing the solution to the regularized optimal transport problem.
Revised: This article describes a set of methods for quickly computing the solution to the regularized optimal transport problem.
Edit intent: clarity
Original:  It generalizes and improves upon the widely-used iterative Bregman projections algorithm (or Sinkhorn-Knopp algorithm).
Revised:  It generalizes and improves upon the widely-used iterative Bregman projections algorithm (or Sinkhorn--Knopp algorithm).
Edit intent: fluency