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

4896144192 · Jun 202019922001200920172026
48 results for Reactive Policies

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

Algorithm improves reinforcement learning policies using offline data.

problem Improving reinforcement learning policies with limited online data.
method Designs a single non-reactive policy using offline data with provable guarantees.
result Algorithm achieves better policy quality with less online data.

MPC outperforms reactive budgeting in non-stationary return environments.

problem Optimizing budget allocation under non-stationary returns.
method Receding-horizon Model Predictive Control (MPC) compared to reactive policies.
result MPC consistently outperforms reactive budgeting when return dynamics are predictable.

Designs a single policy for collecting data to train near-optimal policies.

problem Engineering overhead in deploying minimax procedures for stochastic linear contextual bandits.
method Designs a single stochastic policy to collect data from which a near-optimal policy can be extracted.
result The designed policy can collect data from which a near-optimal policy can be extracted.

Decouples critic chunk length from policy to improve policy reactivity and performance.

problem Bootstrapping bias and difficulty in extracting optimal policies from chunked critics.
method Optimizes policy against a distilled critic for partial action chunks, allowing shorter chunks for policy.
result Reliably outperforms prior methods on long-horizon offline goal-conditioned tasks.

We introduce Recurrent Predictive State Policy (RPSP) networks, a recurrent architecture that brings insights from predictive state representations to reinforcement learning in partially observable environments. Predictive state policy networks consist of a recursive filter, which keeps track of a belief about the stat…

2018-03-05abs ↗pdf ↗

A new framework uses stochastic optimal control to estimate rare events more accurately.

problem Estimating rare events like chemical reactions in biomolecules is computationally challenging.
method The approach casts committor estimation as a stochastic optimal control problem, developing direct and off-policy Value Matching losses.
result The framework yields more accurate committor estimates, reaction rates, and equilibrium constants.

Many robotic applications require the agent to perform long-horizon tasks in partially observable environments. In such applications, decision making at any step can depend on observations received far in the past. Hence, being able to properly memorize and utilize the long-term history is crucial. In this work, we pro…

2019-03-09abs ↗pdf ↗

A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.

problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.

Enhances queue-reactive model for realistic limit order book simulation.

problem Realistic simulation of limit order books for market research and strategy development.
method Extends Queue-Reactive model with neural network for complex dependencies and varying market conditions.
result Captures key market properties like square-root law of market impact and order size patterns.

We present a new volatility model, simple to implement, that includes a leverage effect whose return-volatility correlation function fits to empirical observations. This model is able to capture both the "retarded effect" induced by the specific risk, and the "panic effect", which occurs whenever systematic risk become…

2012-09-24abs ↗pdf ↗

We present a reactive beta model that includes the leverage effect to allow hedge fund managers to target a near-zero beta for market neutral strategies. For this purpose, we derive a metric of correlation with leverage effect to identify the relation between the market beta and volatility changes. An empirical test ba…

2019-11-03abs ↗pdf ↗

Unified model for market dynamics, linking price and order flow.

problem Modeling market dynamics and order flow in a unified framework.
method Markovian market model driven by a hidden Brownian efficient price, signal-driven and queue-reactive models.
result Stability of mid-price around efficient price at macroscopic scale, behavior as diffusion.

We propose and study a new model for reinforcement learning with rich observations, generalizing contextual bandits to sequential decision making. These models require an agent to take actions based on observations (features) with the goal of achieving long-term performance competitive with a large set of policies. To …

2016-02-08abs ↗pdf ↗

Neural planners for RDDL MDPs produce deep reactive policies in an offline fashion. These scale well with large domains, but are sample inefficient and time-consuming to train from scratch for each new problem. To mitigate this, recent work has studied neural transfer learning, so that a generic planner trained on othe…

2019-02-08abs ↗pdf ↗

A Relational Markov Decision Process (RMDP) is a first-order representation to express all instances of a single probabilistic planning domain with possibly unbounded number of objects. Early work in RMDPs outputs generalized (instance-independent) first-order policies or value functions as a means to solve all instanc…

2020-02-18abs ↗pdf ↗

AIF improves physical AI agents' performance in dynamic environments.

problem Physical AI agents are less capable than biological agents in open-ended real-world environments.
method Developed from probability theory, Bayesian machine learning, variational inference, and Active Inference (AIF), grounded in the Free Energy Principle.
result AIF minimizes variational free energy and is well-suited to physical constraints.

Paper improves volatility estimation using a Queue-Reactive model.

