wanyu/IteraTeR_v2 huggingface dataset:
Original:  With the development combination of quantitative trading and reinforcement learning, more trading algorithms have achieved significant gains beyond the benchmark model Buy Hold (B H) . There is a certain gap between these algorithms and the real trading decision making scenarios.
Revised:  With the development combination of quantitative trading and reinforcement learning, Buy\& Hold (B H) . There is a certain gap between these algorithms and the real trading decision making scenarios.
Edit intent: clarity
Original:  On the other hand, the information level considered by these algorithms is not rich enough, which limits the performance of these algorithms.
Revised:  On the other hand, the information level considered by these algorithms is not rich enough, which limit the performance of these algorithms.
Edit intent: fluency
Original:  Thus, we propose an algorithm called the Multi-frequency Continuous-share Trading algorithm with GARCH (MCTG) to solve the problems above, which consists of parallel network layers and deep reinforcement learning .
Revised:  Thus, we propose a parallel-network continuous quantitative trading model with GARCH and PPO to enrich the basical deep reinforcement learning .
Edit intent: clarity
Original: Recently, neural architecture search (NAS) has attracted much attention and has been explored for automatic speech recognition (ASR).
Revised: Neural architecture search (NAS) has attracted much attention and has been explored for automatic speech recognition (ASR).
Edit intent: coherence
Original:  Our prior work has shown promising results compared with hand-designed neural networks.
Edit intent: coherence
Original:  First, based on the vanilla neural architecture, normal cells are altered to be causal cells , in order to control the total latency of the neural network .
Revised:  First, based on the vanilla neural architecture, normal cells are altered to causal cells to control the total latency of the neural network .
Edit intent: coherence
Original:  First, based on the vanilla neural architecture, normal cells are altered to be causal cells , in order to control the total latency of the neural network .
Revised:  First, based on the vanilla neural architecture, normal cells are altered to be causal cells , in order to control the total latency of the architecture .
Edit intent: clarity
Original:  2) For the low latency setting, the evaluation network can achieve more than 19\\%DIF < (average on the four test sets) relative improvements %DIF > (average on the four  compared with the hybrid CLDNN baseline, on a 10k-hour large-scale dataset .
Revised:  2) For the low latency setting, the evaluation network can achieve more than 19\\%DIF < (average on the four test sets) relative improvements %DIF > (average on the four test sets) relative improvements compared with the hybrid CLDNN baseline, on a 10k-hour large-scale dataset .
Edit intent: fluency
Original:  Additional 11%DIFDELCMD < \\%%% %DIF < relative improvements can be achieved if the latency of the neural network is relaxed to the medium latency setting .
Revised:  Additional 11%DIFDELCMD < \\%%% %DIF < relative improvements can be achieved if the latency of the .
Edit intent: clarity
Original: High-velocity dynamic actions (e.g., fling or throw) play a crucial role in our every-day interaction with deformable objects by improving our efficiency and effectively expanding our physical reach range.
Revised: High-velocity dynamic actions (e.g., fling or throw) play a crucial role in our everyday interaction with deformable objects by improving our efficiency and effectively expanding our physical reach range.
Edit intent: fluency
Original:  The project video is available at URL 
Revised:  The project video is available at URL .
Edit intent: fluency
Original:  Code, data, and simulation environment are available at URL .
Edit intent: coherence
Original: An effective online recommendation system should jointly capture user long-term and short-term preferences in both user internal and external behaviors  .
Revised: An effective online recommendation system should jointly capture users' long-term and short-term preferences in both user internal and external behaviors .
Edit intent: fluency
Original:  However, it is  challenging to conduct fast adaptations to variable new topics while making full use of all information in large-scale systems, due to the online efficiency limitation and complexity of real-world systems .
Revised:  However, it is extremely challenging to conduct fast adaptations to variable new topics while making full use of all information in large-scale systems, due to the online efficiency limitation and complexity of real-world systems .
Edit intent: clarity
Original:  However, it is  challenging to conduct fast adaptations to variable new topics while making full use of all information in large-scale systems, due to the online efficiency limitation and complexity of real-world systems .
Revised:  However, it is challenging to conduct fast adaptations to variable new topics while making full use of all information in large-scale systems, due to the real-world systems .
Edit intent: coherence
Original:  To improve online learning for short-term  interests, we propose a temporal MAML method with asynchronous online updating for fast adaptation, which regards recommendations at different time periods as different tasks.
Revised:  To improve online learning for short-term interests, we propose a temporal meta-learning method based on MAML under an asynchronous optimization strategy for fast adaptation, which regards recommendations at different time periods as different tasks.
Edit intent: clarity
Original:  LSTTM has also been deployed on a widely-used online system , affecting millions of users .
Revised:  It has been deployed on a widely-used online system , affecting millions of users .
Edit intent: clarity
Original:  The discrepancy of a set system (U,\mathscr S) is the minimum over all mappings \chi%DIFDELCMD < \colon %DIFDELCMD < %%% U\rightarrow\{-1,1\} of S\in\mathscr S%DIFDELCMD < \bigl|%%% \sum_{v\in S\chi(v) }%DIFDELCMD < \bigr|%%% . We study the discrepancy of set systems that are first-order definable in sparse graph classes.
Revised:  The discrepancy of a set system (U,\mathscr S) is the minimum over all mappings \chi%DIFDELCMD < \colon %DIFDELCMD < %%% %DIFDELCMD < \bigl|%%% \sum_{v\in S\chi(v) }%DIFDELCMD < \bigr|%%% . We study the discrepancy of set systems that are first-order definable in sparse graph classes.
Edit intent: coherence
Original:  We prove that all the set systems definable in a monotone class \mathscr C have bounded discrepancy if and only if \mathscr C has bounded expansion, and that they have hereditary discrepancy at most |U|^{c} (for some~c<1/2) if and only if \mathscr C is nowhere dense.
Revised:  We prove that all the set systems definable in a monotone class \mathscr C have hereditary discrepancy at most |U|^{c} (for some~c<1/2) if and only if \mathscr C is nowhere dense.
Edit intent: clarity
Original:  From the algorithmic point of view, we prove that if \mathscr C is a class of graphs with bounded expansion and \phi(\bar x;\bar y) is a first-order formula, then for each input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|}\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi can be computed in \mathcal O(|G|^{|\bar x|) time.
Revised:  We further prove that if \mathscr C is a class of graphs with bounded expansion and \phi(\bar x;\bar y) is a first-order formula, then for each input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|}\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi can be computed in \mathcal O(|G|^{|\bar x|) time.
Edit intent: clarity
Original:  From the algorithmic point of view, we prove that if \mathscr C is a class of graphs with bounded expansion and \phi(\bar x;\bar y) is a first-order formula, then for each input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|}\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi can be computed in \mathcal O(|G|^{|\bar x|) time.
Revised:  From the algorithmic point of view, we prove that if \mathscr C is a class of graphs with bounded expansion and \phi(\bar x;\bar y) is a first-order formula, then we can compute in polynomial time, for an input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|}\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi can be computed in \mathcal O(|G|^{|\bar x|) time.
Edit intent: clarity
Original:  From the algorithmic point of view, we prove that if \mathscr C is a class of graphs with bounded expansion and \phi(\bar x;\bar y) is a first-order formula, then for each input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|}\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi can be computed in \mathcal O(|G|^{|\bar x|) time.
Revised:  From the algorithmic point of view, we prove that if \mathscr C is a class of graphs with bounded expansion and \phi(\bar x;\bar y) is a first-order formula, then for each input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|}\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi ) time.
Edit intent: clarity
Original:  We also deduce that for such set-systems, when |}%DIFDELCMD < \bar %DIFDELCMD < %%% x|=1, \varepsilon-nets of size O(1/\varepsilon) can be computed in time O(|G|\,\log |G|) and \varepsilon-approximations of size O(1/\varepsilon) can be computed in polynomial time .
Revised:  We also deduce that for such set-systems, when |}%DIFDELCMD < \bar %DIFDELCMD < %%% , an \varepsilon-net of size O(1/\varepsilon) can be computed in time O(|G|\,\log |G|) and \varepsilon-approximations of size O(1/\varepsilon) can be computed in polynomial time .
Edit intent: clarity
Original:  We also deduce that for such set-systems, when |}%DIFDELCMD < \bar %DIFDELCMD < %%% x|=1, \varepsilon-nets of size O(1/\varepsilon) can be computed in time O(|G|\,\log |G|) and \varepsilon-approximations of size O(1/\varepsilon) can be computed in polynomial time .
Revised:  We also deduce that for such set-systems, when |}%DIFDELCMD < \bar %DIFDELCMD < %%% x|=1, \varepsilon-nets of size O(1/\varepsilon) , and an \varepsilon-approximation of size O(1/\varepsilon) can be computed in polynomial time .
Edit intent: clarity
Original:  We show that the set systems on a ground set U definable on a monotone nowhere dense class of graphs \mathscr C have hereditary discrepancy at most |U|^{c (for some~c<1/2) and that, on the contrary, for every monotone somewhere dense class \mathscr C and for every positive integer d there is a set system of d-tuples definable in \mathscr C with discrepancy\Omega(|U|^{1/2}).
Revised:  We show that the set systems on a ground set U definable on a monotone nowhere dense class of graphs \mathscr C have hereditary discrepancy (for some~c<1/2) and that, on the contrary, for every monotone somewhere dense class \mathscr C and for every positive integer d there is a set system of d-tuples definable in \mathscr C with discrepancy\Omega(|U|^{1/2}).
Edit intent: clarity
Original:  We further prove that if \mathscr C is a class of graphs with bounded expansion and \phi(}%DIFDELCMD < \bar %%% x;%DIFDELCMD < \bar %%% y) is a first-order formula, then we can compute in polynomial time, for an input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi, an \varepsilon-net } of  size O(1/\varepsilon) , and an \varepsilon-approximation of size O(1/\varepsilon) .
Revised:  We further prove that if \mathscr C is a class of graphs with bounded expansion and \phi(}%DIFDELCMD < \bar %%% x;%DIFDELCMD < \bar %%% y) is a first-order formula, then we can compute in polynomial time, for an input graph G\in\mathscr C, a mapping \chi:V(G)^{|\bar x|\rightarrow\{-1,1\} witnessing the boundedness of the discrepancy of the set-system defined by~\phi, an \varepsilon-net } of neighborhood set systems of edge colored graphs, a polynomial-time algorithm to compute \varepsilon-approximations of size O(1/\varepsilon) , and an \varepsilon-approximation of size O(1/\varepsilon) .
Edit intent: clarity
Original:  Therefore, processing in memory can provide a promising solution for the memory wall bottleneck for ML workloads.
Revised:  Processing in memory has been proposed as a promising solution for the memory wall bottleneck for ML workloads.
Edit intent: clarity
Original:  Moreover, we propose a processing-in-memory DRAM bank architecture, data mapping and dataflow based on the proposed primitive .
Revised:  Moreover, we propose a processing-in-memory DRAM bank architecture, data mapping scheme and dataflow for executing DNNs within DRAM .
Edit intent: clarity
Original:  In this paper we propose a deterministic algorithm that constructs for a given readonly string of length n over the alphabet \{0,1,\ldots,n^{O(1)}\} a version of \tau-partitioning set with size O(b) and \tau = n{b} using O(b) space and O(1{\epsilon}n) time provided b \ge n^\epsilon, for \epsilon > 0. As a corollary, for b \ge n^\epsilon and constant \epsilon > 0, we obtain linear construction algorithms with O(b) space on top of the string for two major small-space indexes:
Revised:  In this paper we propose a deterministic algorithm that constructs for a given readonly string of length n over the alphabet \{0,1,\ldots,n^{O(1)}\} a variant of \tau-partitioning set with size O(b) and \tau = n{b} using O(b) space and O(1{\epsilon}n) time provided b \ge n^\epsilon, for \epsilon > 0. As a corollary, for b \ge n^\epsilon and constant \epsilon > 0, we obtain linear construction algorithms with O(b) space on top of the string for two major small-space indexes:
Edit intent: clarity
Original:  Unlike the classical discriminant, D^+(p) never vanishes.
Edit intent: coherence
Original:  We first prove a conjecture that D^+(p) is a \mu-symmetric function of its roots \alpha _1,\ldots, \alpha _m.
Revised:  We first prove a conjecture that D^+(p) is a \mu-symmetric function of its roots \rho _1,\ldots, \alpha _m.
Edit intent: clarity
Original:  We first prove a conjecture that D^+(p) is a \mu-symmetric function of its roots \alpha _1,\ldots, \alpha _m.
Revised:  We first prove a conjecture that D^+(p) is a \mu-symmetric function of its roots \alpha _1,\ldots, \rho _m.
Edit intent: clarity
Original:  A basic tool used by our proof is the "symbolic Poisson resultant ".
Revised:  A basic tool used by our proof is the "symbolic Poisson formula ".
Edit intent: clarity
Original:  For the momentum-preserving scheme, our key ideas mainly follow the extrapolation/prediction-correction technique and  symplectic Runge-Kutta (RK) methods in timecombined with the standard Fourier pseudo-spectral method in space.
Revised:  For the momentum-preserving scheme, the key idea is based on the extrapolation/prediction-correction technique and symplectic Runge-Kutta (RK) methods in timecombined with the standard Fourier pseudo-spectral method in space.
Edit intent: clarity
Original:  For the momentum-preserving scheme, our key ideas mainly follow the extrapolation/prediction-correction technique and  symplectic Runge-Kutta (RK) methods in timecombined with the standard Fourier pseudo-spectral method in space.
Revised:  For the momentum-preserving scheme, our key ideas mainly follow the extrapolation/prediction-correction technique and the symplectic Runge-Kutta (RK) methods in timecombined with the standard Fourier pseudo-spectral method in space.
Edit intent: fluency
Original:  For the momentum-preserving scheme, our key ideas mainly follow the extrapolation/prediction-correction technique and  symplectic Runge-Kutta (RK) methods in timecombined with the standard Fourier pseudo-spectral method in space.
Revised:  For the momentum-preserving scheme, our key ideas mainly follow the extrapolation/prediction-correction technique and symplectic Runge-Kutta method in time, together with the standard Fourier pseudo-spectral method in space.
Edit intent: clarity
Original:  Subsequently, based on the energy quadratization approach and the analogous linearized idea used in the construction of the linear momentum-preserving scheme , the energy-preserving scheme is presented and it is proven to preserve both the discrete mass and quadratic energy .
Revised:  For the energy-preserving scheme, it is mainly based on the energy quadratization approach and the analogous linearized idea used in the construction of the linear momentum-preserving scheme , the energy-preserving scheme is presented and it is proven to preserve both the discrete mass and quadratic energy .
Edit intent: coherence
Original:  Subsequently, based on the energy quadratization approach and the analogous linearized idea used in the construction of the linear momentum-preserving scheme , the energy-preserving scheme is presented and it is proven to preserve both the discrete mass and quadratic energy .
Revised:  Subsequently, based on the energy quadratization approach and the analogous linearized strategy used in the construction of the linear momentum-preserving scheme , the energy-preserving scheme is presented and it is proven to preserve both the discrete mass and quadratic energy .
Edit intent: clarity
Original:  Numerical results are addressed to demonstrate the accuracy and efficiency of the schemes .
Revised:  Numerical results are addressed to demonstrate the accuracy and efficiency of the proposed scheme .
Edit intent: clarity
Original: The dynamics of cross-diffusion models leads to a high computational complexity for implicit difference schemes, turning them unsuitable for tasks when time is of the essence .
Revised: The dynamics of cross-diffusion models leads to a high computational complexity for implicit difference schemes, turning them unsuitable for tasks that require results in real-time .
Edit intent: clarity
Original: Privacy protection has recently attracted the attention of both academics and industries . Society protects individual data privacy through complex legal frameworks.
Revised: Privacy protection has recently been in the spotlight of attention to both academia and industry . Society protects individual data privacy through complex legal frameworks.
Edit intent: clarity
Original:  This has become a topic of interest with the increasing applications of data science and artificial intelligence that have created a higher demand to the ubiquitous application of the data.
Revised:  The increasing number of applications of data science and artificial intelligence that have created a higher demand to the ubiquitous application of the data.
Edit intent: clarity
Original:  This has become a topic of interest with the increasing applications of data science and artificial intelligence that have created a higher demand to the ubiquitous application of the data.
Revised:  This has become a topic of interest with the increasing applications of data science and artificial intelligence has resulted in a higher demand to the ubiquitous application of the data.
Edit intent: clarity
Original:  This has become a topic of interest with the increasing applications of data science and artificial intelligence that have created a higher demand to the ubiquitous application of the data.
Revised:  This has become a topic of interest with the increasing applications of data science and artificial intelligence that have created a higher demand for the ubiquitous application of the data.
Edit intent: fluency
Original:  The privacy protection of the broad Data-InformationKnowledge-Wisdom (DIKW) landscape, the next generation of information organization, has not been in the limelight.
Revised:  The privacy protection of the broad Data-Information-Knowledge-Wisdom (DIKW) landscape, the next generation of information organization, has not been in the limelight.
Edit intent: fluency
Original:  Next , we will explore DIKW architecture through the applications of  popular swarm intelligence and differential privacy.
Revised:  Next , we will explore DIKW architecture through the applications of the popular swarm intelligence and differential privacy.
Edit intent: fluency
Original:  The proposed approach is proved through the application of personalized data that is based on the open-sourse IRIS dataset.
Revised:  The proposed approach is demonstrated through the application of personalized data that is based on the open-sourse IRIS dataset.
Edit intent: clarity
Original:  Experiments show that MuseMorphose outperforms recurrent neural network (RNN) based prior art on numerous widely-used metrics for style transfer tasks.
Revised:  Experiments show that MuseMorphose outperforms recurrent neural network (RNN) based baselines on numerous widely-used metrics for style transfer tasks.
Edit intent: clarity
Original:  A theorem predictor is also designed to infer the theorem application sequence fed to the symbolic solver for the more efficient and reasonable searching path.
Revised:  Also, a theorem predictor is also designed to infer the theorem application sequence fed to the symbolic solver for the more efficient and reasonable searching path.
Edit intent: coherence
Original:  A theorem predictor is also designed to infer the theorem application sequence fed to the symbolic solver for the more efficient and reasonable searching path.
Revised:  A theorem predictor is designed to infer the theorem application sequence fed to the symbolic solver for the more efficient and reasonable searching path.
Edit intent: clarity
Original:  Extensive experiments on the Geometry3K and GEOS datasets demonstrate  Inter-GPS achieves significant improvements over existing methods. 
Revised:  Extensive experiments on the Geometry3K and GEOS datasets demonstrate that Inter-GPS achieves significant improvements over existing methods. 
Edit intent: fluency
Original:  The increasing stride length and decreasing stance phase duration in the gait cycle suggest that simultaneous use of a robotic walker and a pneumatic walking assist device would effectively decrease FOF and maintain a stable gait pattern for PD patients.
Revised:  The increasing stride length and decreasing stance phase duration in the gait cycle suggest that simultaneous use of a robotic walker and a pneumatic walking assist device would effectively decrease FOG and maintain a stable gait pattern for PD patients.
Edit intent: clarity
Original:  Some standard numerical experiments of two-dimensional Euler system such as the shock-vortex interaction and the 2D Riemann problems are presented.
Edit intent: coherence
Original:  To summarize, the MOP-WENO-X schemes also enjoy the advantages of the MOP-WENO-ACMk scheme proposed in 18 .
Revised:  To summarize, the MOP-WENO-X schemes 18 .
Edit intent: clarity
Original:  It helps us to extend the order-preserving (OP ) criterion , originally defined and carefully examined in 18%DIFDELCMD < ]%%% , into the design of the mappings.
Revised:  It helps us to extend the 18%DIFDELCMD < ]%%% , into the design of the mappings.
Edit intent: coherence
Original:  It helps us to extend the order-preserving (OP ) criterion , originally defined and carefully examined in 18%DIFDELCMD < ]%%% , into the design of the mappings.
Revised:  It helps us to extend the order-preserving (OP ) criterion , originally defined and carefully examined in %DIFDELCMD < ]%%% , into the design of the mappings.
Edit intent: fluency
Original: 5\% accuracy loss under unprecedented 0.73\% connectivity, which reveals remarkable structure refining capability in SNNs. Our work suggests that there exists extremely high redundancy in deep SNNs. Our codes are available at URL 
Revised: 5\% accuracy loss under unprecedented 0.73\% connectivity, which reveals remarkable structure refining capability in SNNs. Our work suggests that there exists extremely high redundancy in deep SNNs. Our codes are available at URL .
Edit intent: fluency