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.

169,181 papers · 148 categories

Trend · papers per month

1.7%3.4%5.1%6.8% · Jan 199819922001200920182026
48 results for threshold-based portfolios

Develops a new method for building data-driven portfolios with a target risk-return.

problem Building a portfolio with a specific risk-return level.
method Applies LSTM to select the best predictor for portfolio construction and uses predictive threshold-based portfolios (TBPs) to target specific risk-return levels.
result Thresholds play a dominant role in characterizing risk, return, and prediction accuracy of the subset.

The paper examines fairness issues in decision-making systems when protected class labels are unobserved.

problem Fairness assessment challenges when protected class labels are unavailable.
method Decomposes biases in estimating outcome disparity via threshold-based imputation and proposes a weighted estimator.
result Threshold-based imputation generally overestimates disparities, while the weighted estimator has a simpler negative bias.

We study ranking quantilized mean-field games to select top-performing agents.

problem Selecting top-performing agents in competitive scenarios.
method Developed two formulations: target-based and threshold-based, and provided analytic and semi-explicit solutions.
result Analytic and semi-explicit solutions for quantilized mean-field consistency conditions.

Proposes a framework to explain KS deterioration in credit risk models.

problem Inconsistent and ad hoc diagnosis of KS decline in credit risk models.
method Counterfactual diagnostic framework attributing KS decline to sampling variability, portfolio composition, covariate shift, and residual deterioration.
result The proposed approach provides more interpretable and governance-relevant explanations than threshold-based review alone.

Study online learning with feedback graphs and switching costs, providing algorithms and optimal regret bounds.

problem Online learning with partial feedback and switching costs.
method Analysis of feedback graphs, lower bound on expected regret, new algorithms (Threshold Based EXP3, EXP3. SC).
result Order optimal algorithms for specific cases and Threshold Based EXP3 outperforms in empirical evaluations.

Subspace clustering refers to the problem of clustering high-dimensional data points into a union of low-dimensional linear subspaces, where the number of subspaces, their dimensions and orientations are all unknown. In this paper, we propose a variation of the recently introduced thresholding-based subspace clustering…

2014-03-13abs ↗pdf ↗

This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both alg…

2015-09-22abs ↗pdf ↗

New algorithm achieves almost exact graph matching in almost quadratic time.

problem Graph matching under correlated Erdős-Rényi models.
method Rank-based graph matching using local tree correlation tests.
result Achieves almost exact recovery in almost quadratic time complexity.

We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm intr…

2013-05-15abs ↗pdf ↗

We consider the problem of online active learning to collect data for regression modeling. Specifically, we consider a decision maker with a limited experimentation budget who must efficiently learn an underlying linear population model. Our main contribution is a novel threshold-based algorithm for selection of most i…

2016-02-09abs ↗pdf ↗

A privacy-preserving algorithm for high-dimensional bandits.

problem High-dimensional stochastic contextual linear bandits with sparse parameters under privacy constraints.
method PrivateLASSO algorithm based on sparse hard-thresholding and episodic thresholding.
result Minimax private lower bounds and utility guarantees for PrivateLASSO.

A class of heterogeneous agent models is investigated where investors switch trading position whenever their motivation to do so exceeds some critical threshold. These motivations can be psychological in nature or reflect behaviour suggested by the efficient market hypothesis (EMH). By introducing different propensitie…

2006-07-31abs ↗pdf ↗

Study evaluates thresholds for removing noise from DNN weights using random matrix theory.

problem Removing noise from deep neural network weights for better approximation.
method Model weights as signal + noise, use random matrix theory to estimate thresholds, evaluate using cosine similarity.
result Proposed threshold estimation method improves approximation quality.

SplitWise enhances stepwise regression by adaptively encoding numeric predictors into binary features.

problem Capturing nonlinear relationships in regression models without sacrificing interpretability.
method Adaptive encoding of numeric predictors into binary features using shallow decision trees, assessed by AIC or BIC.
result Consistently produces more parsimonious and generalizable models than traditional techniques.

This paper compares three portfolio designs for Indian stocks.

