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

Trend · papers per month

295786114 · May 202619922001200920172026
48 results for DSEx Broad Index

Quantum SVM improves financial data classification.

problem Classifying financial data using quantum machine learning.
method Application of quantum kernels to financial data, specifically DSEx Broad Index.
result Empirical quantum advantage demonstrated for financial data classification.

Investigates the relationship between US money supply and asset indices over 2001-2019.

problem Determining the relationship between US money supply and asset indices growth.
method Information entropy methodology applied to US asset indices (Property, Russell 2000, S&P 500, NASDAQ) over 2001-2019.
result Growth in US broad money supply is the main determinant of US asset indices growth, especially the NASDAQ and Russell 2000.

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…

2015-10-13abs ↗pdf ↗

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.

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 …

2019-12-16abs ↗pdf ↗

SGD shows distinct phases in learning single-index models, achieving optimal sample complexity and regret.

problem Learning single-index models with SGD in adaptive data settings.
method Stochastic gradient descent (SGD) with an optimal learning rate schedule.
result SGD achieves near-optimal sample complexity and regret guarantees across both burn-in and learning phases.

Efficiently learns Single-Index Models with constant factor approximation.

problem Learning Single-Index Models under L22L_2^2 loss with unknown link functions.
method An efficient algorithm using alignment sharpness for optimization.
result Achieves constant factor approximation to optimal loss for various distributions and link functions.

Noise Sensitivity Exponent controls statistical-computational gaps in learning.

problem Understanding when learning is statistically possible yet computationally hard in high-dimensional statistics.
method Investigating statistical-computational gaps in single- and multi-index models using Noise Sensitivity Exponent.
result Noise Sensitivity Exponent governs statistical-computational gaps in high-dimensional learning.

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…

2017-03-12abs ↗pdf ↗

New framework limits SGD for multi-index models, addressing SQ framework shortcomings.

problem Limitations of SGD for multi-index models beyond SQ framework.
method Developed a new non-SQ framework to study SGD limitations for single-index and multi-index models.
result Applies to broad settings and architectures, including neural networks.

Post-estimation smoothing improves prediction accuracy with structural indices.

problem Using natural structural indices in machine learning without losing robustness.
method A post-estimation smoothing operator that separates from the original predictor.
result Post-estimation smoothing improves accuracy over original predictors under simple conditions.

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…

2002-07-16abs ↗pdf ↗

Proposes a transfer learning framework for sparse SIMs without raw source data.

problem Lack of direct access to raw source data and known link functions in transfer learning.
method Source-data-free framework based on SIM, using summary statistics and a multilayer perceptron.
result Consistent improvements over existing approaches in synthetic and real-world data.

Study shows computational and statistical gaps in Gaussian Single-Index Models.

problem Statistical and computational trade-offs in high-dimensional regression problems.
method Analysis of SQ and LDP frameworks, partial-trace algorithm.
result Computational algorithms require significantly more samples than information-theoretic limits.

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.

Investigate using LETFs to outperform benchmarks, finding them more likely to succeed.

problem The controversy and popularity of LETFs in constructing portfolios.
method Systematic investigation using IR-optimal strategies with LETFs and VETFs, including neural network-based approaches.
result IR-optimal strategies with LETFs outperform benchmarks and achieve partial stochastic dominance.

Study forecasts U.S. bond index using deep learning, finding persistence is key.

problem Forecasting U.S. aggregate bond index with deep learning methods.
method Constructed a stationary but maximally persistent representation of the bond index, evaluated using MLPs and CNNs.
result Deep learning models outperform traditional methods in short-horizon forecasting of bond indices.

Neural networks can achieve optimal sample complexity for learning single-index models.

problem Achieving optimal computational-statistical tradeoff in learning Gaussian single-index models.
method Unified gradient-based algorithm for training a two-layer neural network, adaptable to various loss and activation functions.
result Sample complexity of ds/2dd^{s^\star/2} \lor d matches the SQ lower bound up to a polylogarithmic factor.

