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

2.4%4.8%7.1%9.5% · Sep 199619922001200920172026
48 results for Factor-based averaging

Hybrid approach improves probabilistic forecasts for electricity trading.

problem Improving probabilistic forecasts for electricity trading markets.
method Combines QRA and factor-based averaging for probabilistic forecasting.
result The hybrid approach outperforms benchmarks in statistical measures and economic value.

Machine learning factors outperform traditional portfolio optimization methods.

problem Comparing machine learning and traditional portfolio optimization methods.
method Examined machine learning and factor-based portfolio optimization using autoencoder neural networks and dimensionality reduction techniques.
result Minimum-variance portfolios using latent factors derived from autoencoders and sparse methods outperform simpler benchmarks in risk minimization.

We consider the problem of identifying current coupons for Agency backed To-be-Announced (TBA) Mortgage Backed Securities. In a doubly stochastic factor based model which allows for prepayment intensities to depend upon current and origination mortgage rates, as well as underlying investment factors, we identify the cu…

2015-10-07abs ↗pdf ↗

A theoretical framework for non-negative matrix factorization based on generalized dual Kullback-Leibler divergence, which includes members of the exponential family of models, is proposed. A family of algorithms is developed using this framework and its convergence proven using the Expectation-Maximization algorithm. …

2019-05-16abs ↗pdf ↗

Unified framework combines views and optimization for better portfolio management.

problem Optimizing portfolio weights with dynamic adjustment based on volatility.
method Dynamic sliding window adjusting horizon, factor estimates, BL posterior returns, and weights over time.
result Outperforms dynamic mean-variance optimization without BL views, providing stronger downside risk control.

New method for identifying causal relationships in financial time series data.

problem Identifying causal relationships in nonstationary financial time series data.
method Refined constraint-based causal discovery algorithm (CD-NOTS) for nonstationary time series data.
result CD-NOTS effectively identifies causal connections in financial applications.

We propose a nonparametric Bayesian factor regression model that accounts for uncertainty in the number of factors, and the relationship between factors. To accomplish this, we propose a sparse variant of the Indian Buffet Process and couple this with a hierarchical model over factors, based on Kingman's coalescent. We…

2009-08-05abs ↗pdf ↗

Alpha-R1 uses LLMs to reason about economic factors and news for better alpha screening.

problem Challenges in data-driven investment strategies due to signal decay and regime shifts.
method Reinforcement learning trained on 8B parameters to evaluate alpha relevance under changing market conditions.
result Empirically outperforms benchmark strategies and shows improved robustness to alpha decay.

This paper investigates Shampoo's heuristics and decouples preconditioner updates.

problem Improving Shampoo's heuristics for training neural networks.
method Decomposing preconditioner updates, correcting eigenvalues, and adapting eigenbasis computation frequency.
result Principled techniques to remove Shampoo's heuristics and improve training algorithms.

A new method for robust matrix completion overcomes limitations of existing approaches.

problem Robust matrix completion from corrupted entries, especially under overparameterization and ill-conditioning.
method Factorization-based iterative algorithm combining Gauss-Newton linearization and outlier removal.
result Theoretical guarantees of exact recovery for suitable assumptions.

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).

Gradient descent achieves exact linear convergence rate for symmetric matrix completion.

problem Low-rank symmetric matrix completion using gradient descent.
method Local analysis of gradient descent for symmetric matrices without additional assumptions.
result Closed-form expression of exact linear convergence rate matches practice.

The paper analyzes DeepWalk and node2vec for community detection in stochastic blockmodels.

problem Theoretical understanding of community detection in stochastic blockmodels.
method Matrix factorization perspective on DeepWalk and node2vec.
result Node2vec and DeepWalk can perfectly recover community memberships in sparse graphs.

Robust principal component analysis (RPCA) has been widely used for recovering low-rank matrices in many data mining and machine learning problems. It separates a data matrix into a low-rank part and a sparse part. The convex approach has been well studied in the literature. However, state-of-the-art algorithms for the…

2016-09-27abs ↗pdf ↗

Many machine learning algorithms require precise estimates of covariance matrices. The sample covariance matrix performs poorly in high-dimensional settings, which has stimulated the development of alternative methods, the majority based on factor models and shrinkage. Recent work of Ledoit and Wolf has extended the sh…

