wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show how deep architectures with sample-level filters improve the accuracy in music auto-tagging and they provide results that are com- parable to previous state-of-the-art performances for the Magnatagatune dataset and Million song dataset .
Revised:  We show how deep architectures with sample-level filters improve the accuracy in music auto-tagging and they provide results that are com- parable to previous state-of-the-art performances for the Magnatagatune dataset and Million Song Dataset .
Edit intent: clarity
Original:  Our experiments show that using the combination of multi-level and multi-scale features is highly effective in music auto-tagging and the proposed method outperforms previous state-of-the-arts on the Magnatagatune dataset and the million song dataset .
Revised:  Our experiments show that using the combination of multi-level and multi-scale features is highly effective in music auto-tagging and the proposed method outperforms previous state-of-the-arts on the MagnaTagATune dataset and the million song dataset .
Edit intent: fluency
Original:  Our experiments show that using the combination of multi-level and multi-scale features is highly effective in music auto-tagging and the proposed method outperforms previous state-of-the-arts on the Magnatagatune dataset and the million song dataset .
Revised:  Our experiments show that using the combination of multi-level and multi-scale features is highly effective in music auto-tagging and the proposed method outperforms previous state-of-the-arts on the Magnatagatune dataset and the Million Song Dataset .
Edit intent: clarity
Original:  Experiments show that our proposed solutions can achieve 4\% improvement for a 44-layer plain network and almost 50\% improvement for a 110-layer plain network on the CIFAR-10 dataset .
Revised:  Experiments show that our proposed solutions can achieve 4\% improvement for a 44-layer and a 110-layer plain network on the CIFAR-10 dataset .
Edit intent: clarity
Original:  Experiments show that our proposed solutions can achieve 4\% improvement for a 44-layer plain network and almost 50\% improvement for a 110-layer plain network on the CIFAR-10 dataset .
Revised:  Experiments show that our proposed solutions can achieve 4\% improvement for a 44-layer plain network and almost 50\% improvement for a 110-layer plain networks on both the CIFAR-10 dataset .
Edit intent: clarity
Original: Multi-task learning employs shared representation of knowledge for learning multiple instances from the same or related problems.
Edit intent: coherence
Original:  Therefore, we introduce a new category of problem called dynamic time series prediction that requires a trained model to give prediction when presented with different values of the embedding dimension.
Revised:  Therefore, we introduce a new category of problem called dynamic time series prediction that requires a model to give prediction when presented with different values of the embedding dimension.
Edit intent: clarity
Original:  This enables neural networks to retain modularity during training for building blocks of knowledge for different instances of the problem .
Revised:  This enables neural networks to retain modularity during training for making a decision in situations even when certain inputs are missing .
Edit intent: clarity
Original:  The effectiveness of the proposed method is demonstrated using one-step-ahead chaotic time series problems.
Revised:  The effectiveness of the method is demonstrated using one-step-ahead chaotic time series problems.
Edit intent: clarity
Original: We investigate the relationship between several enumeration complexity classes and focus in particular on the incremental polynomial time and the polynomial delay (IncP and DelayP  ).
Revised: We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP ).
Edit intent: clarity
Original:  We prove for some algorithms that we can turn an average delay into a worst case delay  , suggesting that IncP_1 = DelayP even with a polynomially bounded memory.
Revised:  We prove for some algorithms , we can turn an average delay into a worst case delay , suggesting that IncP_1 = DelayP even with a polynomially bounded memory.
Edit intent: fluency
Original: In general, the quality of experience QoE is subjective and context-dependent , identifying and calculating the factors that affect QoE is  a difficult task.
Revised: The quality of experience QoE is subjective and context-dependent , identifying and calculating the factors that affect QoE is a difficult task.
Edit intent: coherence
Original: In general, the quality of experience QoE is subjective and context-dependent , identifying and calculating the factors that affect QoE is  a difficult task.
Revised: In general, the quality of experience (QoE) is known to be subjective and context-dependent , identifying and calculating the factors that affect QoE is a difficult task.
Edit intent: clarity
Original: In general, the quality of experience QoE is subjective and context-dependent , identifying and calculating the factors that affect QoE is  a difficult task.
Revised: In general, the quality of experience QoE is subjective and context-dependent . Identifying and calculating the factors that affect QoE is a difficult task.
Edit intent: fluency
Original: In general, the quality of experience QoE is subjective and context-dependent , identifying and calculating the factors that affect QoE is  a difficult task.
Revised: In general, the quality of experience QoE is subjective and context-dependent , identifying and calculating the factors that affect QoE is indeed a difficult task.
Edit intent: clarity
Original:  Recently, a lot of effort has been devoted to estimating the users QoE in order to enhance video delivery.
Revised:  Recently, a lot of effort has been devoted to estimate the users QoE in order to enhance video delivery.
Edit intent: fluency
Original:  Recently, a lot of effort has been devoted to estimating the users QoE in order to enhance video delivery.
Revised:  Recently, a lot of effort has been devoted to estimating the users QoE in order to improve video delivery.
Edit intent: clarity
Original:  In the literature, most of the QoE-driven optimization schemes that realize trade-offs among different quality metrics have been addressed under the assumption of homogenous populations , nevertheless, people perceptions on a given video quality may not be the same, which makes the QoE optimization harder.
Revised:  In the literature, most of the QoE-driven optimization schemes that realize trade-offs among different quality metrics have been addressed under the assumption of homogenous populations . Nevertheless, people perceptions on a given video quality may not be the same, which makes the QoE optimization harder.
Edit intent: fluency
Original:  This paper aims at taking a step further  to address this limitation to meet all the users profiles.
Revised:  This paper aims at taking a step further in order to address this limitation to meet all the users profiles.
Edit intent: coherence
Original:  This paper aims at taking a step further  to address this limitation to meet all the users profiles.
Revised:  This paper aims at taking a step further to address this limitation and meet users profiles.
Edit intent: clarity
Original:  We propose a closed-loop control framework based on the users subjective feedbacks to learn the QoE function and enhance video qualities at the same time.
Revised:  To do so, we propose a closed-loop control framework based on the users subjective feedbacks to learn the QoE function and enhance video qualities at the same time.
Edit intent: coherence
Original:  We propose a closed-loop control framework based on the users subjective feedbacks to learn the QoE function and enhance video qualities at the same time.
Revised:  We propose a closed-loop control framework based on the users (subjective) feedbacks to learn the QoE function and enhance video qualities at the same time.
Edit intent: fluency
Original:  We propose a closed-loop control framework based on the users subjective feedbacks to learn the QoE function and enhance video qualities at the same time.
Revised:  We propose a closed-loop control framework based on the users subjective feedbacks to learn the QoE function and optimize it at the same time.
Edit intent: clarity
Original:  Our simulation results show that our system converges to a steady state where the learned QoE-function noticeably enhances the users feedbacks.
Revised:  Our simulation results show that our system converges to a steady state , where the resulting QoE function noticeably improves the users feedbacks.
Edit intent: clarity
Original: In this work we explore the connection between Convolution Neural Networks , partial differential equations, multigrid/multiscale methods and and optimal control .
Revised: In this work we explore the connection between Convolution Neural Networks (CNNs) .
Edit intent: clarity
Original:  Based on a discrete kinetic network model, we use the integrated population flux balance method to derive the cNESS turnover rate for a conformation-modulated enzymatic reaction.
Revised:  Based on a discrete kinetic network model, we use the integrated probability flux balance method to derive the cNESS turnover rate for a conformation-modulated enzymatic reaction.
Edit intent: clarity
Original:  When conformational detailed balance is satisfied, the turnover rate reduces to the MM functional form, explaining its general validity for many enzymatic systems.
Revised:  When conformational detailed balance is satisfied, the turnover rate reduces to the MM functional form, explaining its validity for many enzymatic systems.
Edit intent: clarity
Original:  In addition , a one-to-one correspondence is shown between non-MM terms and combined cyclic loops with unbalanced conformational currents , revealing a unique relation between the cNESS turnover rate and the underlying network topology .
Revised:  For the first time , a one-to-one correspondence is shown between non-MM terms and combined cyclic loops with unbalanced conformational currents , revealing a unique relation between the cNESS turnover rate and the underlying network topology .
Edit intent: clarity
Original:  In addition , a one-to-one correspondence is shown between non-MM terms and combined cyclic loops with unbalanced conformational currents , revealing a unique relation between the cNESS turnover rate and the underlying network topology .
Revised:  In addition , a one-to-one correspondence is established between non-MM terms and combined cyclic loops with unbalanced conformational currents , revealing a unique relation between the cNESS turnover rate and the underlying network topology .
Edit intent: clarity
Original:  In addition , a one-to-one correspondence is shown between non-MM terms and combined cyclic loops with unbalanced conformational currents , revealing a unique relation between the cNESS turnover rate and the underlying network topology .
Revised:  In addition , a one-to-one correspondence is shown between non-MM terms and combined cyclic loops with unbalanced conformational currents .
Edit intent: clarity
Original:  Cooperativity resulting from nonequilibrium conformational dynamics , referred to as 'kinetic cooperativity,' has been observed in enzymatic reactions, and we provide a novel, rigorous approach for predicting and characterizing such behavior , which includes positive and negative cooperativity as well as substrate inhibition.
Revised:  Cooperativity resulting from nonequilibrium conformational dynamics has been observed in enzymatic reactions, and we provide a novel, rigorous approach for predicting and characterizing such behavior , which includes positive and negative cooperativity as well as substrate inhibition.
Edit intent: clarity
Original:  Cooperativity resulting from nonequilibrium conformational dynamics , referred to as 'kinetic cooperativity,' has been observed in enzymatic reactions, and we provide a novel, rigorous approach for predicting and characterizing such behavior , which includes positive and negative cooperativity as well as substrate inhibition.
Revised:  Cooperativity resulting from nonequilibrium conformational dynamics , referred to as 'kinetic cooperativity,' has been observed in enzymatic reactions, and we provide a novel, rigorous means of predicting and characterizing such behavior , which includes positive and negative cooperativity as well as substrate inhibition.
Edit intent: clarity
Original: In this note, we characterize the embeddability of general Kimura 3ST Markov matrices in terms of their eigenvalues.
Revised: In this note, we characterize the embeddability of generic Kimura 3ST Markov matrices in terms of their eigenvalues.
Edit intent: fluency
Original:  As a consequence, we are able to compute the volume of such matrices and compare it to the volume of all Markov matrices within the model.
Revised:  As a consequence, we are able to compute the volume of such matrices relative to the volume of all Markov matrices within the model.
Edit intent: clarity
Original:  Moreover, we provide an example showing that, in general, mutation rates are not identifiable from substitution probabilities under the Kimura 3ST model.
Revised:  We also provide examples showing that, in general, mutation rates are not identifiable from substitution probabilities under the Kimura 3ST model.
Edit intent: coherence
Original:  This example also illustrates that symmetries between mutation probabilities do not necessarily translate into symmetries between the corresponding mutation rates.
Revised:  This example also illustrates that symmetries between mutation probabilities do not necessarily arise from symmetries between the corresponding mutation rates.
Edit intent: clarity
Original: Rascal is a programming language that aims to simplify software language engineering  such as program analysis and transformation.
Revised: Rascal is a programming language that aims to simplify software language engineering tasks such as program analysis and transformation.
Edit intent: clarity
Original:  The debate on the impact factor and its use in research evaluations is very important, but this debate should not be based on misplaced statistical arguments  .
Revised:  The debate on the impact factor and its use in research evaluations , but the discussion should not be based on misplaced statistical arguments .
Edit intent: coherence
Original:  In fact, our computer simulationsdemonstrate the possibility that the impact factor is a more accurate indicator of the value of an article than the number of citations the article has received .
Revised:  Using computer simulations, we demonstrate that under certain conditions the number of citations an article has received is a more accurate indicator of the value of an article than the number of citations the article has received .
Edit intent: clarity
Original:  In fact, our computer simulationsdemonstrate the possibility that the impact factor is a more accurate indicator of the value of an article than the number of citations the article has received .
Revised:  In fact, our computer simulationsdemonstrate the possibility that the impact factor is a more accurate indicator of the value of the article than the number of citations the article has received .
Edit intent: fluency
Original:  Currently, fiber-optic cables carry about 99%DIFDELCMD < \\%%% %DIF < of global Internet traffic.
Revised:  %DIFDELCMD < \\%%% %DIF < of global Internet traffic.
Edit intent: coherence
Original:  In this work, we consider the actual information provided by the Indian meteorological department (IMD) on seismic zones, and earthquakes occurred in the past in India, and propose a scheme , called seismic zone aware node relocation (SZANR), to improve the survivability of the existing Indian optical network through minute changes in network topology.
Revised:  In this work, we consider the actual information provided by the Indian meteorological department (IMD) on seismic zones, and earthquakes occurred in the past in India, and propose a scheme to improve the survivability of the existing Indian optical network through minute changes in network topology.
Edit intent: coherence
Original:  We take Indian RailTel optical network as a case study in this work.
Edit intent: coherence
Original:  Simulations show significant improvement in the network survivability can be achieved using the proposed SZANR in events of earthquakes.
Revised:  Simulations show significant improvement in the network survivability can be achieved using the proposed scheme in events of earthquakes.
Edit intent: clarity
Original:  In this paper, we present some new estimates for the spectrum of an arbitrary matrix after perturbation.
Revised:  In this paper, we establish new perturbation bounds to characterize the variation of the spectrum of an arbitrary matrix after perturbation.
Edit intent: clarity
Original: The^{n\times n} be a normal matrix with spectrum \{i\}_{i=1}^{n}, and let }A^{n\times n} be a perturbed matrix with spectrum \{}\lambda\}_{i=1}^{n}.
Revised: The^{n\times n} be a normal matrix with spectrum \{i\}_{i=1}^{n}, and let }A^{n\times n} be a perturbed matrix with spectrum \{}\lambda_{i\}_{i=1}^{n}.
Edit intent: fluency
Original: Progress in Multiple Object Tracking (MOT) has been  limited by the size of the available datasets.
Revised: Progress in Multiple Object Tracking (MOT) has been historically limited by the size of the available datasets.
Edit intent: clarity
Original:  A novel path supervision paradigm lets the annotator loosely track the object with a cursor while watching the video .
Revised:  In our novel path supervision paradigm lets the annotator loosely track the object with a cursor while watching the video .
Edit intent: coherence
Original:  A novel path supervision paradigm lets the annotator loosely track the object with a cursor while watching the video .
Revised:  A novel path supervision the annotator loosely track the object with a cursor while watching the video .
Edit intent: clarity
Original:  A novel path supervision paradigm lets the annotator loosely track the object with a cursor while watching the video .
Revised:  A novel path supervision paradigm lets the annotator loosely follows the object with a cursor while watching the video .
Edit intent: fluency
Original:  A novel path supervision paradigm lets the annotator loosely track the object with a cursor while watching the video .
Revised:  A novel path supervision paradigm lets the annotator loosely track the object with the cursor while watching the video .
Edit intent: fluency
Original:  These path annotations , together with object detections, are fed into a two-step optimization to produce full bounding-box trajectories.
Revised:  Our approach is able to turn such weak annotations into dense box trajectories.
Edit intent: clarity
Original:  Our experiments on existing datasets prove that our framework produces more accurate annotations than the state of the art and this in a fraction of the time.
Revised:  Our experiments on existing datasets prove that our framework produces more accurate annotations than the state of the art , in a fraction of the time.
Edit intent: coherence
Original:  We believe tracking approaches can benefit from a larger dataset like this one, just as was the case in object recognition.
Revised:  Tracking approaches can benefit from a larger dataset like this one, just as was the case in object recognition.
Edit intent: clarity
Original:  We believe tracking approaches can benefit from a larger dataset like this one, just as was the case in object recognition.
Revised:  We believe tracking approaches can benefit training on such large-scale datasets, as did object recognition.
Edit intent: clarity
Original:  We show its potential by using it to retrain an off-the-shelf person matching network, originally trained on the MOT15 dataset, almost halving the misclassification rate.
Revised:  We prove this by re-training an off-the-shelf person matching network, originally trained on the MOT15 dataset, almost halving the misclassification rate.
Edit intent: clarity
Original:  In the latter, where we improve the top-performing tracker (NOMT) dropping the number of ID Switches by 18\% and fragments by 5\%.
Revised:  On the latter, where we improve the top-performing tracker (NOMT) dropping the number of ID Switches by 18\% and fragments by 5\%.
Edit intent: fluency
Original:  In the latter, where we improve the top-performing tracker (NOMT) dropping the number of ID Switches by 18\% and fragments by 5\%.
Revised:  In the latter, we improve the top-performing tracker (NOMT) dropping the number of ID Switches by 18\% and fragments by 5\%.
Edit intent: fluency
Original:  In the latter, where we improve the top-performing tracker (NOMT) dropping the number of ID Switches by 18\% and fragments by 5\%.
Revised:  In the latter, where we improve the top-performing tracker (NOMT) dropping the number of IDSwitches by 18\% and fragments by 5\%.
Edit intent: fluency
Original:  We find that heterogeneous distributions of attractiveness facilitate the spreading of the contagion process.
Revised:  We find that heterogeneous distributions of attractiveness alter the contagion process.
Edit intent: clarity
Original:  This effect is particularly strong in realistic scenarios where the two variables are positively correlated.
Revised:  In particular, in case of uncorrelated and positive correlations between the two variables are positively correlated.
Edit intent: clarity
Original:  The results presented contribute to the understanding of the dynamical properties of time-varying networks and their effects on contagion phenomena unfolding on their fabric 
Revised:  The results presented contribute to the understanding of the dynamical properties of time-varying networks and their effects on contagion phenomena unfolding on their fabric .
Edit intent: fluency
Original:  Our method outperforms the state-of-the-art unsupervised models on most benchmark tasks, and on many tasks even beats supervised models, highlighting the robustness of the produced  sentence embeddings.
Revised:  Our method outperforms the state-of-the-art unsupervised models on most benchmark tasks, highlighting the robustness of the produced sentence embeddings.
Edit intent: coherence
Original: We describe the Customer Life Time Value (CLTV) prediction system deployed at ASOS.com, a global online fashion retailer.
Revised: We describe the Customer LifeTime Value (CLTV) prediction system deployed at ASOS.com, a global online fashion retailer.
Edit intent: fluency
Original:  We describe our system, which adopts this approach, and our ongoing efforts to further improve it.
Edit intent: coherence
Original:  The estimated twist-bend coupling coefficient from oxDNA simulations is G=30 (1) nm, in agreement with the value obtained from a recent analysis of magnetic tweezers data (G=40(10) nm) \pm1 .
Revised:  The estimated twist-bend coupling coefficient from oxDNA simulations is G=30 \pm1 .
Edit intent: coherence
Original: We characterize a class of fully coupled forward backward stochastic differential equations in terms of optimal maximal sub-solutions of BSDEs.
Revised: We provide a verification and characterization result of optimal maximal sub-solutions of BSDEs in terms of fully coupled forward backward stochastic differential equations in terms of optimal maximal sub-solutions of BSDEs.
Edit intent: clarity
Original:  We provide some explicit examples and show how to quantify the costs of incompleteness when using utility indifference pricing  .
Revised:  We show with explicit examples how to quantify the costs of incompleteness when using utility indifference pricing .
Edit intent: clarity
Original:  We found further that T^*_{\rm cr}\propto -{\rm SCD}, where SCD is a recently proposed "sequence charge decoration" parameter that is determined solely by sequence information.
Revised:  Moreover, T^*_{\rm cr}\propto -{\rm SCD}, where SCD is a recently proposed "sequence charge decoration" parameter that is determined solely by sequence information.
Edit intent: coherence