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

238475713950 · Jun 202019922001200920172026
48 results for index set selection

Enhances index selection for databases with task-specific inductive biases.

problem Challenges in traditional and automatic tuning strategies for database index set selection.
method Applies deep RL with task-specific inductive biases to index set selection, reformulating the problem as permutation learning.
result Improves index selection, achieving up to 40% smaller configurations with similar latency.

The paper optimizes asset selection for index trackers and enhanced trackers with varying cardinality constraints.

problem Optimizing asset selection for index trackers and enhanced trackers with cardinality constraints.
method Divided into two steps: asset pre-selection and asset weight estimation. Used eight pre-selection procedures with different combinations of selection methods and regression types.
result Out-of-sample tracking errors are roughly proportional to 1/sqrt(cardinality). OLS is more effective than LAD, BE marginally more effective than FS, and (n) marginally more effective than (c).

New algorithm finds best subset in high-dimensional data models.

problem Finding the best subset of predictors in high-dimensional data models.
method Proposes a scalable algorithm using a generalized information criterion.
result Directly proves consistency and oracle property for the best-subset selection.

DFR models dynamic distributional data with weighted Fréchet means.

problem Regression of distribution-valued responses over time.
method Dynamic Fréchet Regression (DFR) with index-aware weighting and feature selection.
result Improved predictive accuracy and feature recovery over existing methods.

Estimates linear models from self-selected data, addressing econometric challenges.

problem Estimating linear models from self-selected data with known or unknown selection criteria.
method Developed efficient algorithms for both known and unknown selection criteria.
result Identified and estimated linear models from self-selected data, accommodating various selection criteria.

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 ↗

The so-called Pareto-Levy or power-law distribution has been successfully used as a model to describe probabilities associated to extreme variations of worldwide stock markets indexes data and it has the form Pr(X>x) x(alpha)forgamma<x<infinity.TheselectionofthethresholdparametergammaPr(X>x) ~ x**(-alpha) for gamma< x <infinity. The selection of the threshold parameter gamma from empirical d…

2004-11-06abs ↗pdf ↗

We report the results of fifteen sets of portfolio selection simulations using stocks in the ASX200 index for the period May 2000 to December 2013. We investigated five portfolio selection methods, randomly and from within industrial groups, and three based on neighbor-Net phylogenetic networks. We report that using ra…

2016-03-08abs ↗pdf ↗

We presented Bayesian portfolio selection strategy, via the kk factor asset pricing model. If the market is information efficient, the proposed strategy will mimic the market; otherwise, the strategy will outperform the market. The strategy depends on the selection of a portfolio via Bayesian multiple testing methodol…

2017-04-17abs ↗pdf ↗

For massive data sets, efficient computation commonly relies on distributed algorithms that store and process subsets of the data on different machines, minimizing communication costs. Our focus is on regression and classification problems involving many features. A variety of distributed algorithms have been proposed …

2014-10-24abs ↗pdf ↗

The successive projection algorithm (SPA) is a fast algorithm to tackle separable nonnegative matrix factorization (NMF). Given a nonnegative data matrix XX, SPA identifies an index set K\mathcal{K} such that there exists a nonnegative matrix HH with XX(:,K)HX \approx X(:,\mathcal{K})H. SPA has been successfully used as a…

2019-08-12abs ↗pdf ↗

New method finds minimum in noisy data, useful for model selection.

problem Finding the index of the minimum value in noisy observations.
method Developed an asymptotically normal test statistic integrating cross-validation and differential privacy.
result Achieves a favorable bias-variance trade-off in practical scenarios.

The paper uses TDA to select stocks for a sparse portfolio, improving performance across market scenarios.

problem Sparse portfolio selection in financial markets.
method Topological data analysis (TDA) for clustering stock price movements.
result The TDA-based clustering strategy significantly enhances sparse portfolio performance.

ARGEN method improves variable selection and regularization in high-dimensional sparse models.

problem Constrained variable selection and regularization in high-dimensional sparse linear models.
method ARGEN penalty method, variable selection and regularization.
result ARGEN method has variable selection and estimation consistency under certain conditions.

Convolutional neural networks (CNNs) achieve state-of-the-art performance in a wide variety of tasks in computer vision. However, interpreting CNNs still remains a challenge. This is mainly due to the large number of parameters in these networks. Here, we investigate the role of compression and particularly pruning fil…

2017-11-07abs ↗pdf ↗

The paper studies implicit regularization in over-parameterized models for high-dimensional data.

problem Understanding implicit regularization in over-parameterized models for high-dimensional data.
method The paper designs regularization-free algorithms for the high-dimensional single index model and provides theoretical guarantees for the induced implicit regularization phenomenon.
result The proposed methods achieve minimax optimal statistical rates of convergence and outperform classical methods with explicit regularization.

This paper selects features in deep neural networks with theoretical guarantees.

problem Feature selection in deep neural networks with unknown nonlinear functions.
method Reformulate neural networks as index models, estimate feature sets using Stein's formula, and apply screening-and-selection mechanism.
result Consistent feature selection with theoretical guarantees, even in high-dimensional settings.

Paper compares feature selection methods using GCM and LOCO, showing GCM methods generally outperform LOCO.

