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.
Improved stochastic clocks for financial models without increasing trades.
The Kelly rule fails to maximize growth in a time-changed return setting.
We introduce a linear space of finitely additive measures to treat the problem of optimal expected utility from consumption under a stochastic clock and an unbounded random endowment process. In this way we establish existence and uniqueness for a large class of utility maximization problems including the classical one…
We introduce a linear space of finitely additive measures to treat the problem of optimal expected utility from consumption under a stochastic clock and an unbounded random endowment process. In this way we establish existence and uniqueness for a large class of utility-maximization problems including the classical one…
Study efficient pricing for barrier options in stochastic-volatility models with leverage correction.
Clock theorem extended to knotoids and linkoids.
This paper is about the clock number of a knot. First we define the clock number by using states of a knot defined by Kauffman. Next we show that if K is a prime knot, its clock number is greater than or equal to its crossing number. Finally we prove that its clock number is equal to its crossing number if and only if …
New CTBNs with clocks allow for non-exponential survival times.
HTFM improves mode coverage and tail-statistic recovery for heavy-tailed data.
We prove that the variance swap rate (fair strike) equals the price of a co-terminal European-style contract when the underlying is an exponential Markov process, time-changed by an arbitrary continuous stochastic clock, which has arbitrary correlation with the driving Markov process, provided that the payoff function …
Generalizes Kauffman's clock theorem to surfaces.
A symmetry-guided definition of time may enhance and simplify the analysis of historical series with recurrent patterns and seasonalities. By enforcing simple-scaling and stationarity of the distributions of returns, we identify a successful protocol of time definition in Finance. The essential structure of the stochas…
Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.
In this short note, we study an optimization problem of expected implementation shortfall (IS) cost under general shaped market impact functions. In particular, we find that an optimal strategy is a VWAP (volume weighted average price) execution strategy when the market model is a Black-Scholes type with stochastic clo…
In the large financial market, which is described by a model with countably many traded assets, we formulate the problem of the expected utility maximization. Assuming that the preferences of an economic agent are modeled with a stochastic utility and that the consumption occurs according to a stochastic clock, we obta…
State-of-the-art link prediction utilizes combinations of complex features derived from network panel data. We here show that computationally less expensive features can achieve the same performance in the common scenario in which the data is available as a sequence of interactions. Our features are based on social vec…
We solve a lifecycle model in which the consumer's chronological age does not move in lockstep with calendar time. Instead, biological age increases at a stochastic non-linear rate in time like a broken clock that might occasionally move backwards. In other words, biological age could actually decline. Our paper is ins…
Independent Component Analysis (ICA) is a dimensionality reduction technique that can boost efficiency of machine learning models that deal with probability density functions, e.g. Bayesian neural networks. Algorithms that implement adaptive ICA converge slower than their nonadaptive counterparts, however, they are cap…
Moniqua improves SGD convergence with quantized communication.
The paper characterizes discrete Morse functions on knot diagrams and generalizes a clock theorem.
We formulate simple assumptions, implying the Robbins-Monro conditions for the -learning algorithm with the local learning rate, depending on the number of visits of a particular state-action pair (local clock) and the number of iteration (global clock). It is assumed that the Markov decision process is communicatin…
Increasing the mini-batch size for stochastic gradient descent offers significant opportunities to reduce wall-clock training time, but there are a variety of theoretical and systems challenges that impede the widespread success of this technique. We investigate these issues, with an emphasis on time to convergence and…
Paper analyzes systematic jump risk around the clock using news narratives.
In stochastic optimization, using large batch sizes during training can leverage parallel resources to produce faster wall-clock training times per training epoch. However, for both training loss and testing error, recent results analyzing large batch Stochastic Gradient Descent (SGD) have found sharp diminishing retur…
A new uncertainty principle helps traders better understand market activity.
Enhances SGLD for log-concave posteriors with asynchronous computation.
We consider stochastic second-order methods for minimizing smooth and strongly-convex functions under an interpolation condition satisfied by over-parameterized models. Under this condition, we show that the regularized subsampled Newton method (R-SSN) achieves global linear convergence with an adaptive step-size and a…
YOASOVI improves stochastic VI for large models with fast, self-correcting sampling.
We describe a computationally efficient, stochastic graph-regularization technique that can be utilized for the semi-supervised training of deep neural networks in a parallel or distributed setting. We utilize a technique, first described in [13] for the construction of mini-batches for stochastic gradient descent (SGD…
This work provides a scaling rule for model EMA optimization across batch sizes.
Deep-learning method solves BSVIEs and coupled systems.
The Clock Drawing Test (CDT) is a rapid, inexpensive, and popular neuropsychological screening tool for cognitive conditions. The Digital Clock Drawing Test (dCDT) uses novel software to analyze data from a digitizing ballpoint pen that reports its position with considerable spatial and temporal precision, making possi…
The natural gradient method has been used effectively in conjugate Gaussian process models, but the non-conjugate case has been largely unexplored. We examine how natural gradients can be used in non-conjugate stochastic settings, together with hyperparameter learning. We conclude that the natural gradient can signific…
A new pricing controller handles resource constraints to infer target prices effectively.
Optimizer memory affects learning rate sensitivity in shuffle order, impacting fine-tuning noise.
Boosted Frank-Wolfe accelerates optimization for nonconvex problems.
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by over…
This study compares parallel SMC and MCMC for Bayesian deep learning, showing SMC parallel is faster.
Generative models learn rules at different timescales, revealing a 'innovation window'.
Algorithm estimates clock in network cascades to improve performance.
Detect spacetime curvature without rulers and clocks in 3D.
Classifies connections on Galilei manifolds, generalizing known results.
This paper introduces the Metric-Free Natural Gradient (MFNG) algorithm for training Boltzmann Machines. Similar in spirit to the Hessian-Free method of Martens [8], our algorithm belongs to the family of truncated Newton methods and exploits an efficient matrix-vector product to avoid explicitely storing the natural g…
Derives variance kernel for reaction boundary in financial models.
Derives operational-time variance kernel for reaction boundaries in financial markets.
This paper builds a model of high-frequency equity returns by separately modeling the dynamics of trade-time returns and trade arrivals. Our main contributions are threefold. First, we characterize the distributional behavior of high-frequency asset returns both in ordinary clock time and in trade time. We show that wh…
We introduce a new class of processes for the evaluation of multivariate equity derivatives. The proposed setting is well suited for the application of the standard copula function theory to processes, rather than variables, and easily enables to enforce the martingale pricing requirement. The martingale condition is i…
Paper proposes SCott optimizer to reduce forecasting model training variance.