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

94189283377 · Jun 202019922001200920172026
48 results for single factor

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.

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.

The study examines how global economic policy uncertainty affects crude oil futures volatility.

problem Predicting crude oil futures volatility using global economic policy uncertainty.
method Established single-factor and two-factor models under the GARCH-MIDAS framework, tested with rolling-window and fixed-span specifications.
result GEPU changes have stronger predictive power than the GEPU index for crude oil futures volatility.

sgdGMF efficiently estimates generalized matrix factorization models for single-cell RNA sequencing data.

problem Challenges in dimensionality reduction for large single-cell RNA sequencing datasets.
method Scalable adaptive stochastic gradient descent algorithm for generalized matrix factorization models.
result sgdGMF outperforms existing methods in scalability and accuracy for large datasets.

We find that the CAPM fails to explain the small firm effect even if its non-parametric form is used which allows time-varying risk and non-linearity in the pricing function. Furthermore, the linearity of the CAPM can be rejected, thus the widely used risk and performance measures, the beta and the alpha, are biased an…

2017-03-28abs ↗pdf ↗

We carry out a Painlevé analysis to find the cases where the cohomogeneity one steady Ricci soliton equation can be integrable. We concentrate on two classes of solitons: warped products and complex line bundles over a Fano Kähler Einstein base. For warped products, the analysis singles out the case with one factor whe…

2018-02-28abs ↗pdf ↗

In this paper we examine the effect of applying ensemble learning to the performance of collaborative filtering methods. We present several systematic approaches for generating an ensemble of collaborative filtering models based on a single collaborative filtering algorithm (single-model or homogeneous ensemble). We pr…

2012-11-13abs ↗pdf ↗

Gibbs sampling is the de facto Markov chain Monte Carlo method used for inference and learning on large scale graphical models. For complicated factor graphs with lots of factors, the performance of Gibbs sampling can be limited by the computational cost of executing a single update step of the Markov chain. This cost …

2018-06-15abs ↗pdf ↗

We discuss constant mean curvature bubbletons in Euclidean 3-space via dressing with simple factors, and prove that single bubbletons are not embedded.

2010-10-29abs ↗pdf ↗

In this paper, we use replica analysis to investigate the influence of correlation among the return rates of assets on the solution of the portfolio optimization problem. We consider the behavior of the optimal solution for the case where the return rate is described with a single-factor model and compare the findings …

2017-04-05abs ↗pdf ↗

Paper presents a method for estimating long-term PDs with incomplete data.

problem Estimating long-term PDs with limited and incomplete historical data.
method Single risk factor approach for simultaneous calibration of PDs across sub-portfolios.
result Method yields long-term PDs without requiring complete historical data.

Paper tackles offline RL with weak assumptions on both function classes and data coverage.

problem Achieve sample-efficient offline RL with weak assumptions on both factors.
method Simple algorithm based on primal-dual formulation of MDPs, with density-ratio function modeling dual variables.
result Polynomial sample complexity achieved under realizability and single-policy concentrability.

An ideal cognitively-inspired memory system would compress and organize incoming items. The Kanerva Machine (Wu et al, 2018) is a Bayesian model that naturally implements online memory compression. However, the organization of the Kanerva Machine is limited by its use of a single Gaussian random matrix for storage. Her…

2020-02-06abs ↗pdf ↗

In this paper, we propose an online algorithm to compute matrix factorizations. Proposed algorithm updates the dictionary matrix and associated coefficients using a single observation at each time. The algorithm performs low-rank updates to dictionary matrix. We derive the algorithm by defining a simple objective funct…

2015-06-14abs ↗pdf ↗

Paper proposes C-STM for multimodal neuroimaging data classification.

problem Multimodal neuroimaging data fusion for better classification.
method Coupled Support Tensor Machine (C-STM) using latent factors from ACMTF.
result C-STM achieves better classification performance than single-mode classifiers.

The paper explores a Multi-Objective RL approach for trading that generalizes reward functions.

problem Improving performance in single-asset trading through adaptive reward functions.
method Developed a Multi-Objective Deep Reinforcement Learning algorithm to generalize reward functions and discount factors.
result The Multi-Objective algorithm demonstrates increased predictive stability and better performance in sparse reward scenarios.

Method for factor analysis in short panels without assuming sphericity or Gaussianity.

problem Factor analysis in short panels without assuming sphericity or Gaussianity.
method Pseudo maximum likelihood method and asymptotically uniformly most powerful invariant test.
result Systematic risk explains a large part of cross-sectional total variance in bear markets but is not spanned by observed factors.

