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

3469103137 · Jun 202019922001200920172026
48 results for up-down action

The conventional formal tool to detect effects of the financial persistence is in terms of the Hurst exponent. A typical corresponding result is that its value comes out close to 0.5, as characteristic for geometric Brownian motion, with at most small departures from this value in either direction depending on the mark…

2005-04-22abs ↗pdf ↗

The waiting time needed for a stock market index to undergo a given percentage change in its value is found to have an up-down asymmetry, which, surprisingly, is not observed for the individual stocks composing that index. To explain this, we introduce a market model consisting of randomly fluctuating stocks that occas…

2006-04-18abs ↗pdf ↗

A non-trivial probability structure is evident in the binary data extracted from the up/down price movements of very high frequency data such as tick-by-tick data for USD/JPY. In this paper, we analyze the Sony bank USD/JPY rates, ignoring the small deviations from the market price. We then show there is a similar non-…

2005-09-30abs ↗pdf ↗

Changepoint detection is a central problem in time series and genomic data. For some applications, it is natural to impose constraints on the directions of changes. One example is ChIP-seq data, for which adding an up-down constraint improves peak detection accuracy, but makes the optimization problem more complicated.…

2017-03-09abs ↗pdf ↗

Combines CNN and Transformer for financial time series forecasting.

problem Forecasting financial time series, especially stock prices, is challenging due to short-term and long-term dependencies.
method Uses CNN for short-term dependencies and Transformer for long-term dependencies.
result Demonstrated superior performance in forecasting stock price changes compared to traditional methods.

Compact models match or exceed GPT's performance in financial news sentiment analysis.

problem Improving financial sentiment analysis models without large computational costs.
method Fine-tuning non-generative, small-sized models (FinBERT, FinDRoBERTa) on a novel market score database.
result Fine-tuned models outperform GPT-3.5 and GPT-4 in zero-shot learning for financial news sentiment analysis.

Introduces Causal Energy Minimization to understand Transformer layers.

problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.

Since the machine learning techniques are improving rapidly, it has been shown that the image recognition techniques in deep neural networks can be used to detect jet substructure. And it turns out that deep neural networks can match or outperform traditional approach of expert features. However, there are disadvantage…

2017-11-07abs ↗pdf ↗

GPT-4 improves stock price prediction from microblogging sentiments.

problem Improving stock price prediction using sentiment analysis of microblogs.
method Developed a novel method for contextual sentiment analysis using GPT-4, fine-tuning prompts for better accuracy.
result GPT-4 outperformed BERT in predicting stock price movements, achieving a peak accuracy of 71.47%.

Cryptocurrencies are ranked for efficiency using a new Complexity-Entropy Plane.

problem Evaluating the efficiency of cryptocurrencies using traditional financial metrics.
method Developed a Binary Complexity-Entropy Plane (BiCEP) to analyze daily price fluctuations of major cryptocurrencies.
result Only Shiba Inu (SHIB) is significantly inefficient, while most cryptocurrencies operate in close-to-efficient conditions.

Simpler models outperform deep architectures with proper preprocessing and tuning.

problem Signal extraction from noisy cryptocurrency LOB data.
method Benchmarked a range of models including deep architectures and interpretable baselines.
result Simpler models can match and exceed deep architectures' performance with proper preprocessing and tuning.

We study the problem of predicting whether the price of the 21 most popular cryptocurrencies (according to coinmarketcap.com) will go up or down on day d, using data up to day d-1. Our C2P2 algorithm is the first algorithm to consider the fact that the price of a cryptocurrency c might depend not only on historical pri…

2019-06-03abs ↗pdf ↗

Deleting refusal directions from models leads to systematically more optimistic decisions.

problem The impact of removing refusal directions from models on decision-making outcomes.
method Ablation study using a frozen pipeline of 21,600 weekly equity decisions.
result Ablation of refusal directions makes models more optimistic and justifies themselves more, but also reduces confidence.

Simplifies large action space bandits by selecting representative actions.

problem Efficiently managing large action spaces with correlated outcomes.
method Random sampling and solving of bandit instances to identify representative actions.
result The algorithm selects a smaller set of representative actions that perform nearly as well as the full action space.

We study isometric actions on Riemannian symmetric spaces of noncompact type which are induced by reductive algebraic subgroups of the isometry group. We show that for such an action there exists a corresponding isometric action on a dual compact symmetric space, which reflects many properties of the original action. F…

2011-01-09abs ↗pdf ↗

Classifies totally geodesic submanifolds and polar actions on Stiefel manifolds.

problem Classifying totally geodesic submanifolds and polar actions on Stiefel manifolds.
method Classification through polar actions and cohomogeneity-one actions.
result Classification of orbits of polar actions on Stiefel manifolds.

We identify action representations from video data, proving their statistical benefits.

problem Identifying latent action policies from video data.
method Entropy-regularized LAPO objective, formalizing desiderata for action representations.
result Entropy-regularized LAPO identifies action representations satisfying desiderata under suitable conditions.

We classify the polar actions on the complex hyperbolic plane up to orbit equivalence. Apart from the trivial and transitive polar actions, there are five polar actions of cohomogeneity one and four polar actions of cohomogeneity two.

2011-08-02abs ↗pdf ↗

The paper studies curvatures and austere properties of orbits in symmetric spaces.

problem Analyzing curvatures and austere properties of orbits in symmetric spaces.
method Using Hermann actions and hyperpolar properties, the paper derives explicit formulas for principal curvatures and conditions for orbits to be austere.
result The paper provides conditions for orbits to be austere and extends previous results to a larger class of infinite-dimensional submanifolds.

Defines and computes a generalized spectral action for Lorentz warped products.

problem Computing spectral actions for Lorentz warped products.
method Defines and computes the bimetric spectral Einstein-Hilbert action for Lorentz warped products.
result Derives a Kastler-Kalau-Walze type theorem for Lorentz warped products.

The paper studies acylindrical actions on trees and proves acylindrical hyperbolicity of Baumslag-Solitar groups.

problem Exploring acylindrical actions on trees and their properties.
method Demonstrates criteria for preserving acylindrical hyperbolicity and analyzes the outer automorphism group of Baumsligar-Solitar groups.
result Proves acylindrical hyperbolicity of non-solvable Baumsligar-Solitar groups.

UTE improves reinforcement learning by measuring action uncertainty, enhancing policy learning efficiency.

problem Degrading performance of action repetition in reinforcement learning, especially with sub-optimal actions.
method UTE uses ensemble methods to measure uncertainty during action extension, allowing strategic exploration or certainty.
result UTE outperforms existing action repetition algorithms, significantly enhancing policy learning efficiency.

We analyze polar actions on Hermitian and quaternion-Kähler symmetric spaces of compact type. For complex integrable polar actions on Hermitian symmetric spaces of compact type we prove a reduction theorem and several corollaries concerning the geometry of these actions. The results are independent of the classificatio…

2006-12-18abs ↗pdf ↗

The study examines how perturbations of lattice actions on group boundaries behave.

problem Understanding how perturbations of lattice actions on group boundaries affect semi-conjugacy.
method Analyzes continuous factorization of perturbed actions onto original actions by semi-conjugacy.
result Perturbations of lattice actions on group boundaries can be C0C^0 semi-conjugate or not.