Research
On-device research index

arXiv research

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.

168,738 papers · 148 categories

Trend · papers per month

1234 · May 202619922001200920172026
48 results for time-weighted z-score

LOBRM model recreates limit order books from trade and quote data.

problem Lack of LOB data and limitations in LOBRM model.
method Extended LOBRM with time-weighted z-score standardization and exponential decay kernel, conducted in chronological order.
result LOBRM with decay kernel outperforms traditional models and module ensembling is effective.

The paper uses transformed ANOVA to identify important fire detection variables.

problem Identifying key variables for forest fire detection.
method Developed a complete orthonormal system for standard normal distribution, applied Z-score transformation, and used ANOVA approximation.
result Attribute ranking reveals important variables for fire detection.

This study uses TDA to map corporate failure, revealing distinct regions of risk.

problem Understanding and predicting corporate default risk.
method Topological Data Analysis (TDA) applied to Altman's Z-score model.
result Firms do not cluster neatly along default predictors, suggesting complex risk landscapes.

Online learning makes sequence of decisions with partial data arrival where next movement of data is unknown. In this paper, we have presented a new technique as multiple times weight updating that update the weight iteratively forsame instance. The proposed technique analyzed with popular state-of-art algorithms from …

2018-10-26abs ↗pdf ↗

We present a continuous-time maximum likelihood estimation methodology for credit rating transition probabilities, taking into account the presence of censored data. We perform rolling estimates of the transition matrices with exponential time weighting with varying horizons and discuss the underlying dynamics of trans…

2009-12-23abs ↗pdf ↗

Study shows heavy-tailed distributions affect reliability of machine learning calibration statistics.

problem Reliability of calibration statistics for machine learning regression tasks is affected by heavy-tailed uncertainty and error distributions.
method Examined two calibration error estimation methods (CE and ZMS) and found ZMS to be less sensitive to heavy-tailed distributions.
result Heavy-tailed distributions make MSE and MV unreliable, but ZMS remains a reliable approach.

In this article we prove a family of local (in time) weighted Strichartz estimates with derivative losses for the Klein-Gordon equation on asymptotically de Sitter spaces and provide a heuristic argument for the non-existence of a global dispersive estimate on these spaces. The weights in the estimates depend on the ma…

2010-11-21abs ↗pdf ↗

Two new models forecast multiple subpopulations' mortality, outperforming existing methods.

problem Modeling mortality patterns and trajectories in related populations.
method Adapted multivariate functional principal component analysis techniques.
result The second proposed model outperforms existing methods in forecast accuracy.

We analyze linear McKean-Vlasov forward-backward SDEs arising in leader-follower games with mean-field type control and terminal state constraints on the state process. We establish an existence and uniqueness of solutions result for such systems in time-weighted spaces as well as a {convergence} result of the solution…

2018-09-12abs ↗pdf ↗

In this study, we extend the optimal execution problem with convex market impact function studied in Kato (2014) to the case where the market impact function is S-shaped, that is, concave on [0,xˉ0][0, \bar {x}_0] and convex on [xˉ0,)[\bar {x}_0, \infty ) for some xˉ00\bar {x}_0 \geq 0. We study the corresponding Hamilton-Jacobi-…

2017-06-28abs ↗pdf ↗

We use the explicit relation between genus filtrated ss-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces Mg,sdiscM_{g,s}^{disc} (discrete volumes), to express Gaussian means…

2015-12-31abs ↗pdf ↗

New method uses statistical physics to detect financial market manipulation.

problem Detecting financial market manipulation activities like spoofing and layering.
method Modeling order book dynamics as particle motion and using momentum measure.
result Method outperforms conventional Z-score-based anomaly detection.

The paper extends logistic regression for unbounded majority classes and derives asymptotic properties.

problem Infinitely imbalanced logistic regression inference.
method Derive a second order expansion for slope parameter under unbounded majority class.
result The second order term converges to a normal distribution with a variance depending only on the minority class's mean.

In this paper, we build an organization of high-dimensional datasets that cannot be cleanly embedded into a low-dimensional representation due to missing entries and a subset of the features being irrelevant to modeling functions of interest. Our algorithm begins by defining coarse neighborhoods of the points and defin…

2015-07-01abs ↗pdf ↗

