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

109218326435 · Jun 202019922001200920172026
48 results for inventory processes

The paper analyzes optimal execution strategies for traders with inventory processes influenced by Brownian motion.

problem Optimal execution strategies for traders with inventory processes influenced by Brownian motion.
method Statistical tests and empirical analysis of intra-day data from the Toronto Stock Exchange.
result Empirical evidence supports the presence of a non-zero Brownian motion component in inventories and wealth processes.

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.

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.

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 ↗

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 ↗

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 on HFTs' interactions with a large trader using mean field game theory.

problem Interactions between high-frequency traders and a large trader executing assets at discrete times.
method Modeling HFTs' behavior using a jump process and solving the equilibrium through mean field game approach.
result Inventory-averse HFTs lower LT's costs when market impact is large.

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.

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.

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.

Bayesian optimization improves forest inventory sampling using remote sensing data.

problem Optimizing forest inventory sampling in large areas with limited data.
method Bayesian optimization applied to RS data for improved sampling design.
result The proposed method outperforms baseline methods in terms of MSE values.

Study finds inventory inaccuracies are linked to store activity and product perishability.

problem Inventory record inaccuracy in grocery retailing environments.
method Analysis of 24,000 SKUs across 11 stores, field quasi-experiment on audits.
result Inventory audits can boost sales by 11%, especially for perishable items.

A new approach integrates inventory prediction and routing optimization for better supply chain management.

problem Optimizing efficient route selection in supply chain management with uncertain inventory demand.
method Decision-focused learning approach using neural networks to directly integrate inventory prediction and routing optimization.
result Direct integration of inventory prediction and routing optimization leads to better supply chain decisions.

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.

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.

We propose a continuous-time stock-flow consistent model for inventory dynamics in an economy with firms, banks, and households. On the supply side, firms decide on production based on adaptive expectations for sales demand and a desired level of inventories. On the demand side, investment is determined as a function o…

2016-10-04abs ↗pdf ↗

Proposes a Big Data framework for SC forecasting, including data preprocessing and machine learning.

problem Improving SC forecasting accuracy and efficiency.
method Data collection, preprocessing, machine learning model training, hyperparameter tuning, performance evaluation.
result Optimized SC forecasting models enhance workforce, inventory, and overall SC performance.

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 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.

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 basic financial purpose of a firm is to maximize its value. An inventory management system should also contribute to realization of this basic aim. Many current asset management models currently found in financial management literature were constructed with the assumption of book profit maximization as basic aim. H…

2013-01-16abs ↗pdf ↗

Deep neural networks optimize inventory decisions in complex supply chains.

problem Optimizing inventory decisions in stochastic multi-echelon supply chains.
method Pairwise modeling and DNN agents for order-up-to levels.
result The method performs better than alternate methods in general supply chain networks.

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.

We study the cross-correlation matrix CijC_{ij} of inventory variations of the most active individual and institutional investors in an emerging market to understand the dynamics of inventory variations. We find that the distribution of cross-correlation coefficient CijC_{ij} has a power-law form in the bulk followed by …

2012-01-02abs ↗pdf ↗

Algorithm improves reinforcement learning in MDPs with partial order policies.

problem Improving reinforcement learning in MDPs with partial order policies.
method Epoch-based reinforcement learning algorithm leveraging a partial order over policy class.
result Achieves an O(wlog(Θ)T)O(\sqrt{w \log(|Θ|) T}) regret bound, independent of state and action space sizes.

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 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.

New method reduces inventory inaccuracies by 10x, saving retailers 4% annually.

problem Inaccurate inventory records cost retailers 4% annually, and manual detection is impractical.
method Proposes a new anomaly detection method for low-rank Poisson matrices using cross-sectional data.
result Our approach reduces anomaly detection costs by up to 10x compared to existing methods.

Paper applies RL to optimize inventory management across multiple products and nodes.

problem Optimizing inventory management for a large number of products with shared capacity in a multi-node supply chain.
method Novel multi-agent hierarchical reinforcement learning framework with A2C algorithm and quantised action spaces.
result The approach optimizes for maximizing product sales and minimizing wastage of perishable products.

We propose a framework for studying optimal market making policies in a limit order book (LOB). The bid-ask spread of the LOB is modelled by a Markov chain with finite values, multiple of the tick size, and subordinated by the Poisson process of the tick-time clock. We consider a small agent who continuously submits li…

2011-06-24abs ↗pdf ↗

Paper introduces privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand.

problem Privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand distribution and nonsmooth loss function.
method Developed a clipped noisy gradient descent algorithm based on convolution smoothing for optimal inventory estimation within f-differential privacy framework.
result Achieved privacy-preserving optimal inventory policy with provable privacy guarantees and desirable statistical precision.

We consider a repeated newsvendor problem where the inventory manager has no prior information about the demand, and can access only censored/sales data. In analogy to multi-armed bandit problems, the manager needs to simultaneously "explore" and "exploit" with her inventory decisions, in order to minimize the cumulati…

2017-10-16abs ↗pdf ↗