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.
FLAP adapts policies quickly to new tasks using shared linear representations.
Paper introduces a new outer measure for continuous price paths with instant enforcement.
HyperFast instantly classifies tabular data in one pass.
We study two time-scale linear stochastic approximation algorithms, which can be used to model well-known reinforcement learning algorithms such as GTD, GTD2, and TDC. We present finite-time performance bounds for the case where the learning rate is fixed. The key idea in obtaining these bounds is to use a Lyapunov fun…
The article examines in some detail the convergence rate and mean-square-error performance of momentum stochastic gradient methods in the constant step-size and slow adaptation regime. The results establish that momentum methods are equivalent to the standard stochastic gradient method with a re-scaled (larger) step-si…
The paper proves ML estimators are strongly consistent for identifying edge weights in BAR models.
Given a Lorentzian manifold , a geodesic in and a timelike Jacobi field along , we introduce a special class of instants along that we call -pseudo conjugate (or focal relatively to some initial orthogonal submanifold). We prove that the -pseudo conjugate insta…
In this paper, we consider sequential online prediction (SOP) for streaming data in the presence of outliers and change points. We propose an INstant TEmporal structure Learning (INTEL) algorithm to address this problem. Our INTEL algorithm is developed based on a full consideration of the duality between online predic…
We introduce a new tool for predicting the evolution of an option for the cases where at some specific time, there is a high-degree of uncertainty for identifying its price. We work over the special case where we can predict the evolution of the system by joining a single price for the Option, defined at some specific …
Using symplectic techniques and spectral analysis of smooth paths of self-adjoint operators, we characterize the set of conjugate instants along a geodesic in an infinite dimensional Riemannian Hilbert manifold.
In this paper, we propose a classification based glottal closure instants (GCI) detection from pathological acoustic speech signal, which finds many applications in vocal disorder analysis. Till date, GCI for pathological disorder is extracted from laryngeal (glottal source) signal recorded from Electroglottograph, a d…
In the present paper we construct stock price processes with the same marginal log-normal law as that of a geometric Brownian motion and also with the same transition density (and returns' distributions) between any two instants in a given discrete-time grid. We then illustrate how option prices based on such processes…
In this work we determine bifurcation instants for 1-parameter families of solutions to the Yamabe problem defined on maximal flag manifolds. We also study the local rigidity points, namely, a isolated solution of the Yamabe problem.
Sound event detection (SED) methods are tasked with labeling segments of audio recordings by the presence of active sound sources. SED is typically posed as a supervised machine learning problem, requiring strong annotations for the presence or absence of each sound source at every time instant within the recording. Ho…
The paper tackles the problem of deriving a topological structure among stock prices from high frequency historical values. Similar studies using low frequency data have already provided valuable insights. However, in those cases data need to be collected for a longer period and then they have to be detrended. An effec…
The paper tackles fairness in forecasting and learning linear dynamical systems.
In this paper we study the setting where features are added or change interpretation over time, which has applications in multiple domains such as retail, manufacturing, finance. In particular, we propose an approach to provably determine the time instant from which the new/changed features start becoming relevant with…
Phishing is the simplest form of cybercrime with the objective of baiting people into giving away delicate information such as individually recognizable data, banking and credit card details, or even credentials and passwords. This type of simple yet most effective cyber-attack is usually launched through emails, phone…
ALINE optimizes Bayesian inference and data acquisition by strategically querying informative data.
Panoptic trades options without oracles on Ethereum.
Deep learning optimizes VWAP strategy for lower transaction costs.
Within the context of multivariate time series segmentation this paper proposes a method inspired by a posteriori optimal trading. After a normalization step time series are treated channel-wise as surrogate stock prices that can be traded optimally a posteriori in a virtual portfolio holding either stock or cash. Line…
Measures of implied volatility roughness corrected for bias.
By appealing to renewal theory we determine the equations that the mean exit time of a continuous-time random walk with drift satisfies both when the present coincides with a jump instant or when it does not. Particular attention is paid to the corrections ensuing from the non-Markovian nature of the process. We show t…
A new SSL method uses instance-dependent thresholds to improve accuracy.
Study dynamic portfolio choice under rotating drivers, revealing a new geometric structure.
New algorithms detect anomalies in processes with minimal delay.
GER learns particle dynamics from unpaired snapshots using physics-informed GANs.
A common approach for defining a reward function for Multi-objective Reinforcement Learning (MORL) problems is the weighted sum of the multiple objectives. The weights are then treated as design parameters dependent on the expertise (and preference) of the person performing the learning, with the typical result that a …
COSMIC identifies LTV systems from large data sets efficiently.
Let f:Σ_1 --> Σ_2 be a map between compact Riemannian manifolds of constant curvature. This article considers the evolution of the graph of f in the product of Σ_1 and Σ_2 by the mean curvature flow. Under suitable conditions on the curvature of Σ_1 and Σ_2 and the differential of the initial map, we show that the flow…
In this paper, we present Gamma-LSTM, an enhanced long short term memory (LSTM) unit, to enable learning of hierarchical representations through multiple stages of temporal abstractions. Gamma memory, a hierarchical memory unit, forms the central memory of Gamma-LSTM with gates to regulate the information flow into var…
Study finds bifurcation and local rigidity points for solutions to the Yamabe problem on Aloff-Wallach Spaces.
A statistical generalization is made of microeconomics in the spirit of going from classical to statistical mechanics. The price and quantity of every commodity1 traded in the market, at each instant of time, is considered to be an independent random variable: all prices and quantities are considered to be stochastic p…
We argue that the word ``critical'' in the title is not purely literary. Based on our and other previous work on nonlinear complex dynamical systems, we summarize present evidence, on the Oct. 1929, Oct. 1987, Oct. 1987 Hong-Kong, Aug. 1998 global market events and on the 1985 Forex event, for the hypothesis advanced f…
Low bit-width integer weights and activations are very important for efficient inference, especially with respect to lower power consumption. We propose Monte Carlo methods to quantize the weights and activations of pre-trained neural networks without any re-training. By performing importance sampling we obtain quantiz…
We develop an adversarial-reinforcement learning scheme for microswimmers in statistically homogeneous and isotropic turbulent fluid flows, in both two (2D) and three dimensions (3D). We show that this scheme allows microswimmers to find non-trivial paths, which enable them to reach a target on average in less time tha…
Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s…
We consider the problem of diversifying automated reply suggestions for a commercial instant-messaging (IM) system (Skype). Our conversation model is a standard matching based information retrieval architecture, which consists of two parallel encoders to project messages and replies into a common feature representation…
We consider reinforcement learning in parameterized Markov Decision Processes (MDPs), where the parameterization may induce correlation across transition probabilities or rewards. Consequently, observing a particular state transition might yield useful information about other, unobserved, parts of the MDP. We present a…
This paper studies the valuation of a class of default swaps with the embedded option to switch to a different premium and notional principal anytime prior to a credit event. These are early exercisable contracts that give the protection buyer or seller the right to step-up, step-down, or cancel the swap position. The …
Robust algorithm for distributed optimization resistant to Byzantine failures.
We devise an optimal allocation strategy for the execution of a predefined number of stocks in a given time frame using the technique of discrete-time Stochastic Control Theory for a defined market model. This market structure allows an instant execution of the market orders and has been analyzed based on the assumptio…
The goal of this study is to determine which strategic model, either IO or RBV, allows firms to generate the highest performance on a competitive market. Contrasting with classical studies that mobilize analyses as VARCOMP, we deploy a multi-agent system simulating the behavior of firms adopting RBV or IO strategic mod…
A new RL framework handles autocorrelated actions for better learning and stability.
Multi-armed bandit algorithms have become a reference solution for handling the explore/exploit dilemma in recommender systems, and many other important real-world problems, such as display advertisement. However, such algorithms usually assume a stationary reward distribution, which hardly holds in practice as users' …
The paper is concerned with non-linear Gaussian filtering and smoothing in continuous-discrete state-space models, where the dynamic model is formulated as an Itô stochastic differential equation (SDE), and the measurements are obtained at discrete time instants. We propose novel Taylor moment expansion (TME) Gaussian …
Common event-triggered state estimation (ETSE) algorithms save communication in networked control systems by predicting agents' behavior, and transmitting updates only when the predictions deviate significantly. The effectiveness in reducing communication thus heavily depends on the quality of the dynamics models used …