wanyu/IteraTeR_v2 huggingface dataset:
Original:  The new methods are based on performing a time step with a conventional time-stepping scheme  followed by a truncation operation into a tensor manifold with prescribed rank.
Revised:  The new methods are based on performing a time step with a conventional time-stepping scheme followed by a truncation operation onto a tensor manifold with prescribed rank.
Edit intent: fluency
Original:  By considering such truncation operation as a nonlinear operator in the space of tensors , we prove various consistency results and errors estimates for a wide range of step-truncation algorithms.
Revised:  By considering such truncation operation as a nonlinear operator in the space of tensors , we prove convergence of a wide range of step-truncation algorithms.
Edit intent: clarity
Original: Recently, E-commerce platforms have extensive impacts on our human life.
Revised:  E-commerce platforms have extensive impacts on our human life.
Edit intent: coherence
Original:  To provide an efficient platform, one of the most fundamental problem is how to balance the demand and supply in market segments  .
Revised:  To provide an efficient platform, one of the most fundamental problems is how to balance the demand and supply in market segments .
Edit intent: fluency
Original:  While conventional machine learning models have achieved a great success on data-sufficient segments, it may fail in a large-portion of segments in E-commerce platforms, where there are not sufficient records to learn well-trained models.
Revised:  While conventional machine learning models have achieved great success on data-sufficient segments, it may fail in a large-portion of segments in E-commerce platforms, where there are not sufficient records to learn well-trained models.
Edit intent: fluency
Original:  The goal is to facilitate the learning process in the target segments even facing a shortage of related training data by leveraging the learned knowledge from data-sufficient source segments.
Revised:  The goal is to facilitate the learning process in the target segments by leveraging the learned knowledge from data-sufficient source segments.
Edit intent: clarity
Original:  The multi-pattern fusion network considers both local and global temporal patterns for segment demand prediction.
Revised:  The multi-pattern fusion network considers both local and seasonal temporal patterns for segment demand prediction.
Edit intent: clarity
Original:  In the meta-learning paradigm, the transferable knowledge is regarded as the model parameter initializations of MPFN, which are learned from diverse source segments.
Revised:  In the meta-learning paradigm, transferable knowledge is regarded as the model parameter initializations of MPFN, which are learned from diverse source segments.
Edit intent: fluency
Original:  In the meta-learning paradigm, the transferable knowledge is regarded as the model parameter initializations of MPFN, which are learned from diverse source segments.
Revised:  In the meta-learning paradigm, the transferable knowledge is regarded as the model parameter initialization of MPFN, which are learned from diverse source segments.
Edit intent: fluency
Original:  Furthermore, we capture the segment relations by combining data-driven segment representation and segment knowledge graph representation and tailor the segment-specific relations to customize transferable model parameter initializations .
Revised:  Furthermore, we capture the segment relations by combining data-driven segment representation and segment knowledge graph representation and tailor the segment-specific relations to customize transferable model parameter initialization .
Edit intent: fluency
Original:  Extensive experiments are conducted on two large-scale industrial datasets.
Revised:  We conduct extensive experiments on two large-scale industrial datasets.
Edit intent: clarity
Original:  The results show that our RMLDP outperforms a set of state-of-the-art baselines.
Revised:  The results justify that our RMLDP outperforms a set of state-of-the-art baselines.
Edit intent: clarity
Original:  In addition , RMLDP has also been deployed in Taobao, a real-world E-commerce platform.
Revised:  Besides , RMLDP has also been deployed in Taobao, a real-world E-commerce platform.
Edit intent: coherence
Original:  In addition , RMLDP has also been deployed in Taobao, a real-world E-commerce platform.
Revised:  In addition , RMLDP has been deployed in Taobao, a real-world E-commerce platform.
Edit intent: clarity
Original:  Due to uncertainties in practice such as unknown file popularities, cache placement scheme design is still an open problem with unresolved challenges: 1) how to maintain time-averaged storage costs under budgets, 2) how to incorporate online learning to aid cache placement to minimize performance loss (a.k.a. regret), and 3) how to exploit offline history information to further reduce regret.
Revised:  Due to uncertainties in practice such as unknown file popularities, cache placement scheme design is still an open problem with unresolved challenges: 1) how to maintain time-averaged storage costs under budgets, 2) how to incorporate online learning to aid cache placement to minimize performance loss (a.k.a. regret), and 3) how to exploit offline historical information to further reduce regret.
Edit intent: fluency
Original:  To solve the problem, we employ virtual queue techniques to manage time-averaged  constraints, and adopt data-driven bandit learning methods to integrate offline history information into online learning to handle exploration-exploitation tradeoff.
Revised:  To solve the problem, we employ virtual queue techniques to manage time-averaged constraints, and adopt history-aware bandit learning methods to integrate offline history information into online learning to handle exploration-exploitation tradeoff.
Edit intent: clarity
Original:  To solve the problem, we employ virtual queue techniques to manage time-averaged  constraints, and adopt data-driven bandit learning methods to integrate offline history information into online learning to handle exploration-exploitation tradeoff.
Revised:  To solve the problem, we employ virtual queue techniques to manage time-averaged constraints, and adopt data-driven bandit learning methods to integrate offline historical information into the online learning procedure to handle the exploration-exploitation tradeoff.
Edit intent: clarity
Original:  With an effective combination of online control and data-driven online learning, we devise a Cache Placement scheme with Data-driven Bandit Learning called CPDBL . Our theoretical analysis and simulations show that CPDBL achieves a sublinear time-averaged regret under long-term storage cost constraints .
Revised:  With an effective combination of online control and data-driven online learning, we devise a Cache Placement scheme with History-aware Bandit Learning called CPDBL . Our theoretical analysis and simulations show that CPDBL achieves a sublinear time-averaged regret under long-term storage cost constraints .
Edit intent: clarity
Original:  With an effective combination of online control and data-driven online learning, we devise a Cache Placement scheme with Data-driven Bandit Learning called CPDBL . Our theoretical analysis and simulations show that CPDBL achieves a sublinear time-averaged regret under long-term storage cost constraints .
Revised:  With an effective combination of online control and data-driven online learning, we devise a Cache Placement scheme with Data-driven Bandit Learning called CPHBL . Our theoretical analysis and simulations show that CPDBL achieves a sublinear time-averaged regret under long-term storage cost constraints .
Edit intent: clarity
Original:  With an effective combination of online control and data-driven online learning, we devise a Cache Placement scheme with Data-driven Bandit Learning called CPDBL . Our theoretical analysis and simulations show that CPDBL achieves a sublinear time-averaged regret under long-term storage cost constraints .
Revised:  With an effective combination of online control and data-driven online learning, we devise a Cache Placement scheme with Data-driven Bandit Learning called CPDBL . Our theoretical analysis and simulations show that CPHBL achieves a sublinear time-averaged regret under long-term storage cost constraints .
Edit intent: clarity
Original: In multi-tiered fog computing systems, to accelerate the processing of computation-intensive tasks for real-time IoT applications, resource-limited IoT devices can offload part of their workloads to nearby fog nodes, \%with greater computation capacities, whereafter such workloads may be offloaded to upper-tier fog nodes with greater computation capacities.
Revised: In multi-tiered fog computing systems, to accelerate the processing of computation-intensive tasks for real-time IoT applications, resource-limited IoT devices can offload part of their workloads to nearby fog nodes, whereafter such workloads may be offloaded to upper-tier fog nodes with greater computation capacities.
Edit intent: coherence
Original:  One way to construct a cooperative Nash equilibrium is to find a ` friendly rivalry ' strategy, which aims at full cooperation but never allows the co-players to be better off.
Revised:  One way to construct a cooperative Nash equilibrium is to find a ` friendly-rivalry ' strategy, which aims at full cooperation but never allows the co-players to be better off.
Edit intent: fluency
Original: Generalizing the passing number construction by Sauer, we give a short proof of the fact that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees  .
Revised: We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees .
Edit intent: coherence
Original:  This is the first case where big Ramsey degrees are known to be finite for structures in  non-binary language.
Revised:  This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language.
Edit intent: fluency
Original:  Our proof is based on  vector (or product) form of the Milliken's tree theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
Revised:  Our proof is based on the vector (or product) form of the Milliken's tree theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
Edit intent: fluency
Original:  Our proof is based on  vector (or product) form of the Milliken's tree theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
Revised:  Our proof is based on vector (or product) form of Milliken's tree theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
Edit intent: fluency
Original:  Our proof is based on  vector (or product) form of the Milliken's tree theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
Revised:  Our proof is based on vector (or product) form of the Milliken's Tree Theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
Edit intent: fluency
Original:  In the previous decade Facebook data contributed to significant evolution of social network research . Paired with this topic we have experienced growing popularity in the link prediction techniques, which are important tools in link mining and analysis.
Revised:  Its data contributed to significant evolution of social network research . Paired with this topic we have experienced growing popularity in the link prediction techniques, which are important tools in link mining and analysis.
Edit intent: coherence
Original:  In the previous decade Facebook data contributed to significant evolution of social network research . Paired with this topic we have experienced growing popularity in the link prediction techniques, which are important tools in link mining and analysis.
Revised:  In the previous decade Facebook data contributed to significant evolution of social network research and link prediction techniques, which are important tools in link mining and analysis.
Edit intent: clarity
Original:  This paper gives a comprehensive overview of link prediction analysis on the Facebook100 network , which was derived in 2005.
Revised:  This paper gives the first comprehensive analysis of link prediction analysis on the Facebook100 network , which was derived in 2005.
Edit intent: clarity
Original:  This paper gives a comprehensive overview of link prediction analysis on the Facebook100 network , which was derived in 2005.
Revised:  This paper gives a comprehensive overview of link prediction on the Facebook100 network , which was derived in 2005.
Edit intent: clarity
Original:  This paper gives a comprehensive overview of link prediction analysis on the Facebook100 network , which was derived in 2005.
Revised:  This paper gives a comprehensive overview of link prediction analysis on the Facebook100 network .
Edit intent: coherence
Original:  Further we discuss our approach and present results . Lastly, we compare and review our models, where overall performance and classification rates are presented.
Revised:  Further we discuss our approach and present results . Lastly, we compare and review applied models, where overall performance and classification rates are presented.
Edit intent: clarity
Original:  We study chaotic and periodic nature of cyclic quantum walks and focus on an unique situation wherein a periodic quantum walk on  3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph  .
Revised:  We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph .
Edit intent: fluency
Original:  We study chaotic and periodic nature of cyclic quantum walks and focus on an unique situation wherein a periodic quantum walk on  3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph  .
Revised:  We study chaotic and periodic nature of cyclic quantum walks and focus on an unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph .
Edit intent: fluency
Original:  While many algorithms can be ported to a GPU in a simple and direct fashion, such efforts have resulted in inefficent and inaccurate versions of UMAP.
Revised:  While many algorithms can be ported to a GPU in a simple and direct fashion, such efforts have resulted in inefficient and inaccurate versions of UMAP.
Edit intent: fluency
Original:  A comparison principle and C^{2,1} smoothness for the solution are established by penalty approximation method.
Revised:  The C^{2,1} smoothness for the solution are established by penalty approximation method.
Edit intent: coherence
Original:  We find that the surplus-time space can be divided into three non-overlapping regions by a ceded risk and time dependent reinsurance barrier and a time dependent dividend-payout barrier.
Revised:  We find that the surplus-time space can be divided into three non-overlapping regions by a ceded risk and time dependent reinsurance barrier and a time-dependent dividend-payout barrier.
Edit intent: fluency
Original:  exposed to all risk once surplus upward crosses the reinsurance barrier;
Revised:  exposed to all the risks once surplus upward crosses the reinsurance barrier;
Edit intent: fluency
Original:  We also present a prototype implementation that can automatically infer these bounds .
Revised:  We also present a prototype implementation that can automatically infer these bounds 
Edit intent: fluency
Original: Many epidemiological models predict high morbidity levels based on an epidemic's fast initial spread rate .
Revised: Empirical studies show that epidemiological models based on an epidemic's fast initial spread rate .
Edit intent: clarity
Original: Many epidemiological models predict high morbidity levels based on an epidemic's fast initial spread rate .
Revised: Many epidemiological models predict high morbidity levels based on an epidemic's initial spread rate .
Edit intent: clarity
Original:  We find an extremely heterogeneous distribution of computer susceptibility , with nearly all outbreaks starting at its tail and collapsing quickly once it is exhausted .
Revised:  We find an extremely heterogeneous distribution of computer susceptibilities , with nearly all outbreaks starting at its tail and collapsing quickly once it is exhausted .
Edit intent: fluency
Original:  We find an extremely heterogeneous distribution of computer susceptibility , with nearly all outbreaks starting at its tail and collapsing quickly once it is exhausted .
Revised:  We find an extremely heterogeneous distribution of computer susceptibility , with nearly all outbreaks initially over-affecting the tail of the distribution, then collapsing quickly once it is exhausted .
Edit intent: clarity
Original:  We find an extremely heterogeneous distribution of computer susceptibility , with nearly all outbreaks starting at its tail and collapsing quickly once it is exhausted .
Revised:  We find an extremely heterogeneous distribution of computer susceptibility , with nearly all outbreaks starting at its tail and collapsing quickly once this tail is depleted .
Edit intent: clarity
Original:  This mechanism annuls the correlation between an epidemic's initial growth rate and its total reach and prevents the majority of epidemics  from reaching a macroscopic fraction of the population.
Revised:  This mechanism restricts the correlation between an epidemic's initial growth rate and its total reach and prevents the majority of epidemics from reaching a macroscopic fraction of the population.
Edit intent: clarity
Original:  This mechanism annuls the correlation between an epidemic's initial growth rate and its total reach and prevents the majority of epidemics  from reaching a macroscopic fraction of the population.
Revised:  This mechanism annuls the correlation between an epidemic's initial growth rate and its total reach , thus preventing the majority of epidemics from reaching a macroscopic fraction of the population.
Edit intent: coherence
Original:  The few pervasive malwares distinguish themselves early by avoiding infecting the tail and preferentially targeting computers unaffected by typical malware.
Revised:  The few pervasive malwares distinguish themselves early on via the following key trait: they avoid infecting the tail and preferentially targeting computers unaffected by typical malware.
Edit intent: clarity
Original:  The few pervasive malwares distinguish themselves early by avoiding infecting the tail and preferentially targeting computers unaffected by typical malware.
Revised:  The few pervasive malwares distinguish themselves early by avoiding infecting the tail , while preferentially targeting computers unaffected by typical malware.
Edit intent: coherence
Original:  Our analysis on more than 26 million COVID-19 tweets show that large-scale surveillance of public discourse is feasible with computationally lightweight classifiers by out-of-the-box utilization of these representations.
Revised:  Our analysis on more than 26 million COVID-19 tweets shows that large-scale surveillance of public discourse is feasible with computationally lightweight classifiers by out-of-the-box utilization of these representations.
Edit intent: fluency
Original: We propose three different data driven approaches for pricing European style call options using supervised machine-learning algorithms.
Revised: We propose three different data-driven approaches for pricing European style call options using supervised machine-learning algorithms.
Edit intent: fluency
Original: We propose three different data driven approaches for pricing European style call options using supervised machine-learning algorithms.
Revised: We propose three different data driven approaches for pricing European-style call options using supervised machine-learning algorithms.
Edit intent: fluency
Original:  The proposed approaches are tested on two stock market indices , NIFTY50 and BANKNIFTY from the Indian equity market.
Revised:  The proposed approaches are tested on two stock market indices : NIFTY50 and BANKNIFTY from the Indian equity market.
Edit intent: fluency
Original:  We also illustrate the performance of the trained models in the period leading up to the 2020 Stock Market Crash , Jan 2019 to April 2020.
Revised:  We also illustrate the performance of the trained models in the period leading up to the 2020 Stock Market Crash ( Jan 2019 to April 2020.
Edit intent: fluency
Original:  We also illustrate the performance of the trained models in the period leading up to the 2020 Stock Market Crash , Jan 2019 to April 2020.
Revised:  We also illustrate the performance of the trained models in the period leading up to the 2020 Stock Market Crash , Jan 2019 to April 2020).
Edit intent: fluency
Original: Finding the best model that describes a high dimensional dataset , is a daunting task.
Revised: Finding the model that best describes a high dimensional dataset , is a daunting task.
Edit intent: fluency
Original: Finding the best model that describes a high dimensional dataset , is a daunting task.
Revised: Finding the best model that describes a high dimensional dataset is a daunting task.
Edit intent: fluency
Original:  In addition, model selection within the MCMs ' class is invariant with respect to changes in the representation of the data.
Revised:  In addition, model selection among MCMs is invariant with respect to changes in the representation of the data.
Edit intent: clarity
Original:  They portray the structure of dependencies among variables in a simple way .
Revised:  MCMs portray the structure of dependencies among variables in a simple way .
Edit intent: clarity
Original:  They provide robust predictions on dependencies and symmetries , as illustrated in several examples . MCMs may contain interactions between variables of any order . So, for example, our approach reveals whether a dataset is appropriately described by a pairwiseinteraction model .
Revised:  They provide robust predictions on dependencies and symmetries , as illustrated in several examples . MCMs may contain interactions between variables of any order between variables, and thus may reveal the presence of interactions of order higher than pairwise .
Edit intent: clarity
Original:  We show that , for analytic functions, the convergence rate of the Gegenbauer projection of degree n is the same as that of the best approximation of the same degree when \lambda\leq0 and the former is slower than the latter by a factor of n^{\lambda when \lambda>0} \leq1 , where \lambda is the parameter in Gegenbauer polynomials.
Revised:  We show that the rate of convergence of Gegenbauer projections is the same as that of the best approximation of the same degree when \lambda\leq0 and the former is slower than the latter by a factor of n^{\lambda when \lambda>0} \leq1 , where \lambda is the parameter in Gegenbauer polynomials.
Edit intent: clarity
Original:  We show that , for analytic functions, the convergence rate of the Gegenbauer projection of degree n is the same as that of the best approximation of the same degree when \lambda\leq0 and the former is slower than the latter by a factor of n^{\lambda when \lambda>0} \leq1 , where \lambda is the parameter in Gegenbauer polynomials.
Revised:  We show that , for analytic functions, the convergence rate of the Gegenbauer projection of degree n is the same as that of the best approximation of the same degree when \lambda\leq0 when \lambda>0} \leq1 , where \lambda is the parameter in Gegenbauer polynomials.
Edit intent: coherence