wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we develop a  joint space sampling-based MPC for manipulators that can be efficiently parallelized using GPUs.
Revised:  In this paper, we develop a system for fast, joint space sampling-based MPC for manipulators that can be efficiently parallelized using GPUs.
Edit intent: clarity
Original:  In this paper, we develop a  joint space sampling-based MPC for manipulators that can be efficiently parallelized using GPUs.
Revised:  In this paper, we develop a joint space sampling-based MPC for manipulators that is efficiently parallelized using GPUs.
Edit intent: coherence
Original:  Second , we propose an adversarial bias mitigation approach applied to the state-of-the-art Bert rankers , which jointly learns to predict relevance and remove protected attributes.
Revised:  To mitigate these biases , we propose an adversarial bias mitigation approach applied to the state-of-the-art Bert rankers , which jointly learns to predict relevance and remove protected attributes.
Edit intent: clarity
Original:  Second , we propose an adversarial bias mitigation approach applied to the state-of-the-art Bert rankers , which jointly learns to predict relevance and remove protected attributes.
Revised:  Second , we propose an adversarial bias mitigation for IR , which jointly learns to predict relevance and remove protected attributes.
Edit intent: clarity
Original: Facebook announced a community review program in December 2019 and Twitter launched a community-based platform to address misinformation , called Birdwatch, in January 2021.
Revised: Facebook and Twitter recently announced community-based platform to address misinformation , called Birdwatch, in January 2021.
Edit intent: clarity
Original: Facebook announced a community review program in December 2019 and Twitter launched a community-based platform to address misinformation , called Birdwatch, in January 2021.
Revised: Facebook announced a community review program in December 2019 and Twitter launched a community-based review platforms to address misinformation , called Birdwatch, in January 2021.
Edit intent: fluency
Original: Facebook announced a community review program in December 2019 and Twitter launched a community-based platform to address misinformation , called Birdwatch, in January 2021.
Revised: Facebook announced a community review program in December 2019 and Twitter launched a community-based platform to address misinformation .
Edit intent: coherence
Original:  We provide an overview of the potential affordances of such community based approaches to content moderation based on past research  .
Revised:  We provide an overview of the potential affordances of such community-based approaches to content moderation based on past research .
Edit intent: fluency
Original:  We call for more multidisciplinary research utilizing methods from complex systems studies, behavioural sociology, and computational social science to advance the research on crowd-based content moderation.
Revised:  We call for multidisciplinary research utilizing methods from complex systems studies, behavioural sociology, and computational social science to advance the research on crowd-based content moderation.
Edit intent: clarity
Original: We propose a model for hierarchical structured data as an extension to the stochastic temporal convolutional network (STCN) . The proposed model combines an autoregressive model with a hierarchical variational autoencoder and downsampling to achieve superior computational complexity.
Revised: We propose a model for hierarchical structured data as an extension to the stochastic temporal convolutional network . The proposed model combines an autoregressive model with a hierarchical variational autoencoder and downsampling to achieve superior computational complexity.
Edit intent: clarity
Original: We investigate so-called "one-to-two-player lifting" theorems for infinite-duration two-player games on graphs with zero-sum objectives.
Revised: We investigate a phenomenon of "one-to-two-player lifting" theorems for infinite-duration two-player games on graphs with zero-sum objectives.
Edit intent: clarity
Original: We investigate so-called "one-to-two-player lifting" theorems for infinite-duration two-player games on graphs with zero-sum objectives.
Revised: We investigate so-called "one-to-two-player lifting" in infinite-duration two-player games on graphs with zero-sum objectives.
Edit intent: clarity
Original:  If that much memory is sufficient to play optimally in one-player games , then how much memory isneeded to play optimally in two-player games ?
Revised:  If that much memory is sufficient to do so for one-player games , then how much memory isneeded to play optimally in two-player games ?
Edit intent: clarity
Original:  In 2005 , Gimbert and Zielonka  (CONCUR 2005) have shown that if no memory is needed in the one-player games, then the same holds for the two-player games.
Revised:  In 2005 , Gimbert and Zielonka ~ (CONCUR 2005) have shown that if no memory is needed in the one-player games, then the same holds for the two-player games.
Edit intent: fluency
Original:  ~ (CONCUR 2020) have shown that if some constant amount of memory (independent of the size of a game graph) is sufficient in the one-player games , then exactly the same constant is sufficient in the two-player  games .
Revised:  (CONCUR 2020) have shown that if some constant amount of memory (independent of the size of a game graph) is sufficient in the one-player games , then exactly the same constant is sufficient in the two-player games .
Edit intent: coherence
Original:  If the memory grows just a bit slower (in the  one-player games ) than in the example of Bouyer et al., then in every two-player game it is sufficient to have finite memory .
Revised:  If the memory grows just a bit slower (in the one-player games ) than in the example of Bouyer et al., then in every two-player games is infinite .
Edit intent: clarity
Original:  Thus, our work identifies the exact barrier for the one-to-two-player lifting theorems in a context of finite-memory strategies .
Revised:  Thus, we obtain the exact barrier for the one-to-two-player lifting theorems in a context of finite-memory strategies .
Edit intent: clarity
Original:  Thus, our work identifies the exact barrier for the one-to-two-player lifting theorems in a context of finite-memory strategies .
Revised:  Thus, our work identifies the exact barrier for the one-to-two-player lifting theorems .
Edit intent: clarity
Original:  A successful multiview policy could be deployed on a mobile manipulation platform, allowing it to complete a task regardless of its view of the scene.
Revised:  A successful multiview policy could be deployed on a mobile manipulation platform, allowing the robot to complete a task regardless of its view of the scene.
Edit intent: clarity
Original:  Furthermore, we analyze our policies to determine the benefits of learning from multiview data compared to learning with data  from a fixed perspective.
Revised:  Furthermore, we analyze our policies to determine the benefits of learning from multiview data compared to learning with data collected from a fixed perspective.
Edit intent: clarity
Original:  We show that learning from multiview data has little, if any, penalty to performance for a fixed-view task compared to learning with an equivalent amount of fixed-view data.
Revised:  We show that learning from multiview data results in little, if any, penalty to performance for a fixed-view task compared to learning with an equivalent amount of fixed-view data.
Edit intent: clarity
Original:  Our results indicate that multiview policies implicitly learn to identify spatially correlated features with a degree of view-invariance .
Revised:  Our results indicate that multiview policies implicitly learn to identify spatially correlated features .
Edit intent: clarity
Original: Recent technology breakthroughs in spatial molecular profiling (SMP), such as spatial transcriptomics sequencing, have enabled the comprehensive molecular characterization of single cells while preserving spatial and morphological information.
Revised: Recent technology breakthrough in spatial molecular profiling (SMP), such as spatial transcriptomics sequencing, have enabled the comprehensive molecular characterization of single cells while preserving spatial and morphological information.
Edit intent: fluency
Original: Recent technology breakthroughs in spatial molecular profiling (SMP), such as spatial transcriptomics sequencing, have enabled the comprehensive molecular characterization of single cells while preserving spatial and morphological information.
Revised: Recent technology breakthroughs in spatial molecular profiling has enabled the comprehensive molecular characterization of single cells while preserving spatial and morphological information.
Edit intent: clarity
Original: Recent technology breakthroughs in spatial molecular profiling (SMP), such as spatial transcriptomics sequencing, have enabled the comprehensive molecular characterization of single cells while preserving spatial and morphological information.
Revised: Recent technology breakthroughs in spatial molecular profiling (SMP), such as spatial transcriptomics sequencing, have enabled the comprehensive molecular characterizations of single cells while preserving spatial and morphological information.
Edit intent: fluency
Original:  One immediate question  is how to identify spatially variable (SV) genes.
Revised:  One immediate question is how to identify spatially variable genes.
Edit intent: clarity
Original:  Most of the current work builds upon the geostatistical model with  Gaussian process that relies on the selection ofad hoc kernels to account for spatial expression patterns.
Revised:  Most of the current methods build upon the geostatistical model with Gaussian process that relies on the selection ofad hoc kernels to account for spatial expression patterns.
Edit intent: clarity
Original:  Most of the current work builds upon the geostatistical model with  Gaussian process that relies on the selection ofad hoc kernels to account for spatial expression patterns.
Revised:  Most of the current work builds upon the geostatistical model with a Gaussian process that relies on the selection ofad hoc kernels to account for spatial expression patterns.
Edit intent: fluency
Original:  Most of the current work builds upon the geostatistical model with  Gaussian process that relies on the selection ofad hoc kernels to account for spatial expression patterns.
Revised:  Most of the current work builds upon the geostatistical model with Gaussian process that relies on ad hoc kernels to account for spatial expression patterns.
Edit intent: clarity
Original:  To overcome this potential challenge and capture more  spatial patterns, we introduced a Bayesian modeling framework to identify SV genes .
Revised:  To overcome this potential challenge and capture more types of spatial patterns, we introduced a Bayesian modeling framework to identify SV genes .
Edit intent: clarity
Original:  We used auxiliary variable Markov chain Monte Carlo algorithms to sample from the posterior distribution with an intractable normalizing constant  . Simulation results showed high accuracy in detecting SV genes compared with kernel-based alternatives.
Revised:  We use auxiliary variable Markov chain Monte Carlo algorithms to sample from the posterior distribution with an intractable normalizing constant . Simulation results showed high accuracy in detecting SV genes compared with kernel-based alternatives.
Edit intent: fluency
Original:  This statistical methodology presents a new perspective for characterizing spatial patterns from SMP data.
Revised:  The proposed method presents a new perspective for characterizing spatial patterns from SMP data.
Edit intent: clarity
Original:  This statistical methodology presents a new perspective for characterizing spatial patterns from SMP data.
Revised:  This statistical methodology presents a new perspective for analyzing spatial transcriptomics data.
Edit intent: clarity
Original: Recent technology breakthrough in spatial molecular profiling has enabled the comprehensive molecular characterizations of single cells while preserving spatial information.
Revised: A recent technology breakthrough in spatial molecular profiling has enabled the comprehensive molecular characterizations of single cells while preserving spatial information.
Edit intent: fluency
Original:  One immediate question in analysis of spatial molecular profiling data is how to identify spatially variable genes.
Revised:  One immediate question in spatial molecular profiling data is how to identify spatially variable genes.
Edit intent: clarity
Original:  One immediate question in analysis of spatial molecular profiling data is how to identify spatially variable genes.
Revised:  One immediate question in analysis of spatial molecular profiling data analysis is to identify genes whose expressions exhibit spatially correlated patterns, called spatially variable genes.
Edit intent: clarity
Original:  Most of the current methods build upon the geostatistical model with a Gaussian process that relies on selecting ad hoc kernels to account for spatial expression patterns.
Revised:  Most current methods to identify spatially variable genes are built upon the geostatistical model with a Gaussian process that relies on selecting ad hoc kernels to account for spatial expression patterns.
Edit intent: clarity
Original:  Most of the current methods build upon the geostatistical model with a Gaussian process that relies on selecting ad hoc kernels to account for spatial expression patterns.
Revised:  Most of the current methods build upon the geostatistical model with Gaussian process to capture the spatial patterns, which rely on ad hoc kernels to account for spatial expression patterns.
Edit intent: clarity
Original:  We use auxiliary variable Markov chain Monte Carlo algorithms to sample from the posterior distribution with an intractable normalizing constant in the Ising model.
Revised:  We use auxiliary variable Markov chain Monte Carlo algorithms to sample from the posterior distribution with an intractable normalizing constant in the model.
Edit intent: clarity
Original:  Applying our method to two real spatial transcriptomics datasets, we discovered novel spatial patterns that shed light on the biological mechanisms.
Revised:  When applied to two real spatial transcriptomics datasets, we discovered novel spatial patterns that shed light on the biological mechanisms.
Edit intent: clarity
Original:  The proposed method presents a new perspective for analyzing spatial transcriptomics data.
Revised:  In summary, the proposed method presents a new perspective for analyzing spatial transcriptomics data.
Edit intent: coherence
Original: Absolute Concentration Robustness (ACR) was introduced by Shinar and Feinberg as a way to define species concentration robustness in mass action dynamical systems.
Revised: Absolute Concentration Robustness (ACR) was introduced by Shinar and Feinberg as a way to define robustness of equilibrium species concentration in a mass action dynamical systems.
Edit intent: clarity
Original:  The robustness of function rests on what we refer to as empirical robustness -- the concentration of a variable remains unvarying, when measured in the long run, across arbitrary initial conditions.
Revised:  The robustness of function rests on what we refer to as empirical robustness--the concentration of a variable remains unvarying, when measured in the long run, across arbitrary initial conditions.
Edit intent: fluency
Original:  The robustness of function rests on what we refer to as empirical robustness -- the concentration of a variable remains unvarying, when measured in the long run, across arbitrary initial conditions.
Revised:  The robustness of function rests on what we refer to as empirical robustness -- the concentration of a species remains unvarying, when measured in the long run, across arbitrary initial conditions.
Edit intent: clarity
Original:  We report several characterizations for (refinements of) hierarchies and split systems that are compatible with ( sets of) partitions.
Revised:  We report several characterizations for (refinements of) hierarchies and split systems that are compatible with ( systems of) partitions.
Edit intent: fluency
Original:  The latter problem becomes NP-complete but fixed-parameter tractable if a set of partitions is considered instead of a single partition.
Revised:  The latter problem becomes NP-complete but fixed-parameter tractable if a system of partitions is considered instead of a single partition.
Edit intent: clarity
Original:  We finally explore the close relationship of the concept of compatibility and so-called Fitch maps.
Revised:  In this context, we also explore the close relationship of the concept of compatibility and so-called Fitch maps.
Edit intent: coherence
Original: Proactive tile-based virtual reality (VR) video streaming employs the current tracking data of a user to predict future requested tiles, then renders and delivers the predicted tiles to be requested before playback.
Revised: Proactive tile-based virtual reality (VR) video streaming employs the current tracking data of a user to predict future requested tiles, then renders and delivers the predicted tiles before playback.
Edit intent: clarity
Original:  However, existing privacy protection may fail even with federated learning at head mounted display (HMD) . This is because when the HMD requests the predicted requested tiles and the prediction is accurate, the real requested tiles and corresponding user behavior-related data can still be recovered at multi-access edge computing server .
Revised:  However, existing privacy protection may fail even with federated learning at head mounted display (HMD) . This is because when the future requested tiles can be predicted accurately, the user-behavior-related data can still be recovered at multi-access edge computing server .
Edit intent: clarity
Original:  However, existing privacy protection may fail even with federated learning at head mounted display (HMD) . This is because when the HMD requests the predicted requested tiles and the prediction is accurate, the real requested tiles and corresponding user behavior-related data can still be recovered at multi-access edge computing server .
Revised:  However, existing privacy protection may fail even with federated learning at head mounted display (HMD) . This is because when the HMD requests the predicted requested tiles and the prediction is accurate, the real requested tiles and corresponding user behavior-related data can still be recovered from the predicted tiles .
Edit intent: clarity
Original:  To this end, we first add extra camouflaged tile requests in addition to  real tile requests and model the privacy requirement as the spatial degree of privacy \textit{ (sDoP).
Revised:  To this end, we first add extra camouflaged real tile requests and model the privacy requirement as the spatial degree of privacy \textit{ (sDoP).
Edit intent: clarity
Original:  To this end, we first add extra camouflaged tile requests in addition to  real tile requests and model the privacy requirement as the spatial degree of privacy \textit{ (sDoP).
Revised:  To this end, we first add extra camouflaged tile requests in addition to tile requests to the real tile requests and model the privacy requirement as the spatial degree of privacy \textit{ (sDoP).
Edit intent: clarity
Original:  To this end, we first add extra camouflaged tile requests in addition to  real tile requests and model the privacy requirement as the spatial degree of privacy \textit{ (sDoP).
Revised:  To this end, we first add extra camouflaged tile requests in addition to real tile requests and model the privacy requirement as the \textit{ (sDoP).
Edit intent: clarity
Original:  From the obtained optimal closed-form solution, we find that the  increase of sDoP improves the capability of communication and computing hence improves QoE , but degrades the prediction performance hence degrades the QoE.
Revised:  From the obtained optimal closed-form solution, we find that the increase of sDoP improves the capability of communication and computing hence improves QoE . On the other side it degrades the prediction performance hence degrades the QoE.
Edit intent: coherence
Original: Uncertainty quantification is a key aspect in robotic perception, as overconfident or point estimators can lead to collisions and damages to the environment and the robot.
Revised: Uncertainty quantification is a key aspect of robotic perception, as overconfident or point estimators can lead to collisions and damages to the environment and the robot.
Edit intent: fluency
Original:  For MC dropout,in particular, we explore  the effect of the dropout at different levels in the architecture.
Revised:  For MC dropout,in particular, we explore deeply the effect of the dropout at different levels in the architecture.
Edit intent: clarity
Original:  We demonstrate that adding dropout in the encoder leads to better results than adding it in the decoder, the latest being the usual approach in the literature for similar problems.
Revised:  We demonstrate that adding dropout in the encoder offer better results than adding it in the decoder, the latest being the usual approach in the literature for similar problems.
Edit intent: clarity
Original:  We also propose the use of depth uncertainty in the application of pseudo-RGBD ICP and demonstrate its potential for improving the accuracy in such a task.
Revised:  We also show the use of depth uncertainty in the application of pseudo-RGBD ICP and demonstrate its potential for improving the accuracy in such a task.
Edit intent: clarity
Original: Electricity exchanges offer several trading possibilities for market participants: starting with futures products through the spot market consisting of the auction and continuous part, and ending with the balancing market .
Revised: Electricity exchanges offer several trading possibilities for market participants: derivative products like futures, the spot market consisting of the auction and continuous part, and ending with the balancing market .
Edit intent: clarity
Original: Electricity exchanges offer several trading possibilities for market participants: starting with futures products through the spot market consisting of the auction and continuous part, and ending with the balancing market .
Revised: Electricity exchanges offer several trading possibilities for market participants: starting with futures products through the spot market consisting of auctions and continuous trading, and balancing markets .
Edit intent: clarity
Original:  This problem is not trivial especially for trading larger volumes as the market participants should also consider their own price impact .
Revised:  This problem is not trivial especially for trading larger volumes this problem gets particularly important as such trades influence the prices substantially .
Edit intent: clarity
Original:  The following paper raises this issue considering two markets: the hourly EPEX Day-Ahead Auction and the quarter-hourly EPEX Intraday Auction.
Revised:  The following paper raises this issue considering two markets: the hourly Day-Ahead Auction and the quarter-hourly EPEX Intraday Auction.
Edit intent: fluency
Original:  The following paper raises this issue considering two markets: the hourly EPEX Day-Ahead Auction and the quarter-hourly EPEX Intraday Auction.
Revised:  The following paper raises this issue considering two markets: the hourly EPEX Day-Ahead Auction and the quarter-hourly Intraday Auction.
Edit intent: fluency
Original:  For a meaningful optimization many price scenarios are considered that we obtain using bootstrap with models that are well-known and researched in the electricity price forecasting literature.
Revised:  For an optimal coordinated bidding many price scenarios are considered that we obtain using bootstrap with models that are well-known and researched in the electricity price forecasting literature.
Edit intent: clarity