wanyu/IteraTeR_full_sent huggingface dataset:
Original: Rough volatility models are continuous time stochastic volatility models where the volatility process is driven by a fractional Brownian motion with the Hurst parameter less than half, and have attracted much attention since a seminal paper titled "Volatility is rough" was posted on SSRN in 2014 claiming that they explain a scaling property of realized variance time series . From our point of view, the analysis is not satisfactory because the estimation error of the latent volatility was not taken into account;
Revised: Rough volatility models are continuous time stochastic volatility models where the volatility process is driven by a fractional Brownian motion with the Hurst parameter less than half, and have attracted much attention since a seminal paper titled "Volatility is rough" was posted on SSRN in 2014 showing that the log realized volatility time series of major stock indices have the same scaling property as such a rough fractional Brownian motion has. We however find by simulations that the impressive approach tends to suggest the same roughness irrespectively whether the volatility is actually rough or not; an overlooked estimation error of the latent volatility was not taken into account;
Edit intent: meaning-changed
Original:  Motivated by this preliminary finding, we construct a quasi-likelihood estimator for a fractional stochastic volatility model and apply it to realized variance time series to examine whether the  volatility is really rough.
Revised:  Motivated by this preliminary finding, here we develop a statistical theory for a continuous time fractional stochastic volatility model and apply it to realized variance time series to examine whether the volatility is really rough.
Edit intent: meaning-changed
Original:  Motivated by this preliminary finding, we construct a quasi-likelihood estimator for a fractional stochastic volatility model and apply it to realized variance time series to examine whether the  volatility is really rough.
Revised:  Motivated by this preliminary finding, we construct a quasi-likelihood estimator for a fractional stochastic volatility model and apply it to realized variance time series to examine whether the Hurst parameter is indeed estimated smaller than half, that is, whether the volatility is really rough.
Edit intent: meaning-changed
Original:   Our quasi-likelihood is based on a central limit theorem for the realized volatility estimation error and a Whittle-type approximation to the auto-covariance of the log-volatility process.
Revised:  We construct a quasi-likelihood estimator and apply it to realized volatility time series. Our quasi-likelihood is based on a central limit theorem for the realized volatility estimation error and a Whittle-type approximation to the auto-covariance of the log-volatility process.
Edit intent: meaning-changed
Original:  For an infinite-horizon model with linear state dynamics and exogenous volatilities,  the equilibrium returns mean-revert around their frictionless counterparts -- the deviation has Ornstein-Uhlenbeck dynamics for quadratic costs whereas it follows a doubly-reflected Brownian motion if costs are proportional.
Revised:  For an infinite-horizon model with linear state dynamics and exogenous volatilities, we prove that the equilibrium returns mean-revert around their frictionless counterparts -- the deviation has Ornstein-Uhlenbeck dynamics for quadratic costs whereas it follows a doubly-reflected Brownian motion if costs are proportional.
Edit intent: coherence
Original:  For an infinite-horizon model with linear state dynamics and exogenous volatilities,  the equilibrium returns mean-revert around their frictionless counterparts -- the deviation has Ornstein-Uhlenbeck dynamics for quadratic costs whereas it follows a doubly-reflected Brownian motion if costs are proportional.
Revised:  For an infinite-horizon model with linear state dynamics and exogenous volatilities, the equilibrium returns mean-revert around their frictionless counterparts - the deviation has Ornstein-Uhlenbeck dynamics for quadratic costs whereas it follows a doubly-reflected Brownian motion if costs are proportional.
Edit intent: fluency
Original:  These fall outside the scope of known wellposedness results, but can be solved numerically using the simulation-based deep-learning approach of \mbox{%DIFAUXCMD han.al.17 . In a calibration to time series of returns, bid-ask spreads, and trading volume, transaction costs substantially affect equilibrium asset prices.
Revised:  These fall outside the scope of known wellposedness results, but can be solved numerically using the simulation-based deep-learning approach of Han, Jentzen and E (2018) . In a calibration to time series of returns, bid-ask spreads, and trading volume, transaction costs substantially affect equilibrium asset prices.
Edit intent: meaning-changed
Original:  These fall outside the scope of known wellposedness results, but can be solved numerically using the simulation-based deep-learning approach of \mbox{%DIFAUXCMD han.al.17 . In a calibration to time series of returns, bid-ask spreads, and trading volume, transaction costs substantially affect equilibrium asset prices.
Revised:  These fall outside the scope of known wellposedness results, but can be solved numerically using the simulation-based deep-learning approach of \mbox{%DIFAUXCMD han.al.17 . In a calibration to time series of prices and trading volume, transaction costs substantially affect equilibrium asset prices.
Edit intent: clarity
Original:  These fall outside the scope of known wellposedness results, but can be solved numerically using the simulation-based deep-learning approach of \mbox{%DIFAUXCMD han.al.17 . In a calibration to time series of returns, bid-ask spreads, and trading volume, transaction costs substantially affect equilibrium asset prices. In contrast, the effects of different cost specifications are rather similar, justifying the use of quadratic costs as a proxy for other less tractable specifications.
Revised:  These fall outside the scope of known wellposedness results, but can be solved numerically using the simulation-based deep-learning approach of \mbox{%DIFAUXCMD han.al.17 . In a calibration to time series of returns, bid-ask spreads, and trading volume, realistic liquidity premia are accompanied by a moderate increase in volatility. The effects of different cost specifications are rather similar, justifying the use of quadratic costs as a proxy for other less tractable specifications.
Edit intent: clarity
Original:  c) that fluctuations of the dynamics can lead to better exploration of the physical space, thus preventing multiple stable aggregates. From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Revised:  c) that fluctuations of the dynamics can lead to better exploration of the physical space, thus preventing multiple stable clusters. Comparing those findings with previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Edit intent: clarity
Original:  From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Revised:  From previous results, we speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Edit intent: clarity
Original:  From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Revised:  From previous results, we may speculate about the fact that chemotactic cells can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Edit intent: clarity
Original:  From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Revised:  From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient . Social interactions are sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Edit intent: coherence
Original:  From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles . It is then unlikely that cells have developed special mechanisms to cope with the presence of topological perturbation sources. Nevertheless, we suggest that further studies can provide better understanding and that, in order to gain deeper knowledge, mechanical models should be coupled with phenomenological, system-oriented ones .
Revised:  From previous results, we may speculate about the fact that chemotactic cells , in many cases, can avoid obstacles by simply following the altered chemical gradient : social interactions seem to be sufficient to guarantee the aggregation of the whole colony past numerous obstacles .
Edit intent: coherence
Original: Given a purely atomic probability measure with support on n points, P, any mean-preserving contraction  of P, Q, with support on m > n points is a mixture of mean-preserving contractions of P, each with support on most n points.
Revised: Given a purely atomic probability measure with support on n points, P, any mean-preserving contraction (mpc) of P, Q, with support on m > n points is a mixture of mean-preserving contractions of P, each with support on most n points.
Edit intent: meaning-changed
Original: Given a purely atomic probability measure with support on n points, P, any mean-preserving contraction  of P, Q, with support on m > n points is a mixture of mean-preserving contractions of P, each with support on most n points.
Revised: Given a purely atomic probability measure with support on n points, P, any mean-preserving contraction of P, Q, with support on m > n points is a mixture of mpcs of P, each with support on most n points.
Edit intent: fluency
Original:  This suggests that network architecture can be designed for efficient search without controlling the precise arrangement of connections.
Revised:  For synthetic networks on a lattice, we predict the search time dependence on these global structural parameters by connecting with percolation theory, providing a bridge from irregular real-world networks to a simpler physical model. The dependence of search time on global network structural properties suggests that network architecture can be designed for efficient search without controlling the precise arrangement of connections.
Edit intent: meaning-changed
Original:  The optimal strategy is derived in a semi-closed form that depends on the solution of a Riccati-Volterra equation. Numerical studies suggest that investment demand decreases with the roughnessof the market .
Revised:  The optimal strategy is derived in a semi-closed form that depends on the solution of a Riccati-Volterra equations. We numerically examine the relationship between investment demand and volatility roughness .
Edit intent: clarity
Original:  Parallel maximal matching algorithms (adapted for switching) appear to have stricken the best such tradeoff.
Revised: In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultants throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken the best such tradeoff.
Edit intent: coherence
Original:  Parallel maximal matching algorithms (adapted for switching) appear to have stricken the best such tradeoff. On one hand, they provide the following Quality of Service (QoS) guarantees: Using maximal matchings as crossbar schedules results in at least 50\% switch throughput and order-optimal (i.e., independent of the switch size N) average delay bounds for various traffic arrival processes.
Revised:  Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings as crossbar schedules results in at least 50\% switch throughput and order-optimal (i.e., independent of the switch size N) average delay bounds for various traffic arrival processes.
Edit intent: clarity
Original:  On one hand, they provide the following Quality of Service (QoS) guarantees: Using maximal matchings as crossbar schedules results in at least 50\% switch throughput and order-optimal (i.e., independent of the switch size N) average delay bounds for various traffic arrival processes.
Revised:  On one hand, they provide the following Quality of Service (QoS) guarantees: Using maximal matchings in every time slot results in at least 50\% switch throughput and order-optimal (i.e., independent of the switch size N) average delay bounds for various traffic arrival processes.
Edit intent: clarity
Original:  On the other hand, using N processors (one per port), their per-port computational complexity can be as low as O( \log ^2N) (more precisely O(\log N) iterations that each has O(\log N) computational complexity) for an N\times N switch .
Revised:  On the other hand, their computational complexity can be as low as O( \log ^2N) (more precisely O(\log N) iterations that each has O(\log N) computational complexity) for an N\times N switch .
Edit intent: clarity
Original:  On the other hand, using N processors (one per port), their per-port computational complexity can be as low as O( \log ^2N) (more precisely O(\log N) iterations that each has O(\log N) computational complexity) for an N\times N switch .
Revised:  On the other hand, using N processors (one per port), their per-port computational complexity can be as low as O( log ^2N) (more precisely O(\log N) iterations that each has O(\log N) computational complexity) for an N\times N switch .
Edit intent: fluency
Original:  On the other hand, using N processors (one per port), their per-port computational complexity can be as low as O( \log ^2N) (more precisely O(\log N) iterations that each has O(\log N) computational complexity) for an N\times N switch .
Revised:  On the other hand, using N processors (one per port), their per-port computational complexity can be as low as O( \log ^2N) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance .
Edit intent: meaning-changed
Original:  Yet, the matchings that QPS-r computes have the same quality as maximal matchings in the following sense: Using such matchings as crossbar schedules results in exactly the same aforementioned provable throughput and delay guarantees as using maximal matchings, as we show using Lyapunov stability analysis .
Revised:  Using Lyapunov stability analysis, we show that the throughput and delay guarantees as using maximal matchings, as we show using Lyapunov stability analysis .
Edit intent: clarity
Original:  Yet, the matchings that QPS-r computes have the same quality as maximal matchings in the following sense: Using such matchings as crossbar schedules results in exactly the same aforementioned provable throughput and delay guarantees as using maximal matchings, as we show using Lyapunov stability analysis .
Revised:  Yet, the matchings that QPS-r computes have the same quality as maximal matchings in the following sense: Using such matchings as crossbar schedules results in exactly the same aforementioned provable throughput and delay performance is identical to that of maximal matching algorithm .
Edit intent: clarity
Original:  Although QPS-r builds upon an existing add-on technique called Queue-Proportional Sampling (QPS), we are the first to discover and prove this nice property of such matchings.
Revised:  Although QPS-r builds upon an existing add-on technique called Queue-Proportional Sampling (QPS), in this paper, we provide analytical guarantees on its throughput and delay under i.i.d. traffic as well as a Markovian traffic model which can model many realistic traffic patterns.
Edit intent: meaning-changed
Original:  We also demonstrate that QPS-3 (running 3 iterations) has comparable empirical throughput and delay performances as iSLIP (running \log _2 N iterations), a refined and optimized representative maximal matching algorithm adapted for switching.
Revised:  We also demonstrate that QPS-3 (running 3 iterations) has comparable empirical throughput and delay performances as iSLIP (running log _2 N iterations), a refined and optimized representative maximal matching algorithm adapted for switching.
Edit intent: fluency
Original: We study the problem of estimating the volume of convex polytopes, focusing on H- and V-polytopes, as well as zonotopes . Although a lot of effort is devoted to practical algorithms for H-polytopes there is no such method for the latter two representations. We propose a new, practical algorithm for all representations, which is faster than existing methods. It relies on Hit-and-Run sampling, and combines a new simulated annealing method with the Multiphase Monte Carlo (MMC) approach. Our method introduces the following key features to make it adaptive: (a) It defines a sequence of convex bodies in MMC by introducing a new annealing schedule, whose length is shorter than in previous methods with high probability, and the need of computing an enclosing and an inscribed ball is removed; (b) It exploits statistical properties in rejection-sampling and proposes a better empirical convergence criterion for specifying each step; (c) For zonotopes, it may use a sequence of convex bodies for MMC different than balls, where the chosen body adapts to the input. We offer an open-source , optimized C++ implementation , and analyze its performance to show that it outperforms state-of-the-art software for H-polytopes by Cousins-Vempala (2016) and Emiris-Fisikopoulos (2018), while it undertakes volume computations that were intractable until now, as it is the first polynomial-time, practical method for V-polytopes and zonotopes that scales to high dimensions (currently 100).
Revised: We study the problem of estimating the volume of convex polytopes, focusing on H- and V-polytopes, and zonotopes (Z-polytopes). We design a novel practical Multiphase Monte Carlo algorithm that leverages random walks based on billiard trajectories, as well as new empirical convergence tests and a simulated annealing schedule of adaptive convex bodies. We present a detailed experimental evaluation of our algorithm using a rich dataset containing Birkhoff polytopes and polytopes from structural biology. Our open-source , optimized C++ implementation , and analyze its performance to show that it outperforms state-of-the-art software for H-polytopes by Cousins-Vempala (2016) and Emiris-Fisikopoulos (2018), while it undertakes volume computations that were intractable until now, as it is the first polynomial-time, practical method for V-polytopes and zonotopes that scales to high dimensions (currently 100).
Edit intent: meaning-changed
Original:  We offer an open-source , optimized C++ implementation , and analyze its performance to show that it outperforms state-of-the-art software for H-polytopes by Cousins-Vempala (2016) and Emiris-Fisikopoulos (2018), while it undertakes volume computations that were intractable until now, as it is the first polynomial-time, practical method for V-polytopes and zonotopes that scales to high dimensions (currently 100).
Revised:  We offer an open-source implementation tackles problems that have been intractable so far, offering the first software to scale up in thousands of dimensions for H-polytopes by Cousins-Vempala (2016) and Emiris-Fisikopoulos (2018), while it undertakes volume computations that were intractable until now, as it is the first polynomial-time, practical method for V-polytopes and zonotopes that scales to high dimensions (currently 100).
Edit intent: meaning-changed
Original:  We offer an open-source , optimized C++ implementation , and analyze its performance to show that it outperforms state-of-the-art software for H-polytopes by Cousins-Vempala (2016) and Emiris-Fisikopoulos (2018), while it undertakes volume computations that were intractable until now, as it is the first polynomial-time, practical method for V-polytopes and zonotopes that scales to high dimensions (currently 100). We further focus on zonotopes, and characterize them by their order (number of generators over dimension), because this largely determines sampling complexity. We analyze a related application, where we evaluate methods of zonotope approximation in engineering .
Revised:  We offer an open-source , optimized C++ implementation , and analyze its performance to show that it outperforms state-of-the-art software for H-polytopes and in the hundreds for V- and Z-polytopes on moderate hardware. Last, we illustrate our software in evaluating Z-polytope approximations .
Edit intent: meaning-changed
Original:  We apply the proposed scheme to the problem of tracking multiple vehicles and show that it achieves significantly higher accuracy than that of a corresponding uncoded scheme and approaches the accuracy of an ideal centralized scheme when the update interval is large enough.
Revised:  We apply the proposed scheme to the problem of tracking multiple vehicles . We show that replication achieves significantly higher accuracy than that of a corresponding uncoded scheme and approaches the accuracy of an ideal centralized scheme when the update interval is large enough.
Edit intent: clarity
Original:  We apply the proposed scheme to the problem of tracking multiple vehicles and show that it achieves significantly higher accuracy than that of a corresponding uncoded scheme and approaches the accuracy of an ideal centralized scheme when the update interval is large enough.
Revised:  We apply the proposed scheme to the problem of tracking multiple vehicles and show that it achieves significantly higher accuracy than the corresponding uncoded scheme and approaches the accuracy of an ideal centralized scheme when the update interval is large enough.
Edit intent: clarity
Original:  We apply the proposed scheme to the problem of tracking multiple vehicles and show that it achieves significantly higher accuracy than that of a corresponding uncoded scheme and approaches the accuracy of an ideal centralized scheme when the update interval is large enough.
Revised:  We apply the proposed scheme to the problem of tracking multiple vehicles and show that it achieves significantly higher accuracy than that of a corresponding uncoded scheme . The use of maximum distance separable (MDS) codes further improves accuracy for larger update intervals. In both cases, the proposed scheme approaches the accuracy of an ideal centralized scheme when the update interval is large enough.
Edit intent: meaning-changed