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.
Clock theorem extended to knotoids and linkoids.
Generalizes Kauffman's clock theorem to surfaces.
The paper characterizes discrete Morse functions on knot diagrams and generalizes a clock theorem.
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 …
We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident vertices. On the torus our objects are perfect pairings, whereas on the sphere this is only true after removing one triangle and its vertices.…
HTFM improves mode coverage and tail-statistic recovery for heavy-tailed data.
Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.
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…
Improved stochastic clocks for financial models without increasing trades.
Study efficient pricing for barrier options in stochastic-volatility models with leverage correction.
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…
New link polynomials linked to cluster theory.
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…
Paper analyzes systematic jump risk around the clock using news narratives.
A new uncertainty principle helps traders better understand market activity.
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…
New CTBNs with clocks allow for non-exponential survival times.
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.
This paper is an introduction to the state sum model for the Alexander-Conway polynomial that was introduced in the the author's book "Formal Knot Theory" (Princeton University Press, 1983). The article outlines how Alexander's original definition of the polynomial as the determinant of a matrix associated with the lin…
D-Wave hybrid quantum-classical portfolio optimization shows classical decomposition is key, not quantum sampling.
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.
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 …
Derives variance kernel for reaction boundary in financial models.
Derives operational-time variance kernel for reaction boundaries in financial markets.
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…
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…
Time dilation and relative velocity are observationally indistinguishable in the special theory of relativity, a duality that carries over into the general theory under Fermi coordinates along a curve (in coordinate-independent language, in the tangent Minkowski space along the curve). For …
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…
Distributed training of deep nets is an important technique to address some of the present day computing challenges like memory consumption and computational demands. Classical distributed approaches, synchronous or asynchronous, are based on the parameter server architecture, i.e., worker nodes compute gradients which…
Improves meta-learning efficiency with mixed-mode differentiation.
Moniqua improves SGD convergence with quantized communication.
A new approach to protein language models combines latent space prediction with masked language modeling.
Deep learning has shown that learned functions can dramatically outperform hand-designed functions on perceptual tasks. Analogously, this suggests that learned optimizers may similarly outperform current hand-designed optimizers, especially for specific problems. However, learned optimizers are notoriously difficult to…
We study the optimal stopping of an American call option in a random time-horizon under exponential spectrally negative Lévy models. The random time-horizon is modeled as the so-called Omega default clock in insurance, which is the first time when the occupation time of the underlying Lévy process below a level , ex…
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…
New algorithms optimize multiple machine learning metrics in real-world tasks.
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…
NAC-FL optimizes model updates in FL systems by adapting compression to network congestion.
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…
Deep learning models can learn confounding factors instead of device fingerprints in wireless signals.