wanyu/IteraTeR_full_sent huggingface dataset:
Original:  This paper relaxes key assumptions regarding the availability of information included the hidden action model in order to study whether and, if so, how fast the optimal sharing rule is achieved and how this is affected by the various types of information employed in the principal-agent relation.
Revised:  This paper relaxes key assumptions regarding the availability of information included in the hidden-action model in order to study whether and, if so, how fast the optimal sharing rule is achieved and how this is affected by the various types of information employed in the principal-agent relation.
Edit intent: fluency
Original:  For this, we follow an approach to transfer closed-form mathematical models into agent-based computational models . The results show that the extent of information about feasible options to carry out a task only has an impact on performance , if decision-makers are well informed about the environment, and that the decision whether to perform exploration or exploitation when searching for new feasible options only affects performance in specific situations.
Revised:  For this, we follow an approach to transfer closed-form mathematical models into agent-based computational models and show that the extent of information about feasible options to carry out a task only has an impact on performance , if decision-makers are well informed about the environment, and that the decision whether to perform exploration or exploitation when searching for new feasible options only affects performance in specific situations.
Edit intent: coherence
Original:  The results show that the extent of information about feasible options to carry out a task only has an impact on performance , if decision-makers are well informed about the environment, and that the decision whether to perform exploration or exploitation when searching for new feasible options only affects performance in specific situations.
Revised:  The results show that the extent of information about feasible options to carry out a task only has an impact on performance if decision makers are well informed about the environment, and that the decision whether to perform exploration or exploitation when searching for new feasible options only affects performance in specific situations.
Edit intent: fluency
Original:  We find that using an aging-specific subnetwork indeed yields more accurate aging-related gene predictions than using the entire network . Also, predictive methods from our framework that have not previously been used for supervised prediction of aging-related genes outperform existing prominent methods for the same purpose  .
Revised:  We find that using an aging-specific subnetwork indeed yields more accurate aging-related gene predictions than using the entire network , and (ii) predictive methods from our framework that have not previously been used for supervised prediction of aging-related genes outperform existing prominent methods for the same purpose .
Edit intent: coherence
Original:  Applying a covering scheme, we can boost any 2-approximation algorithm for CVP to a (1+\epsilon)-approximation algorithm with the improved run time, either using a straightforward sampling routine or using the deterministic algorithm of Dadush for the construction of an epsilon net.
Revised:  Applying a covering scheme, we can boost any constant approximation algorithm for CVP to a (1+\epsilon)-approximation algorithm with the improved run time, either using a straightforward sampling routine or using the deterministic algorithm of Dadush for the construction of an epsilon net.
Edit intent: meaning-changed
Original:  This generalizes the result of Eisenbrand et al. which applies to the \ell_\infty-norm. As it is the case for the covering procedure of Eisenbrand et al., our approach boosts any constant factor approximation algorithm to a (1+\epsilon)-approximate algorithm. By assuming the existence of a poly(n)-space and 2^{O(n) .
Revised:  Finally, we establish a connection between the and 2^{O(n) .
Edit intent: coherence
Original:  By assuming the existence of a poly(n)-space and 2^{O(n) .
Revised:  By assuming the existence of a poly(n)-space and 2^{O(n). Using the enumeration and sparsification tools developped by Dadush, Kun, Peikert and Vempala, this leads to a simple alternative to the boosting procedure for CVP under \ell_p-norms. This connection might be of independent interest .
Edit intent: meaning-changed
Original: Resource competition theory (R* theory) predicts that the species with the highest efficiency (lowest resource requirements) will exclude all other species when competing over a single resource. This prediction contrasts the vast diversity in natural systems where there are often few limiting resources . We conjecture that this prediction is derived from the unrealistic assumption that all species acquire the same amount of the resource, i. e. equal exploitation.
Revised: Resource competition theory predicts coexistence and exclusion patterns based on species Rs, the resource levels of zero net growth. A major assumption of this theory is that all species have identical access to resources. However, many systems are characterized by preemption exploitation (e.g. asymmetric competition, contest competition) where some species deplete resources before encountering their competitors. Although preemption exploitation was incorporated into several system-specific and resource-specific models, these models lack the simplicity, generality, and analytical tractability of the classical theory.
Edit intent: meaning-changed
Original:  Here, we introduce to this theory the concept of preemption exploitation and demonstrate that multispecies coexistence is possible when there is a tradeoff between resource use efficiency and preemption ability.
Revised:  Here, we extend resource competition theory to include hierarchical preemption exploitation and show that the conditions for coexistence are qualitatively different from that of equal exploitation. Under preemption exploitation, a necessary and sufficient condition for coexistence is that the R of the inferior species be lower than the superior preemptors. In other words, there should be a tradeoff between resource use efficiency and preemption ability.
Edit intent: meaning-changed
Original:  Here, we introduce to this theory the concept of preemption exploitation and demonstrate that multispecies coexistence is possible when there is a tradeoff between resource use efficiency and preemption ability. Moreover, our model predicts a transition from efficiency dominated communities to preemption dominated communities with increasing resource availability . This new theory unifies URLanism-specific mechanisms and tradeoffs into a single general tradeoff between preemption and efficiency that provides a mean of coexistence under resource competition .
Revised:  Here, we introduce to this theory the concept of preemption exploitation and demonstrate that multispecies coexistence is possible when there is a tradeoff between the ability to preempt the resource and R. Within the coexistence region, the relative abundance of the preemptor species increases as the difference in Rs decreases and as resource availability increases. Our results highlight the tradeoff between preemption and efficiency that provides a mean of coexistence under resource competition .
Edit intent: meaning-changed
Original:  This new theory unifies URLanism-specific mechanisms and tradeoffs into a single general tradeoff between preemption and efficiency that provides a mean of coexistence under resource competition .
Revised:  This new theory unifies URLanism-specific mechanisms and tradeoffs into a single general tradeoff between preemption ability and R as a coexistence mechanism that unifies seemingly distinct tradeoffs, i.e., various biological attributes lead to a negative relationship between being a gleaner (having low R) and preemption ability .
Edit intent: meaning-changed
Original: Advertisers that engage in real-time bidding (RTB) to display their ads commonly have two goals: learning their optimal bidding policy and estimating the expected effect of exposing users to their ads. Typical strategies to accomplish one of these goals tend to ignore the other, creating an apparent tension between the two .
Revised: Advertisers that engage in real-time bidding (RTB) systems, which leverage auctions to programmatically allocate user impressions to multiple competing advertisers, continue to enjoy widespread success in digital advertising. Assessing the effectiveness of such advertising remains a lingering challenge in research and practice .
Edit intent: clarity
Original:  This paper exploits the economic structure of the bid optimization problem faced by advertisers to show that these two objectives can actually be perfectly aligned. By framing the advertiser's problem as a multi-armed bandit (MAB)
Revised:  This paper exploits the economic structure of first- and second-price auctions, which are ubiquitous in RTB systems, embedded within a multi-armed bandit (MAB)
Edit intent: meaning-changed
Original:  problem, we propose a modified Thompson Sampling (TS) algorithm that concurrently learns the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Revised:  setup for online adaptive experimentation. We implement it via a modified Thompson Sampling (TS) algorithm that concurrently learns the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Edit intent: meaning-changed
Original:  problem, we propose a modified Thompson Sampling (TS) algorithm that concurrently learns the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Revised:  problem, we propose a modified Thompson sampling (TS) algorithm that concurrently learns the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Edit intent: fluency
Original:  problem, we propose a modified Thompson Sampling (TS) algorithm that concurrently learns the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Revised:  problem, we propose a modified Thompson Sampling (TS) algorithm that estimates causal effects of advertising while minimizing the costs of experimentation to the advertiser by simultaneously learning the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Edit intent: meaning-changed
Original:  problem, we propose a modified Thompson Sampling (TS) algorithm that concurrently learns the optimal bidding policy and estimates the expected effect of displaying the ad while minimizing economic losses from potential sub-optimal bidding . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Revised:  problem, we propose a modified Thompson Sampling (TS) algorithm that concurrently learns the optimal bidding policy that maximizes her expected payoffs from auction participation . Simulations show that not only the proposed method successfully accomplishes the advertiser's goals, but also does so at a much lower cost than more conventional experimentation policies aimed at performing causal inference.
Edit intent: clarity
Original:  The interactive, iterative nature of our neural system fits well into the continuous time formulation of data sensory stream prediction and, as we show, the model's structure yields a simple, local synaptic update rule, which could be used to complement or replace online spike-timing dependent plasticity rules .
Revised:  The interactive, iterative nature of our neural system fits well into the continuous time formulation of data sensory stream prediction and, as we show, the model's structure yields a simple, local synaptic update rule, which could be used to complement or replace online spike-timing dependent plasticity .
Edit intent: fluency
Original:  Notably, our model is competitive in terms of classification performance, capable of conducting online semi-supervised learning, and more computationally economical and biologically-plausible than popular artificial neural networks.
Revised:  Notably, our model is competitive in terms of classification performance, capable of conducting online semi-supervised learning, naturally experiences less URLetting when learning from a sequence of tasks, and is more computationally economical and biologically-plausible than popular artificial neural networks.
Edit intent: meaning-changed
Original:   We improve this by showing that if r is not a prime power and N:=(d+1)r-r\Big\lceild+2{r+1}\Big\rceil-2, then there is an almost r-embedding \Delta_N\to\mathbb R^d.
Revised:  This was improved by Blagojevi\'c-Frick-Ziegler using a simple construction of higher-dimensional counterexamples by taking k-fold join power of lower-dimensional ones. We improve this by showing that if r is not a prime power and N:=(d+1)r-r\Big\lceild+2{r+1}\Big\rceil-2, then there is an almost r-embedding \Delta_N\to\mathbb R^d.
Edit intent: meaning-changed
Original:   We improve this by showing that if r is not a prime power and N:=(d+1)r-r\Big\lceild+2{r+1}\Big\rceil-2, then there is an almost r-embedding \Delta_N\to\mathbb R^d.
Revised:  We improve this further (for d large compared to r): If r is not a prime power and N:=(d+1)r-r\Big\lceild+2{r+1}\Big\rceil-2, then there is an almost r-embedding \Delta_N\to\mathbb R^d.
Edit intent: meaning-changed
Original:  Our proof is based on generalizations of the Mabillard--Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the \"Ozaydin theorem on existence of equivariant maps.
Revised:  Our proof is based on generalizations of the Mabillard-Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the \"Ozaydin theorem on existence of equivariant maps.
Edit intent: fluency
Original: A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA) . Attribute explorationis a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert.
Revised: A well-known knowledge acquisition method in the field of Formal Concept Analysis (FCA) . Attribute explorationis a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert.
Edit intent: clarity
Original:  The structure of such information can be analysed using Formal Concept Analysis (FCA) . Attribute explorationis a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert.
Revised:  The structure of such information can be analysed using Formal Concept Analysis (FCA) is attribute exploration. It is used to reveal dependencies in a set of attributes with help of a domain expert.
Edit intent: coherence
Original:  However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together.
Revised:  However, in general no single expert is capable (time- and knowledge-wise) of exploring the knowledge domain alone. However, there is up to now no theory that models the interaction of multiple experts for the task of attribute exploration with incomplete knowledge. To this end, we to develop a theoretical framework that allows multiple experts to explore domains together.
Edit intent: meaning-changed
Original:  To this end we build upon results on representation of incomplete knowledge 2, 8-10 , adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Revised:  We use a representation of incomplete knowledge 2, 8-10 , adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Edit intent: clarity
Original:  To this end we build upon results on representation of incomplete knowledge 2, 8-10 , adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Revised:  To this end we build upon results on representation of incomplete knowledge , adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Edit intent: coherence
Original:  To this end we build upon results on representation of incomplete knowledge 2, 8-10 , adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Revised:  To this end we build upon results on representation of incomplete knowledge 2, 8-10 as three-valued contexts. We then adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Edit intent: meaning-changed
Original:  To this end we build upon results on representation of incomplete knowledge 2, 8-10 , adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Revised:  To this end we build upon results on representation of incomplete knowledge 2, 8-10 , adapt the corresponding version of attribute exploration to fit the setting of multiple experts . We suggest formalizations for key components like expert knowledge, interaction and collaboration strategy.
Edit intent: coherence
Original:  We establish lower and upper bounds on the new variants of the segment number, mostly for cubic graphs, depending on the connectivity of the given graph. We also construct an infinite family of planar graphs where the classical segment number is asymptotically twice as large as each of the new variants of the segment number  .
Revised:  We first construct an infinite family of planar graphs where the classical segment number is asymptotically twice as large as each of the new variants of the segment number .
Edit intent: clarity
Original: We consider certain analytical features of the "Kill the Winner" model which is a stochastic model that can explain among other things competition among species and simultaneous predation on the competing species  .
Revised: We consider certain analytical features of the "Kill the Winner" model which is a stochastic model that can explain among other things competition among species and simultaneous predation on the competing species from a geometric perspective which allows for a systematic description of models admitting singular Lagrangians .
Edit intent: meaning-changed
Original:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance  that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Revised:  The main contributions of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Edit intent: fluency
Original:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance  that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Revised:  The main contribution of this paper are to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Edit intent: fluency
Original:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance  that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Revised:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, and provide methods of collision detection and anticipatory collision avoidance that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Edit intent: clarity