wanyu/IteraTeR_v2 huggingface dataset:
Original:  In particular, we show that the dimension of the LSGD's attraction region is at most floor((n-1)/2) for a class of quadratic functions which is significantly smaller than GD's ( n-1 )-dimensional attraction region .
Revised:  In particular, we show that the dimension of the attraction region for mLSGD is floor((n-1)/2) for a class of quadratic functions which is significantly smaller than GD's ( n-1 )-dimensional attraction region .
Edit intent: clarity
Original:  In particular, we show that the dimension of the LSGD's attraction region is at most floor((n-1)/2) for a class of quadratic functions which is significantly smaller than GD's ( n-1 )-dimensional attraction region .
Revised:  In particular, we show that the dimension of the LSGD's attraction region is at most floor((n-1)/2) , and hence it is significantly smaller than GD's ( n-1 )-dimensional attraction region .
Edit intent: coherence
Original:  In particular, we show that the dimension of the LSGD's attraction region is at most floor((n-1)/2) for a class of quadratic functions which is significantly smaller than GD's ( n-1 )-dimensional attraction region .
Revised:  In particular, we show that the dimension of the LSGD's attraction region is at most floor((n-1)/2) for a class of quadratic functions which is significantly smaller than GD's ( n-1 .
Edit intent: clarity
Original:  The model considers interest rate and credit spread term structures and their dynamics.
Revised:  We model interest rate and credit spread term structures and their dynamics.
Edit intent: clarity
Original:  We show that illiquid bonds present an additional liquidity spread that depends on the time-to-liquidate aside from credit and interest rate parameters .
Revised:  We show that illiquid bonds present an additional liquidity spread that depends on the time-to-liquidate aside from bond volatility .
Edit intent: clarity
Original:  For the tractable cases, we also state new structural properties equivalent to Kotzig's theorem on  bridges in unique perfect matchings.
Revised:  For the tractable cases, we also state new structural properties equivalent to Kotzig's theorem on the existence of bridges in unique perfect matchings.
Edit intent: clarity
Original:  We also exhibit a connection between blossoms and bridge deletion orders in unique perfect matchings .
Revised:  We also exhibit a connection between blossoms and bridge deletion orders .
Edit intent: clarity
Original: A considerable number of the most-subscribed YouTube channels feature content popular among children of very young age.
Revised: A large number of the most-subscribed YouTube channels feature content popular among children of very young age.
Edit intent: clarity
Original: A considerable number of the most-subscribed YouTube channels feature content popular among children of very young age.
Revised: A considerable number of the most-subscribed YouTube channels target children of very young age.
Edit intent: clarity
Original:  Hundreds of toddler-oriented channels on YouTube offer inoffensive, well produced, and educational videos.
Revised:  Hundreds of toddler-oriented channels on YouTube feature inoffensive, well produced, and educational videos.
Edit intent: clarity
Original:  Unfortunately, inappropriate (disturbing) content that targets this demographic is also common.
Revised:  Unfortunately, inappropriate content that targets this demographic is also common.
Edit intent: clarity
Original:  Hence, in this work, we develop a classifier able to detect toddler-oriented inappropriate content on YouTube with 82.8 \% accuracy, and we leverage it to perform a first-of-its-kind, large-scale, quantitative characterization that reveals some of the risks of YouTube media consumption by young children.
Revised:  Hence, in this work, we build a classifier able to detect toddler-oriented inappropriate content on YouTube with 82.8 \% accuracy, and we leverage it to perform a first-of-its-kind, large-scale, quantitative characterization that reveals some of the risks of YouTube media consumption by young children.
Edit intent: clarity
Original:  Hence, in this work, we develop a classifier able to detect toddler-oriented inappropriate content on YouTube with 82.8 \% accuracy, and we leverage it to perform a first-of-its-kind, large-scale, quantitative characterization that reveals some of the risks of YouTube media consumption by young children.
Revised:  Hence, in this work, we develop a classifier able to discern inappropriate content that targets toddlers on YouTube with 82.8 \% accuracy, and we leverage it to perform a first-of-its-kind, large-scale, quantitative characterization that reveals some of the risks of YouTube media consumption by young children.
Edit intent: clarity
Original:  Hence, in this work, we develop a classifier able to detect toddler-oriented inappropriate content on YouTube with 82.8 \% accuracy, and we leverage it to perform a first-of-its-kind, large-scale, quantitative characterization that reveals some of the risks of YouTube media consumption by young children.
Revised:  Hence, in this work, we develop a classifier able to detect toddler-oriented inappropriate content on YouTube with 82.8 \% accuracy, and leverage it to perform a first-of-its-kind, large-scale, quantitative characterization that reveals some of the risks of YouTube media consumption by young children.
Edit intent: fluency
Original:  Our analysis indicates that YouTube 's currently deployed counter-measures are ineffective in terms of detecting disturbing videos in a timely manner.
Revised:  Our analysis indicates that YouTube 's currently deployed counter-measures are ineffective in terms of detecting them in a timely manner.
Edit intent: clarity
Original:  Finally , using our classifier , we assess how prominent the problem is on YouTube, finding that young children are  likely to encounter disturbing videos when they randomly browse the platform starting from benign videos.
Revised:  Alarmingly , using our classifier , we assess how prominent the problem is on YouTube, finding that young children are likely to encounter disturbing videos when they randomly browse the platform starting from benign videos.
Edit intent: coherence
Original:  Finally , using our classifier , we assess how prominent the problem is on YouTube, finding that young children are  likely to encounter disturbing videos when they randomly browse the platform starting from benign videos.
Revised:  Finally , using our classifier we show that young children are likely to encounter disturbing videos when they randomly browse the platform starting from benign videos.
Edit intent: coherence
Original: A large number of the most-subscribed YouTube channels target children of  very young age.
Revised: A large number of the most-subscribed YouTube channels target children of a very young age.
Edit intent: fluency
Original:  Hundreds of toddler-oriented channels on YouTube feature inoffensive, well produced , and educational videos.
Revised:  Hundreds of toddler-oriented channels on YouTube feature inoffensive, well-produced , and educational videos.
Edit intent: fluency
Original: We investigate a simple model for social learning with two agents : a teacher and a student.
Revised: We investigate a simple model for social learning with two agents , a teacher and a student.
Edit intent: fluency
Original:  The teacher's goal is to teach the student the state of the world \Theta, however, the teacher herself is not certain about \Theta and needs to simultaneously learn it and teach it to the student.
Revised:  The teacher's goal is to teach the student the state of the world ; however, the teacher herself is not certain about \Theta and needs to simultaneously learn it and teach it to the student.
Edit intent: fluency
Original:  The teacher's goal is to teach the student the state of the world \Theta, however, the teacher herself is not certain about \Theta and needs to simultaneously learn it and teach it to the student.
Revised:  The teacher's goal is to teach the student the state of the world \Theta, however, the teacher himself is not certain about \Theta and needs to simultaneously learn it and teach it to the student.
Edit intent: fluency
Original:  The teacher's goal is to teach the student the state of the world \Theta, however, the teacher herself is not certain about \Theta and needs to simultaneously learn it and teach it to the student.
Revised:  The teacher's goal is to teach the student the state of the world \Theta, however, the teacher herself is not certain about the state of the world and needs to simultaneously learn it and teach it to the student.
Edit intent: fluency
Original:  We model the teacher's and the student's uncertainty via binary symmetric channels, and employ a simple heuristic decoder at the student's end .
Revised:  We model the teacher's and student's uncertainty via binary symmetric channels, and employ a simple heuristic decoder at the student's end .
Edit intent: fluency
Original:  We model the teacher's and the student's uncertainty via binary symmetric channels, and employ a simple heuristic decoder at the student's end .
Revised:  We model the teacher's and the student's uncertainty via binary symmetric channels, and employ two simple decoding strategies for the student .
Edit intent: clarity
Original:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant  . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Revised:  We focus on two teaching strategies: a " low-effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Edit intent: fluency
Original:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant  . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Revised:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high-effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Edit intent: fluency
Original:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant  . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Revised:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of the world at each time instant . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Edit intent: clarity
Original:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant  . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Revised:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low-effort strategy outperforms the high effort strategy.
Edit intent: fluency
Original:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant  . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high effort strategy.
Revised:  We focus on two teaching strategies: a " low effort " strategy of simply forwarding information, and a " high effort " strategy of communicating the teacher's current best estimate of \Theta at each time instant . Using tools from large deviation theory, we calculate the exact learning rates for these strategies and demonstrate regimes where the low effort strategy outperforms the high-effort strategy.
Edit intent: fluency
Original: We investigate a simple model for social learning with two agents , a teacher and a student.
Revised: We investigate a simple model for social learning with two agents : a teacher and a student.
Edit intent: fluency
Original: Fulla, Uppman, and Zivny ACM ToCT'18%DIFDELCMD < ] %%% established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution.
Revised:  ACM ToCT'18%DIFDELCMD < ] %%% established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution.
Edit intent: clarity
Original: Fulla, Uppman, and Zivny ACM ToCT'18%DIFDELCMD < ] %%% established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution.
Revised: Fulla, Uppman, and Zivny %DIFDELCMD < ] %%% established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution.
Edit intent: clarity
Original:  This result, in addition to identifying the complexity frontier, ]  features the discovery of a new non-trivial tractable case (called EDS ) that does not appear in the non-surjective setting.
Revised:  This result, in addition to identifying the complexity frontier, ] features the discovery of a new non-trivial tractable case called EDS that does not appear in the non-surjective setting.
Edit intent: coherence
Original:  As our main result, we introduce a generalisation of EDS to arbitrary finite domains called SEDS (similar to EDS) and establish a conditional complexity classification of SEDS VCSPs based on a reduction to smaller domains.
Revised:  As our main result, we extend the class EDS to arbitrary finite domains called SEDS (similar to EDS) and establish a conditional complexity classification of SEDS VCSPs based on a reduction to smaller domains.
Edit intent: clarity
Original:  As our main result, we introduce a generalisation of EDS to arbitrary finite domains called SEDS (similar to EDS) and establish a conditional complexity classification of SEDS VCSPs based on a reduction to smaller domains.
Revised:  As our main result, we introduce a generalisation of EDS to arbitrary finite domains and provide a conditional complexity classification of SEDS VCSPs based on a reduction to smaller domains.
Edit intent: clarity
Original:  This gives a complete classification of SEDS VCSPs on three-element domains .
Revised:  On three-element domains .
Edit intent: clarity
Original: Many time-series data including text, movies, and biological signals can be represented as sequences of correlated binary patterns .
Revised: Sequences of correlated binary patterns can represent many time-series data including text, movies, and biological signals can be represented as sequences of correlated binary patterns .
Edit intent: fluency
Original: Many time-series data including text, movies, and biological signals can be represented as sequences of correlated binary patterns .
Revised: Many time-series data including text, movies, and biological signals .
Edit intent: clarity
Original:  This model can uncover overlapping graphs underlying the data better than a traditional orthogonal decomposition method, and outperforms an original time-dependent full Ising model.
Revised:  This model can uncover overlapping graphs underlying the data better than a traditional orthogonal decomposition method, and outperforms an original time-dependent Ising model.
Edit intent: clarity
Original:  It achieves high similarity to RepeatMasker and is tens of times faster.
Revised:  It achieves high similarity to RepeatMasker and is times faster.
Edit intent: clarity
Original:  I3 can  be used as a field-normalized indicator.
Revised:  I3 can also be used as a field-normalized indicator.
Edit intent: coherence
Original:  the mean-normalized citation score (MNCS), relative-citation ratio (RCR), citation score normalized by cited references (CSNCR), characteristic scores and scales (CSS), source-normalized citation score (SNCS), citation percentiles , and proportion of papers which belong to the x\% most frequently cited papers (PPtop x\%).
Revised:  the mean-normalized citation score (MNCS), relative-citation ratio (RCR), citation score normalized by cited references (CSNCR), characteristic scores and scales (CSS), source-normalized citation score (SNCS), citation percentile , and proportion of papers which belong to the x\% most frequently cited papers (PPtop x\%).
Edit intent: clarity
Original:  For the ferromagnetic (attractive) Ising model, Daskalasis et al. (2018) presented a polynomial time algorithm for identity testing.
Revised:  For the ferromagnetic (attractive) Ising model, Daskalakis et al. (2018) presented a polynomial time algorithm for identity testing.
Edit intent: fluency
Original:  These include, but are not limited to, subject and session data variance, long and arduous calibration processes and performance generalisation issues across differentsubjects or sessions.
Revised:  These include, but are not limited to, subject and session data variance, long and arduous calibration processes and predictive generalisation issues across differentsubjects or sessions.
Edit intent: clarity
Original:  These include, but are not limited to, subject and session data variance, long and arduous calibration processes and performance generalisation issues across differentsubjects or sessions.
Revised:  These include, but are not limited to, subject and session data variance, long and arduous calibration processes and performance generalisation issues across different subjects or sessions.
Edit intent: fluency
Original:  Even if the model Q is chosen in the most skilful and sophisticated way, she is left with the possibility that Q does not provide an exact description of reality.
Revised:  Even if the model Q is chosen in the most skilful and sophisticated way, she is left with the possibility that Q does not provide an "exact" description of reality.
Edit intent: fluency
Original:  Remarkably, this can be overcome by considering a suitable adapted version of the Wasserstein distance which takes the temporal structure of pricing models into account.
Revised:  Remarkably, this can be overcome by considering a suitable "adapted" version of the Wasserstein distance which takes the temporal structure of pricing models into account.
Edit intent: clarity
Original:  Automated methods that can detect causal relationships would be very welcome, but practical methods that can infer causality are difficult to find, and the subject of ongoing research.
Revised:  Automated methods that can infer causality are difficult to find, and the subject of ongoing research.
Edit intent: coherence
Original:   Our results suggest that whether or not transfer entropy measures of causality are misleading depends strongly on the cognitive task considered.
Revised:  Our results suggest that transfer entropy will sometimes fail to infer causality when it exists, and sometimes suggest a causal connection when there is none. However, the extent of incorrect inference strongly depends on the cognitive task considered.
Edit intent: clarity
Original:  These results emphasize the importance of understanding the fundamental logic processes that contribute to  cognitive processing, and quantifying their relevance in any given nervous system.
Revised:  These results emphasize the importance of understanding the fundamental logic processes that contribute to information flow in cognitive processing, and quantifying their relevance in any given nervous system.
Edit intent: clarity
Original:  First, we investigate the relations between two standard objectives in dimension reduction, maximizing variance and preservation of pairwise relative distances.
Revised:  First, we investigate the relations between two standard objectives in dimension reduction, preservation of variance and of pairwise relative distances.
Edit intent: clarity
Original:  The derivation of their asymptotic correlation and numerical experiments tell that a projection usually cannot satisfy both objectives  .
Revised:  Investigations of their asymptotic correlation and numerical experiments tell that a projection usually cannot satisfy both objectives .
Edit intent: clarity
Original:  The derivation of their asymptotic correlation and numerical experiments tell that a projection usually cannot satisfy both objectives  .
Revised:  The derivation of their asymptotic correlation as well as numerical experiments show that a projection usually cannot satisfy both objectives .
Edit intent: clarity
Original:  The derivation of their asymptotic correlation and numerical experiments tell that a projection usually cannot satisfy both objectives  .
Revised:  The derivation of their asymptotic correlation and numerical experiments tell that a projection does usually not satisfy both objectives .
Edit intent: clarity
Original:  In a standard classification problem we determine projections on the input data that balance them and compare subsequent results.
Revised:  In a standard classification problem we determine projections on the input data that balance the objectives and compare subsequent results.
Edit intent: clarity
Original:  We introduce new variational loss functions that enable integration of additional information via transformations and projections of the target data.
Revised:  We introduce new variational loss functions for learning tasks. These loss functions integrate additional information via transformations and projections of the target data.
Edit intent: clarity
Original:  Further, we introduce a general framework of variational loss functionsfor learning tasks .
Revised:  Further, we introduce a general framework of augmented target loss functions .
Edit intent: clarity
Original:  We introduce an expression generating neural network that significantly favors the generation of expressions with desired leading powers, even generalizing to powers not in the training set.
Revised:  We introduce an expression generating neural network which preferentially generates production rules to construct expressions with the desired leading powers, even generalizing to powers not in the training set.
Edit intent: clarity