problem Volatility estimation from high-frequency data is biased by microstructure noise.
method Uses Queue-Reactive model of limit order book to improve volatility estimation.
result Unified and alternation estimators lead to optimal mean squared error for integrated volatility.

Study examines Fed's pandemic communication strategies.

problem Analyzing Federal Reserve's communication during the COVID-19 pandemic.
method Sentiment analysis, topic modeling, comparative analysis of previous crises.
result Fed's communication during the pandemic focused on financial stability, market volatility, social welfare, and unconventional monetary policy.

Enhances diffusion-based sampling for molecular systems.

problem Inefficiency and thermodynamic mode miss in diffusion-based samplers for molecular systems.
method Introduces a sequential bias along collective variables (CVs) to encourage exploration and increase temperature in the projected space.
result Improves efficiency, mode discovery, and free energy estimation; first to demonstrate reactive sampling.

Distribution grids are currently challenged by frequent voltage excursions induced by intermittent solar generation. Smart inverters have been advocated as a fast-responding means to regulate voltage and minimize ohmic losses. Since optimal inverter coordination may be computationally challenging and preset local contr…

2018-07-10abs ↗pdf ↗

Deep reinforcement learning improves trading performance in volatile energy markets.

problem Volatility and low signal-to-noise ratios in energy markets.
method Formalized trading as a stochastic system, developed reactive and adaptive algorithms, used deep neural networks.
result Deep reinforcement learning models outperform buy-and-hold strategy with an 83% higher Sharpe ratio.

RL optimizes trading algorithms to reduce market impact and costs.

problem Optimizing sophisticated trading algorithms to minimize market impact and costs.
method Reinforcement learning framework within a market simulator.
result RL-derived strategies consistently outperform baselines and operate near the efficient frontier.

In this work we introduce two variants of multivariate Hawkes models with an explicit dependency on various queue sizes aimed at modeling the stochastic time evolution of a limit order book. The models we propose thus integrate the influence of both the current book state and the past order flow. The first variant cons…

2019-01-25abs ↗pdf ↗

New BE dimension measure reveals rich RL problems with sample-efficient algorithms.

problem Finding sample-efficient algorithms for complex RL problems.
method Introducing Bellman Eluder (BE) dimension and designing GOLF and OLIVE algorithms.
result GOLF and OLIVE algorithms learn near-optimal policies for low BE dimension problems with polynomial samples.

Study develops a data-based model for in-cylinder pressure and cyclic variations in RCCI engines.

problem Lack of models capturing cyclic variations in combustion concepts like RCCI.
method Combines Principle Component Decomposition and Gaussian Process Regression.
result Model predicts combustion measures with high accuracy, especially peak-pressure rise-rate.

A new hierarchy quantifies agency in systems based on information processing.

problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.

A2MT learns agents to select which modalities to acquire at test time.

problem Learning agents to select modalities for multimodal temporal data acquisition.
method Perceiver IO architecture for active acquisition of multimodal temporal data.
result Agents successfully learn cost-reactive acquisition behavior on real-world datasets.

This paper proposes a general model for synchronized crowding behavior. An order parameter is introduced to quantify the level of synchronization which is shown a function of percentage of agents in reactive state. Further, synchronization is shown to be driven by the most active agents with the highest volatility. A t…

2016-12-04abs ↗pdf ↗

The paper develops a method to predict the latent deterioration phase in limit order books before stress is observed.

problem Limit order books can transition rapidly from stable to stressed conditions, making it difficult to detect the latent deterioration phase.
method The paper formalizes a three-regime causal data-generating process and proposes a trigger-based detector combining MAX aggregation of complementary signal channels, a rising-edge condition, and adaptive thresholding.
result The proposed method achieves mean lead-time of +18.6 timesteps with perfect precision and moderate coverage, outperforming classical change-point and microstructure baselines.

New algorithm extracts device profiles for short-term power predictions in commercial buildings.

problem Short-term power prediction in commercial buildings with high accuracy.
method Unsupervised extraction of device profiles from aggregate power measurements, disaggregation using particle swarm optimization, and state changes forecast by artificial neural networks.
result Developed approach outperforms existing methods with high accuracy.

We study the relation between the trading behavior of agents and volatility in toy markets of adaptive inductively rational agents. We show that excess volatility, in such simplified markets, arises as a consequence of {\em i)} the neglect of market impact implicit in price taking behavior and of {\em ii)} excessive re…

2000-04-21abs ↗pdf ↗

Improved portfolio optimization method yields better risk-adjusted returns.

problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted kk-BAHC covariance cleaning procedure for correlation matrices.
result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.