problem Designing an optimum portfolio that balances return and risk.
method Three approaches: minimum risk, optimum risk, and Eigen portfolios.
result Optimum risk portfolios and Eigen portfolios identified for each sector.

Detecting edge correlation between two graphs sharpens a threshold based on densest subgraph.

problem Detecting edge correlation between two Erdős-Rényi graphs.
method Formulated as a hypothesis testing problem, connecting to densest subgraph detection.
result Sharp information-theoretic threshold established for edge correlation detection.

Project predicts stock prices for robust portfolio design in Indian sectors.

problem Precise stock price prediction for robust portfolio design.
method Minimum variance and optimal risk portfolio optimization using past stock prices.
result Backtesting shows improved performance of optimized portfolios over equal weight portfolio.

A new factor analysis method using ICA reduces portfolio concentration and diversifies excess kurtosis.

problem Standard factor analysis suffers from issues with pairwise correlations of asset returns.
method Identifies factors based on non-Gaussianity instead of variance, using ICA.
result Fat-tailed portfolios significantly reduce portfolio concentration and winner-takes-all problem.

Paper uses neural networks to compress large portfolios of options, reducing risk and capital requirements.

problem Managing risk and capital requirements for large portfolios of financial options.
method Artificial neural network framework for portfolio compression, static hedging, and risk management.
result The compressed portfolio's risk profiles align closely with the target portfolio's, reducing capital requirements.

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

2015-10-09abs ↗pdf ↗

This study compares three portfolio design approaches for stock selection.

problem Designing a profitable portfolio with precise stock returns and risks.
method Three portfolio design approaches: mean-variance portfolio, hierarchical risk parity, and autoencoder-based portfolio.
result Autoencoder portfolios outperform MVP on annual returns, but MVP is best on risk-adjusted returns.

In this paper Portfolio Optimization techniques were used to determine the most favorable investment portfolio. In particular, stock indices of three companies, namely Microsoft Corporation, Christian Dior Fashion House and Shevron Corporation were evaluated. Using this data the amounts invested in each asset when a po…

2015-05-19abs ↗pdf ↗

This study compares two portfolio optimization methods on Indian stocks.

problem Designing an optimal portfolio considering stock returns and risks.
method Hierarchical Risk Parity and Eigen Portfolio approaches on NIFTY 50 sectors.
result Hierarchical Risk Parity portfolio outperforms Eigen portfolio in most sectors tested.

The paper introduces eigen-portfolios using PCA to improve portfolio construction in finance.

problem Overfitting and poor generalization in selecting a single eigen-portfolio.
method Principal Component Analysis (PCA) to derive eigen-portfolios from asset return correlation matrices.
result An ensemble strategy combining multiple top-performing eigen-portfolios significantly improves out-of-sample performance.

The study infers risk preferences from portfolio choices and measures portfolio efficiency.

problem Measuring the efficiency of household investment portfolios based on risk preferences.
method Statistical analysis of portfolio choices and demographic information over six years.
result Implied risk aversion increases with wealth and financial literacy, impacting portfolio efficiency.

In stochastic portfolio theory, a relative arbitrage is an equity portfolio which is guaranteed to outperform a benchmark portfolio over a finite horizon. When the market is diverse and sufficiently volatile, and the benchmark is the market or a buy-and-hold portfolio, functionally generated portfolios introduced by Fe…

2014-07-31abs ↗pdf ↗

Survey of universal portfolio techniques for minimizing investment regret.

problem Minimizing investment regret in algorithmic trading.
method Explains various universal portfolio techniques and their proofs.
result Coverage of fundamental concepts and algorithms in regret minimization.

Investor skill levels affect optimal portfolio size, study shows.

problem Optimal portfolio size for different skill levels of investors.
method Mathematical methods to study annual and continuous portfolio diversification, regression analysis.
result Strong investors should hold concentrated portfolios, poor investors should hold diversified portfolios.

Study on stock portfolio concentration among Finnish households and investors.

problem Understanding the concentration of stock portfolios owned by Finnish households and investors.
method Analysis of stock portfolios using Herfindahl-Hirschman index over 20 years.
result High portfolio concentration observed in Finnish retail investors, similar to institutional investors.