wanyu/IteraTeR_v2 huggingface dataset:
Original:  The resultant algorithm is coined analog federated ADMM (A-FADMM) based on analog transmissions and the alternating direct method of multipliers (ADMM).
Revised:  The resultant algorithm is coined analog federated ADMM (A-FADMM) based on analog transmissions and the alternating direction method of multipliers (ADMM).
Edit intent: clarity
Original:  Therefore, these components are optimized independently from each other and the overall system suffers from error propagation.
Revised:  These components are optimized independently from each other and the overall system suffers from error propagation.
Edit intent: coherence
Original:  In this paper, we propose a novel training method that enables pretrained contextual embeddings such as BERT to process acoustic features.
Revised:  In this paper, we propose a novel training method that enables pretrained contextual embeddings to process acoustic features.
Edit intent: clarity
Original:  Experimental results in three benchmark datasets show that our system reaches the pipeline architecture performance without using any training data and outperforms it after fine-tuning with only a few examples .
Revised:  Experimental results in three benchmarks show that our system reaches the pipeline architecture performance without using any training data and outperforms it after fine-tuning with only a few examples .
Edit intent: clarity
Original: Motivation: COVID-19 has fast-paced drug re-positioning for its treatment.
Revised:  COVID-19 has fast-paced drug re-positioning for its treatment.
Edit intent: coherence
Original:  Results: The main contribution of this work is a manually curated database publicly shared, comprising of existing associations between viruses and their corresponding antivirals.
Revised:  The main contribution of this work is a manually curated database publicly shared, comprising of existing associations between viruses and their corresponding antivirals.
Edit intent: coherence
Original:  Results of the patient-specific tests suggest that the proposed methodology could be a valuable tool for improving cardiovascular diagnostics and the treatment of diseases .
Revised:  Results of the patient-specific tests suggest that the proposed methodology and expectations of the computed pressures are comparable to the recorded waveforms .
Edit intent: clarity
Original: Self assembly is a ubiquitous process in synthetic and biological systems, broadly defined as the spontaneous self-organization of multiple subunits (e.g. macromolecules, particles) into ordered multi-unit structures.
Revised: Self-assembly is a ubiquitous process in synthetic and biological systems, broadly defined as the spontaneous self-organization of multiple subunits (e.g. macromolecules, particles) into ordered multi-unit structures.
Edit intent: fluency
Original: Self assembly is a ubiquitous process in synthetic and biological systems, broadly defined as the spontaneous self-organization of multiple subunits (e.g. macromolecules, particles) into ordered multi-unit structures.
Revised: Self assembly is a ubiquitous process in synthetic and biological systems, broadly defined as the spontaneous organization of multiple subunits (e.g. macromolecules, particles) into ordered multi-unit structures.
Edit intent: clarity
Original:  The vast majority of equilibrium assembly processes give rise to two ``states'' : one consisting of dispersed disassociated subunits, and the other, a bulk-condensed state of unlimited size.
Revised:  The vast majority of equilibrium assembly processes give rise to two states : one consisting of dispersed disassociated subunits, and the other, a bulk-condensed state of unlimited size.
Edit intent: fluency
Original:  Then,  examples of self-limiting assembly systems will be introduced and classified within this framework based on two broad categories: {\it self-closing assemblies} and {\it open-boundary assemblies}.
Revised:  Then, examples of self-limiting assembly systems , and classify them within this framework based on two broad categories: {\it self-closing assemblies} and {\it open-boundary assemblies}.
Edit intent: clarity
Original:  Finally, we discuss alternative mechanisms for finite-size assemblies  and draw contrasts with the size-control that these can achieve relative to self-limitation in equilibrium, single-species assemblies.
Revised:  Finally, we discuss alternative mechanisms for finite-size assemblies , and draw contrasts with the size-control that these can achieve relative to self-limitation in equilibrium, single-species assemblies.
Edit intent: fluency
Original:  MOR techniques based on moment matching are well established due to their simplicity and computational performance in the reduction process.
Revised:  MOR techniques based on moment-matching are well established due to their simplicity and computational performance in the reduction process.
Edit intent: fluency
Original:  However, the efficacy of these methods based on the ordinary Krylov subspace is usually unsatisfactory to approximate the original behaviour .
Revised:  However, moment-matching methods based on the ordinary Krylov subspace is usually unsatisfactory to approximate the original behaviour .
Edit intent: clarity
Original:  However, the efficacy of these methods based on the ordinary Krylov subspace is usually unsatisfactory to approximate the original behaviour .
Revised:  However, the efficacy of these methods based on the ordinary Krylov subspace are usually inadequate to accurately approximate the original behaviour .
Edit intent: clarity
Original:  However, the efficacy of these methods based on the ordinary Krylov subspace is usually unsatisfactory to approximate the original behaviour .
Revised:  However, the efficacy of these methods based on the ordinary Krylov subspace is usually unsatisfactory to approximate the original circuit behavior .
Edit intent: clarity
Original:  When there is a single host species, stochastic persistence and extinction of the host is characterized using external Lyapunpov exponents corresponding to the average per-capita growth rates of the host when rare.
Revised:  When there is a single host species, stochastic persistence and extinction of the host is characterized using external Lyapunov exponents corresponding to the average per-capita growth rates of the host when rare.
Edit intent: fluency
Original:  The proposed novel interpretation of RMs in the multi-agent setting explicitly encodes required teammate interdependencies and independencies , allowing the team-level task to be decomposed into sub-tasks for individual agents.
Revised:  The proposed novel interpretation of RMs in the multi-agent setting explicitly encodes required teammate interdependencies , allowing the team-level task to be decomposed into sub-tasks for individual agents.
Edit intent: clarity
Original:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log T/ \log ( d \log T) ) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Revised:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs O (d \log T/ \log ( d \log T) ) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Edit intent: clarity
Original:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log T/ \log ( d \log T) ) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Revised:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log d \log T) ) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Edit intent: clarity
Original:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log T/ \log ( d \log T) ) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Revised:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log T/ \log ( d \log T) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Edit intent: fluency
Original:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log T/ \log ( d \log T) ) policy switches to achieve the minimax-optimal expected regret, almost matching the O(d \log T) upper bound by Abbasi-Yadkori et al. 2011 ;
Revised:  We show that, when the context vectors are adversarially chosen in d-dimensional linear contextual bandits, the learner needs \Omega (d \log T/ \log ( d \log T) ) policy switches to achieve the minimax-optimal 2011 ;
Edit intent: clarity
Original:  Along the way, we propose distributional optimal design , a natural extension of the optimal experiment design, and provide a sample-efficient learning algorithm for the problem, which may be of independent interest.
Revised:  Along the way, we propose the distributional optimal design , a natural extension of the optimal experiment design, and provide a sample-efficient learning algorithm for the problem, which may be of independent interest.
Edit intent: fluency
Original:  To preserve user privacy , researchers have devised different privacy-preserving approaches  ;
Revised:  Data sharing (e.g. cross-agency data sharing) for machine learning and analytics is one of the important components in data science. However, due to privacy concerns, data should be enforced with strong privacy guarantees before sharing. Different privacy-preserving approaches ;
Edit intent: coherence
Original:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employing  selective privacy preservation  . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Revised:  This paper presents a framework named P selective privacy preservation . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Edit intent: coherence
Original:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employing  selective privacy preservation  . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Revised:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employingrivacy selective privacy preservation . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Edit intent: fluency
Original:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employing  selective privacy preservation  . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Revised:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employingP selective privacy preservation . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Edit intent: fluency
Original:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employing  selective privacy preservation  . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Revised:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employingreservation selective privacy preservation . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Edit intent: fluency
Original:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employing  selective privacy preservation  . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Revised:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employinga selective privacy preservation . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Edit intent: fluency
Original:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employing  selective privacy preservation  . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Revised:  This paper presents a framework named PPaaS (Privacy Preservation as a Service) to maintain usability by employings selective privacy preservation . PPaaS includes a pool of privacy preservation methods, and for each application , it selects the most suitable one after rigorous evaluation.
Edit intent: fluency
Original:  We show that our augmentation framework improves performances on several text classification tasks using publicly available models and corpora (SST2 and TREC) as well as on a BEC detection task.
Revised:  We show that our augmentation framework improves performances on several text classification tasks using publicly available models and corpora as well as on a BEC detection task.
Edit intent: clarity
Original:  While having a single, global population strongly restricts the possible dynamics, we demonstrate that if the number of populations is large enough, a rank R network can approximate any R-dimensional dynamical system.
Revised:  While having a single, global population strongly restricts the possible dynamics, we demonstrate that if the number of populations is large enough, a rank-R network can approximate any R-dimensional dynamical system.
Edit intent: fluency
Original:  To examine skeleton action recognition ' in the wild ' , we introduce Skeletics-152, a curated and 3-D pose-annotated subset of RGB videos sourced from Kinetics-700, a large-scale action dataset.
Revised:  To examine skeleton action recognition ' in the wild , we introduce Skeletics-152, a curated and 3-D pose-annotated subset of RGB videos sourced from Kinetics-700, a large-scale action dataset.
Edit intent: fluency
Original:  The results from benchmarking the top performers of NTU-120 on Skeletics-152 reveal the challenges and domain gap induced by actions 'in the wild'.
Edit intent: coherence
Original:  Finally, as a new frontier for action recognition, we introduce Metaphorics, a dataset with caption-style annotated YouTube videos of the popular social game Dumb Charades and interpretative dance performances.
Revised:  We also introduce Metaphorics, a dataset with caption-style annotated YouTube videos of the popular social game Dumb Charades and interpretative dance performances.
Edit intent: clarity
Original:  It also provides an assessment of top-performing approaches across a spectrum of activity settings and via the introduced datasets, proposes new frontiers for human action recognition.
Revised:  Via the introduced datasets, proposes new frontiers for human action recognition.
Edit intent: coherence
Original:  It also provides an assessment of top-performing approaches across a spectrum of activity settings and via the introduced datasets, proposes new frontiers for human action recognition.
Revised:  It also provides an assessment of top-performing approaches across a spectrum of activity settings and via the introduced datasets, our work enables new frontiers for human action recognition.
Edit intent: clarity
Original: Piecewise divergence-free H( \div )-nonconforming virtual elements are designed for Stokes problem in any dimensions.
Revised: Piecewise divergence-free H( div )-nonconforming virtual elements are designed for Stokes problem in any dimensions.
Edit intent: fluency
Original: Piecewise divergence-free H(div )-nonconforming virtual elements are designed for Stokes problem in any dimensions.
Revised: Piecewise divergence-free H(div nonconforming virtual elements are designed for Stokes problem in any dimensions.
Edit intent: fluency
Original:  A detailed and rigorous error analysis is presented for the discrete method , including the norm equivalence of the stabilization on the kernel of the local energy projector, the interpolation error estimate, the discrete inf-sup condition, and the optimal error estimate of the discrete method .
Revised:  A detailed and rigorous error analysis is presented for the discrete method .
Edit intent: coherence
Original:  In recent OPE and OPL contexts, most of the studies have focused on one-player cases, and not on more than two-player cases.
Revised:  In recent OPE and OPL contexts, most of the studies have focused on single-player cases, and not on more than two-player cases.
Edit intent: clarity
Original:  In recent OPE and OPL contexts, most of the studies have focused on one-player cases, and not on more than two-player cases.
Revised:  In recent OPE and OPL contexts, most of the studies have focused on one-player cases, and not on multi-player cases.
Edit intent: clarity
Original:  For OPL, we calculate maximin policies as Nash equilibrium strategies over the historical data.
Edit intent: coherence
Original:  Finally, we demonstrate the effectiveness and performance of the proposed methods through experiments.
Revised:  Finally, we demonstrate the effectiveness and performance of the proposed estimators through experiments.
Edit intent: clarity
Original: Both observed and unobserved vertex heterogeneity can influence block structure in graphs.
Revised: In network inference applications, it is often desirable to detect community structure, namely to cluster vertices into groups, or blocks, according to some measure of similarity. Beyond mere adjacency matrices, many real networks also involve vertex covariates that carry key information about underlying block structure in graphs.
Edit intent: clarity
Original:  To assess these effects on block recovery, we present a comparative analysis of two model-based spectral algorithms for clustering vertices in stochastic blockmodel graphs with vertex covariates.
Revised:  To assess the effects of such covariates on block recovery, we present a comparative analysis of two model-based spectral algorithms for clustering vertices in stochastic blockmodel graphs with vertex covariates.
Edit intent: clarity
Original:  The first algorithm  directly estimates the induced block assignments by investigating the estimated block connectivity probability matrix including the vertex covariate effect .
Revised:  The first algorithm directly estimates the induced block assignments .
Edit intent: clarity
Original:  The second algorithm estimates the vertex covariate effect and then estimates the induced block assignmentsafter accounting for this effect .
Revised:  The second algorithm incorporates both the adjacency matrix and the vertex covariates into the estimation of block assignments, and moreover quantifies the explicit impact of the vertex covariates on the resulting estimate of the block assignments .
Edit intent: clarity
Original:  We employ Chernoff information to analytically compare the algorithms' performance and derive the Chernoff ratio formula for some special models of interest.
Revised:  We employ Chernoff information to analytically compare the algorithms' performance and derive the Chernoff ratio for certain models of interest.
Edit intent: clarity
Original:  Analytic results and simulations suggest that , in general, the second algorithm is  preferred: we can  better estimate the induced block assignments by first estimating the vertex covariate effect .
Revised:  Analytic results and simulations suggest that the second algorithm is preferred: we can better estimate the induced block assignments by first estimating the vertex covariate effect .
Edit intent: coherence
Original:  Analytic results and simulations suggest that , in general, the second algorithm is  preferred: we can  better estimate the induced block assignments by first estimating the vertex covariate effect .
Revised:  Analytic results and simulations suggest that , in general, the second algorithm is preferred: we can often better estimate the induced block assignments by first estimating the vertex covariate effect .
Edit intent: clarity
Original:  Analytic results and simulations suggest that , in general, the second algorithm is  preferred: we can  better estimate the induced block assignments by first estimating the vertex covariate effect .
Revised:  Analytic results and simulations suggest that , in general, the second algorithm is preferred: we can better estimate the induced block assignments by first estimating the effect of vertex covariates .
Edit intent: clarity
Original:  In addition, real data experiments on a diffusion MRI connectome data set indicate that the second algorithm has the advantages of revealing underlying block structure and taking observed vertex heterogeneity into account in real applications.
Revised:  In addition, real data examples on diffusion MRI connectome data set indicate that the second algorithm has the advantages of revealing underlying block structure and taking observed vertex heterogeneity into account in real applications.
Edit intent: clarity
Original:  The first algorithm uses only the adjacency matrix, and directly estimates the induced block assignments.
Revised:  The first algorithm uses only the adjacency matrix, and directly estimates the block assignments.
Edit intent: clarity
Original:  In addition, real data examples on diffusion MRI connectome datasets and social network datasets also indicate that the second algorithm has the advantages of revealing underlying block structure and taking observed vertex heterogeneity into account in real applications.
Revised:  In addition, real data examples also indicate that the second algorithm has the advantages of revealing underlying block structure and taking observed vertex heterogeneity into account in real applications.
Edit intent: coherence
Original:  This survey presents medical and AI researchers with a comprehensive view of the existing and potential applications of AI technology in combating COVID-19 with the goal of inspiring researches to continue to maximize the advantages of AI and big data to fight COVID-19.
Revised:  This survey presents medical and AI researchers with a comprehensive view of the existing and potential applications of AI technology in combating COVID-19 with the goal of inspiring researchers to continue to maximize the advantages of AI and big data to fight COVID-19.
Edit intent: fluency
Original:  Although Bluetooth technology gives a good insight into the proximity aspect of an encounter, it does not provide any location context related to it which helps making better decisions.
Revised:  Although Bluetooth technology gives a good insight into the proximity aspect of an encounter, it does not provide any location context related to it which helps to make better decisions.
Edit intent: fluency
Original:  Two of them allow private location logging, without revealing their location history within an app.
Revised:  Two such methods allow private location logging, without revealing their location history within an app.
Edit intent: clarity