wanyu/IteraTeR_v2 huggingface dataset:
Original:  The LM dimension is a generalization of the Vapnik-Chervonenkis (VC) dimension that avoids structured data and therefore provides an upper bound for perfectly fitting  any training data.
Revised:  The LM dimension is a generalization of the Vapnik--Chervonenkis (VC) dimension that avoids structured data and therefore provides an upper bound for perfectly fitting any training data.
Edit intent: fluency
Original:  Our derivations are performed by embedding the ideal network into Shannon's communication model which allows to interpret the two points as capacities measured in bits.
Revised:  Our derivations are performed by embedding a neural network into Shannon's communication model which allows to interpret the two points as capacities measured in bits.
Edit intent: clarity
Original:  Among other practical applications, our result allows network implementations with gating functions (e.\,g., sigmoid or rectified linear units) to be evaluated against our upper limit independent of a concrete task .
Revised:  Among other practical applications, our result allows to compare and benchmark different neural network implementations independent of a concrete task .
Edit intent: clarity
Original:  Inspired by this, we have conducted psycho-physical experiments to study foveation of human visual systems for 4D light fields and evaluate our prototype system described in Sun et al. 2017%DIFDELCMD < ]%%% . We measure, for the first time, the blur detection/discrimination and light field depth perception thresholds in up to 15 degree of visual eccentricity, and reject the idea of replacing the peripheral rendering with 2D billboards - 4D light fields are still required.
Revised:  Inspired by this, we have conducted psycho-physical experiments to study foveation of human visual systems for 4D light fields and evaluate our prototype system described in %DIFDELCMD < ]%%% . We measure, for the first time, the blur detection/discrimination and light field depth perception thresholds in up to 15 degree of visual eccentricity, and reject the idea of replacing the peripheral rendering with 2D billboards - 4D light fields are still required.
Edit intent: coherence
Original:  Combining the dimension reduction with the algorithm presented in \mbox{ motwani0pt gives an algorithm for c-approximate nearest neighbor search without false negatives with the query time O(d^2) and the pre-processing time O(n^{O(\frac{1{c-1}})}), for c<2.}
Revised:  0pt gives an algorithm for c-approximate nearest neighbor search without false negatives with the query time O(d^2) and the pre-processing time O(n^{O(\frac{1{c-1}})}), for c<2.}
Edit intent: clarity
Original: In this paper, we propose a two-way secure communication network where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and a friendly jammer (FJ) . By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases.
Revised: In this paper, we propose a two-way secure communication scheme where two transceivers exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and a friendly jammer (FJ) . By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases.
Edit intent: clarity
Original: In this paper, we propose a two-way secure communication network where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and a friendly jammer (FJ) . By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases.
Revised: In this paper, we propose a two-way secure communication network where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and a friendly jammer (FJ) . By adopting the time switching (TS) architecture at the relay, the data transmission is done in three phases.
Edit intent: clarity
Original:  In the first phase, both the relay and FJ are charged by non-information radio frequency  signals from the sources.
Revised:  In the first phase, both the energy-starved nodes, the untrustworthy relay and the jammer, are charged by non-information radio frequency signals from the sources.
Edit intent: clarity
Original:  In the first phase, both the relay and FJ are charged by non-information radio frequency  signals from the sources.
Revised:  In the first phase, both the relay and FJ are charged by non-information radio frequency (RF) signals from the sources.
Edit intent: clarity
Original:  In the second phase, the two sources transmit information signals and concurrently, the FJ transmits artificial noise to confuse the curious relay.
Revised:  In the second phase, the two sources send their information signals and concurrently, the FJ transmits artificial noise to confuse the curious relay.
Edit intent: clarity
Original:  In the second phase, the two sources transmit information signals and concurrently, the FJ transmits artificial noise to confuse the curious relay.
Revised:  In the second phase, the two sources transmit information signals and concurrently, the jammer transmits artificial noise to confuse the curious relay.
Edit intent: clarity
Original:  Finally, the third phase is dedicated to forward the scaled version of the received signal from the relay to the sources.
Revised:  Finally, the third phase is dedicated to forward a scaled version of the received signal from the relay to the sources.
Edit intent: fluency
Original:  For the proposed network , we derive a new closed-form lower-bound expression for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime.
Revised:  For the proposed secure transmission schemes , we derive a new closed-form lower-bound expression for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime.
Edit intent: clarity
Original:  For the proposed network , we derive a new closed-form lower-bound expression for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime.
Revised:  For the proposed network , we derive new closed-form lower-bound expression for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime.
Edit intent: fluency
Original:  For the proposed network , we derive a new closed-form lower-bound expression for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime.
Revised:  For the proposed network , we derive a new closed-form lower-bound expressions for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime.
Edit intent: fluency
Original:  Finally, numerical examples  are provided to  demonstrate the impacts of different system parameters such as energy harvesting time ratio, transmit SNR and the power allocation factor on the secrecy performance of both WFJ and WoFJ scenarios.
Revised:  Finally, numerical examples and discussions are provided to demonstrate the impacts of different system parameters such as energy harvesting time ratio, transmit SNR and the power allocation factor on the secrecy performance of both WFJ and WoFJ scenarios.
Edit intent: clarity
Original:  Finally, numerical examples  are provided to  demonstrate the impacts of different system parameters such as energy harvesting time ratio, transmit SNR and the power allocation factor on the secrecy performance of both WFJ and WoFJ scenarios.
Revised:  Finally, numerical examples are provided to demonstrate the impacts of different system parameters on the secrecy performance of both WFJ and WoFJ scenarios.
Edit intent: clarity
Original:  Finally, numerical examples  are provided to  demonstrate the impacts of different system parameters such as energy harvesting time ratio, transmit SNR and the power allocation factor on the secrecy performance of both WFJ and WoFJ scenarios.
Revised:  Finally, numerical examples are provided to demonstrate the impacts of different system parameters such as energy harvesting time ratio, transmit SNR and the power allocation factor on the secrecy performance of the considered communication scenarios.
Edit intent: clarity
Original:  It may however be that digon-free arrangements of n pairwise intersecting circles indeed have at least 2n-4 triangles.
Revised:  It may however be true that all digon-free arrangements of n pairwise intersecting circles indeed have at least 2n-4 triangles.
Edit intent: clarity
Original:  It may however be that digon-free arrangements of n pairwise intersecting circles indeed have at least 2n-4 triangles.
Revised:  It may however be that digon-free arrangements of n pairwise intersecting circles have at least 2n-4 triangles.
Edit intent: clarity
Original:  The paper contains many drawings of arrangements of pseudocircles and a good fraction of these drawings was produced automatically from the combinatorial data produced by the generation algorithm.
Revised:  The paper contains many drawings of arrangements of pseudocircles and a good fraction of these drawings was produced automatically from the combinatorial data produced by our generation algorithm.
Edit intent: fluency
Original:  To eliminate manual annotation, in this work, we propose a novel image dataset construction framework by employing multiple textual metadata .
Revised:  To eliminate manual annotation, in this work, we propose a novel image dataset construction framework by employing multiple textual queries .
Edit intent: clarity
Original:  Specifically, we formulate noisy textual metadata removing and noisy images filtering as a multi-view and multi-instance learning problem separately.
Revised:  Specifically, we formulate noisy textual queries removing and noisy images filtering as a multi-view and multi-instance learning problem separately.
Edit intent: clarity
Original: Based on the visceral theory of sleep by I.N. Pigarev, we hypothesize that mental illnesses are caused due to errors in the commutation of external and internal information flows in the brain .
Revised: Visceral theory of sleep by I.N. Pigarev, we hypothesize that mental illnesses are caused due to errors in the commutation of external and internal information flows in the brain .
Edit intent: coherence
Original:  The fitness assigned to a genotype is a sum of contributions, each of which is a random function defined on a subset of k \leq \le L loci.
Revised:  The fitness assigned to a genotype is a sum of contributions, each of which is a random function defined on a subset of k \le L loci.
Edit intent: clarity
Original:  Finally, we summarize what is known about the behavior of different types of adaptive walks on NK landscapes .
Revised:  Finally, we discuss the impact of the NK interaction structures on the dynamics of evolution using adaptive walk models .
Edit intent: clarity
Original:  To validate the e effectiveness of our CRLR algorithm, we manually construct a new image dataset from YFCC100M, simulating various non-i.i.d. situations in the real world, and conduct extensive experiments for image classification . Experimental results clearly demonstrate that our CRLR algorithm outperforms the state-of-the-art methods  .
Revised:  To validate the effectiveness of our CRLR algorithm, we manually construct a new image dataset from YFCC100M, simulating various non-i.i.d. situations in the real world, and conduct extensive experiments for image classification . Experimental results clearly demonstrate that our CRLR algorithm outperforms the state-of-the-art methods .
Edit intent: fluency
Original:  To validate the e effectiveness of our CRLR algorithm, we manually construct a new image dataset from YFCC100M, simulating various non-i.i.d. situations in the real world, and conduct extensive experiments for image classification . Experimental results clearly demonstrate that our CRLR algorithm outperforms the state-of-the-art methods  .
Revised:  To validate the e effectiveness of our CRLR algorithm, we conduct comprehensive experiments on both synthetic and real world datasets . Experimental results clearly demonstrate that our CRLR algorithm outperforms the state-of-the-art methods .
Edit intent: clarity
Original:  We test our method on segmentation benchmarks and show that even with weak supervision of whole shape tags, our method is able to infer meaningful semantic regions, without ever observing shape segmentations.
Revised:  We test our method on segmentation benchmarks and show that even with weak supervision of whole shape tags, our method can infer meaningful semantic regions, without ever observing shape segmentations.
Edit intent: clarity
Original:  As a bonus, our network architecture is directly operational in a strongly-supervised scenario and outperforms state-of-the-art strongly-supervised methods on standard benchmarks  .
Revised:  As a bonus, our architecture is directly operational in a strongly-supervised scenario and outperforms state-of-the-art strongly-supervised methods on standard benchmarks .
Edit intent: clarity
Original:  As a bonus, our network architecture is directly operational in a strongly-supervised scenario and outperforms state-of-the-art strongly-supervised methods on standard benchmarks  .
Revised:  As a bonus, our network architecture is directly operational under full supervision and performs strongly on standard benchmarks .
Edit intent: clarity
Original:  Given that an extensive documentation of chess games played throughout the history is available, it is possible to perform detailed and statistically significant studies about this sport.
Revised:  Given that an extensive documentation of chess games played throughout history is available, it is possible to perform detailed and statistically significant studies about this sport.
Edit intent: fluency
Original:  One of the networks includes games that were played over-the-board and the other is related to games played on the Internet.
Revised:  One of the networks includes games that were played over-the-board and the other contains games played on the Internet.
Edit intent: clarity
Original:  We studied the main topological characteristics of the networks, such as degree distribution and correlation , transitivity and community structure.
Revised:  We study the main topological characteristics of the networks, such as degree distribution and correlation , transitivity and community structure.
Edit intent: fluency
Original:  We studied the main topological characteristics of the networks, such as degree distribution and correlation , transitivity and community structure.
Revised:  We studied the main topological characteristics of the networks, such as degree distribution and correlations , transitivity and community structure.
Edit intent: fluency
Original:  We complemented the structural analysis by incorporating players' level of play as node metadata.
Revised:  We complement the structural analysis by incorporating players' level of play as node metadata.
Edit intent: fluency
Original:  While the two networks are topologically different, we found that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.
Revised:  Although both networks are topologically different, we found that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.
Edit intent: fluency
Original:  While the two networks are topologically different, we found that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.
Revised:  While the two networks are topologically different, we show that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.
Edit intent: clarity
Original:  It is known that  industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time.
Revised:  It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time.
Edit intent: clarity
Original:  We prove the existence of a SAT-UNSAT phase transition phenomena for scale-free random 2-SAT instances with \beta<1/2 when the clause/variable ratio is m/n=1-2\beta{(1-\beta)^2.
Revised:  We prove the existence of a SAT-UNSAT phase transition phenomenon for scale-free random 2-SAT instances with \beta<1/2 when the clause/variable ratio is m/n=1-2\beta{(1-\beta)^2.
Edit intent: fluency
Original:  We prove the existence of a SAT-UNSAT phase transition phenomena for scale-free random 2-SAT instances with \beta<1/2 when the clause/variable ratio is m/n=1-2\beta{(1-\beta)^2.
Revised:  We prove the existence of a SAT-UNSAT phase transition phenomena for scale-free random 2-SAT instances with .
Edit intent: coherence
Original:  Our study finds that developers share common interests in GitHub and Stack Overflow, on average, 39\% of the GitHub repositories and Stack Over ow questions that a developer had participated fall in the common interests.
Revised:  Our study finds that developers share common interests in GitHub and Stack Overflow, on average, 39\% of the GitHub repositories and Stack Overflow questions that a developer had participated fall in the common interests.
Edit intent: fluency
Original:  In particular, developers who co-commit and co-pull- request same GitHub repositories and co-answer same Stack Overflow questions, share more common interests compare to other developers who co-participate in other platform activities.
Revised:  In particular, developers who co-commit and co-pull-request same GitHub repositories and co-answer same Stack Overflow questions, share more common interests compare to other developers who co-participate in other platform activities.
Edit intent: fluency
Original: We model information flows in continuous time that are generated by a number of information sources that are switched on and off at random times.
Revised: We model continuous-time information flows generated by a number of information sources that are switched on and off at random times.
Edit intent: clarity
Original: We model information flows in continuous time that are generated by a number of information sources that are switched on and off at random times.
Revised: We model information flows in continuous time that are generated by a number of information sources that switch on and off at random times.
Edit intent: fluency
Original:  We consider a vanilla option and find that its Merton-type price can be expressed by a weighted sum of vanilla prices based on the possible combinations of active information processes at option maturity.
Revised:  We consider a vanilla option and find that its Merton-type price can be expressed by a weighted sum of option values based on the possible combinations of active information processes at option maturity.
Edit intent: clarity
Original:  The constructed information-flow models lend themselves to the quantification of informational advantage in a competition where agents have asymmetric information flows.
Revised:  The constructed information-flow models lend themselves to the quantification of informational advantage among competitive agents who have asymmetric information flows.
Edit intent: clarity
Original:  By modulating a multi-dimensional information process over a random point field, we explicitly relate the discovery of relevant new information sources to jumps in conditional expectation processes of partially observed signals.
Revised:  By modulating a multi-dimensional information process over a random point field, our framework relates the discovery of relevant new information sources to jumps in conditional expectation processes of partially observed signals.
Edit intent: clarity
Original:  We show that the underlying measure-valued process follows jump-diffusion dynamics, where the jumps are governed by information source switches.
Revised:  We show that the underlying measure-valued process follows jump-diffusion dynamics, where the jumps are governed by information switches.
Edit intent: clarity
Original:  The dynamic representation gives rise to a set of martingales on random time intervals that capture evolving information states  as well as to a state-dependent stochastic volatility evolution with jumps.
Revised:  The dynamic representation gives rise to a set of martingales on random time intervals that capture evolving information states , as well as to a state-dependent stochastic volatility evolution with jumps.
Edit intent: fluency
Original:  The nature of information flows usually exhibits complex behaviour, however, we succeed in maintaining analytic tractability by introducing what we term the effective and complementary information processes .
Revised:  The nature of information flows usually exhibits complex behaviour, however, we maintain analytic tractability by introducing what we term the effective and complementary information processes .
Edit intent: clarity
Original:  It turns out that the price of a vanilla optioncan be expressed by a weighted sum of option values based on the possible state configurations at option expiry.
Revised:  It turns out that the price of a vanilla optioncan be expressed by a weighted sum of option values based on the possible state configurations at expiry.
Edit intent: fluency
Original:  The proposed information flow models also lend themselves to the quantification of  informational advantage among competitive agents who have asymmetric information flows .
Revised:  The proposed information flows also lend themselves to the quantification of informational advantage among competitive agents who have asymmetric information flows .
Edit intent: clarity
Original:  The proposed information flow models also lend themselves to the quantification of  informational advantage among competitive agents who have asymmetric information flows .
Revised:  The proposed information flow models also lend themselves to the quantification of asymmetric informational advantage among competitive agents who have asymmetric information flows .
Edit intent: fluency
Original: In the brain , systems are organized in a modular way, serving different functionalities.
Revised: The brain is organized in a modular way, serving different functionalities.
Edit intent: clarity
Original:  We present a novel method, based on random matrix theory, for the detection of functional modules in neural systems .
Revised:  We present a novel method, based on random matrix theory, for the identification of sign-dependent modules in the brain .
Edit intent: clarity
Original:  Our method can efficiently filter out both local unit-specific  noise and global system- wide dependencies that typically obfuscate the presence of sub-structures, thus unveiling a hidden functional structure.
Revised:  Our method filters out the joint effects of local ( unit-specific noise and global system- wide dependencies that typically obfuscate the presence of sub-structures, thus unveiling a hidden functional structure.
Edit intent: clarity
Original:  Our method can efficiently filter out both local unit-specific  noise and global system- wide dependencies that typically obfuscate the presence of sub-structures, thus unveiling a hidden functional structure.
Revised:  Our method can efficiently filter out both local unit-specific ) noise and global system- wide dependencies that typically obfuscate the presence of sub-structures, thus unveiling a hidden functional structure.
Edit intent: fluency