wanyu/IteraTeR_v2 huggingface dataset:
Original:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge  ^{ ( 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le  , where 1/\gamma is roughly 2^d/\varepsilon^2.
Revised:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge ^{ ( 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le n^{1-\gamma , where 1/\gamma is roughly 2^d/\varepsilon^2.
Edit intent: clarity
Original:  For the case of matrices of equal size, our bound matches the bound given by Dvir and Liu (Theory of Computing, 2020 ) for the rigidity of generalized Walsh--Hadamard matrices (Kronecker powers of DFT matrices ), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups .
Revised:  Theory of Computing, 2020 ) for the rigidity of generalized Walsh--Hadamard matrices (Kronecker powers of DFT matrices ), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups .
Edit intent: clarity
Original:  For the case of matrices of equal size, our bound matches the bound given by Dvir and Liu (Theory of Computing, 2020 ) for the rigidity of generalized Walsh--Hadamard matrices (Kronecker powers of DFT matrices ), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups .
Revised:  For the case of matrices of equal size, our bound matches the bound given by Dvir and Liu ( ) for the rigidity of generalized Walsh--Hadamard matrices (Kronecker powers of DFT matrices ), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups .
Edit intent: clarity
Original:  To address these concerns, we introduce the \emph{Entropic Reactive Control Improvisation} (ERCI) framework and algorithm that supports synthesizing control policies for stochastic games that are declaratively specified by (i) a hard constraint specifying what must occur  (ii) a soft constraint specifying what typically occurs, and (iii) a randomization constraint specifying the unpredictability and variety of the controller, as quantified using causal entropy.
Revised:  To address these concerns, we introduce the \emph{Entropic Reactive Control Improvisation} (ERCI) framework and algorithm which supports synthesizing control policies for stochastic games that are declaratively specified by (i) a hard constraint specifying what must occur (ii) a soft constraint specifying what typically occurs, and (iii) a randomization constraint specifying the unpredictability and variety of the controller, as quantified using causal entropy.
Edit intent: fluency
Original:  To address these concerns, we introduce the \emph{Entropic Reactive Control Improvisation} (ERCI) framework and algorithm that supports synthesizing control policies for stochastic games that are declaratively specified by (i) a hard constraint specifying what must occur  (ii) a soft constraint specifying what typically occurs, and (iii) a randomization constraint specifying the unpredictability and variety of the controller, as quantified using causal entropy.
Revised:  To address these concerns, we introduce the \emph{Entropic Reactive Control Improvisation} (ERCI) framework and algorithm that supports synthesizing control policies for stochastic games that are declaratively specified by (i) a hard constraint specifying what must occur , (ii) a soft constraint specifying what typically occurs, and (iii) a randomization constraint specifying the unpredictability and variety of the controller, as quantified using causal entropy.
Edit intent: fluency
Original: The synthesis problem asks to automatically generates , if it exists, an algorithm from a specification of correct input-output pairs.
Revised: The synthesis problem asks to automatically generate , if it exists, an algorithm from a specification of correct input-output pairs.
Edit intent: fluency
Original:  In this paper, we show that in the optimal mechanism, there is no distortion at the top and the agent has no incentive to acquire any additional costly information under equilibrium.
Revised:  In this paper, we show that in the optimal mechanism, the agent has no incentive to acquire any additional costly information under equilibrium.
Edit intent: coherence
Original:  Finally , we show that  posting a deterministic price on fully revealing the states is optimal when the prior distribution is sufficiently informative  .
Revised:  In addition , we show that posting a deterministic price on fully revealing the states is optimal when the prior distribution is sufficiently informative .
Edit intent: coherence
Original:  Finally , we show that  posting a deterministic price on fully revealing the states is optimal when the prior distribution is sufficiently informative  .
Revised:  Finally , we show that posting a deterministic price for fully revealing the states is optimal when the prior distribution is sufficiently informative .
Edit intent: coherence
Original:  In addition, we show that under the separable valuation assumption, there is no distortion at the top, and posting a deterministic price for fully revealing the states is optimal when the prior distribution is sufficiently informative or the cost of acquiring additional information is sufficiently high, and is approximately optimal when the type distribution satisfies the monotone hazard rate condition .
Revised:  In addition, we show that under the separable valuation assumption, there is no distortion at the top, and posting a deterministic price for revealing the states is optimal when the prior distribution is sufficiently informative or the cost of acquiring additional information is sufficiently high, and is approximately optimal when the type distribution satisfies the monotone hazard rate condition .
Edit intent: clarity
Original: This paper considers the generalized continuation Newton method and the trust-region updating strategy for the underdetermined system of nonlinear equations.
Revised: This paper considers the generalized continuation Newton method and thetrust-region updating strategy for the underdetermined system of nonlinear equations.
Edit intent: fluency
Original:  The computational speed of the new method is about eight to fifty times as fast as that of fsolve.
Revised:  The computational time of the new method is about eight to fifty times as fast as that of fsolve.
Edit intent: clarity
Original:  The computational speed of the new method is about eight to fifty times as fast as that of fsolve.
Revised:  The computational speed of the new method is about 1/8 to 1/50 of that of fsolve.
Edit intent: clarity
Original:  We expect BIKED to enable a variety of data-driven design applications for bicycles and generally support the development of data-driven design methods.
Revised:  We expect BIKED to enable a variety of data-driven design applications for bicycles and support the development of data-driven design methods.
Edit intent: coherence
Original:  The epidemiological evolution is obtained by relying on an approach based on statical mechanics.
Revised:  The epidemiological evolution is obtained by relying on an approach based on statistical mechanics.
Edit intent: fluency
Original:  Given a polygonal curve P with n vertices  , and parameters kand \ell , the goal is to find k center curves of complexity at most \ell such that every point on P is covered by a subtrajectory that has small Fr\'echet distance to one of the k center curves .
Revised:  Given a polygonal curve P with n vertices , the goal is to find k center curves of complexity at most \ell such that every point on P is covered by a subtrajectory that has small Fr\'echet distance to one of the k center curves .
Edit intent: clarity
Original: Several pieces of work have uncovered performance disparities by conducting "disaggregated evaluations " of AI systems .
Revised: Disaggregated evaluations of AI systems .
Edit intent: clarity
Original:  We build on these efforts by focusing on the choices that must be made when designing a disaggregated evaluation , as well as some of the key considerations that underlie these design choices and the tradeoffs between these considerations .
Revised:  We build on these efforts by focusing on the choices that a disaggregated evaluation , as well as some of the key considerations that underlie these design choices and the tradeoffs between these considerations .
Edit intent: clarity
Original:  We build on these efforts by focusing on the choices that must be made when designing a disaggregated evaluation , as well as some of the key considerations that underlie these design choices and the tradeoffs between these considerations .
Revised:  We build on these efforts by focusing on the choices that must be made when designing a disaggregated evaluation will have on people, including the people whose data is used to conduct the evaluation .
Edit intent: clarity
Original:  We argue that a deeper understanding of the choices , considerations, and tradeoffs involved in designing disaggregated evaluationswill better enable researchers, practitioners, and the public to understand the ways in which AI systems may be underperforming for particular groups of people .
Revised:  We argue that a deeper understanding of these choices will enable researchers and practitioners to design careful and conclusive disaggregated evaluations. We also argue that better documentation of these choices, along with the underlying considerations and tradeoffs that have been made, will help others when interpreting an evaluation's results and conclusions .
Edit intent: clarity
Original: Reusing mature softwarepackages that have been developed repeatedly can greatly enhance the efficiency and quality of software development .
Revised: With the increase of complexity of modern software, social collaborative coding and reuse of open source software packages become more and more popular, which thus greatly enhances the development efficiency and software quality .
Edit intent: coherence
Original:  In this paper, we propose a novel software recommendation model, named as Session-based Social and Dependence-aware Recommendation (SSDRec) .
Revised:  In this paper, we propose a novel software recommendation model, named as Session-based Social and Dependency-aware software Recommendation (SSDRec) .
Edit intent: clarity
Original: It is useful for autonomous vehicles to have the ability to infer the goals of other vehicles (goal recognition), in order to safely interact with other vehicles and predict their future trajectories.
Revised: It is important for autonomous vehicles to have the ability to infer the goals of other vehicles (goal recognition), in order to safely interact with other vehicles and predict their future trajectories.
Edit intent: clarity
Original:  We propose Goal Recognition with Interpretable Trees (GRIT), a goal recognition system for autonomous vehicles which achieves these objectives.
Revised:  We propose Goal Recognition with Interpretable Trees (GRIT), a goal recognition system which achieves these objectives.
Edit intent: clarity
Original:  Evaluation on two vehicle trajectory datasetsdemonstrates the inference speed and accuracy of GRIT compared to an ablation and two deep learning baselines  .
Revised:  We evaluate GRIT on two datasets, showing that GRIT achieved fast inference speed and accuracy of GRIT compared to an ablation and two deep learning baselines .
Edit intent: clarity
Original:  Evaluation on two vehicle trajectory datasetsdemonstrates the inference speed and accuracy of GRIT compared to an ablation and two deep learning baselines  .
Revised:  Evaluation on two vehicle trajectory datasetsdemonstrates the inference speed and comparable accuracy to two deep learning baselines .
Edit intent: clarity
Original: For many psychiatric disorders, neuroimaging offers a potential for revolutionizing diagnosis and treatment by providing access to preverbal mental processes.
Revised: For many psychiatric disorders, neuroimaging offers a potential for revolutionizing diagnosis , and potentially treatment, by providing access to preverbal mental processes.
Edit intent: clarity
Original:  Linear constraints are presented as a qualified type system,together with an inference algorithm which extends OutsideIn, GHC's existing constraint solver algorithm.
Revised:  Linear constraints are presented as a qualified type system,together with an inference algorithm which extends GHC's existing constraint solver algorithm.
Edit intent: clarity
Original: More than one year after the emergence of COVID-19 , mass vaccination plans appear as a promising long-term exit strategy .
Revised: Mass vaccination offers a promising exit strategy for the COVID-19 , mass vaccination plans appear as a promising long-term exit strategy .
Edit intent: clarity
Original:  However, declining compliance with non-pharmaceutical interventions (NPIs) pose a latent risk of force-lifting restrictions too early, when most of the population remains susceptible.
Revised:  However, as vaccination progresses, demands to lift restrictions increase, despite most of the population remains susceptible.
Edit intent: clarity
Original:  However, declining compliance with non-pharmaceutical interventions (NPIs) pose a latent risk of force-lifting restrictions too early, when most of the population remains susceptible.
Revised:  However, declining compliance with non-pharmaceutical interventions (NPIs) pose a latent risk of force-lifting restrictions too early, when most of the population still being susceptible.
Edit intent: clarity
Original:  Strategies that maintain low case numbers instead of high ones reduce  Keeping case numbers at a low level instead a) reduces the number of fatalities considerably, b) allows to make full use of TTI programs and , in addition, c) offers a better preparedness if escape variants of the virus challenge the vaccination strategy .
Revised:  Strategies that maintain low case numbers instead of high ones reduce Keeping case numbers low is the safest long-term strategy because it i) considerably reduces mortality and morbidity, ii) offers better preparedness against escape virus variants, and iii) allows higher contact numbers ("freedom") over the summer .
Edit intent: coherence
Original:  However, as vaccination progresses, demands to lift restrictions increase, despite most of the population still being susceptible.
Revised:  However, as vaccination progresses, demands to lift restrictions increase, despite most of the population remaining susceptible.
Edit intent: coherence
Original:  The analysed scenarios range from immediately lifting restriction (accepting high mortality and morbidity) to reducing case numbers until test-trace-and-isolate programs facilitate control .
Revised:  The analysed scenarios range from immediately lifting restrictions (accepting high mortality and morbidity) to reducing case numbers until test-trace-and-isolate programs facilitate control .
Edit intent: fluency
Original:  The analysed scenarios range from immediately lifting restriction (accepting high mortality and morbidity) to reducing case numbers until test-trace-and-isolate programs facilitate control .
Revised:  The analysed scenarios range from immediately lifting restriction (accepting high mortality and morbidity) to reducing case numbers to a level where test-trace-and-isolate programs facilitate control .
Edit intent: clarity
Original:  In general, the age-dependent vaccination roll-out implies a transient decrease  in the average age of ICU patients and deaths by about seven years .
Revised:  In general, the age-dependent vaccination roll-out implies a transient decrease in the average age of ICU patients and deceased .
Edit intent: clarity
Original:  all scenarios allow to steadily increase contacts starting in May 2021 and relax most restrictions by autumn 2021.
Revised:  all considered scenarios allow for steadily increasing contacts starting in May 2021 and relax most restrictions by autumn 2021.
Edit intent: clarity
Original:  all scenarios allow to steadily increase contacts starting in May 2021 and relax most restrictions by autumn 2021.
Revised:  all scenarios allow to steadily increase contacts starting in May 2021 and relaxing most restrictions by autumn 2021.
Edit intent: fluency
Original:  However, with the assumed vaccination protection, further waves among the unvaccinated population can only be avoided with high vaccine uptake (>90%DIFDELCMD < \\%%% %DIF < ).
Revised:  However, only high vaccine uptake (>90%DIFDELCMD < \\%%% %DIF < ).
Edit intent: coherence
Original:  However, with the assumed vaccination protection, further waves among the unvaccinated population can only be avoided with high vaccine uptake (>90%DIFDELCMD < \\%%% %DIF < ).
Revised:  However, with the assumed vaccination protection, further waves among the unvaccinated population can only be avoided with high vaccine uptake %DIFDELCMD < \\%%% %DIF < ).
Edit intent: coherence
Original:  Experiments on language generation tasks, including code summarization , generation, translation in seven programming languages show that PLBART outperforms or rivals state-of-the-art models.
Revised:  Experiments on code summarization in the English language, code generation, and code translation in seven programming languages show that PLBART outperforms or rivals state-of-the-art models.
Edit intent: clarity
Original:  Moreover, experiments on discriminative tasks, e.g., program repair, clone detection, and vulnerable code detection  demonstrate PLBART's effectiveness in program understanding.
Revised:  Moreover, experiments on discriminative tasks, e.g., program repair, clone detection, and vulnerable code detection , demonstrate PLBART's effectiveness in program understanding.
Edit intent: fluency
Original:  The leader has specialized capabilities or mission critical information (e.g. goal location) that the followers lack which makes the leader crucial for the mission's success.
Revised:  The leader has specialized capabilities or mission-critical information (e.g. goal location) that the followers lack which makes the leader crucial for the mission's success.
Edit intent: fluency
Original:  The leader has specialized capabilities or mission critical information (e.g. goal location) that the followers lack which makes the leader crucial for the mission's success.
Revised:  The leader has specialized capabilities or mission critical information (e.g. goal location) that the followers lack , and this makes the leader crucial for the mission's success.
Edit intent: coherence
Original:  We develop SDQL, a statically typed language centered around semi-ring dictionaries, that can encode expressions in relational algebra with aggregations, functional collections, and linear algebra .
Revised:  We developed SDQL, a statically typed language centered around semi-ring dictionaries, that can encode expressions in relational algebra with aggregations, functional collections, and linear algebra .
Edit intent: fluency
Original:  We develop SDQL, a statically typed language centered around semi-ring dictionaries, that can encode expressions in relational algebra with aggregations, functional collections, and linear algebra .
Revised:  We develop SDQL, a statically typed language that can express relational algebra with aggregations, functional collections, and linear algebra .
Edit intent: clarity
Original:  Furthermore, thanks to the semi-ring algebraic structures behind these dictionaries, SDQL unifies a wide range of optimizations commonly used in databases  and linear algebra  .
Revised:  Furthermore, thanks to the algebraic structure behind these dictionaries, SDQL unifies a wide range of optimizations commonly used in databases and linear algebra .
Edit intent: clarity
Original:  Furthermore, thanks to the semi-ring algebraic structures behind these dictionaries, SDQL unifies a wide range of optimizations commonly used in databases  and linear algebra  .
Revised:  Furthermore, thanks to the semi-ring algebraic structures behind these dictionaries, SDQL unifies a wide range of optimizations commonly used in databases (DB) and linear algebra .
Edit intent: clarity
Original:  As a result, SDQL enables efficient processing of hybrid database and linear algebra workloads, by putting together optimizations that are otherwise confined to either database systems or linear algebra frameworks.
Revised:  As a result, SDQL enables efficient processing of hybrid DB and LA workloads, by putting together optimizations that are otherwise confined to either database systems or linear algebra frameworks.
Edit intent: clarity
Original:  Through experimental results, we show that a handful of relational and linear algebra workloads can take advantage of the SDQL language and optimizations.
Revised:  Through experimental results, we show that a handful of DB and LA workloads can take advantage of the SDQL language and optimizations.
Edit intent: clarity
Original:  Overall, we observe that SDQL achieves competitive performance  to Typer and Tectorwise, which are state-of-the-art in-memory  systems for (flat, not nested) relational data, and achieves an average 2x speedup over SciPy for linear algebra workloads.
Revised:  Overall, we observe that SDQL achieves competitive performance relative to Typer and Tectorwise, which are state-of-the-art in-memory systems for (flat, not nested) relational data, and achieves an average 2x speedup over SciPy for linear algebra workloads.
Edit intent: clarity
Original:  Finally, for hybrid workloads involving linear algebra processingover nested biomedical data, SDQL can give up to one order of magnitude speedup over Trance, a state-of-the-art nested relational engine  .
Revised:  Finally, for hybrid workloads involving LA processing, SDQL achieves up to one order of magnitude speedup over Trance, a state-of-the-art nested relational engine .
Edit intent: clarity
Original:  Indeed, we give quantitative and geometric descriptions of the "size" or "persistence" of a homology class.
Revised:  Indeed, we give quantitative and geometric descriptions of the ``size'' or ``persistence'' of a homology class.
Edit intent: fluency
Original: Database fingerprinting schemes have been widely adopted to prevent unauthorized sharing of data and identify the source of data leakages.
Revised: Database fingerprinting have been widely adopted to prevent unauthorized sharing of data and identify the source of data leakages.
Edit intent: clarity
Original:  Although existing schemes are robust against common attacks, such as random bit flipping and subset attack, their robustness degrades significantly if attackers utilize the inherent correlations among database entries.
Revised:  Although existing schemes are robust against common attacks, like random bit flipping and subset attack, their robustness degrades significantly if attackers utilize the inherent correlations among database entries.
Edit intent: fluency
Original:  In this paper, we first demonstrate this vulnerability of the existing database fingerprinting schemes by identifying different correlation attacks: column-wise correlation attack, row-wise correlation attack, and the integration of them.
Revised:  In this paper, we first demonstrate the vulnerability of existing database fingerprinting schemes by identifying different correlation attacks: column-wise correlation attack, row-wise correlation attack, and the integration of them.
Edit intent: coherence
Original:  We empirically investigate the impact of the identified correlation attacks and the performance of mitigation techniques using two real-world relational databases.
Revised:  We empirically investigate the impact of the identified correlation attacks and the performance of mitigation techniques using real-world relational databases.
Edit intent: clarity