wanyu/IteraTeR_v2 huggingface dataset:
Original:  We apply a specific adaptation to one recently proposed weighted double estimator  and propose a multiagent deep reinforcement learning framework, named Weighted Double Deep Q-Network (WDDQN).
Revised:  We apply a specific adaptation to one recently proposed weighted double estimator to the multiagent domain and propose a multiagent deep reinforcement learning framework, named Weighted Double Deep Q-Network (WDDQN).
Edit intent: clarity
Original:  We apply a specific adaptation to one recently proposed weighted double estimator  and propose a multiagent deep reinforcement learning framework, named Weighted Double Deep Q-Network (WDDQN).
Revised:  We apply a specific adaptation to one recently proposed weighted double estimator and propose a multiagent DRL framework, named Weighted Double Deep Q-Network (WDDQN).
Edit intent: clarity
Original:  We apply a specific adaptation to one recently proposed weighted double estimator  and propose a multiagent deep reinforcement learning framework, named Weighted Double Deep Q-Network (WDDQN).
Revised:  We apply a specific adaptation to one recently proposed weighted double estimator and propose a multiagent deep reinforcement learning framework, named weighted double deep Q-network (WDDQN).
Edit intent: fluency
Original:  To achieve efficient cooperation,Lenient Reward Network and\textit{Mixture Replay Strategy are introduced.
Revised:  Lenient Reward Network and\textit{Mixture Replay Strategy are introduced.
Edit intent: clarity
Original:  To achieve efficient cooperation,Lenient Reward Network and\textit{Mixture Replay Strategy are introduced.
Revised:  To achieve efficient cooperation, and\textit{Mixture Replay Strategy are introduced.
Edit intent: clarity
Original:  To achieve efficient cooperation,Lenient Reward Network and\textit{Mixture Replay Strategy are introduced.
Revised:  To achieve efficient cooperation,Lenient Reward Network \textit{Mixture Replay Strategy are introduced.
Edit intent: fluency
Original:  To achieve efficient cooperation,Lenient Reward Network and\textit{Mixture Replay Strategy are introduced.
Revised:  To achieve efficient cooperation,Lenient Reward Network and\textit{ are introduced.
Edit intent: coherence
Original:  To achieve efficient cooperation,Lenient Reward Network and\textit{Mixture Replay Strategy are introduced.
Revised:  To achieve efficient cooperation,Lenient Reward Network and\textit{Mixture Replay Strategy 
Edit intent: coherence
Original:  By utilizing the deep neural network and the weighted double estimator  , WDDQN can not only reduce the bias effectively but also be extended to many deep RL scenarios with only raw pixel images as input.
Revised:  By utilizing the weighted double estimator , WDDQN can not only reduce the bias effectively but also be extended to many deep RL scenarios with only raw pixel images as input.
Edit intent: coherence
Original:  Empirically, the WDDQN outperforms the existing DRL algorithm (double DQN ) and multiagent RL algorithm ( lenient Q-learning ) in terms of performance and convergence within stochastic cooperative environments.
Revised:  Empirically, the WDDQN outperforms the existing DRL algorithm (double DQN ) and multiagent RL algorithm ( lenient Q-learning , in terms of performance and convergence within stochastic cooperative environments.
Edit intent: fluency
Original:  If the cross traffic is elastic, i.e., made up of buffer-filling flows like Cubic or Reno , then one should use a scheme that competes well with such traffic.
Revised:  If the cross traffic is elastic, i.e., made up of flows like Cubic or Reno , then one should use a scheme that competes well with such traffic.
Edit intent: clarity
Original:  We have developed Nimbus, a protocol that explicitly switches between TCP-competitive and delay-sensitive modes using the elasticity detector  .
Revised:  We present the design and evaluation of Nimbus, a protocol that explicitly switches between TCP-competitive and delay-sensitive modes using the elasticity detector .
Edit intent: clarity
Original:  We have developed Nimbus, a protocol that explicitly switches between TCP-competitive and delay-sensitive modes using the elasticity detector  .
Revised:  We have developed Nimbus, a congestion control protocol that uses the elasticity detector .
Edit intent: clarity
Original:  If the cross traffic is elastic, i.e., made up of flows like Cubic or NewReno that increase their rate when they perceive available bandwidth, then one should use a  scheme that competes well with such traffic.
Revised:  If the cross traffic is elastic, i.e., made up of flows like Cubic or NewReno that increase their rate to fill up all available bandwidth, then one should use a scheme that competes well with such traffic.
Edit intent: clarity
Original:  Such a scheme will not be able to control delays because the cross traffic will not cooperate to maintain low delays.
Edit intent: coherence
Original:  If, however,  cross traffic is inelastic, then one can use a suitable delay-controlled algorithm .
Revised:  If, however, the cross traffic is inelastic, then one can use a suitable delay-controlled algorithm .
Edit intent: coherence
Original:  If, however,  cross traffic is inelastic, then one can use a suitable delay-controlled algorithm .
Revised:  If, however, cross traffic is inelastic, then one can use a delay-controlling scheme that maintains low delay .
Edit intent: clarity
Original:  We present the design and evaluation of Nimbus, a congestion control protocol that uses the elasticity detector to switch between delay-control and TCP-competitive modes .
Revised:  We present the design and evaluation of Nimbus, a congestion control system that uses the elasticity detector to switch between delay-control and TCP-competitive modes .
Edit intent: clarity
Original:  We present the design and evaluation of Nimbus, a congestion control protocol that uses the elasticity detector to switch between delay-control and TCP-competitive modes .
Revised:  We present the design and evaluation of Nimbus, a congestion control protocol that uses the elasticity detector to switch between TCP-competitive modes .
Edit intent: clarity
Original:  We present the design and evaluation of Nimbus, a congestion control protocol that uses the elasticity detector to switch between delay-control and TCP-competitive modes .
Revised:  We present the design and evaluation of Nimbus, a congestion control protocol that uses the elasticity detector to switch between delay-control and TCP-competitive and delay-controlling algorithms .
Edit intent: clarity
Original:  Our results on emulated and real-world paths show that Nimbus  achieves throughput comparable to or better than Cubic always , but with delays that are much lower when cross traffic is inelastic.
Revised:  Our results on emulated and real-world paths show that Nimbus achieves throughput comparable to or better than Cubic , but with delays that are much lower when cross traffic is inelastic.
Edit intent: clarity
Original:  Unlike BBR, Nimbus is fair to Cubic, and has significantly lower delay by 40-50 ms.
Edit intent: coherence
Original:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Revised:  Compared to Copa, which also switches between a TCP-competitive and a delay-controlling mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Edit intent: fluency
Original:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Revised:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus detects the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Edit intent: clarity
Original:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Revised:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of the cross traffic more accurately; and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Edit intent: clarity
Original:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Revised:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it can support a variety of delay-based and TCP-competitive methods .
Edit intent: clarity
Original:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Revised:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-controlling and TCP-competitive methods .
Edit intent: clarity
Original:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive methods .
Revised:  Compared to Copa, which also switches between a delay-controlling and a TCP-competitive mode, Nimbus is more robust at correctly detecting the nature of cross traffic, and unlike Copa, it is usable by a variety of delay-based and TCP-competitive algorithms .
Edit intent: clarity
Original: This paper develops a technique to detect whether the cross traffic competing with a flow is elastic or not , and shows how to use the elasticity detector to improve congestion control.
Revised: This paper develops a technique to detect whether the cross traffic competing with a flow is "elastic" , and shows how to use the elasticity detector to improve congestion control.
Edit intent: coherence
Original: This paper develops a technique to detect whether the cross traffic competing with a flow is elastic or not , and shows how to use the elasticity detector to improve congestion control.
Revised: This paper develops a technique to detect whether the cross traffic competing with a flow is elastic or not , and shows that this elasticity detector improves congestion control.
Edit intent: clarity
Original:  If the cross traffic is elastic, i.e., made up of flows like Cubic that increase their rate to fill up all available bandwidth, then one should use a TCP-competitive scheme that competes well with such traffic.
Revised:  If cross traffic is elastic, i.e., made up of flows like Cubic that increase their rate to fill up all available bandwidth, then one should use a TCP-competitive scheme that competes well with such traffic.
Edit intent: coherence
Original:  Our elasticitydetector modulates the flow's  rate with sinusoidal pulses that create small traffic fluctuations at the bottleneck link, and it estimates elasticity from the frequency response (FFT) of the rate of the cross traffic.
Revised:  Our elasticitydetector modulates the flow's rate with sinusoidal pulses that create small traffic fluctuations at the bottleneck link, and measures the frequency response (FFT) of the rate of the cross traffic.
Edit intent: clarity
Original:  Our elasticitydetector modulates the flow's  rate with sinusoidal pulses that create small traffic fluctuations at the bottleneck link, and it estimates elasticity from the frequency response (FFT) of the rate of the cross traffic.
Revised:  Our elasticitydetector modulates the flow's rate with sinusoidal pulses that create small traffic fluctuations at the bottleneck link, and it estimates elasticity from the frequency response of the rate of the cross traffic.
Edit intent: clarity
Original:  We design Nimbus, a congestion control system that uses the elasticity detector to switch between TCP-competitive and delay-controlling algorithms.
Edit intent: coherence
Original:  Our results on emulated and real-world paths show that Nimbus (switching between Cubic and a suitable delay-controlling scheme) always achieves throughput comparable to or better than Cubic, but with delays that are much lower when cross traffic is inelastic.
Revised:  Our results on emulated and real-world paths show that Nimbus (switching between Cubic and a suitable delay-controlling scheme) always achieves throughput comparable to Cubic, but with delays that are much lower when cross traffic is inelastic.
Edit intent: clarity
Original:  Compared to Copa, which also switches between a TCP-competitive and a delay-controlling mode, Nimbus detects the nature of the cross traffic more accurately ;
Revised:  Nimbus detects the nature of the cross traffic more accurately ;
Edit intent: coherence
Original: Understanding the relationship between protein sequence, function, and stability is a fundamental problem in structural biology, protein evolution, protein engineering, and virology .
Revised: Understanding the relationship between protein sequence, function, and stability is a fundamental problem in biology .
Edit intent: clarity
Original:  We infer an energy landscape with separate folding and binding energies  providing a detailed view of how mutations affect binding and stability across the protein.
Revised:  We infer an energy landscape with distinct folding and binding energies providing a detailed view of how mutations affect binding and stability across the protein.
Edit intent: clarity
Original:  The increasing maturity of millimeter wave ( mmWave ) communication has opened up the possibility of providing high-speed wireless backhaul to such cell sites.
Revised:  The increasing maturity of millimeter wave ( mm-wave ) communication has opened up the possibility of providing high-speed wireless backhaul to such cell sites.
Edit intent: fluency
Original:  Since mmWave is also suitable for access links, the third generation partnership project (3GPP) is envisioning an integrated access and backhaul (IAB) architecture for the fifth generation (5G) cellular networks in which the same infrastructure and spectral resources will be used for both access and backhaul.
Revised:  Since mm-wave is also suitable for access links, the third generation partnership project (3GPP) is envisioning an integrated access and backhaul (IAB) architecture for the fifth generation (5G) cellular networks in which the same infrastructure and spectral resources will be used for both access and backhaul.
Edit intent: fluency
Original:  In this paper, we develop an analytical framework for IAB-enabled cellular network using which we provide an accurate characterization of its downlink rate coverage probability  .
Revised:  In this paper, we develop an analytical framework for IAB-enabled cellular network using which its downlink rate coverage probability .
Edit intent: clarity
Original:  Using this  , we study the performance of three backhaul bandwidth (BW) partition strategies , (i ) equal partition: when all SBSs obtain equal share of the backhaul BW , (ii ) instantaneous load-based partition: when the backhaul BW share of an SBS is proportional to its instantaneous load , and (iii ) average load-based partition: when the backhaul BW share of an SBS is proportional to its average load.
Revised:  Using this framework , we study the performance of three backhaul bandwidth (BW) partition strategies , (i ) equal partition: when all SBSs obtain equal share of the backhaul BW , (ii ) instantaneous load-based partition: when the backhaul BW share of an SBS is proportional to its instantaneous load , and (iii ) average load-based partition: when the backhaul BW share of an SBS is proportional to its average load.
Edit intent: clarity
Original:  Traditional population genetics methods fail to distinguish a chronic immune response from natural repertoire evolutionin healthy individuals .
Revised:  Traditional population genetics methods fail to distinguish chronic immune response from natural repertoire evolutionin healthy individuals .
Edit intent: fluency
Original:  Traditional population genetics methods fail to distinguish a chronic immune response from natural repertoire evolutionin healthy individuals .
Revised:  Traditional population genetics methods fail to distinguish a chronic immune response from healthy repertoire evolution .
Edit intent: clarity
Original:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors  are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Revised:  Here, we infer the evolutionary modes of B-cell repertoires and identify complex dynamics with a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Edit intent: clarity
Original:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors  are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Revised:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of better B-cell receptor mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Edit intent: clarity
Original:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors  are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Revised:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors (BCRs) are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Edit intent: clarity
Original:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors  are beneficial, in contrast to the many deleterious changes in structurally relevant framework regions.
Revised:  Here, we infer the evolutionary modes of B-cell repertoire response and identify a complex dynamics where, instead of one winning clone, there is a constant production of new better mutants that compete with each other . A substantial fraction of mutations in pathogen-engaging CDRs of B-cell receptors are beneficial, in contrast to many such changes in structurally relevant framework regions.
Edit intent: clarity
Original:  The picture is of a dynamic repertoire, where better clones may be outcompeted by new mutants before they fix , challenging current vaccine design and therapy ideas .
Revised:  The picture is of a dynamic repertoire, where better clones may be outcompeted by new mutants before they fix .
Edit intent: clarity
Original: Most existing models of opinion formation use random initial conditions.
Revised: Currently used models of opinion formation use random initial conditions.
Edit intent: clarity
Original:  Our work  suggests that the existing opinion dynamics models should be reevaluated to incorporate the initial condition dependence.
Revised:  Our work thus suggests that the existing opinion dynamics models should be reevaluated to incorporate the initial condition dependence.
Edit intent: coherence
Original:  Interestingly, if the solution of the problem is sparse , for both our algorithms, we obtain better complexity bound if the algorithm uses a 1-norm proximal setup, rather than the Euclidean proximal setup, which is a standard choice for unconstrained problems .
Revised:  Interestingly, if the solution of the problem is sparse , for both our algorithms, we obtain better complexity bound if the algorithm uses a 1-norm proximal setup, rather than the Euclidean proximal setup, which is a standard choice for unconstrained problems 
Edit intent: fluency
Original: We consider an unconstrained problem of minimization of a smooth convex function which is only available through noisy observations of its values, the noise consisting of two parts.
Revised: We consider an unconstrained problem of minimizing a smooth convex function which is only available through noisy observations of its values, the noise consisting of two parts.
Edit intent: fluency
Original:  Similar to stochastic optimization problems, the first part is of a stochastic nature.
Revised:  Similar to stochastic optimization problems, the first part is of stochastic nature.
Edit intent: fluency
Original:  On the opposite, the second part is an additive noise of an unknown nature, but bounded in the absolute value.
Revised:  The second part is an additive noise of an unknown nature, but bounded in the absolute value.
Edit intent: coherence
Original:  On the opposite, the second part is an additive noise of an unknown nature, but bounded in the absolute value.
Revised:  On the opposite, the second part is additive noise of an unknown nature, but bounded in the absolute value.
Edit intent: fluency
Original:  On the opposite, the second part is an additive noise of an unknown nature, but bounded in the absolute value.
Revised:  On the opposite, the second part is an additive noise of unknown nature, but bounded in the absolute value.
Edit intent: fluency
Original:  On the opposite, the second part is an additive noise of an unknown nature, but bounded in the absolute value.
Revised:  On the opposite, the second part is an additive noise of an unknown nature, but bounded in absolute value.
Edit intent: fluency
Original:  Interestingly , if the difference between the starting point and the solution is a sparse vector, for both our algorithms, we obtain  better complexity bound if the algorithm uses a \ell_1-norm proximal setup, rather than the Euclidean proximal setup, which is a standard choice for unconstrained problems
Revised:  Interestingly , if the difference between the starting point and the solution is a sparse vector, for both our algorithms, we obtain a better complexity bound if the algorithm uses a \ell_1-norm proximal setup, rather than the Euclidean proximal setup, which is a standard choice for unconstrained problems
Edit intent: fluency