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

Trend · papers per month

153305458610 · Jun 202019922001200920172026
48 results for non-linear factor structure

DPLS improves asset pricing by capturing non-linear risk factor structures.

problem Estimating asset pricing models with non-linear risk factor structures.
method Deep Partial Least Squares (DPLS) for dynamic and flexible factor modeling.
result DPLS models outperform linear models in asset pricing, capturing non-linear risk factor interactions.

A neural network model tackles high-dimensional data with latent structures.

problem Modeling high-dimensional data with latent low-dimensional structures.
method Integrates PCA and Soft PCA layers into neural network architecture for factor modeling and non-linear transformations.
result Demonstrates improved performance in forecasting and nowcasting with real-world data.

Paper uses non-linear dimension reduction for better economic forecasting.

problem Analyzing economic effects of shocks in large datasets.
method Non-linear dimension reduction in factor-augmented vector autoregressions.
result Non-linear dimension reduction techniques improve forecasting, especially in volatile data.

The aim of our work is to propose a natural framework to account for all the empirically known properties of the multivariate distribution of stock returns. We define and study a "nested factor model", where the linear factors part is standard, but where the log-volatility of the linear factors and of the residuals are…

2013-09-12abs ↗pdf ↗

Matrix completion works well for smooth non-linear structures, even without low-rank assumptions.

problem Matrix completion for smooth non-linear structures.
method Nuclear-norm penalization for matrices lying in a low-dimensional non-linear manifold.
result Nuclear-norm penalization is minimax rate optimal for recovering smooth non-linear matrices with missing data.

Develops polynomial diffusion models for multi-factor commodity futures dynamics.

problem Modeling futures prices using latent state variables for short and long-term stochastic factors.
method Polynomial diffusion models to incorporate non-linear effects, two filtering methods for estimation.
result Accurate estimation of futures prices despite parameter identification issues in polynomial diffusion models.

A new model explains asset returns with a single factor, improving cross-sectional performance.

problem Understanding the cross-section of asset returns with complex models.
method Proposes a non-linear single-factor asset pricing model with a nonparametric link function estimated jointly with sieve-based estimators.
result The model delivers superior cross-sectional performance with a low-dimensional approximation of the link function.

A systematic algorithm for building integrating factors of the form mu(x,y') or mu(y,y') for non-linear second order ODEs is presented. When such an integrating factor exists, the algorithm determines it without solving any differential equations. Examples of ODEs not having point symmetries are shown to be solvable us…

1997-11-27abs ↗pdf ↗

Paper introduces non-linear discounting models for default compensation and climate valuation.

problem Valuation of non-replicable value and damage under default risk.
method Develops two models: one for risk-neutralising discounting and another for survival probability dependent discounting.
result Non-decaying discount factors (negative discount rates) are possible under certain scenarios.

Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made toward this emerging research area. However, there are several fundamental problems that remain open. First, existing methods fail to preser…

2019-05-16abs ↗pdf ↗

Paper presents a deep learning method for estimating asset return precision matrices in noisy financial markets.

problem Estimating precision matrices of asset returns in low signal-to-noise ratio environments.
method Non-linear factor model within deep learning framework, consistent estimator with error covariance estimator.
result Superior accuracy in simulations and empirical data.

In this article, we study a generalisation of the Seiberg-Witten equations, replacing the spinor representation with a hyperKahler manifold equipped with certain symmetries. Central to this is the construction of a (non-linear) Dirac operator acting on the sections of the non-linear fibre-bundle. For hyperKahler manifo…

2017-06-06abs ↗pdf ↗

Unified model learns joint and individual features from brain imaging data.

problem Integrating structural and functional connectivity data for behavioral phenotypes.
method Cross-Modal Joint-Individual Variational Network (CM-JIVNet) with multi-head attention fusion.
result CM-JIVNet outperforms in cross-modal reconstruction and behavioral trait prediction.

We propose rectified factor networks (RFNs) to efficiently construct very sparse, non-linear, high-dimensional representations of the input. RFN models identify rare and small events in the input, have a low interference between code units, have a small reconstruction error, and explain the data covariance structure. R…

2015-02-23abs ↗pdf ↗

Kernel clustering algorithm improved for large datasets using incomplete Cholesky factorization.

problem Large memory usage in kernel-based clustering for large-scale datasets.
method Approximate the kernel matrix using incomplete Cholesky factorization and apply linear kk-means clustering.
result The proposed method achieves similar performance to kernel kk-means clustering but handles large-scale datasets efficiently.

We consider a stochastic factor financial model where the asset price process and the process for the stochastic factor depend on an observable Markov chain and exhibit an affine structure. We are faced with a finite time investment horizon and derive optimal dynamic investment strategies that maximize the investor's e…

2014-03-20abs ↗pdf ↗

