wanyu/IteraTeR_v2 huggingface dataset:
Original:  The first approach is the standard one which is to obtain the convergence rates in terms of Bregman distance and the second one is to obtain the convergence rates in weaker norms.
Revised:  The first approach is the standard one which is to obtain the convergence rates in terms of Bregman distance and the second one is in terms of weaker norms.
Edit intent: fluency
Original: In this paper, we analyze the convergence rates of well known Tikhonov regularization scheme for solving the nonlinear ill-posed problems by using the Holder stability estimates.
Revised: In this paper, we analyze the convergence rates of well known Tikhonov regularization scheme for solving the nonlinear ill-posed problems by incorporating the conditional stability estimates.
Edit intent: clarity
Original:  At the end, we also discuss the convergence rates for Tikhonov regularization with sparsity constraints by incorporating the Holder stability estimates .
Revised:  We also discuss the convergence rates for Tikhonov regularization with sparsity constraints by incorporating the Holder stability estimates .
Edit intent: coherence
Original: In this paper, we analyze the convergence rates of well known Tikhonov regularization scheme for solving the nonlinear ill-posed problems by incorporating the conditional stability estimates.
Revised: In this paper, we formulate the convergence rates of well known Tikhonov regularization scheme for solving the nonlinear ill-posed problems by incorporating the conditional stability estimates.
Edit intent: clarity
Original:  Furthermore, it enables a different and unified view point on shell mechanics in general and leads to an elegant implementation.
Edit intent: coherence
Original:  Numerical results are achieved based on isogeometric analysis for classical and new benchmark tests.
Revised:  Numerical results presented herein are achieved with isogeometric analysis for classical and new benchmark tests.
Edit intent: clarity
Original: The aim of this paper is to select the RBF neural network  centers under concurrent faults.
Revised: The aim of this paper is to train an RBF neural network centers under concurrent faults.
Edit intent: clarity
Original:  It is well known that fault tolerance is a very attractive property for neural network algorithms .
Revised:  It is well known that fault tolerance is a very attractive property for neural networks .
Edit intent: clarity
Original:  And center selection is an important procedure during the training process of  RBF neural network.
Revised:  And center selection is an important procedure during the training process of an RBF neural network.
Edit intent: fluency
Original:  In this paper, we will address these two issues simultaneously and devise two novel algorithms . Both of them are based on the framework of ADMM and utilize the technique of sparse approximation.
Revised:  In this paper, we devise two novel algorithms to address these two issues simultaneously and devise two novel algorithms . Both of them are based on the framework of ADMM and utilize the technique of sparse approximation.
Edit intent: clarity
Original:  In this paper, we will address these two issues simultaneously and devise two novel algorithms . Both of them are based on the framework of ADMM and utilize the technique of sparse approximation.
Revised:  In this paper, we will address these two issues simultaneously . Both of them are based on the framework of ADMM and utilize the technique of sparse approximation.
Edit intent: clarity
Original:  The convergence of both two methods is proved . Simulation results show that  the proposed algorithms are superior to many existing center selection algorithms under concurrent fault .
Revised:  The convergence of both two methods is proved . Simulation results show that , under concurrent fault, the proposed algorithms are superior to many existing center selection algorithms under concurrent fault .
Edit intent: fluency
Original:  In the second method, an l 0 -norm term is directly used, and the hard threshold (HT) is utilized to address the l 0 -norm term.
Revised:  In the second method, an l0-norm term is directly used, and the hard threshold (HT) is utilized to address the l 0 -norm term.
Edit intent: fluency
Original:  In the second method, an l 0 -norm term is directly used, and the hard threshold (HT) is utilized to address the l 0 -norm term.
Revised:  In the second method, an l 0 -norm term is directly used, and the hard threshold (HT) is utilized to address the l0-norm term.
Edit intent: fluency
Original:  the experiments are conducted via noise-free classical simulation of the quantum circuits implemented in QISKit .
Revised:  the experiments are conducted via noise-free classical simulation of the quantum circuits implemented in Qiskit .
Edit intent: fluency
Original:  This technical report moves some steps in the direction of characterizing the practical performance of the methodology, in the context of finding solutions to classical combinatorial optimization problems.
Revised:  This paper moves some steps in the direction of characterizing the practical performance of the methodology, in the context of finding solutions to classical combinatorial optimization problems.
Edit intent: clarity
Original:  A number of key wireless network functionalities (e.g., traffic steering, energy savings ) give rise to hard optimization problems.
Revised:  A number of key wireless network functionalities (e.g., traffic steering, power control ) give rise to hard optimization problems.
Edit intent: clarity
Original:  To this end, in this paper we propose the framework of Online Network Optimization (ONO), which seeks to maintain both agile and efficient control over time, using an arsenal of data-driven, adaptive , and AI-based techniques.
Revised:  To this end, we propose the framework of Online Network Optimization (ONO), which seeks to maintain both agile and efficient control over time, using an arsenal of data-driven, adaptive , and AI-based techniques.
Edit intent: coherence
Original:  Therefore, the important question " what is the right ONO technique?
Revised:  Therefore, the important question ` what is the right ONO technique?
Edit intent: fluency
Original:  " remains open to date.
Revised:  ' remains open to date.
Edit intent: fluency
Original:  In this paper, we discuss the pros and cons of each technique and further attempt a direct quantitative comparison for a specific use case, using real data.
Revised:  In this paper, we discuss the pros and cons of each technique and present a direct quantitative comparison for a specific use case, using real data.
Edit intent: clarity
Original:  Both systems can be considered as a recommender system for recommendation algorithms.
Revised:  Both systems can be considered as recommender systems for recommendation algorithms.
Edit intent: fluency
Original:  A macro recommender system recommends the best performing recommendation algorithm to an organization that wants to build a recommender system.
Revised:  A macro-level recommender system recommends the best performing recommendation algorithm to an organization that wants to build a recommender system.
Edit intent: clarity
Original:  This way, an organization does not need to test many algorithms over long periods to find the best one for their particular platform.
Revised:  This way, an organization does not need to test many algorithms over long periods to find the best one for their platform.
Edit intent: clarity
Original:  For instance, a micro recommender system might recommend one algorithm when recommendations for an elderly male user in the evening should be created .
Revised:  For instance, a micro recommender system might recommend one algorithm when recommendations for an elderly male user in the evening are needed .
Edit intent: clarity
Original:  In this paper ,  we propose a new centralitymeasure, Cascade Centrality, which integrates network position ,  the diffusion process, and nodal characteristics.
Revised:  In this paper , we propose contextual centrality , the diffusion process, and nodal characteristics.
Edit intent: clarity
Original:  Cascade Centrality can capture more complex behaviors and processes in the network and has significant implications for theoretical studies in influence maximization and practical applicationsin viral marketingand political campaign .
Revised:  Cascade Centrality can capture more complex behaviors and processes in the network and has significant implications for applications, such as information diffusion, viral marketing, and political campaigns .
Edit intent: clarity
Original:  Our project significantly improves the accuracies upon the heuristic assignment rules popularly adopted in the literature.
Revised:  Our project significantly improves the accuracy upon the heuristic assignment rules popularly adopted in the literature.
Edit intent: fluency
Original:  Starting with the historical data of geo-temporal travel pattern for a panel of individuals, we create, for each person-location, a vector of probability distribution capturing the likelihood that the person will appear in that location for a given the time of day.
Revised:  Starting with the historical data of geo-temporal travel patterns for a panel of individuals, we create, for each person-location, a vector of probability distribution capturing the likelihood that the person will appear in that location for a given the time of day.
Edit intent: fluency
Original:  Stacked in this way, the matrix of historical geo-temporal data enables us to apply Eigen-decomposition and use unsupervised machine learning techniques to extract commonalities across locations for the different group of travelers, which ultimately allows us to make inferences and create labels, such as home and work, on specific locations.
Revised:  Stacked in this way, the matrix of historical geo-temporal data enables us to apply Eigen-decomposition and use unsupervised machine learning techniques to extract commonalities across locations for the different groups of travelers, which ultimately allows us to make inferences and create labels, such as home and work, on specific locations.
Edit intent: fluency
Original: The understanding of variations in genome sequences assists us in identifying people who are predisposed to common diseases , solving rare diseases, and finding the corresponding population group of the individuals from a larger population group.
Revised: The study of genetic variants can help find correlating population groups to identify cohorts that are predisposed to common diseases , solving rare diseases, and finding the corresponding population group of the individuals from a larger population group.
Edit intent: clarity
Original:  Our experimental results, with a focus on accuracy and scalability , show the effectiveness and superiority compared to the state-of-the-art  .
Revised:  Our experimental results, with a focus on accuracy and scalability show that our approach outperforms state-of-the-art .
Edit intent: clarity
Original: Variational autoencoders  (VAEs) have shown a promise in data-driven conversation modeling.
Revised: Variational autoencoders ~ (VAEs) have shown a promise in data-driven conversation modeling.
Edit intent: fluency
Original:  However, most VAE conversation models match the approximate posterior distribution over the latent variables to a simple prior such as standard normal distribution, thereby restricting the generated responses to a relatively simple (e.g., single-modal ) scope.
Revised:  However, most VAE conversation models match the approximate posterior distribution over the latent variables to a simple prior such as standard normal distribution, thereby restricting the generated responses to a relatively simple (e.g., unimodal ) scope.
Edit intent: clarity
Original:  In this paper, we propose DialogWAE, a conditional Wasserstein autoencoder  (WAE) specially designed for dialogue modeling.
Revised:  In this paper, we propose DialogWAE, a conditional Wasserstein autoencoder ~ (WAE) specially designed for dialogue modeling.
Edit intent: fluency
Original:  Experiments on two widely-used datasets show that DialogWAE outperforms the state-of-the-art approaches in generating more coherent, informative and diverse responses.
Revised:  Experiments on two popular datasets show that DialogWAE outperforms the state-of-the-art approaches in generating more coherent, informative and diverse responses.
Edit intent: clarity
Original: Humans are adept at uncovering complex associations in the world around them, yet the underlying mechanisms remain poorly understood.
Revised: Humans are adept at uncovering abstract associations in the world around them, yet the underlying mechanisms remain poorly understood.
Edit intent: clarity
Original:  Intuitively, learning the higher-order structure of statistical relationships should involve sophisticated mental processes, expending valuable computational resources .
Revised:  Intuitively, learning the higher-order structure of statistical relationships should involve complex mental processes .
Edit intent: clarity
Original: Pure machine-based solutions usually struggle in  challenging classification tasks such as entity resolution (ER).
Revised: Pure machine-based solutions usually struggle in the challenging classification tasks such as entity resolution (ER).
Edit intent: fluency
Original:  To alleviate this problem, a recent trend is to involve humans in the resolution process, most notably the crowdsourcing approach.
Revised:  To alleviate this problem, a recent trend is to involve the human in the resolution process, most notably the crowdsourcing approach.
Edit intent: style
Original:  However, it remains very challenging to find a solution that can effectively improve the quality of entity resolution with limited human effort.
Revised:  However, it remains very challenging to effectively improve machine-based entity resolution with limited human effort.
Edit intent: clarity
Original:  In this position paper, we investigate the problem of human and machine cooperation for ER from a risk perspective.
Revised:  In this paper, we investigate the problem of human and machine cooperation for ER from a risk perspective.
Edit intent: clarity
Original:  We propose to select for manual verification the machine-labeled results at high risk of being mislabeled .
Revised:  We propose to select the machine-labeled results at high risk of being mislabeled .
Edit intent: clarity
Original:  We propose to select for manual verification the machine-labeled results at high risk of being mislabeled .
Revised:  We propose to select for manual verification the machine-labeled instances at high risk of being mislabeled .
Edit intent: clarity
Original:  We present a risk model for this task that takes into consideration the human-labeled results as well as the output of the machine 's resolution.
Revised:  We present a risk model that takes into consideration the human-labeled results as well as the output of the machine 's resolution.
Edit intent: clarity
Original:  We present a risk model for this task that takes into consideration the human-labeled results as well as the output of the machine 's resolution.
Revised:  We present a risk model for this task that takes into consideration the human-labeled instances as well as the output of the machine 's resolution.
Edit intent: clarity
Original:  We present a risk model for this task that takes into consideration the human-labeled results as well as the output of the machine 's resolution.
Revised:  We present a risk model for this task that takes into consideration the human-labeled results as well as the output of machine resolution.
Edit intent: fluency
Original:  Finally, our experiments on real data demonstrate that the proposed risk model picks up the mislabeled instances with considerably higher accuracy than the existing alternatives.
Revised:  Finally, we evaluate the performance of the proposed risk model on real data demonstrate that the proposed risk model picks up the mislabeled instances with considerably higher accuracy than the existing alternatives.
Edit intent: clarity
Original:  Finally, our experiments on real data demonstrate that the proposed risk model picks up the mislabeled instances with considerably higher accuracy than the existing alternatives.
Revised:  Finally, our experiments on real data . Our experiments demonstrate that it can pick up the mislabeled instances with considerably higher accuracy than the existing alternatives.
Edit intent: clarity
Original:  Provided with the same  human cost budget, it also achieves consistently better resolution quality than the state-of-the-art approach based on active learning.
Revised:  Provided with the same amount of human cost budget, it also achieves consistently better resolution quality than the state-of-the-art approach based on active learning.
Edit intent: clarity
Original:  Provided with the same  human cost budget, it also achieves consistently better resolution quality than the state-of-the-art approach based on active learning.
Revised:  Provided with the same human cost budget, it can also achieve better resolution quality than the state-of-the-art approach based on active learning.
Edit intent: clarity
Original:  While popularity- and network-based ranking metrics such as degree and Google's PageRank  have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Revised:  While popularity-based ranking algorithms (like Google's PageRank have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Edit intent: clarity
Original:  While popularity- and network-based ranking metrics such as degree and Google's PageRank  have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Revised:  While popularity- and network-based ranking metrics such as degree and Google's PageRank ) have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Edit intent: fluency
Original:  While popularity- and network-based ranking metrics such as degree and Google's PageRank  have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Revised:  While popularity- and network-based ranking metrics such as degree and Google's PageRank have been extensively studied in previous works , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Edit intent: clarity
Original:  While popularity- and network-based ranking metrics such as degree and Google's PageRank  have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Revised:  While popularity- and network-based ranking metrics such as degree and Google's PageRank have been extensively studied in previous literature , we still lack a clear understanding of their potential systemic consequences of the adoption of different ranking algorithms .
Edit intent: clarity
Original:  While popularity- and network-based ranking metrics such as degree and Google's PageRank  have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences of the adoption of different ranking algorithms .
Revised:  While popularity- and network-based ranking metrics such as degree and Google's PageRank have been extensively studied in previous literature , we still lack a clear understanding of the potential systemic consequences .
Edit intent: clarity
Original:  In this work, we fill this gap by introducing a  model of network growth where the probability that a node acquires a new connection depends on both its current ranking position and its inherent quality.
Revised:  In this work, we fill this gap by introducing a new model of network growth where the probability that a node acquires a new connection depends on both its current ranking position and its inherent quality.
Edit intent: clarity
Original:  The model allows us to quantify the ability of a ranking algorithm to detect and promote high-quality content, as well as the heterogeneity of the resulting content popularity distribution .
Revised:  The model allows us to compare the properties of the networks generated under the influence of different ranking algorithms .
Edit intent: clarity
Original:  We show that by correcting for the omnipresent age bias of ranking metrics , the resulting networks exhibit a significantly larger agreement between the nodes'  quality and their long-term popularity, and larger popularity diversity .
Revised:  We show that by correcting for the omnipresent age bias of popularity-based ranking algorithms , the resulting networks exhibit a significantly larger agreement between the nodes' quality and their long-term popularity, and larger popularity diversity .
Edit intent: clarity
Original:  We show that by correcting for the omnipresent age bias of ranking metrics , the resulting networks exhibit a significantly larger agreement between the nodes'  quality and their long-term popularity, and larger popularity diversity .
Revised:  We show that by correcting for the omnipresent age bias of ranking metrics , the resulting networks exhibit a significantly larger agreement between the nodes' inherent quality and their long-term popularity, and larger popularity diversity .
Edit intent: clarity
Original:  Our findings move the first steps toward a model-based understanding of the long-term impact of popularity metrics , and could be used as an informative tool for the design of improved information filtering tools.
Revised:  Our findings move the first steps toward a model-based understanding of the long-term impact of popularity-based ranking algorithms , and could be used as an informative tool for the design of improved information filtering tools.
Edit intent: clarity
Original:  By analyzing a generalized consumer resource model that explicitly includes cross-feeding, stochastic colonization, and thermodynamics, we show that complex microbial communities generically exhibit a sharp transition as a function of available energy fluxes from a ` resource-limited ' regime where community structure and stability is shaped by energetic and metabolic considerations to a diverse regime where the dominant force shaping microbial communities is competition .
Revised:  By analyzing a generalized consumer resource model that explicitly includes cross-feeding, stochastic colonization, and thermodynamics, we show that complex microbial communities generically exhibit a transition as a function of available energy fluxes from a ` resource-limited ' regime where community structure and stability is shaped by energetic and metabolic considerations to a diverse regime where the dominant force shaping microbial communities is competition .
Edit intent: clarity