A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
We analyze the errors arising from discrete readjustment of the hedging portfolio when hedging options in exponential Levy models, and establish the rate at which the expected squared error goes to zero when the readjustment frequency increases. We compare the quadratic hedging strategy with the common market practice …
This paper shows faster convergence rates for stochastic gradient descent in binary classification.
problem Achieving faster convergence rates for stochastic gradient descent in binary classification.
method Stochastic gradient descent and averaging variant, focusing on exponential convergence rates under strong low-noise conditions.
result Exponential convergence of the expected classification error in the final phase of stochastic gradient descent and averaged stochastic gradient descent for differentiable convex loss functions.
Crowdsourcing is an effective tool for human-powered computation on many tasks challenging for computers. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectation) of hyperplane binary labeling rules under the Dawid-Skene crowdsourcing model. The bounds can be appl…
New research shows fixed-budget best-arm identification cannot match static oracle performance.
problem Fixed-budget best-arm identification's performance limitations.
method Analysis of various adaptive and static algorithms for best-arm identification.
result For any algorithm, there exists at least one instance where the error decay rate is at most \((1 + \frac{\log(K)}{8})^{-1}\) times that of the static oracle.
Optimal tests for nonparametric one- and two-sample testing are derived using MMD and KSD.
problem Developing optimal tests for nonparametric one- and two-sample testing.
method Using Sanov's theorem and Maximum Mean Discrepancy (MMD), the optimal error exponents are derived for one-sample tests. For two-sample tests, the quadratic-time Kernel Stein Discrepancy (KSD) is shown to achieve the optimal type-II error exponent.
result Achievement of optimal error exponents for nonparametric one- and two-sample testing in the universal setting.
Approximations to utility indifference prices are provided for a contingent claim in the large position size limit. Results are valid for general utility functions on the real line and semi-martingale models. It is shown that as the position size approaches infinity, the utility function's decay rate for large negative…
The AdaBoost algorithm was designed to combine many "weak" hypotheses that perform slightly better than random guessing into a "strong" hypothesis that has very low error. We study the rate at which AdaBoost iteratively converges to the minimum of the "exponential loss." Unlike previous work, our proofs do not require …
We apply multilevel Monte Carlo for option pricing problems using exponential Lévy models with a uniform timestep discretisation to monitor the running maximum required for lookback and barrier options. The numerical results demonstrate the computational efficiency of this approach. We derive estimates of the convergen…
Deep neural networks approximate option prices in high-dimensional Lévy models efficiently.
problem Approximating option prices in high-dimensional financial models with jumps.
method Use of deep ReLU neural networks to approximate option prices in multivariate Lévy processes with polynomial growth in network size and dimension.
result Established sufficient conditions for polynomial growth in network size and dimension to approximate option prices with error ε.
Crowdsourcing has become an effective and popular tool for human-powered computation to label large datasets. Since the workers can be unreliable, it is common in crowdsourcing to assign multiple workers to one task, and to aggregate the labels in order to obtain results of high quality. In this paper, we provide finit…
We analyze a plug-in estimator for a large class of integral functionals of one or more continuous probability densities. This class includes important families of entropy, divergence, mutual information, and their conditional versions. For densities on the d-dimensional unit cube [0,1]d that lie in a β-Hölder s…
Investors in stock market are usually greedy during bull markets and scared during bear markets. The greed or fear spreads across investors quickly. This is known as the herding effect, and often leads to a fast movement of stock prices. During such market regimes, stock prices change at a super-exponential rate and ar…
Analytic networks with bounded coefficients can't outperform polynomial approximations.
problem Approximation limits of neural networks with analytic activation functions under coefficient constraints.
method Deterministic analysis using comparison argument and Bernstein-type estimates.
result Networks with analytic activation functions and controlled coefficients cannot outperform classical polynomial approximation rates on non-analytic targets.
Kernel thinning compresses distributions more effectively than i.i.d. sampling or standard thinning.
problem Efficiently compressing distributions for better sampling and integration accuracy.
method Introduces kernel thinning, a procedure that compresses an n-point approximation of a distribution into a sqrt(n)-point approximation with comparable integration error.
result Kernel thinning achieves a maximum discrepancy in integration error of O_d(n^(-1/2) sqrt(log n)) in probability for compactly supported distributions and O_d(n^(-1/2) (log n)^(d+1/2) sqrt(log log n)) for sub-exponential distributions.