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,657 papers · 148 categories

Trend · papers per month

0111 · May 201019922001200920172026
6 results for QR-based EWRLS

ABO extends RLS for online learning in non-stationary time-series, improving accuracy and speed.

problem Online learning in non-stationary time-series with overparameterized models.
method QR-based exponentially weighted RLS algorithm with orthogonal-triangular updates.
result ABO maintains bounded residuals and stable condition numbers while achieving speed improvements.

We present an online approach to portfolio selection. The motivation is within the context of algorithmic trading, which demands fast and recursive updates of portfolio allocations, as new data arrives. In particular, we look at two online algorithms: Robust-Exponentially Weighted Least Squares (R-EWRLS) and a regulari…

2010-05-17abs ↗pdf ↗

EX-DRL improves extreme quantile prediction for financial risk management.

problem Inaccurate estimation of extreme quantiles in loss distributions.
method EX-DRL uses Generalized Pareto Distribution (GPD) to model the tail of the loss distribution and Quantile Regression (QR) to improve extreme quantile prediction.
result EX-DRL provides more precise estimates of extreme quantiles, improving risk metrics reliability.

This work connects Cramér distance to QR-DQN for DRL.

problem Improving performance in DRL by capturing full distribution of returns.
method Proves Cramér distance's equivalence to 1-Wasserstein distance and proposes a low-complexity algorithm to compute Cramér distance.
result Cramér distance and quantile regression losses yield collinear gradients under non-crossing constraints.

High-dimensional big data appears in many research fields such as image recognition, biology and collaborative filtering. Often, the exploration of such data by classic algorithms is encountered with difficulties due to `curse of dimensionality' phenomenon. Therefore, dimensionality reduction methods are applied to the…

2016-07-12abs ↗pdf ↗