This paper improves risk control for financial markets by calibrating VaR forecasts using conformal methods.

problem Nonstationary and regime-dependent losses in financial markets.
method Regime-weighted conformal risk control (RWC) for VaR forecasting.
result RWC improves regime-conditional stability in some settings with modest conservativeness changes.

We show short-time existence for curves driven by curve diffusion flow with a prescribed contact angle α(0,π)α\in (0, π): The evolving curve has free boundary points, which are supported on a line and it satisfies a no-flux condition. The initial data are suitable curves of class W2γW_2^γ with γ(32,2]γ\in (\tfrac{3}{2}, 2]. For …

2018-10-02abs ↗pdf ↗

The recently introduced dropout training criterion for neural networks has been the subject of much attention due to its simplicity and remarkable effectiveness as a regularizer, as well as its interpretation as a training procedure for an exponentially large ensemble of networks that share parameters. In this work we …

2013-12-21abs ↗pdf ↗

In this paper, we prove that there exists a dimensional constant δ>0δ> 0 such that given any background Kähler metric ωω, the Calabi flow with initial data u0u_0 satisfying \begin{equation*} \partial \bar \partial u_0 \in L^\infty (M) \text{ and } (1- δ)ω< ω_{u_0} < (1+δ)ω, \end{equation*} admits a unique short time so…

2017-01-24abs ↗pdf ↗

Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…

2018-11-13abs ↗pdf ↗

We introduce a DNN training technique that learns only a fraction of the full parameter set without incurring an accuracy penalty. To do this, our algorithm constrains the total number of weights updated during backpropagation to those with the highest total gradients. The remaining weights are not tracked, and their i…

2018-06-11abs ↗pdf ↗

Study on mean field games with singular controls and their applications.

problem Optimal productivity expansion in dynamic oligopolies.
method Existence and uniqueness of mean field equilibria through nonlinear equations, Abelian limit for discounted and ergodic games.
result Valid connection between discounted and ergodic games, approximation of Nash equilibria.

Novel framework for contextual anomaly detection models uncertainty.

problem Identifying anomalies in target variables influenced by contextual variables.
method Normalcy score (NS) framework using heteroscedastic Gaussian process regression.
result NS outperforms state-of-the-art methods in detection accuracy and interpretability.

New method uses interval-based metric to validate prediction uncertainty in machine learning.

problem Validation of prediction uncertainty in machine learning regression tasks is unreliable due to heavy-tailed distributions.
method Shift from variance-based metrics to interval-based Prediction Interval Coverage Probability (PICP).
result PICP method more quickly and reliably tests prediction intervals than variance-based metrics.

We analyze generalization in deep learning models using random matrix theory.

problem Understanding the generalization error in deep learning models with random feature representations.
method Applying Random Matrix Theory to derive asymptotic generalization error formulas for various architectures.
result Linear ESNs are equivalent to ridge regression with exponentially time-weighted input covariance, revealing an inductive bias towards recent inputs.

This paper provides a practical method to extract caplet volatilities from quoted data.

problem Extracting caplet volatilities from quoted data is complex and not straightforward.
method The paper presents a constructive algorithm based on criteria and robust outlier detection. It includes direct interpolation, bootstrap methods, and global search methods.
result The paper introduces methods to extract caplet volatilities that are arbitrage-free and consistent with quoted data.

Develops a new trading strategy for statistical arbitrage with path-dependent signals.

problem Optimal execution in statistical arbitrage strategies with dynamic predictive signals.
method Signature-based framework modeling alpha and trading speed as linear functionals of truncated signature of market path.
result Fitted policy achieves higher return on turnover compared to a z-score benchmark.

MPC framework reduces execution costs and schedule deviations in trading.

problem Executing large orders in markets under time and liquidity constraints.
method Model Predictive Control (MPC) framework balancing order completion, market impact, and opportunity cost.
result Significant reductions in slippage and schedule shortfall compared to benchmarks.

Analyzes Willmore flow for graphs with boundary data, proving existence and convergence.

problem Willmore flow of graphs with boundary conditions over bounded domains.
method Developed low-regularity theory, reformulated graphical equation, used time-weighted parabolic Hölder spaces.
result Proved short-time and global existence for initial data in C1+α(Ω)C^{1+α}(\overlineΩ) and Lipschitz, with exponential convergence.