2016-11-02abs ↗pdf ↗

Matrix factorization methods are extensively employed to understand complex data. In this paper, we introduce the cross-product penalized component analysis (XCAN), a sparse matrix factorization based on the optimization of a loss function that allows a trade-off between variance maximization and structural preservatio…

2019-06-28abs ↗pdf ↗

We propose a framework for constructing factor models for alpha streams. Our motivation is threefold. 1) When the number of alphas is large, the sample covariance matrix is singular. 2) Its out-of-sample stability is challenging. 3) Optimization of investment allocation into alpha streams can be tractable for a factor …

2014-06-13abs ↗pdf ↗

Novel approach for SEM in small samples with p>np>n.

problem Small sample size and p>np>n issues in factor-based SEM.
method Reformulates covariance structure into self-covariance and cross-covariance, defines a feasible set with relative error constraint.
result Improved stability and directional information in small-sample settings.

We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of "best influencers" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the i…

2019-06-09abs ↗pdf ↗

Proposes an end-to-end deep learning framework for active investing.

problem Constructing an active investment portfolio via deep learning.
method End-to-end deep learning framework covering factor selection, combination, stock selection, and portfolio construction.
result Demonstrates effectiveness of E2E deep learning framework in active investing.

New approach models individual vitality for better mortality predictions.

problem Limited ability of existing mortality models to capture individual complexity.
method Developed a four-component framework for individual vitality dynamics.
result Demonstrates improved analytical and practical outcomes in life insurance and lifetime decision-making.

Proposes a method to cluster multi-aspect data using manifold learning with NMF.

problem Clustering multi-aspect data with diverse features and views.
method Includes inter-manifold learning in NMF framework to handle different data types.
result The method improves clustering accuracy and efficiency on various datasets.

Multi-view clustering aims at integrating complementary information from multiple heterogeneous views to improve clustering results. Existing multi-view clustering solutions can only output a single clustering of the data. Due to their multiplicity, multi-view data, can have different groupings that are reasonable and …

2019-11-26abs ↗pdf ↗

Framework uses LLMs to automate strategy finding in quantitative finance.

problem Brittleness of traditional deep learning models in financial applications.
method Three-stage framework with prompt-engineered LLMs, multimodal agent-based evaluation, and dynamic weight optimization.
result Robust performance in Chinese & US markets, superior risk-adjusted performance.

Many successful methods have been proposed for learning low dimensional representations on large-scale networks, while almost all existing methods are designed in inseparable processes, learning embeddings for entire networks even when only a small proportion of nodes are of interest. This leads to great inconvenience,…

2018-11-14abs ↗pdf ↗

Paper proposes a fast algorithm to recover causal DAGs with latent variables.

problem Discovering causal relationships in the presence of latent variables.
method Cholesky factorization of covariance matrix with optimization for latent variables.
result The algorithm significantly outperforms previous methods in synthetic and real-world datasets.

Recently, matrix factorization-based recommendation methods have been criticized for the problem raised by the triangle inequality violation. Although several metric learning-based approaches have been proposed to overcome this issue, existing approaches typically project each user to a single point in the metric space…

2019-06-04abs ↗pdf ↗

A new model optimizes portfolios by learning stock return distributions conditioned on factors.

problem Optimizing portfolios with high-dimensional asset-specific factors.
method Conditional Diffusion Transformer architecture linking each asset's return to its factor vector.
result The model outperforms benchmarks in mean-variance and mean-CVaR optimization.

Paper defines conditions for feasible correlation matrices from factor structures.

problem Feasibility of option implied correlation matrices in non-FX markets.
method Quantitative and economic approaches to solve the nearest correlation matrix problem.
result Introduces methods to ensure feasible correlation matrices from factor structures.

The paper introduces recklessness to improve recommendation quality and quantity.

problem The reliability/coverage dilemma in recommender systems limits the number of recommended items.
method Incorporates a new term (recklessness) into matrix factorization-based recommender systems to address the dilemma.
result Recklessness improves the quantity and quality of recommendations by allowing for risk regulation.

Learning from multiple-relational data which contains noise, ambiguities, or duplicate entities is essential to a wide range of applications such as statistical inference based on Web Linked Data, recommender systems, computational biology, and natural language processing. These tasks usually require working with very …

2016-04-03abs ↗pdf ↗