wanyu/IteraTeR_v2 huggingface dataset:
Original:  Two of them allow private location logging, without revealing their location history within an app.
Revised:  Two of them allow private location logging, without revealing the location history within an app.
Edit intent: clarity
Original:  The second encryption is a minor modification of the existing GAEN protocol so that GPS information is available to a healthy phone only when it is exposed - this is a better option comparatively.
Revised:  The second encryption is a minor modification of the existing GAEN protocol so that global context is available to a healthy phone only when it is exposed - this is a better option comparatively.
Edit intent: clarity
Original:  For a universal code, there are two parameters of interest: the rate, which is the ratio between the message length and the codeword length, and the number of shared random bits.
Edit intent: coherence
Original:  In the oblivious scenario, the channel adds noise based on the message and the encoding function but does not know the codeword.
Revised:  In the oblivious scenario, the channel adds noise based on the message and the encoding function , but not on the codeword.
Edit intent: coherence
Original: Dietary supplements (DSs) are popular but not always safe.
Revised: Dietary supplements are widely used but not always safe.
Edit intent: clarity
Original:  In this study, we compared four different representations of DS information: (1) original text, (2) syntactic and lexical text simplification, (3) manual text simplification, and (4) a graph-based visualization.
Revised:  In this study, we compared four different representations of DS information: (1) original text, syntactic and lexical text simplification, (3) manual text simplification, and (4) a graph-based visualization.
Edit intent: coherence
Original:  In this study, we compared four different representations of DS information: (1) original text, (2) syntactic and lexical text simplification, (3) manual text simplification, and (4) a graph-based visualization.
Revised:  In this study, we compared four different representations of DS information: (1) original text, (2) syntactic and lexical text simplification, manual text simplification, and (4) a graph-based visualization.
Edit intent: coherence
Original:  In this study, we compared four different representations of DS information: (1) original text, (2) syntactic and lexical text simplification, (3) manual text simplification, and (4) a graph-based visualization.
Revised:  In this study, we compared four different representations of DS information: (1) original text, (2) syntactic and lexical text simplification, (3) manual text simplification, and a graph-based visualization.
Edit intent: coherence
Original:  Using a crowdsourcing platform, we recruited participants to read DS information in different representations and then answer comprehension questions.
Revised:  We then assessed how the different simplification and representation strategies affected consumers' comprehension of dietary supplement information in terms of accuracy and response time to a set of comprehension questions.
Edit intent: clarity
Original:  With responses from 690 qualified participants, our experiments confirmed that the manual approach , as expected, had the best performance for both accuracy and response time to the comprehension questions, while the graph-based approach ranked the second outperforming other representations.
Revised:  With responses from 690 qualified participants, our experiments confirmed that the manual approach had the best performance for both accuracy and response time to the comprehension questions, while the graph-based approach ranked the second outperforming other representations.
Edit intent: clarity
Original:  Moreover, by considering unitary, weighted, undirected  and directed graphs, we clarify how the theoretical tractability or intractability of those problems vary.
Revised:  Moreover, by considering unitary, weighted, undirected , and directed graphs, we clarify how the theoretical tractability or intractability of those problems vary.
Edit intent: fluency
Original:  Moreover, by considering unitary, weighted, undirected  and directed graphs, we clarify how the theoretical tractability or intractability of those problems vary.
Revised:  Moreover, by considering unitary, weighted, undirected and directed graphs, we clarify how the theoretical tractability of those problems vary.
Edit intent: clarity
Original: Recently, non-Euclidean spaces became popular for embedding structured data .
Revised: Various non-trivial spaces are becoming popular for embedding structured data .
Edit intent: clarity
Original:  However, searching for the best configuration of a product space is a resource-intensive procedure, which reduces the practical applicability of the idea.
Revised:  However, searching for the best configuration of product space is a resource-intensive procedure, which reduces the practical applicability of the idea.
Edit intent: fluency
Original:  ResNet-based architecture has been widely adopted as the speaker embedding extractor in speaker verification system.
Revised: The ResNet-based architecture has been widely adopted as the speaker embedding extractor in speaker verification system.
Edit intent: style
Original:  However, simply increasing width or depth is not efficient .
Revised:  However, when the input feature space becomes more complicated, simply increasing the depth and width of the ResNet network may not fully realize its performance potential .
Edit intent: clarity
Original:  In this paper, we investigate the effectiveness of two new structures, i.e., ResNeXt and Res2Net, for speaker verification task.
Revised:  In this paper, we present two extensions of the ResNet architecture, ResNeXt and Res2Net, for speaker verification task.
Edit intent: clarity
Original:  Experimental results on VoxCeleb data demonstrated increasing these two dimensions is more efficient than going deeper or wider . Experiments on two internal test sets with mismatched acoustic conditions also proved the generalization of ResNeXt and Res2Net architecture.
Revised:  Experimental results on VoxCeleb data demonstrated increasing these two dimensions is more efficient than going deeper or wider . Experiments on the VoxCeleb test set demonstrated that the ResNeXt and Res2Net architecture.
Edit intent: clarity
Original:  Particularly, with Res2Net structure, our best model achieved state-of-the-art performance on VoxCeleb1 test set by reducing the EER by 18.5\% relative.
Revised:  Particularly, with Res2Net model achieved superior performance by reducing the EER by 18.5\% relative.
Edit intent: clarity
Original: We present a new policy-based multi-agent reinforcement learning algorithm that implicitly addresses the credit assignment problem under fully cooperative settings.
Revised: We present a multi-agent reinforcement learning algorithm that implicitly addresses the credit assignment problem under fully cooperative settings.
Edit intent: clarity
Original:  Our key motivation is that credit assignment  may not require an explicit formulation as long as (1) the policy gradients of a trained, centralized critic carry sufficient information for the decentralized agents to maximize the critic estimate through optimal cooperation and (2) a sustained level of agent exploration is enforced throughout training.
Revised:  Our key motivation is that credit assignment among agents may not require an explicit formulation as long as (1) the policy gradients of a trained, centralized critic carry sufficient information for the decentralized agents to maximize the critic estimate through optimal cooperation and (2) a sustained level of agent exploration is enforced throughout training.
Edit intent: clarity
Original:  Our key motivation is that credit assignment  may not require an explicit formulation as long as (1) the policy gradients of a trained, centralized critic carry sufficient information for the decentralized agents to maximize the critic estimate through optimal cooperation and (2) a sustained level of agent exploration is enforced throughout training.
Revised:  Our key motivation is that credit assignment may not require an explicit formulation as long as (1) the policy gradients derived from a centralized critic carry sufficient information for the decentralized agents to maximize the critic estimate through optimal cooperation and (2) a sustained level of agent exploration is enforced throughout training.
Edit intent: clarity
Original:  Our key motivation is that credit assignment  may not require an explicit formulation as long as (1) the policy gradients of a trained, centralized critic carry sufficient information for the decentralized agents to maximize the critic estimate through optimal cooperation and (2) a sustained level of agent exploration is enforced throughout training.
Revised:  Our key motivation is that credit assignment may not require an explicit formulation as long as (1) the policy gradients of a trained, centralized critic carry sufficient information for the decentralized agents to maximize the critic estimate through optimal cooperation and (2) a sustained level of exploration is enforced throughout training.
Edit intent: clarity
Original:  In this work , we achieve the former by formulating the centralized critic as a hypernetwork such that the latent state representation is now fused into the policy gradients through its multiplicative association with the agent policies, and we show that this is key to learning optimal joint actions that may otherwise require explicit credit assignment.
Revised:  In this work , we achieve the former by formulating the centralized critic as a hypernetwork such that a latent state representation is now fused into the policy gradients through its multiplicative association with the agent policies, and we show that this is key to learning optimal joint actions that may otherwise require explicit credit assignment.
Edit intent: fluency
Original:  In this work , we achieve the former by formulating the centralized critic as a hypernetwork such that the latent state representation is now fused into the policy gradients through its multiplicative association with the agent policies, and we show that this is key to learning optimal joint actions that may otherwise require explicit credit assignment.
Revised:  In this work , we achieve the former by formulating the centralized critic as a hypernetwork such that the latent state representation is integrated into the policy gradients through its multiplicative association with the agent policies, and we show that this is key to learning optimal joint actions that may otherwise require explicit credit assignment.
Edit intent: clarity
Original:  To achieve the latter, we further propose a practical technique called adaptive entropy regularization where magnitudes of the policy gradients from the entropy term are dynamically rescaled to sustain consistent levels of exploration throughout training.
Revised:  To achieve the latter, we derive a simple technique called adaptive entropy regularization where magnitudes of the policy gradients from the entropy term are dynamically rescaled to sustain consistent levels of exploration throughout training.
Edit intent: clarity
Original:  To achieve the latter, we further propose a practical technique called adaptive entropy regularization where magnitudes of the policy gradients from the entropy term are dynamically rescaled to sustain consistent levels of exploration throughout training.
Revised:  To achieve the latter, we further propose a practical technique called adaptive entropy regularization where magnitudes of the entropy gradients are dynamically rescaled to sustain consistent levels of exploration throughout training.
Edit intent: clarity
Original:  We first identify an optimal scheduling policy by modelling the considered scheduling problem as a constrained Markov decision process (CMDP) problem.
Revised:  We first design an optimal policy by modelling the considered scheduling problem as a constrained Markov decision process (CMDP) problem.
Edit intent: clarity
Original:  We manage to derive approximate closed-form expressions of the average AoI at the destination, and the average number of forwarding operations at the relay for the DTR policy, by modelling the tangled evolution of age at the relay and destination as a Markov chain (MC).
Revised:  We derive approximate closed-form expressions of the average AoI at the destination, and the average number of forwarding operations at the relay for the DTR policy, by modelling the tangled evolution of age at the relay and destination as a Markov chain (MC).
Edit intent: coherence
Original:  We manage to derive approximate closed-form expressions of the average AoI at the destination, and the average number of forwarding operations at the relay for the DTR policy, by modelling the tangled evolution of age at the relay and destination as a Markov chain (MC).
Revised:  We manage to derive approximate closed-form expressions of the average AoI at the destination, and the average number of forwarding operations at the relay for the DTR policy, by modelling the tangled evolution of age at relay and destination as a Markov chain (MC).
Edit intent: fluency
Original:  Numerical results are provided to verify all the theoretical analysis, and show that the low-complexity DTR policy can achieve near optimal performance compared with the optimal scheduling policyderived from the CMDP problem.
Revised:  Numerical results validate all the theoretical analysis, and show that the low-complexity DTR policy can achieve near optimal performance compared with the optimal scheduling policyderived from the CMDP problem.
Edit intent: clarity
Original:  It is a flexible component which can be generalized  other systems to allow competition between different coding tools.
Revised:  It is a flexible component which can be generalized to other systems to allow competition between different coding tools.
Edit intent: fluency
Original:   Here we show that such seasonality , as well as the distribution of viral disease's epidemics with latitude on Earth, can be fully explained by the virucidal properties of UV-B and A Solar photons through a daily, minute-scale, resonant forcing mechanism.
Revised:  Here we show that such seasonality , as well as its distribution with latitude on Earth, can be fully explained by the virucidal properties of UV-B and A Solar photons through a daily, minute-scale, resonant forcing mechanism.
Edit intent: clarity
Original: In the present article we study social network modelling  using human interaction as a basis.
Revised: In this contribution we study social network modelling using human interaction as a basis.
Edit intent: clarity
Original: In the present article we study social network modelling  using human interaction as a basis.
Revised: In the present article we study social network modelling by using human interaction as a basis.
Edit intent: fluency
Original:  To do so, we propose a new set of functions, Affinities , designed to capture the nature of the local interactions among each pair of actors in a network.
Revised:  To do so, we propose a new set of functions, affinities , designed to capture the nature of the local interactions among each pair of actors in a network.
Edit intent: fluency
Original:  Using these functions, we develop a new community detection algorithm, the Borgia Clustering, where communities naturally arise from the multi-agent interaction in the network.
Revised:  By using these functions, we develop a new community detection algorithm, the Borgia Clustering, where communities naturally arise from the multi-agent interaction in the network.
Edit intent: fluency
Original:  We also discuss the effects of size and scale for communities regarding this case, and how we cope with the additional complexity present when big communities arise.
Revised:  We also discuss the effects of size and scale for communities regarding this case, as well as how we cope with the additional complexity present when big communities arise.
Edit intent: coherence
Original:   To reduce the associated computational cost, online numerical schemes are derived using the stochastic gradient  method.
Revised:  To reduce the associated computational cost, online numerical schemes are derived using the stochastic gradient descent method.
Edit intent: clarity
Original:  In this paper we design an AQM mechanism ( Fair Learning Qdisc (LFQ)) that dynamically learns the optimal buffer size for each flow according to a specified reward function online.
Revised:  In this paper we design an AQM mechanism ( Learning Fair Qdisc (LFQ)) that dynamically learns the optimal buffer size for each flow according to a specified reward function online.
Edit intent: fluency
Original:  Description Logics with nominals do not have the CIP nor BDP, but in particular, deciding and computing explicit definitions of concepts or individuals has many potential applications in ontology engineering and ontology-based data management.
Revised:  Description Logics with nominals do not have the CIP nor PBDP, but interpolants and explicit definitions have many potential applications in ontology engineering and ontology-based data management.
Edit intent: clarity
Original:  In this article we show two main results : even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals ALCO and ALCIO . However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity  .
Revised:  In this article we show the following : even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals ALCO and ALCIO . However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity .
Edit intent: clarity
Original:  In this article we show two main results : even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals ALCO and ALCIO . However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity  .
Revised:  In this article we show two main results : even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in description logics with nominals ALCO and ALCIO . However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity .
Edit intent: fluency
Original:  In this article we show two main results : even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals ALCO and ALCIO . However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity  .
Revised:  In this article we show two main results : even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals and ALCIO . However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity .
Edit intent: fluency
Original:  We present a theoretical framework that connects the dynamics of individual cilia to the collective dynamics of a ciliary carpet via systematic coarse-graining.
Revised:  We present a theoretical framework that connects the dynamics of an individual cilium to the collective dynamics of a ciliary carpet via systematic coarse-graining.
Edit intent: fluency
Original:  Our results can contribute to understanding how the collective properties of ciliary arrays can be controlled, which can have significant biological, medical, and engineering implications .
Revised:  Our results can contribute to understanding how the collective properties of beating cilia can be determined using information about the individual units, and as such exemplifies a bottom-up study of a rich active matter system .
Edit intent: clarity
Original:  Recent researches abstract molecules as graphs and employ Graph Neural Networks (GNNs) for task-specific and data-driven molecular representation learning.
Revised:  Recent researches abstract molecules as graphs and employ Graph Neural Networks (GNNs) for molecular representation learning.
Edit intent: clarity
Original:  Nevertheless, two "dark clouds" impede the usage of GNNs in real scenarios: (1) insufficient labeled molecules for supervised training;
Revised:  Nevertheless, two issues impede the usage of GNNs in real scenarios: (1) insufficient labeled molecules for supervised training;
Edit intent: clarity
Original:  (2) poor generalization capabilities to new-synthesized molecules.
Revised:  (2) poor generalization capability to new-synthesized molecules.
Edit intent: fluency
Original:  With carefully designed self-supervised tasks in node, edge and graph-level, GROVER can learn rich structural and semantic information of molecules from enormous unlabelled molecular data.
Revised:  With carefully designed self-supervised tasks in node-, edge- and graph-level, GROVER can learn rich structural and semantic information of molecules from enormous unlabelled molecular data.
Edit intent: fluency
Original:  Rather, to encode such complex information, GROVER integrates Message Passing Networks with the Transformer-style architecture to deliver a class of more expressive encoders of molecules.
Revised:  Rather, to encode such complex information, GROVER integrates Message Passing Networks into the Transformer-style architecture to deliver a class of more expressive encoders of molecules.
Edit intent: clarity
Original:  We pre-train GROVER with 100 million parameters on 10 million unlabelled molecules---the biggest GNN and the largest training dataset that we have ever met .
Revised:  We pre-train GROVER with 100 million parameters on 10 million unlabelled molecules -- the biggest GNN and the largest training dataset that we have ever met .
Edit intent: fluency
Original:  We pre-train GROVER with 100 million parameters on 10 million unlabelled molecules---the biggest GNN and the largest training dataset that we have ever met .
Revised:  We pre-train GROVER with 100 million parameters on 10 million unlabelled molecules---the biggest GNN and the largest training dataset in molecular representation learning .
Edit intent: clarity
Original:  Our experiments show that our model outperforms several popular and strong baseline methods, demonstrating the effectiveness of combining deep learning with multi-modal features.
Revised:  Our experiments show that MDHAN outperforms several popular and strong baseline methods, demonstrating the effectiveness of combining deep learning with multi-modal features.
Edit intent: clarity
Original:  Our experiments show that our model outperforms several popular and strong baseline methods, demonstrating the effectiveness of combining deep learning with multi-modal features.
Revised:  Our experiments show that our model outperforms several popular and robust baseline methods, demonstrating the effectiveness of combining deep learning with multi-modal features.
Edit intent: clarity
Original: We discuss a method for estimating the convergence speed of Anderson Acceleration (AA) applied to the Alternating Direction Method of Multipliers (ADMM), for the case where ADMM by itself converges linearly.
Revised: We explain how Anderson Acceleration (AA) applied to the Alternating Direction Method of Multipliers (ADMM), for the case where ADMM by itself converges linearly.
Edit intent: clarity