problem Feature selection and importance estimation in model-agnostic settings.
method Comparison of feature selection methods related to GCM and LOCO under three model settings.
result GCM-related methods generally outperform LOCO under suitable regularity conditions, as shown by theoretical and empirical results.

Proposes new random models for fuzzy clustering similarity measures.

problem Challenges in choosing a random model for fuzzy clustering similarity measures.
method Introduces three intuitive and explainable random models for fuzzy clusterings.
result Each random model has distinct behavior, emphasizing the importance of accurate model selection.

NETpred uses graph models to predict multiple market indices.

problem Predicting multiple market indices with high accuracy.
method NETpred constructs a heterogeneous graph of related indices and stocks, selects representative nodes, and uses semi-supervised learning to predict index labels.
result NETpred outperforms state-of-the-art methods by 3%-5% in F-score on various datasets.

Paper explores Rashomon set models for more trustworthy medical conclusions.

problem Lack of comprehensive analysis of models in Rashomon set leads to misleading conclusions.
method Introduces Rashomon_DETECT algorithm and Profile Disparity Index (PDI).
result Combining differently behaving models in Rashomon set provides more trustworthy conclusions.

The paper introduces a new model selection criterion for various time series models.

problem Designing adaptive model selection criteria for a wide range of time series models.
method The approach involves a penalized contrast akin to Hannan and Quinn's criterion, with a data-driven calibrated term.
result The new criteria select the true model almost surely asymptotically for a wide range of time series models.

The paper challenges the validity of cluster validity measures in unsupervised learning.

problem The validity of cluster validity measures in selecting optimal clusterings.
method The authors investigate the use of cluster validity measures as objective functions in unsupervised learning and introduce a new variant of the Dunn index.
result Many cluster validity measures promote clusterings that do not match expert knowledge well.

A new FL algorithm reduces communication overhead by selectively updating model parameters.

problem Data heterogeneity and communication overhead in federated learning.
method Uses age of information metric to selectively update model parameters and group clients with similar data.
result Our method can expedite training and surpass other communication-efficient strategies in efficiency.

This paper improves volatility forecasting using dynamic subset selection in genetic programming.

problem Improving accuracy of implied volatility forecasting.
method Dynamic training-subset selection methods applied to genetic programming.
result Dynamic subset selection improves predictive accuracy of genetic programming models.

This study compares Markowitz and Single-Index models for Malaysian stocks.

problem Optimizing portfolio selection for Malaysian stocks using different models.
method Applied Markowitz and Single-Index models to 10-year historical data of 10 stocks and a risk-free asset.
result Comparison of minimum variance and maximum Sharpe portfolios for both models under various constraints.

Flexible deep learning framework controls FDR for feature selection.

problem Controlling Type-I error in feature selection for deep neural networks.
method Approximates FDR control for a wide range of deep architectures using gradient-based feature-importance vectors.
result Theoretical guarantee of FDR control for feature selection in deep learning models.

Paper proposes SCQ and P-TAMS for structured OOD testing in high-stakes ML.

problem Difficulty of incorporating auxiliary information in traditional conformal methods.
method Structure-adaptive conformal q-value (SCQ) and pseudo-score-guided transductive automated model selection (P-TAMS).
result Unified framework controls false discovery rate and improves power across diverse settings.

The problem of recovering a structured signal xCp\mathbf{x} \in \mathbb{C}^p from a set of dimensionality-reduced linear measurements b=Ax\mathbf{b} = \mathbf {A}\mathbf {x} arises in a variety of applications, such as medical imaging, spectroscopy, Fourier optics, and computerized tomography. Due to computational and sto…

2015-10-21abs ↗pdf ↗

Proposes a new semi-parametric framework for batched bandits with covariates.

problem Sequential decision-making with batched feedback and contextual information.
method Batched single-Index Dynamic binning and Successive arm elimination (BIDS) using single-index regression.
result Achieves minimax-optimal rates for nonparametric batched bandits.

We introduce in this paper a new algorithm for Multi-Armed Bandit (MAB) problems. A machine learning paradigm popular within Cognitive Network related topics (e.g., Spectrum Sensing and Allocation). We focus on the case where the rewards are exponentially distributed, which is common when dealing with Rayleigh fading c…

2012-04-07abs ↗pdf ↗

Improved FDR control for sparse financial index tracking.

problem Maintaining FDR control in high-dimensional financial data with strong variable dependencies.
method Expanding T-Rex framework to handle overlapping groups of correlated variables with nearest neighbors penalization.
result Accurately tracks the S&P 500 index using only a small number of stocks.

The 3D index of Dimofte-Gaiotto-Gukov a partially defined function on the set of ideal triangulations of 3-manifolds with rr torii boundary components. For a fixed 2r2r tuple of integers, the index takes values in the set of qq-series with integer coefficients. Our goal is to give an axiomatic definition of the tetra…

2012-08-08abs ↗pdf ↗

Proposes a method to improve stock index prediction using cointegration and quantile loss.

problem Improving stock prediction accuracy by selecting informative factors and using quantile loss.
method Uses cointegration test to select factors and quantile loss for training models.
result Proposed method outperforms conventional approaches in terms of cumulative return and Sharpe ratio.