wanyu/IteraTeR_v2 huggingface dataset:
Original:  As our main contribution, we develop new algorithms for list-decodable mean estimation, achieving nearly-optimal statistical guarantees, with running time n ^{1 + o(1) } d . All prior algorithms for this problem had additional polynomial factors in \frac 1 \alpha.
Revised:  As our main contribution, we develop new algorithms for list-decodable mean estimation, achieving nearly-optimal statistical guarantees, with running time O(n ^{1 + o(1) } d . All prior algorithms for this problem had additional polynomial factors in \frac 1 \alpha.
Edit intent: clarity
Original:  We crucially leverage this new algorithmic framework in the context of the iterative multi-filtering technique of Diakonikolas et . al. '18, '20, providing a method to simultaneously cluster and downsample points using one-dimensional projections -- thus, bypassing the k-PCA subroutines required by prior algorithms.
Revised:  We crucially leverage this new algorithmic framework in the context of the iterative multi-filtering technique of Diakonikolas et al. '18, '20, providing a method to simultaneously cluster and downsample points using one-dimensional projections -- thus, bypassing the k-PCA subroutines required by prior algorithms.
Edit intent: fluency
Original:  We built an evaluationplatform for fast and cost-accurate transaction replaying and constructed real transaction benchmarks on popular Ethereum applications .
Revised:  For cost evaluation, we develop a platform with fast and cost-accurate transaction replaying and constructed real transaction benchmarks on popular Ethereum applications .
Edit intent: coherence
Original:  We built an evaluationplatform for fast and cost-accurate transaction replaying and constructed real transaction benchmarks on popular Ethereum applications .
Revised:  We built an evaluationplatform for fast and cost-accurate transaction replaying , build real transaction benchmarks on popular Ethereum applications .
Edit intent: coherence
Original:  We propose a unification of recent advances (Renyi DP, privacy profiles, f-DP and the PLD formalism) via the characteristic function (\phi-function) of a certain ``worst-case'' privacy loss random variable.
Revised:  We propose a unification of recent advances (Renyi DP, privacy profiles, f-DP and the PLD formalism) via the characteristic function (\phi-function) of a certain ``worst-case'' privacy loss random variable.
Edit intent: fluency
Original:  We show that our approach allows natural adaptive composition like Renyi DP, provides exactly tight privacy accounting like PLD, and can be (often losslessly ) converted to privacy profile and f-DP, thus providing (\epsilon,\delta)-DP guarantees and interpretable tradeoff functions.
Revised:  We show that our approach allows natural adaptive composition like Renyi DP, provides exactly tight privacy accounting like PLD, and can be (often losslessly ) converted to privacy profile and f-DP, thus providing (\epsilon,\delta)-DP guarantees and interpretable tradeoff functions.
Edit intent: fluency
Original:  Algorithmically, we propose an analytical Fourier accountant that represents the complex logarithm of \phi-functions symbolically and uses Gaussian quadrature for numerical computation.
Revised:  Algorithmically, we propose an analytical Fourier accountant that represents the complex logarithm of \phi-functions symbolically and uses Gaussian quadrature for numerical computation.
Edit intent: fluency
Original: This paper integrates non-orthogonal multiple access (NOMA) and over-the-air federated learning (AirFL) into a unified framework using a simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS).
Revised: This paper integrates non-orthogonal multiple access (NOMA) and over-the-air federated learning (AirFL) into a unified framework using one simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS).
Edit intent: clarity
Original:  To accelerate convergence while satisfying QoS requirements, a mixed-integer non-linear programming (MINLP) problem is formulated by jointly designing the transmit power at users and the configuration mode of STAR-RIS. Next, a trust region-based successive convex approximation method and a penalty-based semidefinite relaxation approach is proposed to handle the decoupled non-convex subproblems iteratively.
Revised:  To accelerate convergence while satisfying QoS requirements, a mixed-integer non-linear programming (MINLP) problem is formulated by jointly designing the transmit power at users and the configuration mode of STAR-RIS. Next, a trust region-based successive convex approximation method and a penalty-based semidefinite relaxation approach are proposed to handle the decoupled non-convex subproblems iteratively.
Edit intent: fluency
Original:  Extensive simulation results show that i) the proposed framework can efficiently support NOMA and AirFL users via concurrent uplink communications, ii) our algorithms can achieve a faster convergence rate on the IID and non-IID settings as compared to baselines, and iii) both the spectrum efficiency and learning performance can be significantly improved with the aid of the well-tuned STAR-RIS.
Revised:  Extensive simulation results show that i) the proposed framework can efficiently support NOMA and AirFL users via concurrent uplink communications, ii) our algorithms can achieve a faster convergence rate on IID and non-IID settings as compared to baselines, and iii) both the spectrum efficiency and learning performance can be significantly improved with the aid of the well-tuned STAR-RIS.
Edit intent: fluency
Original:  Extensive simulation results show that i) the proposed framework can efficiently support NOMA and AirFL users via concurrent uplink communications, ii) our algorithms can achieve a faster convergence rate on the IID and non-IID settings as compared to baselines, and iii) both the spectrum efficiency and learning performance can be significantly improved with the aid of the well-tuned STAR-RIS.
Revised:  Extensive simulation results show that i) the proposed framework can efficiently support NOMA and AirFL users via concurrent uplink communications, ii) our algorithms can achieve a faster convergence rate on the IID and non-IID settings compared to existing baselines, and iii) both the spectrum efficiency and learning performance can be significantly improved with the aid of the well-tuned STAR-RIS.
Edit intent: clarity
Original:  A  new set of explicit time-integration methods, which do not necessitate the use of upwind schemes for spatial derivatives, are designed to deal with the convective-type free-surface conditions.
Revised:  A new set of explicit time-integration methods, which do not necessitate the use of upwind schemes for spatial derivatives, are adopted to deal with the convective-type free-surface conditions.
Edit intent: clarity
Original:  The present model is also referred to as a complete 2nd order wave-load model, as all the 2nd order wave loads, including the sum-frequency and difference-frequency components, are solved simultaneously.
Revised:  The present model is considered as a complete 2nd order wave-load model, as all the 2nd order wave loads, including the sum-frequency and difference-frequency components, are solved simultaneously.
Edit intent: clarity
Original:  In this paper, we first define LRPC codes over finite commutative local rings, which are bricks of finite rings, with an efficient decoder and derive an upper bound of the failure probability together with the complexity of the decoder.
Revised:  In this paper, we first define LRPC codes over finite commutative local rings, which are bricks of finite rings, with an efficient decoder . We improve the theoretical bound of the failure probability together with the complexity of the decoder.
Edit intent: clarity
Original:  In this paper, we first define LRPC codes over finite commutative local rings, which are bricks of finite rings, with an efficient decoder and derive an upper bound of the failure probability together with the complexity of the decoder.
Revised:  In this paper, we first define LRPC codes over finite commutative local rings, which are bricks of finite rings, with an efficient decoder and derive an upper bound of the failure probability of the decoder.
Edit intent: clarity
Original:  We then extend the definition to arbitrary finite commutative rings and also provide a decoderin this case.
Revised:  Then, we extend the work to arbitrary finite commutative rings and also provide a decoderin this case.
Edit intent: clarity
Original: Recent work has discovered that deep reinforcement learning (DRL) policies are vulnerable to adversarial examples.
Revised: Recent work has shown that deep reinforcement learning (DRL) policies are vulnerable to adversarial examples.
Edit intent: clarity
Original:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using  Atari 2600 games, we show that our technique is effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Revised:  We utilize the Universal Adversarial Perturbation (UAP) method to compute perturbations, independent of the individual inputs to which they are applied . Via an extensive evaluation using Atari 2600 games, we show that our technique is effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Edit intent: clarity
Original:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using  Atari 2600 games, we show that our technique is effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Revised:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using three Atari 2600 games, we show that our technique is effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Edit intent: clarity
Original:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using  Atari 2600 games, we show that our technique is effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Revised:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using Atari 2600 games, we show that our attacks are effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Edit intent: clarity
Original:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using  Atari 2600 games, we show that our technique is effective, as it fully degrades the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Revised:  We utilize the Universal Adversarial Perturbation (UAP) method to compute effective perturbations independent of the individual inputs to which they are applied . Via an extensive evaluation using Atari 2600 games, we show that our technique is effective, as they fully degrade the performance of both deterministic and stochastic policies (up to 100\%, even when the l_\infty bound on the perturbation is as small as 0.005).
Edit intent: clarity
Original:  It is faster compared to the response time (0.6ms on average) of agents with different DRL policies, and considerably faster than prior attacks (2.7 ms on average).
Revised:  It is faster compared to the response time (0.6ms on average) of different DRL policies, and considerably faster than prior attacks (2.7 ms on average).
Edit intent: clarity
Original:   Furthermore, we demonstrate that known defenses are ineffective against universal perturbations.
Revised:  Furthermore, we demonstrate that the effectiveness of known defenses diminishes against universal perturbations.
Edit intent: clarity
Original: The secrecy of wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced using random attributes of the propagation medium.
Revised: Through ordinary transmissions over wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced using random attributes of the propagation medium.
Edit intent: clarity
Original: The secrecy of wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced using random attributes of the propagation medium.
Revised: The secrecy of wireless multicast networks are greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced using random attributes of the propagation medium.
Edit intent: fluency
Original: The secrecy of wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced using random attributes of the propagation medium.
Revised: The secrecy of wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing of wireless channels, secure transmissions can be enhanced using random attributes of the propagation medium.
Edit intent: clarity
Original: The secrecy of wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced using random attributes of the propagation medium.
Revised: The secrecy of wireless multicast networks is greatly hampered due to the simultaneous presence of fading and shadowing , which can be enhanced by properly exploiting random attributes of the propagation medium.
Edit intent: clarity
Original:  This work focuses on utilizing those attributes to enhance the physical layer security ( PHY security ) performance of a dual-hop wireless multicast network over kappa-mu shadowed fading channel under the wiretapping attempts of multiple eavesdroppers.
Revised:  This study focuses on the utilization of those attributes to enhance the physical layer security ( PHY security ) performance of a dual-hop wireless multicast network over kappa-mu shadowed fading channel under the wiretapping attempts of multiple eavesdroppers.
Edit intent: clarity
Original:  This work focuses on utilizing those attributes to enhance the physical layer security ( PHY security ) performance of a dual-hop wireless multicast network over kappa-mu shadowed fading channel under the wiretapping attempts of multiple eavesdroppers.
Revised:  This work focuses on utilizing those attributes to enhance the physical layer security ( PLS ) performance of a dual-hop wireless multicast network over kappa-mu shadowed fading channel under the wiretapping attempts of multiple eavesdroppers.
Edit intent: clarity
Original:  This work focuses on utilizing those attributes to enhance the physical layer security ( PHY security ) performance of a dual-hop wireless multicast network over kappa-mu shadowed fading channel under the wiretapping attempts of multiple eavesdroppers.
Revised:  This work focuses on utilizing those attributes to enhance the physical layer security ( PHY security ) performance of a dual-hop wireless multicast network over kappa-mu shadow-fading channel under the wiretapping attempts of multiple eavesdroppers.
Edit intent: fluency
Original:  In order to raise the secrecy level, we employ multiple relays with the best relay selection strategy  .
Revised:  In order to improve the secrecy level, we employ multiple relays with the best relay selection strategy .
Edit intent: clarity
Original:  In order to raise the secrecy level, we employ multiple relays with the best relay selection strategy  .
Revised:  In order to raise the secrecy level, the best relay selection strategy .
Edit intent: clarity
Original:  In order to raise the secrecy level, we employ multiple relays with the best relay selection strategy  .
Revised:  In order to raise the secrecy level, we employ multiple relays with the best relay selection strategy among multiple relays is employed .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis is carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e. fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis has been carried out based on the mathematical modeling in terms of analytical expressions of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e. fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy capacity probability , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e. fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e. fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy capacity over multicast relay networks . Capitalizing on those expressions, we analyze how the system parameters ( i.e. fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, the effects of system parameters, i.e. fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: clarity
Original:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e.  fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Revised:  Performance analysis has been carried out based on the mathematical modeling in terms of closed-form expressions of the probability of non-zero secrecy multicast capacity , secure outage probability for multicasting , and ergodic secrecy multicast capacity . Capitalizing on those expressions, we analyze how the system parameters ( i.e. , fading, shadowing, the number of antennas, destination receivers, eavesdroppers, and relays ) affect the secrecy performance .
Edit intent: fluency