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

4895143190 · Jun 202019922001200920172026
48 results for base-stock policy

Optimal vehicle repositioning policy found for shared mobility services.

problem Matching fixed supply with spatial customer demand under uncertain and correlated demand.
method Base-stock repositioning policy, asymptotic optimality, regret analysis, adaptive repositioning algorithm.
result Surrogate Optimization and Adaptive Repositioning algorithm achieves optimal regret of O(n2.5T)O(n^{2.5} \sqrt{T}).

Enhances LLMs for predicting stock movements by considering news dissemination and context.

problem Lack of consideration for news dissemination and insufficient contextual data in LLMs for stock price prediction.
method Clusters news for reach assessment, enriches prompts with specific data and instructions, fine-tunes an LLM using the dataset.
result Improves prediction accuracy by 8% compared to existing methods.

The three-state agent-based 2D model of financial markets as proposed by Giulia Iori has been extended by introducing increasing trust in the correctly predicting agents, a more realistic consultation procedure as well as a formal validation mechanism. This paper shows that such a model correctly reproduces the three f…

2013-10-02abs ↗pdf ↗

StockAgent uses AI to simulate real-world stock trading, analyzing external factors and profitability.

problem Investors need to understand how external factors affect stock trading.
method Developed StockAgent, a multi-agent system driven by large language models.
result Identified how external factors impact trading behavior and profitability.

We study an agent-based stock market model with heterogeneous agents and friction. Our model is based on that of Foellmer-Schweizer(1993): The process of a stock price in a discrete-time framework is determined by temporary equilibria via agents' excess demand functions, and the diffusion approximation approach is appl…

2013-01-28abs ↗pdf ↗

StonkBERT predicts stock price movements using company text data.

problem Can language models predict medium-run stock price movements?
method Fine-tuning transformer-based language models (BERT) on company text data (news articles, blogs, annual reports) for stock price performance classification.
result StonkBERT shows substantial improvement in predictive accuracy compared to traditional models, with news articles providing the best results.

Considering event structure information has proven helpful in text-based stock movement prediction. However, existing works mainly adopt the coarse-grained events, which loses the specific semantic information of diverse event types. In this work, we propose to incorporate the fine-grained events in stock movement pred…

2019-10-11abs ↗pdf ↗

NEAT algorithm optimizes stock trading with reduced risk.

problem Maximizing earnings while minimizing risk in stock trading.
method Applied NEAT algorithm to stock trading with multiple technical indicators, using progressive training data and a multi-objective fitness function.
result NEAT model achieved similar returns to Buy & Hold but with lower risk and stability.

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.

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 ↗

A new DRL system using LSTM improves stock trading performance.

problem Adapting DRL to financial data with low signal-to-noise ratios.
method Cascaded LSTM networks for feature extraction and reinforcement learning.
result Our model outperforms previous models in cumulative returns and Sharp ratio.

Paper develops a new similarity metric for predicting stock market returns.

problem Predicting stock returns is challenging due to market stochasticity and various influencing factors.
method Case-based reasoning approach using historical pricing data and a novel similarity metric.
result Demonstrates the benefits of the novel similarity metric in predicting stock market returns.

Paper proposes a new trading strategy using corporate event detection from news articles.

problem Predicting stock movements based on corporate events from news articles.
method Bi-level event detection model: low-level for token-level event identification, high-level for article-level event identification.
result The proposed strategy outperforms existing models in stock prediction metrics.

Paper tackles efficient evaluation of natural stochastic policies in offline RL.

problem Efficiency issues in evaluating natural stochastic policies due to unknown evaluation policy.
method Derive efficiency bounds for tilting and modified treatment policies, propose nonparametric estimators.
result Proposed estimators attain efficiency bounds under lax conditions and enjoy partial double robustness.

We study the problem of off-policy policy optimization in Markov decision processes, and develop a novel off-policy policy gradient method. Prior off-policy policy gradient approaches have generally ignored the mismatch between the distribution of states visited under the behavior policy used to collect data, and what …

2019-04-17abs ↗pdf ↗

Stabilizes policy optimization with off-policy data using divergence augmentation.

problem Premature convergence and instability in policy optimization with off-policy data.
method Incorporates Bregman divergence between behavior and current policies to ensure safe policy updates.
result Empirically shows better performance in data-scarce scenarios compared to other algorithms.

New methods estimate policy value and gradients for deterministic policies from off-policy data.

problem Estimating policy value and gradients for deterministic policies from off-policy data.
method Proposed new doubly robust estimators based on kernelization approaches.
result Demonstrated a rate independent of horizon length for policy value and gradient estimation.

DSPI connects natural policy gradient to policy iteration, proving global convergence.

problem Optimizing policies in reinforcement learning.
method DSPI framework, combining smoothed policy iteration and natural policy gradient.
result DSPI achieves geometric convergence and optimal complexity for policy optimization.

POTEC tackles off-policy learning in large action spaces, improving effectiveness.

problem Existing OPL methods fail in large discrete action spaces due to bias or variance issues.
method Two-stage algorithm: cluster selection via policy-based approach, action selection via regression-based approach.
result POTEC provides substantial improvements in off-policy learning effectiveness, especially in large and structured action spaces.

Monotonic policy improvement and off-policy learning are two main desirable properties for reinforcement learning algorithms. In this paper, by lower bounding the performance difference of two policies, we show that the monotonic policy improvement is guaranteed from on- and off-policy mixture samples. An optimization …

2017-10-10abs ↗pdf ↗

Protects proprietary policies from imitation learning by training adversarial policy ensembles.

problem Protecting policies from external observers cloning them.
method Introduces a reinforcement learning framework that trains an ensemble of near-optimal policies, making demonstrations useless for external observers.
result Demonstrates the existence of 'non-clonable' ensembles and provides a solution to the optimization problem.

PS framework selects best policy from library for CSO problems.

problem Policy selection in CSO with heterogeneous performance across covariate space.
method PS framework constructs library of candidate policies and learns a meta-policy to select the best one.
result PS consistently outperforms best single policy in heterogeneous CSO problems.