wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, due to the detachment of embedding process with external tasks, the learned embedding results by most existing embedding models can be ine ective for application tasks with speci c objectives, e.g., community detection vs information di usion.
Revised:  However, due to the detachment of embedding process with external tasks, the learned embedding results by most existing embedding models can be ineffective for application tasks with speci c objectives, e.g., community detection vs information di usion.
Edit intent: clarity
Original:  However, due to the detachment of embedding process with external tasks, the learned embedding results by most existing embedding models can be ine ective for application tasks with speci c objectives, e.g., community detection vs information di usion.
Revised:  However, due to the detachment of embedding process with external tasks, the learned embedding results by most existing embedding models can be ine ective for application tasks with specific objectives, e.g., community detection vs information di usion.
Edit intent: fluency
Original:  In this paper, we will study the application oriented heterogeneous  network embedding problem.
Revised:  In this paper, we propose study the application oriented heterogeneous network embedding problem.
Edit intent: clarity
Original:  Signi cantly di erent from the existing works, besides the network structure preservation, the problem should also incorporate the objectives of external application in the objective function.
Revised:  Significantly different from the existing works, besides the network structure preservation, the problem should also incorporate the objectives of external application in the objective function.
Edit intent: fluency
Original:  Signi cantly di erent from the existing works, besides the network structure preservation, the problem should also incorporate the objectives of external application in the objective function.
Revised:  Signi cantly di erent from the existing works, besides the network structure preservation, the problem should also incorporate the objectives of external applications in the objective function.
Edit intent: fluency
Original:  Meanwhile, the heterogeneous network structure can be applied to compute the node "diffusive proximity" score , which capture both local and global network structures.
Revised:  Meanwhile, the heterogeneous network structure can be applied to compute the node "diffusive proximity" scores , which capture both local and global network structures.
Edit intent: fluency
Original:  In this paper, we develop machinery for proving sum of squares lower bounds on symmetric problems based on the intuition that sum of squares has difficulty capturing ] integrality arguments, i.e. arguments that an expression must be an integer.
Revised:  In this paper, we develop machinery for proving sum of squares lower bounds on symmetric problems based on the intuition that sum of squares has difficulty capturing ] integrality arguments, i.e. arguments that expression(s) must be an integer.
Edit intent: fluency
Original:  Using this machinery , we prove a tight sum of squares lower bound for the following Turan type problem: Minimize the number of triangles in a graph G with a fixed edge density.
Revised:  Using this machinery , we prove a tight sum of squares lower bound for the following Turan type problem: Minimize the number of triangles in a graph G with a given edge density.
Edit intent: clarity
Original:  We also give an alternative proof of Grigoriev's  sum of squares lower bound for the knapsack problem .
Revised:  For knapsack, we recover Grigoriev's sum of squares lower bound for the knapsack problem .
Edit intent: clarity
Original: A common technique in proof complexity is showing that lower bounds for a given model follow from lower bounds for a simpler prover/adversary game.
Edit intent: coherence
Original:  In this paper, we develop machinery for applying this technique to the sum of squares hierarchy/Positivstellensatz proof system under the following two conditions.
Revised:  In this paper, we develop machinery which makes it much easier to prove sum of squares hierarchy/Positivstellensatz proof system under the following two conditions.
Edit intent: clarity
Original:  First, we require that our problem is symmetric under permutations of [1,n] . Second, we require that the unsatisfiability of our problem comes from integrality arguments, i.e. arguments that expression(s) must be an integer.
Revised:  First, we require that our problem is symmetric under permutations of [1,n] and the unsatisfiability of our problem comes from integrality arguments, i.e. arguments that expression(s) must be an integer.
Edit intent: coherence
Original:  First, we require that our problem is symmetric under permutations of [1,n] . Second, we require that the unsatisfiability of our problem comes from integrality arguments, i.e. arguments that expression(s) must be an integer.
Revised:  First, we require that our problem is symmetric under permutations of [1,n] . Second, we require that the unsatisfiability of our problem comes from integrality arguments, i.e. arguments that an expression must be an integer.
Edit intent: fluency
Original:  For the MOD 2 principle, we strengthen Grigoriev's linear degree sum of squares lower bound, making it exact.
Revised:  For the MOD 2 principle, we tighten Grigoriev's linear degree sum of squares lower bound, making it exact.
Edit intent: clarity
Original:  and therefore that any semidefinite representation of such polynomials must have dimension at least (n/d)^{\Omega(d)}  . The proof contains several ingredients of independent interest, including the identification of a large subspace in which the elementary symmetric polynomials lie in the relative interior of the set of hyperbolic polynomials, and quantitative versions of several basic facts about real rooted polynomials.
Revised:  and therefore that any semidefinite representation of such cones must have dimension at least (n/d)^{\Omega(d)} . The proof contains several ingredients of independent interest, including the identification of a large subspace in which the elementary symmetric polynomials lie in the relative interior of the set of hyperbolic polynomials, and quantitative versions of several basic facts about real rooted polynomials.
Edit intent: clarity
Original: We propose to use neural networks (NNs) for simultaneous detection and localization of multiple sound sources in Human-Robot Interaction (HRI).
Revised: We propose to use neural networks for simultaneous detection and localization of multiple sound sources in Human-Robot Interaction (HRI).
Edit intent: clarity
Original:  Previously, NN-based methods have been successfully applied to single SSL problems , which do not extend to multiple sources in terms of detection and localization.
Revised:  Previously, NN-based methods have been focusing on localizing a single sound source , which do not extend to multiple sources in terms of detection and localization.
Edit intent: clarity
Original:  In addition, we investigate the use of sub-band cross-correlation information as features for better localization in sound mixtures, as well as three different NN architectures based on different processing motivations.
Revised:  In addition, we investigate the use of sub-band cross-correlation information as features for better localization in sound mixtures, as well as three different network architectures based on different processing motivations.
Edit intent: fluency
Original:  In addition, we investigate the use of sub-band cross-correlation information as features for better localization in sound mixtures, as well as three different NN architectures based on different processing motivations.
Revised:  In addition, we investigate the use of sub-band cross-correlation information as features for better localization in sound mixtures, as well as three different NN architectures based on different motivations.
Edit intent: clarity
Original:  Experiments on real data recorded from the robot show that our NN-based methods significantly outperform the popular spatial spectrum-based approaches.
Revised:  Experiments on real data recorded from a robot show that our NN-based methods significantly outperform the popular spatial spectrum-based approaches.
Edit intent: fluency
Original:  Experiments on real data recorded from the robot show that our NN-based methods significantly outperform the popular spatial spectrum-based approaches.
Revised:  Experiments on real data recorded from the robot show that our proposed methods significantly outperform the popular spatial spectrum-based approaches.
Edit intent: clarity
Original: In this paper, we model the community question answering (CQA) websites on Stack Exchange platform as knowledge markets, and analyze how and why these markets can fail at scale.
Revised: In this paper, we interpret the community question answering (CQA) websites on Stack Exchange platform as knowledge markets, and analyze how and why these markets can fail at scale.
Edit intent: clarity
Original: In this paper, we model the community question answering (CQA) websites on Stack Exchange platform as knowledge markets, and analyze how and why these markets can fail at scale.
Revised: In this paper, we model the community question answering websites on the StackExchange platform as knowledge markets, and analyze how and why these markets can fail at scale.
Edit intent: clarity
Original:  Analyzing CQA websites as markets allows site operators to reason about the failuresin knowledge markets, and design policies to prevent these failures.
Revised:  A knowledge market framing allows site operators to reason about the failuresin knowledge markets, and design policies to prevent these failures.
Edit intent: clarity
Original:  Analyzing CQA websites as markets allows site operators to reason about the failuresin knowledge markets, and design policies to prevent these failures.
Revised:  Analyzing CQA websites as markets allows site operators to reason about market failures, and to design policies to prevent these failures.
Edit intent: clarity
Original:  We explore a set of interpretable economic production models to capture content generation dynamics in knowledge markets.
Revised:  We explore a set of interpretable economic production models on a large empirical dataset to analyze the dynamics of content generation in knowledge markets.
Edit intent: clarity
Original:  The best performing of these, well-known in economic literature as Cobb-Douglas equation, provides an intuitive explanation for content generation in the knowledge markets.
Revised:  Amongst these, the Cobb-Douglas equation, provides an intuitive explanation for content generation in the knowledge markets.
Edit intent: coherence
Original:  factors of content generation such as user participation and content dependency have constant elasticity--a percentage increase in any of the inputs leads to a constant percentage increase in the output , (2)
Revised:  factors of content generation have constant elasticity---a percentage increase in any of the inputs leads to a constant percentage increase in the output , (2)
Edit intent: clarity
Original:  in many markets , factors exhibit diminishing returns--the incremental, marginal output decreases as the input is incrementally increased , (3) markets vary according to their returns to scale--the increase in output resulting from a proportionate increase in all inputs , and finally (4) many markets exhibit diseconomies of scale--measures of market health  decrease as a function of overall system size (number of participants) 
Revised:  in many markets , factors exhibit diminishing returns--the incremental, marginal output decreases as the input is incrementally increased . Knowledge markets also vary on their returns to scale--the increase in output resulting from a proportionate increase in all inputs , and finally (4) many markets exhibit diseconomies of scale--measures of market health decrease as a function of overall system size (number of participants) 
Edit intent: clarity
Original:  in many markets , factors exhibit diminishing returns--the incremental, marginal output decreases as the input is incrementally increased , (3) markets vary according to their returns to scale--the increase in output resulting from a proportionate increase in all inputs , and finally (4) many markets exhibit diseconomies of scale--measures of market health  decrease as a function of overall system size (number of participants) 
Revised:  in many markets , factors exhibit diminishing returns--the incremental, marginal output decreases as the input is incrementally increased , (3) markets vary according to their returns to scale---the increase in output resulting from a proportionate increase in all inputs , and finally (4) many markets exhibit diseconomies of scale--measures of market health decrease as a function of overall system size (number of participants) 
Edit intent: fluency
Original:  in many markets , factors exhibit diminishing returns--the incremental, marginal output decreases as the input is incrementally increased , (3) markets vary according to their returns to scale--the increase in output resulting from a proportionate increase in all inputs , and finally (4) many markets exhibit diseconomies of scale--measures of market health  decrease as a function of overall system size (number of participants) 
Revised:  in many markets , factors exhibit diminishing returns--the incremental, marginal output decreases as the input is incrementally increased , (3) markets vary according to their returns to scale--the increase in output resulting from a proportionate increase in all inputs , and finally (4) many markets exhibit diseconomies of scale---measures of market health decrease as a function of overall system size (number of participants) 
Edit intent: fluency
Original:  The design framework is partially inspired by the vision of DARPA SC2, a 3-year competition whereby competitors are to come up with a clean-slate design that "best share spectrum with any network(s), in any environment, without prior knowledge, leveraging on machine-learning technique".
Revised:  The thrust of this work is partially inspired by the vision of DARPA SC2, a 3-year competition whereby competitors are to come up with a clean-slate design that "best share spectrum with any network(s), in any environment, without prior knowledge, leveraging on machine-learning technique".
Edit intent: clarity
Original:  The DRL agents of DLMA do not know that the other two MAC protocols are TDMA and ALOHA.
Revised:  The nodes operating DLMA do not know that the other two MAC protocols are TDMA and ALOHA.
Edit intent: clarity
Original:  Yet, by a series of observations of the environment, its own actions, and the rewards - in accordance with the DRL algorithmic framework - a DRL agent can learn the optimal MAC strategy for harmonious co-existence with TDMA and ALOHA nodes .
Revised:  Yet, by a series of observations of the environment, its own actions, and the resulting rewards, a DLMA node can learn an optimal MAC strategy for harmonious co-existence with TDMA and ALOHA nodes .
Edit intent: clarity
Original:  Yet, by a series of observations of the environment, its own actions, and the rewards - in accordance with the DRL algorithmic framework - a DRL agent can learn the optimal MAC strategy for harmonious co-existence with TDMA and ALOHA nodes .
Revised:  Yet, by a series of observations of the environment, its own actions, and the rewards - in accordance with the DRL algorithmic framework - a DRL agent can learn the optimal MAC strategy to coexist harmoniously with the TDMA and ALOHA nodes .
Edit intent: fluency
Original: Many empirical networks have community structure, with which nodes are densely interconnected within each community (i.e., a group of nodes) and sparsely across different communities.
Revised: Many empirical networks have community structure, in which nodes are densely interconnected within each community (i.e., a group of nodes) and sparsely across different communities.
Edit intent: clarity
Original:  As a result, we can compute reachable sets of systems with several thousand state variables for bounded, but arbitrarily varying inputs , as demonstrated using a bridge model subject to disturbances .
Revised:  As a result, we can compute reachable sets of systems with several thousand state variables for bounded, but arbitrarily varying inputs .
Edit intent: clarity
Original:  Absolute images have important applications in medical Electrical Impedance Tomography (EIT) imaging, but the  computations are very sensitive to modeling errors and noise.
Revised: Objective: Absolute images have important applications in medical Electrical Impedance Tomography (EIT) imaging, but the computations are very sensitive to modeling errors and noise.
Edit intent: coherence
Original:  In this paper the effects of errors in domain shape and electrode placement on absolute images computed with 2-D D-bar reconstruction algorithms are studied .
Revised:  In this paper the effects of errors in domain shape and electrode placement on absolute images computed with 2D D-bar reconstruction algorithms are studied .
Edit intent: fluency
Original:  It is demonstrated with experimental tank data from several EIT systems that these methods are quite robust to such modeling errors, and furthermore the artefacts arising from such modeling errors are similar to those occurring in classic time-difference EIT imaging  .
Revised:  It is demonstrated with tank data from several EIT systems that these methods are quite robust to such modeling errors, and furthermore the artefacts arising from such modeling errors are similar to those occurring in classic time-difference EIT imaging .
Edit intent: clarity
Original:  Only the data points in high percentiles deviate from it when the local and world \mu parameters of the lognormal distributions are very different.
Revised:  Only the data points in high percentiles deviate from it when the local and world \mu parameters of the lognormal distributions are very different.
Edit intent: fluency
Original:  Comparison of the normal and percentile-based double rank plots shows that the latter is more statistically robust than the former.
Edit intent: coherence
Original: Bigger cities are associated with higher per-capita productivity -- in positive aspects, such as inventions, and negative ones, such as crimes .
Revised: Urban outputs often scale superlinearly with city population .
Edit intent: clarity
Original:  A difficulty in understanding the origin of this phenomenon , superlinear scaling, is that similar quantities exhibit different scaling behaviors.
Revised:  A difficulty in understanding the mechanism of this phenomenon , superlinear scaling, is that similar quantities exhibit different scaling behaviors.
Edit intent: clarity
Original:  A difficulty in understanding the origin of this phenomenon , superlinear scaling, is that similar quantities exhibit different scaling behaviors.
Revised:  A difficulty in understanding the origin of this phenomenon is that different outputs differ considerably in their scaling behaviors.
Edit intent: clarity
Original:  Our model suggests that superlinear scaling can be an outcome of the increased likelihood of finding required collaborations in a larger , interconnected population , and that activities requiring more participants will exhibit more pronounced superlinear scaling .
Revised:  Our model suggests that the increased likelihood of finding required collaborations in a larger , interconnected population , and that activities requiring more participants will exhibit more pronounced superlinear scaling .
Edit intent: clarity
Original:  We test this model using a novel dataset for group sizes involved in seven types of crimes, as well as patents, and find strong support.
Revised:  We test this model using a novel dataset for seven crime types and find strong support.
Edit intent: clarity
Original:  We show a  sharp peak in the distribution of displacement P(x,t) around x=0, that has frequently been observed in experiments , but not previously explained theoretically .
Revised:  We show a sharp peak in the distribution of displacement P(x,t) around x=0, that has frequently been observed in experiments .
Edit intent: coherence
Original: In this paper, we aim to design a distributed solution to topology formation problem of large- scale sensor networks with multi-source multicast flows.
Revised: In this paper, we propose a solution to the distributed topology formation problem of large- scale sensor networks with multi-source multicast flows.
Edit intent: clarity
Original: In this paper, we aim to design a distributed solution to topology formation problem of large- scale sensor networks with multi-source multicast flows.
Revised: In this paper, we aim to design a distributed solution to topology formation problem for large-scale sensor networks with multi-source multicast flows.
Edit intent: fluency
Original:  We propose a distributed solution based on game-theoretic approaches in conjunction with network coding.
Revised:  The proposed solution is based on game-theoretic approaches in conjunction with network coding.
Edit intent: clarity
Original:  We show that the proposed game, which consists of multiple players and multicast flows , can be decomposed into independent link formation games played by only two players with a unicast flow.
Revised:  We show that the proposed game, which consists of multiple players and multicast flows into independent link formation games played by only two players with a unicast flow.
Edit intent: clarity
Original:  It is guaranteed that the proposed algorithm is converged, i.e., a stable network topologycan be always formed .
Revised:  We also show that the proposed algorithm is converged, i.e., a stable network topologycan be always formed .
Edit intent: coherence
Original:  It is guaranteed that the proposed algorithm is converged, i.e., a stable network topologycan be always formed .
Revised:  It is guaranteed that the proposed algorithm is guaranteed to determine at least one stable topology .
Edit intent: clarity
Original:  Our simulation results confirm that the computational complexity of the proposed solution is low enough for practical deployment in large-scale sensor networks.
Revised:  Our simulation results confirm that the computational complexity of the proposed solution is low enough for practical deployment in large-scale networks.
Edit intent: clarity
Original: We study the convolutional phase retrieval problem, which considers recovering an unknown signal \mathbf x \in \mathbb C^n from m measurements consisting of the magnitude of its cyclic convolution with a known kernel \mathbf a \in \mathbb C^m .
Revised: We study the convolutional phase retrieval problem, of recovering an unknown signal \mathbf x \in \mathbb C^n from m measurements consisting of the magnitude of its cyclic convolution with a known kernel \mathbf a \in \mathbb C^m .
Edit intent: coherence
Original: We study the convolutional phase retrieval problem, which considers recovering an unknown signal \mathbf x \in \mathbb C^n from m measurements consisting of the magnitude of its cyclic convolution with a known kernel \mathbf a \in \mathbb C^m .
Revised: We study the convolutional phase retrieval problem, which considers recovering an unknown signal \mathbf x \in \mathbb C^n from m measurements consisting of the magnitude of its cyclic convolution with a given kernel \mathbf a \in \mathbb C^m .
Edit intent: clarity
Original:  We show that when \mathbf a is random and the sample number m is sufficiently large, with high probability \mathbf x can be efficiently recovered up to a global phase  using a combination of spectral initialization and generalized gradient descent.
Revised:  We show that when \mathbf a is random and the number of observations m is sufficiently large, with high probability \mathbf x can be efficiently recovered up to a global phase using a combination of spectral initialization and generalized gradient descent.
Edit intent: clarity