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

188376564752 · Jun 202019922001200920172026
48 results for trailing parameter estimation

We propose a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. Our key insight is to decompose the graph into a set of trails which can then each be solved efficientl…

2015-05-24abs ↗pdf ↗

TRAiL is a linear bandit algorithm that ensures optimal regret and guarantees inference quality.

problem Optimal regret and inference quality in linear bandits with convex action sets.
method TRAiL estimates the parameter through regularized least squares and perturbs the action set along the tangent plane.
result TRAiL achieves an Ω(T)Ω(\sqrt{T}) upper bound on cumulative regret with high probability.

The Kalman filter and Heston model are used to estimate asset prices and trading performance.

problem Estimating asset prices using stochastic models.
method Kalman filter applied to mean-reverting processes and Heston model with method of moments.
result The Kalman filter and Heston model provide effective methods for estimating asset prices and trading performance.

Trailing stop is a popular stop-loss trading strategy by which the investor will sell the asset once its price experiences a pre-specified percentage drawdown. In this paper, we study the problem of timing buy and then sell an asset subject to a trailing stop. Under a general linear diffusion framework, we study an opt…

2017-01-14abs ↗pdf ↗

Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such se…

2017-04-20abs ↗pdf ↗

Online purchase decisions in organizations can go through a complex journey with multiple agents involved in the decision making process. Depending on the product being purchased, and the organizational structure, the process may involve employees who first conduct market research, and then influence decision makers wh…

2019-08-29abs ↗pdf ↗

We show that a critical vulnerability in adversarial imitation is the tendency of discriminator networks to learn spurious associations between visual features and expert labels. When the discriminator focuses on task-irrelevant features, it does not provide an informative reward signal, leading to poor task performanc…

2019-10-02abs ↗pdf ↗

A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of the order of the module. This description has applications in knot theory.

2010-06-21abs ↗pdf ↗

The paper optimizes portfolios using MACD signals derived from price history.

problem Optimizing risky asset portfolios with latent mean-reverting and momentum factors.
method Derives optimal strategies based on MACD signals from EMA processes.
result Establishes admissibility and verification of optimal strategies.

High-performing equity factor with Sharpe ratio above 13 out-of-sample.

problem Hidden cross-sectional predictability in stock returns.
method Regime-conditional signal activation combining value and short-term reversal signals.
result Annualized returns of 158.6% with 12.0% volatility, strong performance out-of-sample.

A lifelong reinforcement learning system is a learning system that has the ability to learn through trail-and-error interaction with the environment over its lifetime. In this paper, I give some arguments to show that the traditional reinforcement learning paradigm fails to model this type of learning system. Some insi…

2020-01-27abs ↗pdf ↗

Investors with anxiety about drawdowns may use stop-loss and trailing stops as optimal selling strategies.

problem Investors' anxiety about drawdowns affects optimal selling strategies.
method Mathematical analysis of optimal stopping with random discounting.
result Stop-loss and trailing stops can be optimal selling strategies under anxiety about drawdowns.

This work abstracts deep neural networks into concept graphs for better interpretability in medical tasks.

problem Lack of interpretability in deep learning models, especially in medical domains.
method Developed a graphical representation of medical image processing models to understand concept-based reasoning.
result Extracted a concept-level graph that reveals the decision-making process of deep learning models.

The Turaev genus defines a natural filtration on knots where Turaev genus zero knots are precisely the alternating knots. We show that the signature of a Turaev genus one knot is determined by the number of components in its all-A Kauffman state, the number of positive crossings, and its determinant. We also show that …

2016-04-12abs ↗pdf ↗

Improved stock selection through predictive fundamentals and uncertainty estimates.

problem Selecting stocks based on future financial data to outperform traditional factor models.
method Train deep nets to forecast future fundamentals, incorporate uncertainty estimates, and adjust portfolios to manage risk.
result Simulated annualized return of 17.7% and Sharpe ratio of 0.84 for uncertainty-aware model, significantly higher than 14.0% and 0.52 for standard factor models.

A new kernel test reduces noise in MMD by focusing on leading eigen-directions.

problem Noise in trailing directional components degrades power of standard kernel two-sample tests.
method Truncate MMD spectral decomposition, retaining only leading eigen-directions.
result Our method achieves superior power and robustness, especially in high-dimensional and unbalanced settings.

Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution rule,https://doi.org/10.1088/1361-6544/ab1275] that for a connected self-similar set, space-filling curves can be c…

2018-04-27abs ↗pdf ↗

Algorithm estimates principal eigenvector with adaptive sensing, improving over non-adaptive methods.

problem Estimating principal eigenvector with limited scalar measurements.
method Compressed variant of Oja's algorithm using two adaptive measurements per sample.
result Convergence rate of O(λ1λ2d2/(Δ2t))\mathcal{O}(λ_1λ_2 d^2 / (Δ^2 t)) after tt iterations, matching information-theoretic lower bound.

