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

1122 · Jun 202019922001200920172026
19 results for meta-policy

Meta-AAD uses deep reinforcement learning to improve anomaly detection by selecting the most informative instances.

problem High false-positive rate in anomaly detection, especially in high-stake applications.
method Meta-AAD leverages deep reinforcement learning to train a meta-policy for query selection, optimizing the number of discovered anomalies.
result Meta-AAD significantly outperforms state-of-the-art re-ranking strategies and unsupervised baselines on 24 benchmark datasets.

Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during meta-training as well as ineffective task identification strategies. This paper provide…

2018-10-16abs ↗pdf ↗

Model-based reinforcement learning approaches carry the promise of being data efficient. However, due to challenges in learning dynamics models that sufficiently match the real-world dynamics, they struggle to achieve the same asymptotic performance as model-free methods. We propose Model-Based Meta-Policy-Optimization…

2018-09-14abs ↗pdf ↗

Policy-GNN optimizes GNN aggregation for diverse node iterations.

problem Optimizing GNN performance by varying aggregation iterations for different nodes.
method Policy-GNN uses a meta-policy framework with deep reinforcement learning to adaptively determine the number of aggregations for each node.
result Policy-GNN significantly outperforms state-of-the-art alternatives on real-world datasets.

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.

FinFlowRL learns from experts to optimize financial control in changing markets.

problem Traditional finance control methods fail in real-world, non-stationary markets.
method Imitation-Reinforcement Learning framework that pretrains on expert strategies and finetunes in noise space.
result Consistently outperforms individually optimized experts across diverse market conditions.

FinFlowRL combines imitation and reinforcement learning for better financial control.

problem Traditional stochastic control methods fail in real-world finance due to changing market conditions.
method FinFlowRL uses imitation learning to pretrain an adaptive meta policy, then finetunes it with reinforcement learning.
result FinFlowRL consistently outperforms individual strategies across various market conditions.

FLAP adapts policies quickly to new tasks using shared linear representations.

problem Adapting policies to new tasks efficiently and effectively.
method FLAP uses a shared linear representation and a separate adapter network for quick adaptation.
result FLAP achieves up to 8X faster adaptation and significantly better performance on out-of-distribution tasks.

MetaTrader combines diverse expert strategies to optimize portfolio performance.

problem Optimizing portfolio performance in changing financial markets.
method Two-stage RL approach: imitation learning followed by a meta-policy.
result MetaTrader significantly outperforms state-of-the-art baselines in balancing profits and risks.

Most meta reinforcement learning (meta-RL) methods learn to adapt to new tasks by directly optimizing the parameters of policies over primitive action space. Such algorithms work well in tasks with relatively slight difference. However, when the task distribution becomes wider, it would be quite inefficient to directly…

2019-09-30abs ↗pdf ↗

Minimum attention improves reinforcement learning performance in high-dimensional dynamics.

problem Improving reinforcement learning performance in high-dimensional nonlinear dynamics.
method Applying minimum attention as a regularization technique in reinforcement learning, including model-based and model-free approaches.
result Minimum attention outperforms state-of-the-art algorithms in few-shot adaptation and variance reduction.

Efficiently adapting to new environments and changes in dynamics is critical for agents to successfully operate in the real world. Reinforcement learning (RL) based approaches typically rely on external reward feedback for adaptation. However, in many scenarios this reward signal might not be readily available for the …

2019-03-04abs ↗pdf ↗

Reinforcement learning (RL) algorithms have demonstrated promising results on complex tasks, yet often require impractical numbers of samples since they learn from scratch. Meta-RL aims to address this challenge by leveraging experience from previous tasks so as to more quickly solve new tasks. However, in practice, th…

2019-04-01abs ↗pdf ↗

MacroHFT uses memory and context-aware reinforcement learning to improve HFT performance.

problem Overfitting and biased decisions in HFT due to rapid market changes.
method Memory Augmented Context-aware Reinforcement Learning (MacroHFT) that trains multiple sub-agents and a hyper-agent.
result MacroHFT achieves state-of-the-art performance on minute-level trading tasks.