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.
We develop a simple stock selection model to explain why active equity managers tend to underperform a benchmark index. We motivate our model with the empirical observation that the best performing stocks in a broad market index often perform much better than the other stocks in the index. Randomly selecting a subset o…
This paper reviews and analyzes various modeling approaches for financial index tracking.
problem Efficient replication of market index performance in financial markets.
method Categorization into three frameworks: optimization, statistical, and machine learning; empirical study on S&P 500 dataset.
result Optimization-based models deliver the most precise index tracking, statistical-based models achieve the strongest return-risk balance, and data-driven models provide competitive performance.
Real Estate Investment Trusts (REITs) are the only truly liquid assets related to real estate investments. We study the behavior of U.S. REITs over the past three decades and document their return characteristics. REITs have somewhat less market risk than equity; their betas against a broad market index average about .…
In this paper, we explore the limitations of PCA as a dimension reduction technique and study its extension, projection pursuit (PP), which is a broad class of linear dimension reduction methods. We first discuss the relevant concepts and theorems and then apply PCA and PP (with negative standardized Shannon's entropy …
We establish multiplicity results for geometrically distinct contractible closed Reeb orbits of non-degenerate contact forms on a broad class of prequantization bundles. The results hold under certain index requirements on the contact form and are sharp for unit cotangent bundles of CROSS's. In particular, we generaliz…
Recently we reported on an application of the Tsallis non-extensive statistics to the S&P500 stock index. There we argued that the statistics are applicable to a broad range of markets and exchanges where anamolous (super) diffusion and 'heavy' tails of the distribution are present, as they are in the S&P500. We have c…
Highly accurate interval forecasting of a stock price index is fundamental to successfully making a profit when making investment decisions, by providing a range of values rather than a point estimate. In this study, we investigate the possibility of forecasting an interval-valued stock price index series over short an…
Despite the advances of deep learning in specific tasks using images, the principled assessment of image fidelity and similarity is still a critical ability to develop. As it has been shown that Mean Squared Error (MSE) is insufficient for this task, other measures have been developed with one of the most effective bei…
We recently showed that the S&P500 stock market index is well described by Tsallis non-extensive statistics and nonlinear Fokker-Planck time evolution. We argued that these results should be applicable to a broad range of markets and exchanges where anomalous diffusion and `heavy' tails of the distribution are present.…
New algorithms learn multi-index models via harmonic analysis, achieving statistical and computational trade-offs.
problem Learning multi-index models with unknown projections of input data.
method Exploiting the equivariance of the problem under the orthogonal group, we derive lower bounds and construct spectral algorithms based on harmonic tensor unfolding.
result Achieve statistical and computational trade-offs between sample and runtime complexity.
Many introductory courses in quantum mechanics include Feynman's time-slicing definition of the path integral, with a complete derivation of the propagator in the simplest of cases. However, attempts to generalize this, for instance to non-quadratic potentials, encounter formidable analytic issues in showing the succes…
A well-interpretable measure of information has been recently proposed based on a partition obtained by intersecting a random sequence with its moving average. The partition yields disjoint sets of the sequence, which are then ranked according to their size to form a probability distribution function and finally fed in…
We develop a pricing model for Sovereign Contingent Convertible bonds (S-CoCo) with payment standstills triggered by a sovereign's Credit Default Swap (CDS) spread. We model CDS spread regime switching, which is prevalent during crises, as a hidden Markov process, coupled with a mean-reverting stochastic process of spr…
Market dynamic is quantified in terms of the entropy S(τ,n) of the clusters formed by the intersections between the series of the prices pt and the moving average pt,n. The entropy S(τ,n) is defined according to Shannon as ∑P(τ,n)logP(τ,n), with P(τ,n) the probability for the cluster t…
The proximal inertial gradient descent is efficient for the composite minimization and applicable for broad of machine learning problems. In this paper, we revisit the computational complexity of this algorithm and present other novel results, especially on the convergence rates of the objective function values. The no…
In this paper, we propose Broad Neural Architecture Search (BNAS) where we elaborately design broad scalable architecture dubbed Broad Convolutional Neural Network (BCNN) to solve the above issue. On one hand, the proposed broad scalable architecture has fast training speed due to its shallow topology. Moreover, we als…
We consider in this paper some structured financial products, known as reverse convertible notes, that resulted in substantial losses to certain buyers of these notes in recent years. We shall focus on specific reverse convertible notes known as "Autocallable Optimization Securities with Contingent Protection Linked to…
A semi-parametric, non-linear regression model in the presence of latent variables is introduced. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex networked system. This new formulation allows joint estimation of certain non-linearities in the system, the direct interaction…
skscope simplifies sparsity-constrained optimization in Python.
problem Tedious mathematical deduction and programming for sparsity-constrained optimization.
method Introduces skscope, a Python library that allows users to solve sparsity-constrained optimization problems by just programming the objective function.
result skscope enables state-of-the-art solvers to quickly attain sparse solutions in high-dimensional spaces, achieving up to 80x speedup.