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

58117175233 · May 202619922001200920172026
48 results for inventory control

A contextual bandit method evaluates and improves inventory control policies.

problem Evaluating and improving periodic review inventory control policies with nonstationary demand.
method Contextual bandit-based algorithm to evaluate and tweak policies.
result The method achieves favorable guarantees in both theory and practice.

Paper tackles inventory management with deep learning, improving performance and adherence to constraints.

problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.

Study optimal pricing and inventory control in dynamic settings with censored demand.

problem Optimal pricing and inventory control in dynamic settings with censored demand.
method Approximate optimal policy via high-order MDP, propose novel algorithms for solving Bellman equations.
result Established finite-sample regret bounds and demonstrated efficacy through numerical experiments.

This paper tackles inventory control with general arrival dynamics and post-processing, improving profitability.

problem Inventory control with arbitrary arrival dynamics and post-processing constraints.
method Formulated as an exogenous decision process, incorporating deep generative models for arrivals, and applying supervised learning techniques.
result Improves profitability over production baselines and real-world A/B test data.

Solves inventory control with unknown demand trend using singular control.

problem Optimally managing inventory with an unknown demand trend.
method Formulates as a stochastic control problem under partial observation, solves equivalent separated problem using transition between formulations, and applies viscosity theory.
result Constructs an optimal control rule and shows bounded Lipschitz continuity of free boundaries.

Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.

problem Optimizing market making in aggregator-routed RFQ markets with varying dealer performance scores.
method Two-tier stochastic control model that separates RFQ-level price competition from macro routing.
result Optimal controls can be expressed through derivatives of reduced Hamiltonians, leading to interpretable mappings from optimal win probabilities to optimal offsets.

Study on inventory management under uncertainty using smooth ambiguity preference.

problem Managing inventory under Knightian uncertainty with smooth ambiguity preference.
method Demonstrates continuous-time smooth ambiguity as the infinitesimal limit of Kalman-Bucy filtering with recursive robust utility. Solves forward-backward stochastic differential equations with quadratic growth to determine cost function. Derives value function and optimal control policy using variational inequalities and viscosity solutions. Transforms problem into two-dimensional singular control.
result Ambiguity drives decision-makers to act earlier, reducing the continuation region.

In this paper we complete and extend our previous work on stochastic control applied to high frequency market-making with inventory constraints and directional bets. Our new model admits several state variables (e.g. market spread, stochastic volatility and intensities of market orders) provided the full system is Mark…

2013-03-28abs ↗pdf ↗

Central bank strategy to maintain currency exchange rate within limits.

problem Maintaining a currency exchange rate within a target zone despite adverse economic trends.
method Modeling the problem with a continuous-time market impact model and solving it as a stochastic control problem.
result Optimal strategy minimizes accumulated inventory of foreign currency.

MaxCOSD algorithm tackles non-i.i.d. demands and stateful dynamics in online inventory control.

problem Managing inventory with non-i.i.d. demands and stateful dynamics.
method MaxCOSD, an online algorithm with provable guarantees for non-degeneracy assumptions.
result MaxCOSD achieves optimal performance for non-i.i.d. demands and stateful dynamics.

Study visualizes actor-critic loss landscapes for inventory optimization.

problem Difficulties in solving multi-store dynamic inventory control problems.
method Low-dimensional visualizations of actor loss function.
result Loss landscapes favor optimal policies in reinforcement learning.

Study bond market making with hit-ratio target using optimal control and HJB equations.

problem Optimizing bond market making with hit-ratio target in OTC markets.
method Stochastic optimal control approach, dualizing hit-ratio target, HJB equation, Riccati equation, linearization.
result Explicit quote decompositions into riskless spread, inventory-risk correction, and hit-ratio correction.

We consider a continuous-time model for inventory management with Markov modulated non-stationary demands. We introduce active learning by assuming that the state of the world is unobserved and must be inferred by the manager. We also assume that demands are observed only when they are completely met. We first derive t…

2012-06-27abs ↗pdf ↗

A dealer manages quotes and rejection rules to control slippage risk in FX markets.

problem Managing inventory risk and latency risk in OTC FX market making.
method Dynamic programming and adiabatic-quadratic approximation to optimize quotes and rejection rules.
result Developed a method to optimize quotes and rejection rules for managing slippage risk.

New Q-learning algorithms reduce regret in inventory control problems.

problem Efficiently learning optimal policies in inventory control problems with limited feedback.
method Proposed Elimination-Based Half-Q-Learning (HQL) and Full-Q-Learning (FQL) algorithms with theoretical regret bounds.
result HQL incurs ildeO(H3T) ilde{\mathcal{O}}(H^3\sqrt{ T}) regret, FQL incurs ildeO(H2T) ilde{\mathcal{O}}(H^2\sqrt{ T}) regret, independent of state and action space sizes.

This paper optimizes perpetual contract liquidity by accounting for funding rates.

problem Optimal liquidity provision for perpetual contracts with stochastic funding rates.
method Formulated a control problem, solved with a HJB scheme, and calibrated on real data.
result Funding-aware market making improves performance and reduces inventory risk.

