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.
Let X be a compact complex Calabi-Yau 4-fold. Under certain assumptions, we define Donaldson-Thomas type deformation invariants (DT4 invariants) by studying moduli spaces of solutions to the Donaldson-Thomas equations on X. We also study sheaves counting problems on local Calabi-Yau 4-folds. We relate DT4…
Enhances RL in target domains with limited data using augmented return.
problem Utilize data from an accessible source domain to improve policy learning in a target domain with scarce data.
method Return Augmented Decision Transformer (REAG) method, which augments the return in the source domain to align with the target domain's optimal trajectory distribution.
result The proposed REAG method achieves the same level of suboptimality as without a dynamics shift, enhancing DT type frameworks' performance in off-dynamics RL.
Mammography is the most effective and available tool for breast cancer screening. However, the low positive predictive value of breast biopsy resulting from mammogram interpretation leads to approximately 70% unnecessary biopsies with benign outcomes. Data mining algorithms could be used to help physicians in their dec…
We consider differential operators on a supermanifold of dimension 1∣1. We define non-degenerate operators as those with an invertible top coefficient in the expansion in the "superderivative" D (which is the square root of the shift generator, the partial derivative in an even variable, with the help of an odd ind…
Growth of monetary assets and debts is commonly described by the formula of compound interest which for the case of continuous compounding is the exponential growth law. Its differential form is dc/dt = i c where dc/dt describes the rate of monetary growth, i the compounded interest rate and c the actual principal. Exp…
For a given time horizon DT, this article explores the relationship between the realized volatility (the volatility that will occur between t and t+DT), the implied volatility (corresponding to at-the-money option with expiry at t+DT), and several forecasts for the volatility build from multi-scales linear ARCH process…
Records of the traded value f_i(t) of stocks display fluctuation scaling, a proportionality between the standard deviation sigma(i) and the average <f(i)>: sigma(i) ~ f(i)^alpha, with a strong time scale dependence alpha(dt). The non-trivial (i.e., neither 0.5 nor 1) value of alpha may have different origins and provid…
In this paper we propose a synergistic melting of neural networks and decision trees (DT) we call neural decision trees (NDT). NDT is an architecture a la decision tree where each splitting node is an independent multilayer perceptron allowing oblique decision functions or arbritrary nonlinear decision function if more…
We present an empirical study of the subordination hypothesis for a stochastic time series of a stock price. The fluctuating rate of trading is identified with the stochastic variance of the stock price, as in the continuous-time random walk (CTRW) framework. The probability distribution of the stock price changes (log…
We develop DTs for PDE models using KL-NN and TL, analyzing TL's moment equations and one-shot learning for exactness.
problem Creating accurate digital twins for systems governed by PDEs under changing conditions.
method We use KL-NN surrogate models and transfer learning to construct DTs, analyzing the moment equations and proposing one-shot and few-shot learning methods.
result For linear PDEs, one-shot TL is exact; for nonlinear PDEs, some parameters can be transferred with minimal error.
We review a construction of hyperkahler metrics proposed in joint work of Davide Gaiotto, Greg Moore and the author. A key ingredient in this construction is a collection of integer "DT invariants" obeying the wall-crossing formula of Kontsevich-Soibelman.
Study online pricing with contextual elasticity and heteroscedastic valuation.
problem Online contextual dynamic pricing with customer decision based on features and price.
method Introduced a novel approach to modeling customer demand with feature-based price elasticity and heteroscedastic noise. Proposed an efficient algorithm called Pricing with Perturbation (PwP).
result Proved an O(dTlogT) regret bound for the algorithm, matching a lower bound of Ω(dT).