wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our analysis suggests that collateral deposits can prevent malicious agents to take advantage of the protocols, and we infer that the deposit amount should depend on the underlying asset price volatility or that it should be dynamically adjusted as the prices changes.
Revised:  Our analysis suggests that collateral deposits can prevent malicious agents to take advantage of the protocols, and we infer that the deposit amount should depend on the underlying asset price volatility or that it should be dynamically adjusted as the price changes.
Edit intent: fluency
Original:  In many cases, domain experts -- who often have no expertise in ML or data science -- are asked to use ML predictions to make high-stakes decisions.
Revised:  In many cases, domain experts - who often have no expertise in ML or data science -- are asked to use ML predictions to make high-stakes decisions.
Edit intent: fluency
Original:  In many cases, domain experts -- who often have no expertise in ML or data science -- are asked to use ML predictions to make high-stakes decisions.
Revised:  In many cases, domain experts -- who often have no expertise in ML or data science - are asked to use ML predictions to make high-stakes decisions.
Edit intent: fluency
Original:  In this paper, we investigate the ML usability challenges  present in the domain of child welfare screening through a series of collaborations with child welfare screeners , which included field observations, interviews, and a formal user study.
Revised:  In this paper, we investigate the ML usability challenges that present in the domain of child welfare screening through a series of collaborations with child welfare screeners , which included field observations, interviews, and a formal user study.
Edit intent: clarity
Original:  Through our collaborations, we identified four key ML challenges , and honed in on one promising ML augmentation tool to address them (local factor contributions).
Revised:  Through our collaborations, we identified four key ML challenges and honed in on one promising ML augmentation tool to address them (local factor contributions).
Edit intent: fluency
Original:  We also composed a list of design considerations to be taken into account when developing future augmentation tools for child welfare screeners and  similar domain experts.
Revised:  We also composed a list of design implications as a useful guideline for researchers who aim to develop an interpretable and interactive visualization tool for ML prediction models deployed for child welfare screeners and similar domain experts.
Edit intent: clarity
Original:  We also composed a list of design considerations to be taken into account when developing future augmentation tools for child welfare screeners and  similar domain experts.
Revised:  We also composed a list of design considerations to be taken into account when developing future augmentation tools for child welfare screeners and other similar domain experts.
Edit intent: fluency
Original: This study investigated how social interaction among robotic agents changes dynamically depending on individual sense of agency .
Revised: This study investigated how social interaction among robotic agents changes dynamically depending on the individual belief of action intention .
Edit intent: clarity
Original:  The model is based on the free energy principle such that  interacting robots find themselves in a loop, attempting to predict and infer each other's actions using active inference.
Revised:  The model is based on the free energy principle such that a pair of interacting robots find themselves in a loop, attempting to predict and infer each other's actions using active inference.
Edit intent: clarity
Original:  We examined how regulating the complexity term to minimize free energy during training determines the dynamic characteristics of networks and affects dyadic imitative interactions.
Revised:  We examined how regulating the complexity term to minimize free energy determines the dynamic characteristics of networks and affects dyadic imitative interactions.
Edit intent: clarity
Original: Recent empirical results show that deep networks can approximate solutions to high dimensional PDEs, seemingly escaping the curse of dimensionality.
Revised: Recent experiments have shown that deep networks can approximate solutions to high dimensional PDEs, seemingly escaping the curse of dimensionality.
Edit intent: clarity
Original: Recent empirical results show that deep networks can approximate solutions to high dimensional PDEs, seemingly escaping the curse of dimensionality.
Revised: Recent empirical results show that deep networks can approximate solutions to high-dimensional PDEs, seemingly escaping the curse of dimensionality.
Edit intent: fluency
Original:  However many open questions remain regarding the theoretical basis for such approximations, including the number of parameters required .
Revised:  However , questions regarding the theoretical basis for such approximations, including the number of parameters required .
Edit intent: clarity
Original:  However many open questions remain regarding the theoretical basis for such approximations, including the number of parameters required .
Revised:  However many open questions remain regarding the theoretical basis for such approximations, including the required network size, remain open .
Edit intent: clarity
Original:  In this paper, we investigate the representational power of neural networks for approximating solutions to linear elliptic PDEs with Dirichlet Boundary conditions.
Revised:  In this paper, we investigate the representational power of neural networks for approximating solutions to linear elliptic PDEs with Dirichlet boundary conditions.
Edit intent: fluency
Original:  Our proof is based on constructing a neural network which simulates gradient descent  in an appropriate Hilbert space which converges to the solution of the PDE.
Revised:  Our proof is based on constructing a neural network which simulates gradient descent ( in an appropriate Hilbert space which converges to the solution of the PDE.
Edit intent: fluency
Original:  Moreover, we bound the size of the neural network needed to represent each iterate in terms of the neural network representing the previous iterate, resulting in a final network whose parameters depend polynomially on d and does not depend on the volume of the domain.
Revised:  Moreover, we bound the size of the solution, showing a polynomial dependence on d and does not depend on the volume of the domain.
Edit intent: clarity
Original:  Y/N), peer prediction aims to design mechanisms that encourage honest subjective feedback without verification.
Revised:  Y/N), peer prediction aims to design mechanisms that encourage honest feedback without verification.
Edit intent: clarity
Original:  We use VMI to design a family of mechanisms where truth-telling is better than any other strategy and all participants only need to answer a small constant number of tasks.
Revised:  A series of works have successfully designed multi-task peer prediction mechanisms where reporting truthfully is better than any other strategy and all participants only need to answer a small constant number of tasks.
Edit intent: clarity
Original:  This work addresses this problem by proposing a  tractable effort incentive optimization goal and generalizing DMI-Mechanism to a new family of practical, dominantly truthful mechanisms, Volume Mutual Information (VMI)-Mechanisms .
Revised:  This work addresses this problem by proposing a tractable effort incentive optimization goal .
Edit intent: coherence
Original:  The main technical tool is a novel family of mutual information measures , Volume Mutual Information, which generalizes Determinant Mutual Information.
Revised:  The main technical highlight in this paper is a novel family of mutual information measures , Volume Mutual Information, which generalizes Determinant Mutual Information.
Edit intent: clarity
Original:  We construct VMI by a simple geometric idea: we measure how informative a distribution is by measuring the volume of distributions that is less informative than it (inappropriately, it's similar to measuring how clever a person is by counting the number of people that are less clever than he/she) .
Revised:  We construct VMI by a simple geometric idea: we can measure an object A's information amount by the number of objects that is less informative than it (inappropriately, it's similar to measuring how clever a person is by counting the number of people that are less clever than he/she) .
Edit intent: clarity
Original:  To help mitigate these challenges, we introduce a new robust and lightweight tool (ir_d atases ) for acquiring, managing, and performing typical operations over datasets used in IR.
Revised:  To help mitigate these challenges, we introduce a new robust and lightweight tool (ir_d atasets ) for acquiring, managing, and performing typical operations over datasets used in IR.
Edit intent: clarity
Original:  This tool provides both a python and command line interface to numerous IR datasets and benchmarks.
Revised:  This tool provides both a Python and command line interface to numerous IR datasets and benchmarks.
Edit intent: fluency
Original:  These include a novel list-based query processor, which avoids expensive data copies of traditional block-based processors under many-to-many joins and avoids materializing adjacency lists in intermediate tuples , a new data structure we call single-indexed edge property pages and an accompanying edge ID scheme, and a new application of Jacobson's bit vector index for compressing NULL values and empty lists.
Revised:  These include a novel list-based query processor, which avoids expensive data copies of traditional block-based processors under many-to-many joins , a new data structure we call single-indexed edge property pages and an accompanying edge ID scheme, and a new application of Jacobson's bit vector index for compressing NULL values and empty lists.
Edit intent: clarity
Original:  The openMHA software is independent of a specific hardware and supports Linux, MacOS and Windows operating systems as well as 32- bit and 64-bit ARM-based architectures such as used in small portable integrated systems. www.openmha.org
Revised:  The openMHA software is independent of a specific hardware and supports Linux, MacOS and Windows operating systems as well as 32-bit and 64-bit ARM-based architectures such as used in small portable integrated systems. www.openmha.org
Edit intent: fluency
Original: Driven by increasing demands on connectivity to improve safety, situational awareness and operational effectiveness for first responders, more and more public safety agencies are realizing the needs of modernization of their existing non-3GPP networks.
Revised: Driven by increasing demands on connectivity to improve safety, situational awareness and operational effectiveness for first responders, more and more public safety agencies are realizing the need of modernization of their existing non-3GPP networks.
Edit intent: fluency
Original:  3GPP based cellular networks offers the unique opportunity of providing fast, reliable, and prioritized communications for first responders in a shared network.
Revised:  3GPP based cellular networks offer the unique opportunity of providing fast, reliable, and prioritized communications for first responders in a shared network.
Edit intent: fluency
Original:  In this article, we give an overview of service requirements on public safety mission critical communications.
Revised:  In this article, we give an overview of service requirements of public safety mission critical communications.
Edit intent: fluency
Original:  But understanding these avalanches of high-dimensional data -- by distilling underlying principles of more general nature -- necessitates dimensional reduction.
Revised:  Understanding these avalanches of high-dimensional data -- by distilling underlying principles of more general nature -- necessitates dimensional reduction.
Edit intent: coherence
Original:  But understanding these avalanches of high-dimensional data -- by distilling underlying principles of more general nature -- necessitates dimensional reduction.
Revised:  But understanding these avalanches of high-dimensional data -- by distilling underlying principles and mechanisms -- necessitates dimensional reduction.
Edit intent: clarity
Original:  We will explain how some geometric insights by mathematicians allow one to identify  genuine hallmarks of biological systems and distinguish them from universal properties of generic data sets.
Revised:  We will explain how some geometric insights by mathematicians allow one to identify these genuine hallmarks of biological systems and distinguish them from universal properties of generic data sets.
Edit intent: coherence
Original:  We will explain how some geometric insights by mathematicians allow one to identify  genuine hallmarks of biological systems and distinguish them from universal properties of generic data sets.
Revised:  We will explain how some geometric insights by mathematicians allow one to identify genuine hallmarks of life and distinguish them from universal properties of generic data sets.
Edit intent: clarity
Original:  In particular, life involves many layers of information processing and internal representations that give rise to extreme dimensional reduction.
Edit intent: coherence
Original:  We illustrate these general principles in a concrete example of a model of protein evolution .
Revised:  We illustrate these principles in a concrete example of a model of protein evolution .
Edit intent: clarity
Original:  More precisely, we need to find a set of k centers C so as to minimize the maximum over all groups j of \sum_{u \text{ in group }j} d(u,C)^p. The socially fair clustering problem was independently proposed by Abbasi, Bhaskara, and Venkatasubramanian [2021] and Ghadiri, Samadi, and Vempala [2021].
Revised:  More precisely, we need to find a set of k centers C so as to minimize the maximum over all groups j of \sum_{u \text{ in group }j} d(u,C)^p. The socially fair clustering problem was independently proposed by Abbasi, Bhaskara, and Venkatasubramanian [2021] and Abbasi, Bhaskara, and Venkatasubramanian [2021].
Edit intent: coherence
Original: Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically-optimized, functionally graded structures, particularly when those structures are represented as discrete density maps.
Revised: Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically optimized structures, particularly when those structures are represented as discrete density maps.
Edit intent: clarity
Original: Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically-optimized, functionally graded structures, particularly when those structures are represented as discrete density maps.
Revised: Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically-optimized, functionally graded structures, particularly those represented as discrete density maps.
Edit intent: coherence
Original:  One na\"ive approach to creating variable-density cellular structures is simply replacing the discrete density map with an unselective type of unit cells having corresponding densities.
Revised:  However, the optimization of such cellular structures is simply replacing the discrete density map with an unselective type of unit cells having corresponding densities.
Edit intent: clarity
Original:  generate various unit cells that satisfy given material properties with high accuracy (relative error <5\%) , 2) create functionally graded cellular structures with high-quality interface connectivity (98.7\% average overlap area at interfaces), and 3) improve the structural performance over the conventional topology-optimized variable-density structure ( 84.4\% reduction in concentrated stress and  extra 7\% reduction in displacement ) .
Revised:  generate various unit cells that satisfy given material properties with high accuracy (relative error <5\%) and 2) create functionally graded cellular structures with high-quality interface connectivity (98.7\% average overlap area at interfaces), and 3) improve the structural performance over the conventional topology-optimized variable-density structure ( 84.4\% reduction in concentrated stress and extra 7\% reduction in displacement ) .
Edit intent: coherence
Original:  generate various unit cells that satisfy given material properties with high accuracy (relative error <5\%) , 2) create functionally graded cellular structures with high-quality interface connectivity (98.7\% average overlap area at interfaces), and 3) improve the structural performance over the conventional topology-optimized variable-density structure ( 84.4\% reduction in concentrated stress and  extra 7\% reduction in displacement ) .
Revised:  generate various unit cells that satisfy given material properties with high accuracy (relative error <5\%) , 2) improve the optimized structural performance over the conventional topology-optimized variable-density structure ( 84.4\% reduction in concentrated stress and extra 7\% reduction in displacement ) .
Edit intent: clarity
Original:  generate various unit cells that satisfy given material properties with high accuracy (relative error <5\%) , 2) create functionally graded cellular structures with high-quality interface connectivity (98.7\% average overlap area at interfaces), and 3) improve the structural performance over the conventional topology-optimized variable-density structure ( 84.4\% reduction in concentrated stress and  extra 7\% reduction in displacement ) .
Revised:  generate various unit cells that satisfy given material properties with high accuracy (relative error <5\%) , 2) create functionally graded cellular structures with high-quality interface connectivity (98.7\% average overlap area at interfaces), and 3) improve the structural performance over the conventional topology-optimized variable-density structure ( 84.4\% reduction in concentrated stress and an extra 7\% reduction in displacement ) .
Edit intent: fluency
Original: Ensemble analysis has become an important tool for analyzing and quantifying gerrymandering;
Revised: Ensemble analysis has become an important tool for quantifying gerrymandering;
Edit intent: coherence
Original:  A variety of methods have been used to construct ensembles of plans , and a fundamental question that arises is: How accurately does an ensemble constructed by a particular method represent the entire space of valid plans-- or, if a method has an inherent bias towards particular types of plans , can this bias be identified and quantified ? Recently, Markov Chain Monte Carlo (MCMC ) methods have become a predominant tool for constructing ensembles of plans.
Revised:  Many methods have been used to construct ensembles of plans , and a fundamental question that arises is: How accurately does an ensemble constructed by a particular method represent the entire space of valid plans-- or, if a method has an inherent bias towards particular types of plans , can this bias be identified and quantified ? Recently, Markov Chain Monte Carlo (MCMC ) methods have become a predominant tool for constructing ensembles of plans.
Edit intent: clarity
Original:  A variety of methods have been used to construct ensembles of plans , and a fundamental question that arises is: How accurately does an ensemble constructed by a particular method represent the entire space of valid plans-- or, if a method has an inherent bias towards particular types of plans , can this bias be identified and quantified ? Recently, Markov Chain Monte Carlo (MCMC ) methods have become a predominant tool for constructing ensembles of plans.
Revised:  A variety of methods have been used to construct ensembles , and a fundamental question that arises is: How accurately does an ensemble constructed by a particular method represent the entire space of valid plans-- or, if a method has an inherent bias towards particular types of plans , can this bias be identified and quantified ? Recently, Markov Chain Monte Carlo (MCMC ) methods have become a predominant tool for constructing ensembles of plans.
Edit intent: fluency
Original:  A variety of methods have been used to construct ensembles of plans , and a fundamental question that arises is: How accurately does an ensemble constructed by a particular method represent the entire space of valid plans-- or, if a method has an inherent bias towards particular types of plans , can this bias be identified and quantified ? Recently, Markov Chain Monte Carlo (MCMC ) methods have become a predominant tool for constructing ensembles of plans.
Revised:  A variety of methods have been used to construct ensembles of plans , and a fundamental question that arises is: Given a method for constructing plans, can we identify a probability distribution on the space of plans that describes the probability of constructing any particular plan by that method ? Recently, Markov Chain Monte Carlo (MCMC ) methods have become a predominant tool for constructing ensembles of plans.
Edit intent: clarity
Original:  This method appears to produce plans with relatively compact districts compared to some other methods, and we sought to  understand this phenomenon in greater detail.
Revised:  This method appears to produce plans with more compact districts than some other methods, and we sought to understand this phenomenon in greater detail.
Edit intent: clarity
Original:  This method appears to produce plans with relatively compact districts compared to some other methods, and we sought to  understand this phenomenon in greater detail.
Revised:  This method appears to produce plans with relatively compact districts compared to some other methods, and we sought to better understand this phenomenon in greater detail.
Edit intent: clarity
Original:  In order to model the basic ReCom step, we constructed large ensembles of plans consisting of two districts for two grid graphs and for the precinct graph of Boulder County, CO.
Revised:  In order to model the basic ReCom step, we constructed ensembles of 2-district plans for two grid graphs and for the precinct graph of Boulder County, CO.
Edit intent: clarity
Original:  We found that , to a high degree of accuracy, the sampling probability for any particular plan is proportional to an exponentially decaying function of a discrete measure that approximates the length of the boundary between the two districts in the plan.
Revised:  We found that the probability of sampling any particular plan is proportional to an exponentially decaying function of a discrete measure that approximates the length of the boundary between the two districts in the plan.
Edit intent: clarity
Original:  This suggests a more quantitative formulation of the observation that ReCom tends to produce relatively compact districts, and it represents an important first step towards understanding the full sampling probability distribution associated to the ReCom method.
Revised:  This is an important step towards understanding the full sampling probability distribution associated to the ReCom method.
Edit intent: coherence
Original:  This suggests a more quantitative formulation of the observation that ReCom tends to produce relatively compact districts, and it represents an important first step towards understanding the full sampling probability distribution associated to the ReCom method.
Revised:  This suggests a more quantitative formulation of the observation that ReCom tends to produce relatively compact districts, and it represents an important first step towards understanding compactness properties for districting plans produced by the ReCom method.
Edit intent: clarity
Original: This paper introduces the key concepts and problems of the new research area of Periodic Geometry and Topology for applications in Materials Science .
Revised: This monograph introduces key concepts and problems of the new research area of Periodic Geometry and Topology for applications in Materials Science .
Edit intent: clarity