Regression Trees analyze stock returns, revealing market excess return as the most informative factor.

problem Understanding informational content of three factors in stock returns.
method Joint regression tree analysis of daily stock return data for 5 major US corporations.
result The market excess return factor is always the most informative in all cases (solo and joint).

A new method STMF improves missing value prediction using tropical semiring.

problem Limited capability of linear models to model complex relations.
method Sparse Tropical Matrix Factorization (STMF) using tropical semiring.
result STMF outperforms NMF on real data, especially in handling extreme values.

New method uses reinforcement learning to sample from complex data structures efficiently.

problem Constructing reliable samples from high-dimensional polytopes for goodness-of-fit tests.
method Markov decision process and reinforcement learning for sampling.
result Demonstrated scalable tools from linear algebra for theoretical guarantees in non-linear algebra context.

Exploiting low-rank structure of the user-item rating matrix has been the crux of many recommendation engines. However, existing recommendation engines force raters with heterogeneous behavior profiles to map their intrinsic rating scales to a common rating scale (e.g. 1-5). This non-linear transformation of the rating…

2018-10-31abs ↗pdf ↗

Matrix completion aims to predict missing elements in a partially observed data matrix which in typical applications, such as collaborative filtering, is large and extremely sparsely observed. A standard solution is matrix factorization, which predicts unobserved entries as linear combinations of latent variables. We g…

2019-07-31abs ↗pdf ↗

Deep tensor factorization benefits from implicit regularization with polynomial growth.

problem Tensor factorization's implicit regularization effect in deep networks is not well understood.
method Investigated the implicit regularization in deep tensor factorization, showing polynomial growth.
result Implicit regularization in deep tensor factorization grows polynomially with depth, improving estimation accuracy and convergence.

Develops a deep multi-factor model for factor investing with clear financial insights.

problem Lack of interpretability and unclear financial insights in non-linear factor models.
method Industry and market neutralization modules, graph attention modules, factor-attention module.
result Demonstrates effectiveness in factor investing with real-world stock market data.

In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully Bayesian hierarchy for …

2010-04-29abs ↗pdf ↗

Adaptive NN method improves matrix completion for non-smooth data.

problem Matrix completion with non-smooth non-linear functions under high missingness.
method Two-sided nearest neighbors with \Holder function class non-linearity.
result NN error rate matches oracle's for latent factors, non-trivial for wide range of missingness.

Proves energy estimates for tensorial wave equations, decoupling components for stability proof.

problem Proving stability of (1+3)(1+3)-Minkowski space-time with various non-linearities.
method Decouples energy estimates for tensorial wave equations, exploiting tensorial structure and Lie derivatives.
result Decoupled energy estimates for tensorial solutions, allowing new stability proofs.

Quantum computing offers a quadratic speedup for estimating non-linear functionals.

problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.

Paper introduces non-linearity signature to measure deep neural network performance.

problem Difficulty in explaining performance differences among similar DNN architectures.
method Affine Optimal Transport mappings to measure non-linearity.
result Signature provides better understanding of DNN inner workings.

A risk-averse agent hedges her exposure to a non-tradable risk factor UU using a correlated traded asset SS and accounts for the impact of her trades on both factors. The effect of the agent's trades on UU is referred to as cross-impact. By solving the agent's stochastic control problem, we obtain a closed-form expr…

2019-07-31abs ↗pdf ↗

We propose a new notion of `non-linearity' of a network layer with respect to an input batch that is based on its proximity to a linear system, which is reflected in the non-negative rank of the activation matrix. We measure this non-linearity by applying non-negative factorization to the activation matrix. Considering…

2018-10-08abs ↗pdf ↗

Deep fundamental factor models are developed to automatically capture non-linearity and interaction effects in factor modeling. Uncertainty quantification provides interpretability with interval estimation, ranking of factor importances and estimation of interaction effects. With no hidden layers we recover a linear fa…

2019-03-18abs ↗pdf ↗

Neural networks outperform single-hour models in day-ahead electricity price forecasting.

problem Improving accuracy in day-ahead electricity price forecasting.
method Compared two neural network structures: one-hour models and daily auction models.
result Daily auction models outperform one-hour models in forecasting accuracy.

Learning by integrating multiple heterogeneous data sources is a common requirement in many tasks. Collective Matrix Factorization (CMF) is a technique to learn shared latent representations from arbitrary collections of matrices. It can be used to simultaneously complete one or more matrices, for predicting the unknow…

2018-11-28abs ↗pdf ↗

Multitask learning algorithms are typically designed assuming some fixed, a priori known latent structure shared by all the tasks. However, it is usually unclear what type of latent task structure is the most appropriate for a given multitask learning problem. Ideally, the "right" latent task structure should be learne…

2012-06-27abs ↗pdf ↗