New tests for identifying the number of latent factors in short panels with small time dimensions.

problem Determining the number of latent factors in short panels with small time dimensions.
method Eigenvalue tests based on variance-covariance matrices of asset returns, with assumptions on spherical errors or instrumental variables for factor betas.
result Established asymptotic distributional results and proposed a novel statistical test for weak factors.

Advances in molecular "omics'" technologies have motivated new methodology for the integration of multiple sources of high-content biomedical data. However, most statistical methods for integrating multiple data matrices only consider data shared vertically (one cohort on multiple platforms) or horizontally (different …

2019-06-09abs ↗pdf ↗

Authors improve accuracy analysis for portfolio optimization with multiple timescale factors.

problem Asymptotic accuracy of portfolio optimization approximations for general utility functions and two timescale factors.
method Construct sub- and super-solutions to fully nonlinear problem.
result Rigorous justification of accuracy for portfolio optimization with general utility functions and two timescale factors.

We extend some results of [BF12] on subfactor projections to show that the projection of a free factor B to the free factor complex of the free factor A is well-defined with uniformly bound diameter, unless either A is contained in B or A and B are vertex stabilizers of a single splitting of F_n, i.e. they are disjoint…

2013-07-04abs ↗pdf ↗

In this article, we explore a class of tractable interest rate models that have the property that the price of a zero-coupon bond can be expressed as a polynomial of a state diffusion process. Our results include a classification of all such time-homogeneous single-factor models in the spirit of Filipovic's maximal deg…

2015-04-13abs ↗pdf ↗

Paper introduces methods to create fair and accurate regression models.

problem Creating fair and accurate regression models.
method Mixed-integer optimization methods, exact formulations, branch-and-bound algorithm, coordinate descent algorithm.
result Developed methods produce fair and accurate models with reduced training times.

In risk management it is desirable to grasp the essential statistical features of a time series representing a risk factor. This tutorial aims to introduce a number of different stochastic processes that can help in grasping the essential features of risk factors describing different asset classes or behaviors. This pa…

2008-12-22abs ↗pdf ↗

A new method uncovers discrete and continuous factors in gene expression data.

problem Jointly identifying discrete and continuous factors of variability without supervision.
method cpl-mixVAE framework using multiple interacting networks.
result The method successfully uncovers discrete and continuous factors in gene expression data.

Proposes MD-LiNA for multi-domain latent factor causal discovery.

problem Discovering causal structures among latent factors from multi-domain data.
method Multi-Domain Linear Non-Gaussian Acyclic Models (MD-LiNA) with an integrated two-phase algorithm.
result Locally consistent estimators of causal structure among shared latent factors.

This paper analyzes privacy threats in federated matrix factorization.

problem Privacy threats in federated matrix factorization models.
method Categorizes federated matrix factorization into three types and analyzes privacy threats.
result This is the first study of privacy threats in federated matrix factorization.

Paper analyzes asymmetry in LoRA initialization for foundation models.

problem Asymmetry in LoRA initialization affects generalization of foundation models.
method Theoretical analysis of asymmetric LoRA with frozen random factors.
result Upper bound on sample complexity of $ ilde{\mathcal{O}}\left(\frac{\sqrt{r}}{\sqrt{N}} ight)$ with high probability.

We improve private training accuracy with learning rate schedules and matrix factorizations.

problem Private training with learning rate schedules and correlated noise.
method General upper and lower bounds for learning rate schedules, memory-efficient constructions, and schedule-aware factorizations.
result Schedule-aware factorizations improve accuracy in private training.

New method disentangles shared and private latent factors in multimodal data.

problem Challenges in disentangling shared and private latent factors in multimodal data.
method Proposes a modification to existing multimodal Variational Autoencoders (MMVAE) to better handle modality-specific variation.
result Demonstrates improved robustness of modified MMVAE to modality-specific variation.

The problem of portfolio allocation in the context of stocks evolving in random environments, that is with volatility and returns depending on random factors, has attracted a lot of attention. The problem of maximizing a power utility at a terminal time with only one random factor can be linearized thanks to a classica…

2019-08-20abs ↗pdf ↗

Proposes CSG model to separate semantic and variation factors for OOD prediction.

problem Out-of-distribution examples cause conventional models to mix semantic and variation factors, leading to poor performance.
method Causal Semantic Generative model (CSG) based on causal reasoning, using variational Bayes for efficient learning and prediction.
result CSG can identify semantic factor and improve OOD prediction performance.