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

1234 · Feb 201919922001200920172026
48 results for Russell 3000

New method accurately reconstructs Russell 3000 index, revealing crowded portfolios.

problem Crowding in index portfolios during reconstitution events.
method Developed a Python package for accurate index reconstruction using CRSP US Stock data.
result Annual Russell 3000 portfolios are more crowded than quarterly ones, suggesting lower transaction costs.

Membership in the Russell 1000 and 2000 Indices is based on a ranking of market capitalization in May. Each index is separately value weighted such that firms just inside the Russell 2000 are comparable in size to firms just outside (i.e. at the bottom of the Russell 1000) but have much higher index weights. These feat…

2015-09-01abs ↗pdf ↗

Study investor attention using search volume data before and after mobile device popularity.

problem Accurately measure investor attention in a fast-paced market.
method Compare investor attention using search volume data before and after mobile device popularization.
result Investor attention measured using search volume data is more accurate and faster after mobile device popularization.

AI predicts stock winners with 2.43 Sharpe ratio, but returns are highly concentrated.

problem Predicting stock returns with AI, focusing on identifying top winners.
method Deployed a state-of-the-art LLM to autonomously search the web for stock attractiveness, avoiding look-ahead bias.
result AI can generate alpha by identifying top winners, but returns are highly concentrated.

Pseudo-Anosov subgroups in surface bundles over tori are convex cocompact.

problem Understanding the structure of pseudo-Anosov subgroups in surface bundles over tori.
method Using the Birman exact sequence to show convex cocompactness.
result Finitely generated, purely pseudo-Anosov subgroups are convex cocompact in surface bundles over tori.

The application of deep recurrent networks to audio transcription has led to impressive gains in automatic speech recognition (ASR) systems. Many have demonstrated that small adversarial perturbations can fool deep neural networks into incorrectly predicting a specified target with high confidence. Current work on fool…

2018-05-20abs ↗pdf ↗

In this article we study Weinstein structures endowed with a Lefschetz fibration in terms of the Legendrian front projection. First we provide a systematic recipe for translating from a Weinstein Lefschetz bifibration to a Legendrian handlebody. Then we present several applications of this technique to symplectic topol…

2016-10-21abs ↗pdf ↗

Investigates the relationship between US money supply and asset indices over 2001-2019.

problem Determining the relationship between US money supply and asset indices growth.
method Information entropy methodology applied to US asset indices (Property, Russell 2000, S&P 500, NASDAQ) over 2001-2019.
result Growth in US broad money supply is the main determinant of US asset indices growth, especially the NASDAQ and Russell 2000.

Traditional activity recognition systems work on the basis of training, taking a fixed set of sensors into account. In this article, we focus on the question how pattern recognition can leverage new information sources without any, or with minimal user input. Thus, we present an approach for opportunistic activity reco…

2017-01-30abs ↗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 ↗

The paper provides conditions for amalgamation of certain subgroups and preserves convexity properties.

problem Conditions for amalgamation of subgroups in hierarchically hyperbolic groups.
method Study of amalgamation conditions and preservation of convexity properties.
result Conditions under which amalgamation preserves hierarchical quasiconvexity and strong quasiconvexity.

Study reveals a hidden cost in derivatives markets through option-implied discount factors.

problem The hidden cost in derivatives markets, not visible in price space.
method Minute-level NBBO data on options, reduced-form specification linking carry gap to implementation risk, trading frictions, and financial conditions.
result An annualized carry gap exists, linked to implementation risk and financial conditions.

Study of graphs interpolating curve and pants graphs, providing formulae and geometry classifications.

problem Understanding the large-scale geometry of graphs connecting curve and pants graphs.
method Developed explicit formulae for quasi-flat ranks and classified geometries using twist-free graphs of multicurves.
result Explicit formulae for quasi-flat ranks and classification of geometries into hyperbolic, relatively hyperbolic, and thick cases.

Stable subgroups identified in genus two handlebody group.

problem Characterizing stable subgroups in genus two handlebody group.
method Proving genus two handlebody group is hierarchically hyperbolic, using quasi-isometric embedding properties and Hamenstädt-Hensel construction.
result Stable subgroups identified and characterized.

The paper optimizes portfolios with transaction costs in a large asset universe.

problem Optimizing portfolios with transaction costs in a large asset universe.
method Mean-variance optimization with nonconvex penalty for proportional and quadratic transaction costs.
result The proposed models show satisfactory performance and highlight the importance of transaction costs.

Feature extraction from financial data is one of the most important problems in market prediction domain for which many approaches have been suggested. Among other modern tools, convolutional neural networks (CNN) have recently been applied for automatic feature selection and market prediction. However, in experiments …

2018-10-21abs ↗pdf ↗

Paper extends Cohen's method to compute Jones polynomial for certain braid subfamilies.

problem Computing Jones polynomial for specific knot families.
method Using weighted adjacency matrices and determinants for certain subfamilies of braid groups.
result Jones polynomial can be computed in polynomial time for certain subfamilies of braid groups.

New econometric results for financial duration models under varying tail behaviors.

problem Estimation and inference challenges in financial durations models with random event counts.
method Analysis of likelihood estimators for ACD models, focusing on tail behavior and stationarity.
result Asymptotic normality breaks down for tail indices smaller than one, leading to mixed Gaussian estimators with non-standard rates of convergence.

Stock prediction has always been attractive area for researchers and investors since the financial gains can be substantial. However, stock prediction can be a challenging task since stocks are influenced by a multitude of factors whose influence vary rapidly through time. This paper proposes a novel approach (Word2Vec…

2019-02-13abs ↗pdf ↗

Image classification with deep neural networks is typically restricted to images of small dimensionality such as 224 x 244 in Resnet models [24]. This limitation excludes the 4000 x 3000 dimensional images that are taken by modern smartphone cameras and smart devices. In this work, we aim to mitigate the prohibitive in…

2018-12-08abs ↗pdf ↗

Tracking large numbers of densely-arranged, interacting objects is challenging due to occlusions and the resulting complexity of possible trajectory combinations, as well as the sparsity of relevant, labeled datasets. Here we describe a novel technique of collective tracking in the model environment of a 2D honeybee hi…

2018-12-31abs ↗pdf ↗

In this paper, we seek a clinically-relevant latent code for representing the spectrum of macular disease. Towards this end, we construct retina-VAE, a variational autoencoder-based model that accepts a patient profile vector (pVec) as input. The pVec components include clinical exam findings and demographic informatio…

2019-07-11abs ↗pdf ↗

Efficient and accurate low-rank approximations of multiple data sources are essential in the era of big data. The scaling of kernel-based learning algorithms to large datasets is limited by the O(n^2) computation and storage complexity of the full kernel matrix, which is required by most of the recent kernel learning a…

2016-01-17abs ↗pdf ↗

Machine learning (ML) methods have the potential to automate clinical EEG analysis. They can be categorized into feature-based (with handcrafted features), and end-to-end approaches (with learned features). Previous studies on EEG pathology decoding have typically analyzed a limited number of features, decoders, or bot…

2020-02-11abs ↗pdf ↗

SPT predicts age and mass of red giants from spectra.

problem Challenges in age and mass estimation of red giants using traditional methods.
method SPT framework with Multi-head Hadamard Self-Attention and Mahalanobis distance-based loss function.
result Remarkable age and mass estimations with low errors and uncertainties.

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.