A new method for inventory control using in-context learning and generative models.

problem Inventory control with decision-dependent censoring, focusing on the censored newsvendor problem.
method In-context generative posterior sampling (ICGPS) combining modern generative models and in-context autoregressive generation.
result ICGPS achieves sublinear Bayesian regret for the censored newsvendor problem, outperforming existing methods.

Study optimizes market making in Chinese stock market with stochastic control and scenario analysis.

problem Limited research on market making in Chinese stock market.
method Optimal market making framework with exponential CARA utility function, accounting for market conditions and risks.
result Impact of volatility and stamp duty on market maker's profit and liquidity.

We study Exo-MDPs to reduce sample complexity in reinforcement learning.

problem Reducing sample complexity in reinforcement learning for structured MDPs.
method Introducing Exo-MDPs and proving structural equivalence to linear mixture MDPs, establishing regret bounds.
result Proved O(H3/2dK)O(H^{3/2}d\sqrt{K}) regret bound for Exo-MDPs, matching lower bounds.

Optimal hidden-target learning for online inventory optimization on general convex sets.

problem Online inventory optimization (OIO) on arbitrary bounded convex capacity sets.
method Maintaining a hidden target and projecting it onto the feasible order-up-to set.
result The method improves the best known regret guarantee for OIO on general convex sets from inverse to inverse-square-root dependence on the common-demand probability.

Unified theory for optimal execution through signal-adaptive quotes in limit order books.

problem Optimal execution in limit order books with signal-dependent factors.
method Develops a unified solution theory for four execution criteria, incorporating signal-dependent drift, price impact, inventory risk, and execution risk.
result Explicit formulas reveal optimal quoting strategies and show signal-dependent drift can significantly affect execution.

We consider a finite-horizon market-making problem faced by a dark pool that executes incoming buy and sell orders. The arrival flow of such orders is assumed to be random and, for each transaction, the dark pool earns a per-share commission no greater than the half bid-ask spread. Throughout the entire period, the mai…

2015-02-10abs ↗pdf ↗

The paper develops a hybrid model for optimal order execution in markets with heterogeneous market makers.

problem Optimal liquidation in markets with limited inventory and risk capacity.
method Derives a reduced form model for aggregated inventory dynamics considering price impact.
result Optimal execution can be modeled as a linear-quadratic stochastic control problem.

In this paper we propose a mathematical framework to address the uncertainty emergingwhen the designer of a trading algorithm uses a threshold on a signal as a control. We rely ona theorem by Benveniste and Priouret to deduce our Inventory Asymptotic Behaviour (IAB)Theorem giving the full distribution of the inventory …

2018-11-08abs ↗pdf ↗

This paper examines how data affects risk measures in uncertain distributions.

problem How does distributional ambiguity affect risk measures?
method Formulated and derived simpler dual problems for infinite and finite dimensional robust moment problems.
result Developed theory and conducted experiments in inventory control and portfolio management.

A PID-based feedback-control system improves multiple KPIs in RTB display advertising.

problem Challenges in simultaneously improving multiple KPIs in RTB campaigns.
method Sequential Control using PID-based feedback and importance metrics.
result Effective in simultaneously controlling multiple KPIs in both simulations and live traffic.

Modeling option market making with hedging-induced price impact.

problem Tackles the challenge of market making in options markets with price impact.
method Models option order flow using Cox processes and studies the dynamics of inventory and price under hedging-induced impact.
result Establishes the well-posedness of the mixed control problem involving quoting and hedging.

Market making is a fundamental trading problem in which an agent provides liquidity by continually offering to buy and sell a security. The problem is challenging due to inventory risk, the risk of accumulating an unfavourable position and ultimately losing money. In this paper, we develop a high-fidelity simulation of…

2018-04-11abs ↗pdf ↗

New algorithm tackles non-stationary RL with near-optimal regret bounds.

problem Model-free reinforcement learning in non-stationary Markov decision processes.
method Proposed RestartQ-UCB algorithm with Freedman-type bonus terms.
result Achieves near-optimal dynamic regret bound in non-stationary RL.

Study shows how to learn optimal policies quickly in stochastic control problems.

problem Learning optimal policies in large, continuous state and action spaces with limited data.
method Analyzes three geometric exponents to quantify fast policy regret convergence.
result Shows that fast policy regret convergence is induced by specific geometric structures.

The ad-trading desks of media-buying agencies are increasingly relying on complex algorithms for purchasing advertising inventory. In particular, Real-Time Bidding (RTB) algorithms respond to many auctions -- usually Vickrey auctions -- throughout the day for buying ad-inventory with the aim of maximizing one or severa…

2015-11-26abs ↗pdf ↗

The paper tackles dynamic collateral control for spot-perpetual basis trading in decentralized finance.

problem Dynamic control of collateral in spot-perpetual basis trading in decentralized finance.
method Solves a static control problem and derives an asymmetric dynamic extension, validated with live execution.
result The dynamic control approach provides a more robust operating benchmark and shows significant rebalancing effects.