New algorithms for generalized linear bandits with unknown reward functions.

problem Misspecification of reward functions in existing bandit algorithms.
method Introducing single index bandits, proposing STOR, ESTOR, and GSTOR algorithms.
result Achieved nearly optimal regret bound of ildeOT(T) ilde{O}_T(\sqrt{T}).

Study evaluates three position sizing methods for put-writing on S&P 500 Index options.

problem Underdeveloped practical implementation of short-dated volatility-selling strategies.
method Kelly criterion, VIX-based volatility scaling, hybrid method.
result Ultra-short-dated, out-of-the-money options deliver superior risk-adjusted returns.

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…

2018-04-04abs ↗pdf ↗

Market dynamic is quantified in terms of the entropy S(τ,n)S(τ,n) of the clusters formed by the intersections between the series of the prices ptp_t and the moving average p~t,n\widetilde{p}_{t,n}. The entropy S(τ,n)S(τ,n) is defined according to Shannon as P(τ,n)logP(τ,n),\sum P(τ,n)\log P(τ,n), with P(τ,n)P(τ,n) the probability for the cluster t…

2019-08-01abs ↗pdf ↗

Optimal control problems on Riemannian manifolds are solved by penalizing constraint violations.

problem Optimal control problems with velocity constraints on Riemannian manifolds.
method Penalizing constraint violations and showing convergence to hard-constrained solutions.
result Solutions to soft-constrained problems converge to solutions of hard-constrained problems as penalty parameter increases.

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…

2018-01-23abs ↗pdf ↗

Unified algebraic framework for virtual braid structures with strong structural consequences.

problem Unified algebraic framework for virtual braid structures with various types of crossings.
method Introducing the universal virtual braid group UVn(c)UV_n(c) and proving its properties.
result Strong structural consequences including residual finiteness, linearity, and solvability of conjugacy problems.

SurvFD and SurvSHAP-IQ provide interpretable survival models by analyzing feature interactions.

problem Non-additivity of hazard and survival functions limits standard additive explanation methods.
method SurvFD decomposes higher-order effects into time-dependent and time-independent components, extending Shapley interactions to time-indexed functions.
result SurvFD and SurvSHAP-IQ offer a new perspective on survival explanations, explicitly characterizing feature interactions.

The paper models US inflation and hyperinflation using monetary and GDP data.

problem Understanding and predicting inflation and hyperinflation.
method Developed economic models to predict US CPI growth based on BMS, GDP, and savings.
result An exact relationship between CPI growth and BMS growth minus GDP and savings growth was found, with a residual term.

Investigates if adding cryptocurrencies to German portfolios diversifies better, finding mixed results.

problem Improving diversification in German investor portfolios using cryptocurrencies.
method Portfolio analysis with descriptive statistics, graphical methods, and econometric spanning tests, using a customized EWCI.
result Cryptocurrencies can improve diversification in some windows but not as a normal case.

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…

2018-04-03abs ↗pdf ↗

Three-layer networks learn complex hierarchical polynomials of multiple nonlinear features.

problem Understanding how neural networks learn hierarchical features of multiple nonlinear inputs.
method Examine a broad class of functions using three-layer neural networks, showing complete recovery and efficient learning.
result Three-layer neural networks trained via gradient descent can learn hierarchical polynomials of multiple nonlinear features efficiently.

Estimates crypto risk premia using hidden factors and finds significant integration with traditional markets.

problem Estimating risk premia in cryptocurrency returns.
method Giglio-Xiu (2021) three-pass approach, controlling for latent factors and non-tradable state variables.
result Latent factors significantly impact crypto returns, highlighting the importance of controlling for unobserved risks.

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…

2017-05-09abs ↗pdf ↗

IndexGAN predicts stock trends using GAN with expert knowledge and news context.

problem Inaccurate stock prediction due to market complexity and limitations of existing GANs.
method Wasserstein GAN framework for multi-step prediction, incorporating news context and market sentiment.
result Superior performance on real-world broad-based indices compared to state-of-the-art baselines.

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.