In this paper we explore methods to exploit symmetries for ensuring sample efficiency in reinforcement learning (RL), this problem deserves ever increasing attention with the recent advances in the use of deep networks for complex RL tasks which require large amount of training data. We introduce a novel method to dete…

2017-06-09abs ↗pdf ↗

The paper tackles model failure detection and refitting in real-world systems.

problem Real-world data often fails statistical models due to heterogeneity.
method Develops tools for detecting and identifying model failures and refitting to improve accuracy.
result Empirical and theoretical results show the effectiveness of the proposed methodology.

Polarization measurements done using Imaging Polarimeters such as the Robotic Polarimeter are very sensitive to the presence of artefacts in images. Artefacts can range from internal reflections in a telescope to satellite trails that could contaminate an area of interest in the image. With the advent of wide-field pol…

2019-11-19abs ↗pdf ↗

This study shows how social insects and machine learning methods share a common mathematical framework.

problem Understanding how decentralized systems achieve optimal decision-making.
method Developed a rigorous mathematical framework to show isomorphism between ant colonies and ensemble machine learning.
result Demonstrated that ant colony decision-making and random forest learning implement identical variance reduction strategies through decorrelation of identical units.

Study of coloured invariants of torus knots using W\mathcal{W} algebras.

problem Understanding coloured invariants of torus knots T(p,p)T(p,p').
method Representation theory of principal affine W\mathcal{W} algebras and asymptotic weight multiplicities.
result Limits of renormalized invariants are equal to characters of W\mathcal{W} algebra modules.

We propose a new model of minority game with so-called smart agents such that the standard deviation and the total loss in this model reach the theoretical minimum values in the limit of long time. The smart agents use trail and error method to make a choice but bring global optimization to the system, which suggests t…

2004-06-15abs ↗pdf ↗

CLQT benchmarks LLM portfolio managers by evaluating their decision-making process, not just returns.

problem Most benchmarks rank LLMs by returns, ignoring their decision-making process and potential for look-ahead leakage.
method CLQT reframes evaluation as diagnosis, using a closed-loop, cost-aware, strategy-consistent environment with a five-stage cycle.
result CLQT provides a durable map of agent competencies and limitations, separating outcome from process.

Adaptive market maker curves minimize arbitrage losses in DeFi.

problem Asset trading prices in AMMs trail behind centralized exchanges, causing LP losses.
method Adapts market maker bonding curves to trader behavior using a differential equation derived from the Glosten-Milgrom model.
result Optimal adaptive curves minimize arbitrage losses while remaining competitive.

We introduce a novel scheme to train binary convolutional neural networks (CNNs) -- CNNs with weights and activations constrained to {-1,+1} at run-time. It has been known that using binary weights and activations drastically reduce memory size and accesses, and can replace arithmetic operations with more efficient bit…

2017-11-30abs ↗pdf ↗

Physics-constrained GP predicts material states under shockwave conditions.

problem Predicting material states under extreme shockwave conditions.
method Physics-constrained Gaussian Process regression with Rankine-Hugoniot constraints.
result Reproduces Hugoniot curves with satisfactory accuracy and uncertainty quantification.

Tail-Safe hedging uses reinforcement learning with a safety layer to manage financial risks.

problem Managing financial risks in derivatives trading with robustness and explainability.
method Combines distributional reinforcement learning with a CBF-QP safety layer to enforce financial constraints.
result Improves risk management without degrading central performance and avoids hard constraint violations.

Deep learning outperforms traditional methods in estimating OU process parameters.

problem Parameter estimation of the Ornstein-Uhlenbeck process is challenging.
method Used a multi-layer perceptron to estimate OU process parameters compared to traditional methods like Kalman filter and maximum likelihood estimation.
result Deep learning method outperforms traditional methods in parameter estimation of the OU process.

BTZSC benchmarks zero-shot text classification across diverse models.

problem Systematically comparing zero-shot text classification across various models.
method Comprehensive benchmark of 22 datasets, comparing NLI cross-encoders, embedding models, rerankers, and instruction-tuned LLMs.
result Rerankers and instruction-tuned LLMs outperform NLI cross-encoders, with rerankers setting a new state-of-the-art.

Deep learning estimates time-varying Markov model parameters.

problem Estimating time-dependent parameters in Markov models.
method Reframes parameter estimation as an optimization problem using maximum likelihood.
result Real solution close to SDE with neural network-derived parameters under specific conditions.

New method improves parameter estimation in complex stochastic models.

problem Parameter calibration in stochastic models with unavailable analytical likelihood.
method Gradient-based simulated parameter estimation with multi-time scale stochastic approximation.
result Enhanced estimation accuracy and reduced computational costs.