wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally, using the simple uniform quantization followed by Huffman coding, our experiment results show that the compression ratios of 51.25, 22.17 and 40.65 are achievable (i.e., the sizes of the compressed models are 1.95\%, 4.51\% and 2.46\% of the original model sizes) for LeNet,  ResNet and AlexNet, respectively , at no or marginal performance loss .
Revised:  Finally, using the simple uniform quantization followed by Huffman coding, we show from our experiments that the compression ratios of 51.25, 22.17 and 40.65 are achievable (i.e., the sizes of the compressed models are 1.95\%, 4.51\% and 2.46\% of the original model sizes) for LeNet, ResNet and AlexNet, respectively , at no or marginal performance loss .
Edit intent: clarity
Original:  Finally, using the simple uniform quantization followed by Huffman coding, our experiment results show that the compression ratios of 51.25, 22.17 and 40.65 are achievable (i.e., the sizes of the compressed models are 1.95\%, 4.51\% and 2.46\% of the original model sizes) for LeNet,  ResNet and AlexNet, respectively , at no or marginal performance loss .
Revised:  Finally, using the simple uniform quantization followed by Huffman coding, our experiment results show that the compression ratios of 51.25, 22.17 and 40.65 are achievable for LeNet, ResNet and AlexNet, respectively , at no or marginal performance loss .
Edit intent: coherence
Original:  Finally, using the simple uniform quantization followed by Huffman coding, our experiment results show that the compression ratios of 51.25, 22.17 and 40.65 are achievable (i.e., the sizes of the compressed models are 1.95\%, 4.51\% and 2.46\% of the original model sizes) for LeNet,  ResNet and AlexNet, respectively , at no or marginal performance loss .
Revised:  Finally, using the simple uniform quantization followed by Huffman coding, our experiment results show that the compression ratios of 51.25, 22.17 and 40.65 are achievable (i.e., the sizes of the compressed models are 1.95\%, 4.51\% and 2.46\% of the original model sizes) for LeNet, ResNet and AlexNet, respectively .
Edit intent: clarity
Original: Research in sentiment analysis is increasing at a fast pace making it challenging to keep track of all the activities in the area.
Revised: Sentiment analysis is one of the fastest growing research areas in computer science, making it challenging to keep track of all the activities in the area.
Edit intent: clarity
Original:  We find that the roots of sentiment analysis are in  studies on public opinion analysis at the start of 20th century , but the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts in the Web.
Revised:  We find that the roots of sentiment analysis are in the studies on public opinion analysis at the start of 20th century , but the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts in the Web.
Edit intent: fluency
Original:  We find that the roots of sentiment analysis are in  studies on public opinion analysis at the start of 20th century , but the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts in the Web.
Revised:  We find that the roots of sentiment analysis are in studies on public opinion analysis at the beginning of 20th century , but the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts in the Web.
Edit intent: fluency
Original:  We find that the roots of sentiment analysis are in  studies on public opinion analysis at the start of 20th century , but the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts in the Web.
Revised:  We find that the roots of sentiment analysis are in studies on public opinion analysis at the start of 20th century , but the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts on the Web.
Edit intent: fluency
Original:  Sentiment analysis papers are scattered to multiple publication venues  and the combined number of papers in the top-15 venues only represent 29 \% of the papers in total.
Revised:  Sentiment analysis papers are scattered to multiple publication venues , and the combined number of papers in the top-15 venues only represent 29 \% of the papers in total.
Edit intent: fluency
Original:  Many topics beyond product reviews like stock markets, elections, disasters, medicine, software development and cyberbullying extend the utilization of sentiment analysis 
Revised:  Many topics beyond product reviews like stock markets, elections, disasters, medicine, software engineering and cyberbullying extend the utilization of sentiment analysis 
Edit intent: clarity
Original:  Many topics beyond product reviews like stock markets, elections, disasters, medicine, software development and cyberbullying extend the utilization of sentiment analysis 
Revised:  Many topics beyond product reviews like stock markets, elections, disasters, medicine, software development and cyberbullying extend the utilization of sentiment analysis .
Edit intent: fluency
Original:  Many topics beyond product reviews like stock markets, elections, disasters, medicine, software engineering and cyberbullying extend the utilization of sentiment analysis .
Revised:  Many topics beyond product reviews like stock markets, elections, disasters, medicine, software engineering and cyberbullying extend the utilization of sentiment analysis 
Edit intent: fluency
Original:  We show a convergence rate of O(1/k) with the constant term depending on the number of agents and the topology  the network.
Revised:  We show a convergence rate of O(1/k) with the constant term depending on the number of agents and the topology of the network.
Edit intent: clarity
Original:  Though the community detection has been extensively investigated from different perspectives, the definition and the detection of core-periphery structure have not been attracted enough attention.
Revised:  Though the community detection has been extensively investigated from different perspectives, the definition and the detection of core-periphery structure have not received much attention.
Edit intent: clarity
Original:  Furthermore, the detection problem of the core-periphery and community structure was separately investigatedpreviously .
Revised:  Furthermore, the detection problems of the core-periphery and community structure was separately investigatedpreviously .
Edit intent: fluency
Original:  Furthermore, the detection problem of the core-periphery and community structure was separately investigatedpreviously .
Revised:  Furthermore, the detection problem of the core-periphery and community structure were separately investigated .
Edit intent: clarity
Original:  Moreover, there are several extra advantages of our algorithm: our method can detect not only single but also multiple  core-periphery structures;
Revised:  Moreover, there are several extra advantages of our algorithm: our method can detect not only single but also multiple pairs of core-periphery structures;
Edit intent: clarity
Original:  by adjusting the size of core, different scales of core-periphery structures can be detected  .
Revised:  different scales of core-periphery structures can be detected .
Edit intent: clarity
Original:  by adjusting the size of core, different scales of core-periphery structures can be detected  .
Revised:  by adjusting the size of core, different scales of core-periphery structures can be detected by adjusting the size of core .
Edit intent: coherence
Original: With the growing use of popular social media services like Facebook and Twitter it is hard to collect all content from the networks without access to the core infrastructure or paying for it.
Revised: With the growing use of popular social media services like Facebook and Twitter it is challenging to collect all content from the networks without access to the core infrastructure or paying for it.
Edit intent: clarity
Original:  In this work we present a novel User-guided Social Media Crawling method (USMC) that is able to collect data from social media, utilizing the wisdom of the crowd to decide the order in which user generated content should be collected , to cover as many user interactions as possible.
Revised:  In this work we present a novel User-guided Social Media Crawling method (USMC) that is able to collect data from social media, utilizing the wisdom of the crowd to decide the order in which user generated content should be collected to cover as many user interactions as possible.
Edit intent: fluency
Original:  USMC is validated by crawling 160 Facebook public pages, containing  368 million users and 1.3 billion interactions, and it is compared with two other crawling methods.
Revised:  USMC is validated by crawling 160 public Facebook pages, containing 368 million users and 1.3 billion interactions, and it is compared with two other crawling methods.
Edit intent: fluency
Original:  USMC is validated by crawling 160 Facebook public pages, containing  368 million users and 1.3 billion interactions, and it is compared with two other crawling methods.
Revised:  USMC is validated by crawling 160 Facebook public pages, containing content from 368 million users and 1.3 billion interactions, and it is compared with two other crawling methods.
Edit intent: clarity
Original:  USMC is validated by crawling 160 Facebook public pages, containing  368 million users and 1.3 billion interactions, and it is compared with two other crawling methods.
Revised:  USMC is validated by crawling 160 Facebook public pages, containing 368 million users including 1.3 billion interactions, and it is compared with two other crawling methods.
Edit intent: clarity
Original:  What is more , the social network constructed from the 20\% sample has more than 75\% of the users and edges compared to the social network created from all posts, and has very similar degree distribution.
Revised:  In addition , the social network constructed from the 20\% sample has more than 75\% of the users and edges compared to the social network created from all posts, and has very similar degree distribution.
Edit intent: coherence
Original:  What is more , the social network constructed from the 20\% sample has more than 75\% of the users and edges compared to the social network created from all posts, and has very similar degree distribution.
Revised:  What is more , the social network constructed from the 20\% sample contains more than 75\% of the users and edges compared to the social network created from all posts, and has very similar degree distribution.
Edit intent: clarity
Original:  What is more , the social network constructed from the 20\% sample has more than 75\% of the users and edges compared to the social network created from all posts, and has very similar degree distribution.
Revised:  What is more , the social network constructed from the 20\% sample has more than 75\% of the users and edges compared to the social network created from all posts, and it has similar degree distribution.
Edit intent: clarity
Original:  Thus, we extend in this study the field-normalized reader impact indicator proposed by us in an earlier study, which is based on Mendeley data (the mean normalized reader score, MNRS), to a target-oriented field-normalized impact indicator (e.g., MNRSED measures reader impact on the sector of educational donation, i.e., teaching).
Revised:  Thus, we extend in this study the field-normalized reader impact indicator proposed by us in an earlier study, which is based on Mendeley data (the mean normalized reader score, MNRS), to a target-oriented field-normalized impact indicator (e.g., MNRS_ED measures reader impact on the sector of educational donation, i.e., teaching).
Edit intent: clarity
Original: We introduce the Free Music Archive (FMA), an open and easily accessible dataset which can be used to evaluate several tasks in music information retrieval (MIR) , a field concerned with browsing, searching, and organizing large music collections.
Revised: We introduce the Free Music Archive (FMA), an open and easily accessible dataset suitable for evaluating several tasks in music information retrieval (MIR) , a field concerned with browsing, searching, and organizing large music collections.
Edit intent: clarity
Original: We introduce the Free Music Archive (FMA), an open and easily accessible dataset which can be used to evaluate several tasks in music information retrieval (MIR) , a field concerned with browsing, searching, and organizing large music collections.
Revised: We introduce the Free Music Archive (FMA), an open and easily accessible dataset which can be used to evaluate several tasks in MIR , a field concerned with browsing, searching, and organizing large music collections.
Edit intent: clarity
Original:  The data is made of 106,574 tracks , 16,341 artists , 14,854 albums, arranged in a hierarchical taxonomy of 161 genres , for a total of 343 days of audio and 917 GiB, all under permissive Creative Commons licenses.
Revised:  The data is made of 106,574 tracks from 16,341 artists , 14,854 albums, arranged in a hierarchical taxonomy of 161 genres , for a total of 343 days of audio and 917 GiB, all under permissive Creative Commons licenses.
Edit intent: fluency
Original:  The data is made of 106,574 tracks , 16,341 artists , 14,854 albums, arranged in a hierarchical taxonomy of 161 genres , for a total of 343 days of audio and 917 GiB, all under permissive Creative Commons licenses.
Revised:  The data is made of 106,574 tracks , 16,341 artists and 14,854 albums, arranged in a hierarchical taxonomy of 161 genres , for a total of 343 days of audio and 917 GiB, all under permissive Creative Commons licenses.
Edit intent: coherence
Original:  together with full-length, high-quality audio, and some pre-computed features.
Revised:  together with full-length, high-quality audio, pre-computed features.
Edit intent: clarity
Original:  We propose a train/validation/test split and three subsets : a genre-balanced set of 8, 000 tracks from 8 major genres, a genre-unbalanced set of 25 , 000 tracks from 16 genres, and a 98 GiB version with clips trimmed to 30s.
Revised:  We propose a train/validation/test split and three subsets , 000 tracks from 16 genres, and a 98 GiB version with clips trimmed to 30s.
Edit intent: coherence
Original:  For this problem we give a randomized (1-\varepsilon)-approximation that works in near-linear time: in O((n/\varepsilon^4)\log^3 n \log (1/\varepsilon)) time we find an axis-parallel rectangle of area at most \alpha that  covers at least (1-\varepsilon) \kappa^* points, where \kappa^* is the maximum possible number of points that could be covered.
Revised:  For this problem we give a probabilistic (1-\varepsilon)-approximation that works in near-linear time: in O((n/\varepsilon^4)\log^3 n \log (1/\varepsilon)) time we find an axis-parallel rectangle of area at most \alpha that covers at least (1-\varepsilon) \kappa^* points, where \kappa^* is the maximum possible number of points that could be covered.
Edit intent: clarity
Original:  For this problem we give a randomized (1-\varepsilon)-approximation that works in near-linear time: in O((n/\varepsilon^4)\log^3 n \log (1/\varepsilon)) time we find an axis-parallel rectangle of area at most \alpha that  covers at least (1-\varepsilon) \kappa^* points, where \kappa^* is the maximum possible number of points that could be covered.
Revised:  For this problem we give a randomized (1-\varepsilon)-approximation that works in near-linear time: In O((n/\varepsilon^4)\log^3 n \log (1/\varepsilon)) time we find an axis-parallel rectangle of area at most \alpha that covers at least (1-\varepsilon) \kappa^* points, where \kappa^* is the maximum possible number of points that could be covered.
Edit intent: fluency
Original:  We conjecture that if F is a family of pseudo-disks, then m=3 is sufficient .
Revised:  We conjecture that if F is a family of pseudo-disks, then such an m exists .
Edit intent: clarity
Original:  We prove that when F is the family of all homothetic copies of a given convex polygon , then such an m exists .
Revised:  We prove that when F is the family of all homothetic copies of a given convex polygon .
Edit intent: clarity
Original:  Armed solely with a local probing operator, we are able to perform a non local analysis of the shape yielding a shape dictionary which encodes its structures.
Edit intent: coherence
Original:  Our method relies on a novel description of shape variations, called Local Probing Field (LPF), which describes how a generic pattern is transformed onto the shape.
Revised:  Our method relies on a novel description of shape variations, called Local Probing Field (LPF), which describes how a local probing operator transforms a pattern onto the shape.
Edit intent: clarity
Original:  By carefully optimizing the position and orientation of these descriptors we are able to capture shape similarities and gather them into a geometrically relevant dictionary over which the shape decomposes sparsely.
Revised:  By carefully optimizing the position and orientation of each descriptor, we are able to capture shape similarities and gather them into a geometrically relevant dictionary over which the shape decomposes sparsely.
Edit intent: clarity
Original: In this letter, we consider the Voronoi tesselation induced by a homogeneous and stationary Poisson point process of unit density in a square .
Revised: We consider the Voronoi tesselation induced by a homogeneous and stationary Poisson point process of unit density in a square .
Edit intent: coherence
Original: In this letter, we consider the Voronoi tesselation induced by a homogeneous and stationary Poisson point process of unit density in a square .
Revised: In this letter, we consider the Voronoi tessellation induced by a homogeneous and stationary Poisson point process of unit density in a square .
Edit intent: fluency
Original: We consider the Voronoi tessellation induced by a homogeneous and stationary Poisson point process of unit intensity in a quadrant, where the two half-axes represent boundaries.
Revised: We consider the Voronoi tessellation induced by a homogeneous Poisson point process of unit intensity in a quadrant, where the two half-axes represent boundaries.
Edit intent: clarity
Original:  We show that the mean cell size is less than unity when the seed is located exactly at the boundary, and it can be larger than unity when the seed lies close to the boundary.
Revised:  We show that the mean cell area is less than unity when the seed is located exactly at the boundary, and it can be larger than unity when the seed lies close to the boundary.
Edit intent: clarity
Original:  In both cases, we illustrate that the two-parameter Gamma distribution, with location-dependent parameters , provides a good fit .
Revised:  We illustrate that the two-parameter Gamma distribution, with location-dependent parameters , provides a good fit .
Edit intent: clarity
Original:  As a potential application, we use the Gamma approximations to study the degree distribution for secure in-connectivity in wireless sensor networks deployed over a bounded domain .
Revised:  As a potential application, we use the Gamma approximations to study the degree distribution for secure connectivity in wireless sensor networks deployed over a bounded domain .
Edit intent: fluency
Original:  As a potential application, we use the Gamma approximations to study the degree distribution for secure in-connectivity in wireless sensor networks deployed over a bounded domain .
Revised:  As a potential application, we use the Gamma approximations to study the degree distribution for secure in-connectivity in wireless sensor networks deployed over a domain with boundaries .
Edit intent: clarity
Original:  We show that for any distribution over observations, if the mutual information between past observations and future observations is upper bounded by I, then a simple Markov model over the most recent I/\epsilon observations can obtain KL error \epsilon with respect to the optimal predictor with access to the entire past.
Revised:  We show that for any distribution over observations, if the mutual information between past observations and future observations is upper bounded by I, then a simple Markov model over the most recent I/\epsilon observations obtains expected KL error \epsilon with respect to the optimal predictor with access to the entire past.
Edit intent: clarity
Original:  We show that for any distribution over observations, if the mutual information between past observations and future observations is upper bounded by I, then a simple Markov model over the most recent I/\epsilon observations can obtain KL error \epsilon with respect to the optimal predictor with access to the entire past.
Revised:  We show that for any distribution over observations, if the mutual information between past observations and future observations is upper bounded by I, then a simple Markov model over the most recent I/\epsilon observations can obtain KL error \epsilon with respect to the optimal predictor that has access to the entire past.
Edit intent: clarity
Original:  We also demonstrate that the simple Markov model cannot really be improved upon  : First, a window length of I/\epsilon (I/\epsilon^2) is information-theoretically necessary for KL error ( \ell_1 error ) . Second, the d^{\Theta(I/\epsilon)} samples required to accurately estimate the Markov model when observations are drawn from an alphabet of size d is in fact necessary for any computationally tractable  algorithm, assuming the hardness of strongly refuting a certain class of CSPs.
Revised:  We also establish that this result cannot be improved upon : First, a window length of I/\epsilon (I/\epsilon^2) is information-theoretically necessary for KL error ( \ell_1 error ) . Second, the d^{\Theta(I/\epsilon)} samples required to accurately estimate the Markov model when observations are drawn from an alphabet of size d is in fact necessary for any computationally tractable algorithm, assuming the hardness of strongly refuting a certain class of CSPs.
Edit intent: clarity
Original:  We also demonstrate that the simple Markov model cannot really be improved upon  : First, a window length of I/\epsilon (I/\epsilon^2) is information-theoretically necessary for KL error ( \ell_1 error ) . Second, the d^{\Theta(I/\epsilon)} samples required to accurately estimate the Markov model when observations are drawn from an alphabet of size d is in fact necessary for any computationally tractable  algorithm, assuming the hardness of strongly refuting a certain class of CSPs.
Revised:  We also demonstrate that the simple Markov model cannot really be improved upon : First, a window length of I/\epsilon (I/\epsilon^2) is information-theoretically necessary for expected KL error \epsilon, or \ell_1 error ) . Second, the d^{\Theta(I/\epsilon)} samples required to accurately estimate the Markov model when observations are drawn from an alphabet of size d is in fact necessary for any computationally tractable algorithm, assuming the hardness of strongly refuting a certain class of CSPs.
Edit intent: clarity
Original:  We also demonstrate that the simple Markov model cannot really be improved upon  : First, a window length of I/\epsilon (I/\epsilon^2) is information-theoretically necessary for KL error ( \ell_1 error ) . Second, the d^{\Theta(I/\epsilon)} samples required to accurately estimate the Markov model when observations are drawn from an alphabet of size d is in fact necessary for any computationally tractable  algorithm, assuming the hardness of strongly refuting a certain class of CSPs.
Revised:  We also demonstrate that the simple Markov model cannot really be improved upon : First, a window length of I/\epsilon (I/\epsilon^2) is information-theoretically necessary for KL error ( \ell_1 error ) . Second, the d^{\Theta(I/\epsilon)} samples required to accurately estimate the Markov model when observations are drawn from an alphabet of size d is necessary for any computationally tractable algorithm, assuming the hardness of strongly refuting a certain class of CSPs.
Edit intent: clarity