wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We also develop methods of Bayesian inference that are less restrictive (though more demanding in terms of computation time) compared to the ones used so far and demonstrate inference on the latent variables (i.e., object-specific inefficiency terms, which are important for, e.g., policy-oriented analyses) .
Revised:  We also develop Bayesian inference methods that are less restrictive (though more demanding in terms of computation time) compared to the ones used so far and demonstrate inference on the latent variables (i.e., object-specific inefficiency terms, which are important for, e.g., policy-oriented analyses) .
Edit intent: clarity
Original:  We also develop methods of Bayesian inference that are less restrictive (though more demanding in terms of computation time) compared to the ones used so far and demonstrate inference on the latent variables (i.e., object-specific inefficiency terms, which are important for, e.g., policy-oriented analyses) .
Revised:  We also develop methods of Bayesian inference that are less restrictive compared to the ones used so far and demonstrate inference on the latent variables (i.e., object-specific inefficiency terms, which are important for, e.g., policy-oriented analyses) .
Edit intent: clarity
Original:  We also develop methods of Bayesian inference that are less restrictive (though more demanding in terms of computation time) compared to the ones used so far and demonstrate inference on the latent variables (i.e., object-specific inefficiency terms, which are important for, e.g., policy-oriented analyses) .
Revised:  We also develop methods of Bayesian inference that are less restrictive (though more demanding in terms of computation time) compared to the ones used so far and demonstrate feasible approximate alternatives based on maximum likelihood .
Edit intent: meaning-changed
Original: We consider a dynamic model of Bayesian persuasion . Over time, a sender performs a series of experiments to persuade a receiver to take a desired action. Due to constraints on the information flow, the sender must take real time to persuade, and the receiver may stop listening and take a final action at any time. In addition, persuasion is costly for both players.
Revised: We consider a dynamic model of Bayesian persuasion in which information takes time and is costly for both players.
Edit intent: clarity
Original:  However, for persuasion costs sufficiently small, a version of a folk theorem holds: outcomes that approximate Kamenica and Gentzkow (2011)'s sender-optimal persuasion as well as full revelation (which is most preferred by the receiver) and everything in between are obtained in MPE, as the cost vanishes.
Revised:  However, for persuasion costs sufficiently small, a version of a folk theorem holds: outcomes that approximate Kamenica and Gentzkow (2011)'s sender-optimal persuasion as well as full revelation and everything in between are obtained in MPE, as the cost vanishes.
Edit intent: clarity
Original: The Coronavirus Disease 2019 ( COVID-19 ), has infected more than 170 ,000 people globally and resulted in over 6 ,000 deaths over a three-month period.
Revised: The Coronavirus Disease 2019 ( COVID-19 ), has infected more than 462 ,000 people globally and resulted in over 6 ,000 deaths over a three-month period.
Edit intent: meaning-changed
Original: The Coronavirus Disease 2019 ( COVID-19 ), has infected more than 170 ,000 people globally and resulted in over 6 ,000 deaths over a three-month period.
Revised: The Coronavirus Disease 2019 ( COVID-19 ), has infected more than 170 ,000 people globally and resulted in over 20 ,000 deaths over a three-month period.
Edit intent: meaning-changed
Original: The Coronavirus Disease 2019 ( COVID-19 ), has infected more than 170 ,000 people globally and resulted in over 6 ,000 deaths over a three-month period. Contrary to mainstream views, there is growing literature on pre-symptomatic and asymptomatic individuals contributing significantly to the disease outbreak . Several recent studies on serial infection yielded a mean interval of around 4 days, shorter than the mean symptom onset time of 5-7 days, and negative serial interval in more than 10\% of the cases. These observations highlight the urgent need to quantify the pre-symptomatic transmission for adequate global response. In this paper, we develop an epidemic model driven by pre-symptomatic transmission. Within the model construct, the infectiousness of a viral carrier on a given day is identified with their symptom onset probability , which we characterise through extensive studies of the clinical literature.
Revised: The Coronavirus Disease 2019 ( COVID-19 ), has infected more than 170 ,000 people globally and resulted in over 6 ,000 deaths as of March 26, 2020. Swift government response to contain the outbreak requires accurate and continuous census of the infected population, particularly with regard to viral carriers without severe symptoms. We take on this task by converting the symptom onset time distribution , which we characterise through extensive studies of the clinical literature.
Edit intent: meaning-changed
Original:  Within the model construct, the infectiousness of a viral carrier on a given day is identified with their symptom onset probability , which we characterise through extensive studies of the clinical literature. The well-known Lotka-Euler estimating equation can then be invoked to relate the daily growth rate \lambda of the epidemic with the basic reproduction number R_0 . We applied the disease spreading model to epidemic development in affected provinces across China following the Wuhan lockdown on January 23, 2020.
Revised:  Within the model construct, the infectiousness of a viral carrier on a given day is identified with their symptom onset probability , which we calibrated, into the percentage of the latent, pre-symptomatic and symptomatic groups through a novel mathematical procedure. We then estimate the reduction of the basic reproduction number R_0 . We applied the disease spreading model to epidemic development in affected provinces across China following the Wuhan lockdown on January 23, 2020.
Edit intent: meaning-changed
Original:  The well-known Lotka-Euler estimating equation can then be invoked to relate the daily growth rate \lambda of the epidemic with the basic reproduction number R_0 . We applied the disease spreading model to epidemic development in affected provinces across China following the Wuhan lockdown on January 23, 2020. The remarkable three-phase universal pattern can be well-captured by the model. Despite its simplicity, the model allows synthesis of data from diverse sources to form a quantitative understanding of key mechanisms that drive or contain the disease spreading, and to make informed decisions to bring the pandemic under control .
Revised:  The well-known Lotka-Euler estimating equation can then be invoked to relate the daily growth rate \lambda of the epidemic with the basic reproduction number R_0 under specific disease control practices such as contact tracing, testing and social distancing. Finally, in light of our model findings, we analyze the bell-shaped curves of epidemic evolution from various affected regions, and recommend measures to steer the pandemic to its final descent at a universal decay rate of -0.32/day .
Edit intent: meaning-changed
Original:  We then estimate the reduction of the basic reproduction number R_0 under specific disease control practices such as contact tracing, testing and social distancing. Finally, in light of our model findings, we analyze the bell-shaped curves of epidemic evolution from various affected regions , and recommend measures to steer the pandemic to its final descent at a universal decay rate of -0.32/day  .
Revised:  We then estimate the reduction of the basic reproduction number R_0 under specific disease control practices such as contact tracing, testing , social distancing, wearing masks and staying at home. When these measures are implemented in parallel, their effects on R_0 multiply. For example, if 70\% of the general public wear masks and contact tracing is conducted at 60\% efficiency within a 4-day time frame, epidemic growth will be flattened in the hardest hit countries. Finally, we analyze the bell-shaped curves of epidemic evolution from various affected regions , and recommend measures to steer the pandemic to its final descent at a universal decay rate of -0.32/day .
Edit intent: meaning-changed
Original:  Finally, in light of our model findings, we analyze the bell-shaped curves of epidemic evolution from various affected regions , and recommend measures to steer the pandemic to its final descent at a universal decay rate of -0.32/day  .
Revised:  Finally, in light of our model findings, we analyze the bell-shaped curves of epidemic evolution from various affected regions and point out the significance of a universal decay rate of -0.32/day .
Edit intent: clarity
Original:  Finally, in light of our model findings, we analyze the bell-shaped curves of epidemic evolution from various affected regions , and recommend measures to steer the pandemic to its final descent at a universal decay rate of -0.32/day  .
Revised:  Finally, in light of our model findings, we analyze the bell-shaped curves of epidemic evolution from various affected regions , and recommend measures to steer the pandemic to its final descent at a universal decay rate of -0.32/day in the final eradication of the disease .
Edit intent: clarity
Original:  COVID-19 has infected more than 823,000 people globally and resulted in over 40,000 deaths as of April 1, 2020. Swift government response to contain the outbreak requires accurate and continuous census of the infected population, particularly with regards to viral carriers without severe symptoms. We take on this task by converting the symptom onset time distribution, which we calibrated , into the percentage of the latent, pre-symptomatic and symptomatic groups through a novel mathematical procedure .
Revised:  COVID-19 grew into a world-wide pandemic. Transmission by pre-symptomatic and asymptomatic viral carriers rendered intervention and containment of the disease extremely challenging. Based on reported infection case studies, we construct an epidemiological model that focuses on transmission around the symptom onset time distribution, which we calibrated , into the percentage of the latent, pre-symptomatic and symptomatic groups through a novel mathematical procedure .
Edit intent: clarity
Original:  We take on this task by converting the symptom onset time distribution, which we calibrated , into the percentage of the latent, pre-symptomatic and symptomatic groups through a novel mathematical procedure .
Revised:  We take on this task by converting the symptom onset . The model is calibrated against incubation period and serial interval statistics during early stages of the pandemic. Mathematical treatment of the model yields explicit expressions for the size of latent and pre-symptomatic subpopulations during the exponential growth phase .
Edit intent: meaning-changed
Original:  For example, if 70\% of the general public wear masks and contact tracing is conducted at 60\% efficiency within a 4-day time frame, epidemic growth will be flattened in the hardest hit countries. Finally, we analyze the bell-shaped curves of epidemic evolution from various affected regions and point out the significance of a universal decay rate of -0.32/day in the final eradication of the disease .
Revised:  We also compare our model behaviour to pandemic evolution data from various affected regions and point out the significance of a universal decay rate of -0.32/day in the final eradication of the disease .
Edit intent: clarity
Original:  In this paper, we first introduce attentions in the spectral domain of graphs . Accordingly, we present Spectral Graph Attention Network (SpGAT) that learn representations for different frequency components regarding weighted filters and graph wavelets bases.
Revised:  In this paper, we first introduce attentions in the spectral domain of graphs and present Spectral Graph Attention Network (SpGAT) that learn representations for different frequency components regarding weighted filters and graph wavelets bases.
Edit intent: coherence
Original:   We thoroughly evaluate the performance of SpGAT in the semi-supervised node classification task and verified the effectiveness of the learned attentions in the spectral domain.
Revised:  Further, to reduce the computational cost of SpGAT brought by the eigen-decomposition, we propose a fast approximation variant SpGAT-Cheby. We thoroughly evaluate the performance of SpGAT in the semi-supervised node classification task and verified the effectiveness of the learned attentions in the spectral domain.
Edit intent: meaning-changed
Original:  More desirable is a high-level language where the domain-specialist simply specifies the workload in terms of high-level operations (e.g., matrix-multiply(A, B))  and the compiler identifies the best implementation fully utilizing the heterogeneous platform.
Revised:  More desirable is a high-level language where the domain-specialist simply specifies the workload in terms of high-level operations (e.g., matrix-multiply(A, B)) , and the compiler identifies the best implementation fully utilizing the heterogeneous platform.
Edit intent: fluency
Original:  For creating a compiler that supports productivity, portability, and performance simultaneously, it is crucial to predict  performance of various available implementations (variants) of the dominant operations (kernels) contained in the workload on various hardware to decide (a) which variant should be chosen for each kernel in the workload, and (b) on which hardware resource the variant should run.
Revised:  For creating a compiler that supports productivity, portability, and performance simultaneously, it is crucial to predict the performance of various available implementations (variants) of the dominant operations (kernels) contained in the workload on various hardware to decide (a) which variant should be chosen for each kernel in the workload, and (b) on which hardware resource the variant should run.
Edit intent: fluency
Original:  Using models with less than 75 parameters, and only 250 training data instances, we are able to obtain a low MAPE of ~13\% significantly outperforming traditional feed-forward neural networks on 40 kernel-variant-hardware combinations.
Revised:  Using models with less than 75 parameters, and only 250 training data instances, we are able to obtain a low MAPE of 3\%, significantly outperforming traditional feed-forward neural networks on 40 kernel-variant-hardware combinations.
Edit intent: meaning-changed
Original:  Using models with less than 75 parameters, and only 250 training data instances, we are able to obtain a low MAPE of ~13\% significantly outperforming traditional feed-forward neural networks on 40 kernel-variant-hardware combinations.
Revised:  Using models with less than 75 parameters, and only 250 training data instances, we are able to obtain a low MAPE of ~13\% significantly outperforming traditional feed-forward neural networks on 48 kernel-variant-hardware combinations.
Edit intent: meaning-changed
Original: Many important practical markets inherently involve the interaction of strategic buyers with strategic sellers. A fundamental impossibility result for such two-sided markets due to Myerson and Satterthwaite establishes that even in the simplest such market, that of bilateral trade, it is impossible to design a mechanism that is individually rational, truthful, (weakly) budget balanced, and efficient.
Revised: A celebrated impossibility result by Myerson and Satterthwaite establishes that even in the simplest such market, that of bilateral trade, it is impossible to design a mechanism that is individually rational, truthful, (weakly) budget balanced, and efficient.
Edit intent: clarity
Original:  A fundamental impossibility result for such two-sided markets due to Myerson and Satterthwaite establishes that even in the simplest such market, that of bilateral trade, it is impossible to design a mechanism that is individually rational, truthful, (weakly) budget balanced, and efficient. Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare subject to the other constraints-has to be carefully tailored to the Bayesian priors and is extremely complex.
Revised:  A fundamental impossibility result for such two-sided markets due to Myerson and Satterthwaite (1983) shows that any truthful mechanism for two-sided markets that maximizes social welfare subject to the other constraints-has to be carefully tailored to the Bayesian priors and is extremely complex.
Edit intent: clarity
Original:  Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare subject to the other constraints-has to be carefully tailored to the Bayesian priors and is extremely complex.
Revised:  Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare must run a deficit, resulting in a necessity to relax welfare efficiency and the use of approximation mechanisms. Such mechanisms in general make extensive use of the other constraints-has to be carefully tailored to the Bayesian priors and is extremely complex.
Edit intent: meaning-changed
Original:  Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare subject to the other constraints-has to be carefully tailored to the Bayesian priors and is extremely complex. In light of this impossibility result it is very natural to seek "simple" mechanisms that are approximately optimal, and indeed a very active line of recent work has established a broad spectrum of constant-factor approximation guarantees, which apply to settings well beyond those for which (implicit) characterizations of the optimal (second best) mechanism are known. In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em   single sample from the priors!
Revised:  Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare subject to the other constraints-has to be carefully tailored to the Bayesian priors . In this work, we investigate a question of increasing theoretical and practical importance: how much prior information is required to design mechanisms with near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em single sample from the priors!
Edit intent: clarity
Original:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em   single sample from the priors!
Revised:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal approximations? Our first contribution is a more general impossibility result stating that no meaningful approximation is possible without any prior information, expanding the famous impossibility result of Myerson and Satterthwaite. Our second contribution is that one{\em single sample from the priors!
Edit intent: meaning-changed
Original:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em   single sample from the priors!
Revised:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em single sample single sample from the priors!
Edit intent: fluency
Original:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em   single sample from the priors!
Revised:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em (one number per item), arguably a minimum-possible amount of prior information, from each seller distribution is sufficient for a large class of two-sided markets. We prove matching upper and lower bounds on the best approximation that can be obtained with one single sample for subadditive buyers and additive sellers, regardless of computational considerations. Our third contribution is the design of computationally efficient blackbox reductions that turn any one-sided mechanism into a two-sided mechanism with a small loss in the approximation, while using only one single sample from the priors!
Edit intent: meaning-changed
Original:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em   single sample from the priors! In fact, most of our results in addition to requiring less information also improve upon the best known approximation guarantees for the respective setting .
Revised:  In this work, we go one step further and show that for many fundamental two-sided markets-e.g., bilateral trade, double auctions, and combinatorial double auctions-it is possible to design near-optimal mechanisms with provable, constant-factor approximation guarantees with just a{\em single sample from each seller. On the way, our blackbox-type mechanisms deliver several interesting positive results in their own right, often beating even the state of the art that uses full prior information .
Edit intent: meaning-changed
Original:  We investigate the existence and computation of \beta-plurality points, and obtain the following results . * Define \beta^*_d := \sup \{ \beta : any finite multiset V in \mathbb{R^d admits a \beta-plurality point} \}.
Revised:  We investigate the existence and computation of \beta-plurality points, and obtain the following . * Define \beta^*_d := \sup \{ \beta : any finite multiset V in \mathbb{R^d admits a \beta-plurality point} \}.
Edit intent: clarity
Original:  We prove that \beta^*_2 = 3/2, and that 1/d \leq \beta^*_d \leq 3/2 for all d\geq 3. \}.
Revised:  We prove that \beta^*_2 = 3/2, and that 1/d \leq \beta^*_d \leq 3/2 for all d\geq 3. * Define \beta(p, V) := \sup \{ \beta : \text{p is a \beta-plurality point for V\}.
Edit intent: meaning-changed