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

75150225300 · Jun 202019922001200920172026
48 results for offline dynamic inventory

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.

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.

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 ↗

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.

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.

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.

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.

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

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

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.

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.

Unified framework connects two market-making models, revealing their underlying equivalence.

problem Independent calibration of two market-making frameworks (Avellaneda-Stoikov and Cartea-Jaimungal).
method Axiomatic approach to market preference functional, showing equivalence under specific conditions.
result Avellaneda-Stoikov and Cartea-Jaimungal frameworks are equivalent under certain conditions.

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.

Investigates market dynamics with informed traders and high-frequency traders.

problem Trading large orders in a market with multiple high-frequency traders.
method Analyzes a three-period Kyle's model with a normal-speed informed trader and multiple anticipatory high-frequency traders under different inventory pressures.
result Surprising results: improving HFTs' speed or prediction can harm them but benefit the informed trader.

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 analyzes sample complexity for offline RL with deep ReLU networks.

problem Theoretical analysis of sample complexity for offline RL with deep ReLU networks.
method Establishes sample complexity for offline RL with deep ReLU networks, considering Besov dynamic closure and correlated structure.
result First theoretical characterization of sample complexity for offline RL with deep neural network function approximation.

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.

BOMS enhances offline MBRL by improving model selection with Bayesian optimization.

problem Inaccurate model selection in offline MBRL due to distribution shift.
method Proposes BOMS, an active model selection framework using Bayesian optimization.
result Improves model selection with only a small amount of online interaction.

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 ↗

Algorithm learns optimal dynamic mechanisms from data.

problem Designing optimal mechanisms for dynamic settings with unknown reward functions.
method Offline reinforcement learning with pessimism principle.
result Learned mechanisms are efficient, individually rational, and truthful.

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.

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.

Proposes EDESH-SA for better inventory management under uncertainty.

problem Inventory management under uncertainty.
method Ensemble Differential Evolution with simulation-based hybridization and self-adaptation.
result Improves financial performance and optimizes search spaces.

MOOSE improves offline RL robustness by using dynamics models.

problem Low robustness of model-free offline RL algorithms in industrial settings.
method MOOSE uses dynamics models to assess policy performance, keeping policies within data support.
result MOOSE outperforms state-of-the-art model-free offline RL algorithms in robust performance.

Identifies latent actions and dynamics from offline data with diverse demonstrators.

problem Recovering latent actions and environment dynamics from action-free trajectories.
method Assumes distinct policies for each demonstrator, identifies latent transitions and policies via matrix factorization.
result Identifies latent transitions and demonstrator policies up to permutation.

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.

New method learns policies from offline data using operator models.

problem Limited understanding of approximation errors in offline reinforcement learning.
method Linking reinforcement learning to Hamilton-Jacobi-Bellman equation, proposing operator-theoretic algorithm.
result Global convergence of the value function and finite-sample guarantees derived.

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.

Optimal market making strategy with price forecasts reduces inventory costs and spreads.

problem Optimal market making strategy with price forecasts reduces inventory costs and spreads.
method Modeling market making strategy with linear price impact, random slope and intercept, and simultaneous order arrivals.
result Simultaneous order arrivals and price forecasts reduce inventory costs and spreads.

A new algorithm uses IVs to learn optimal policies from observational data.

problem Learning optimal policies from unobserved variable confounded data.
method IV-aided Value Iteration (IVVI) algorithm based on conditional moment restrictions.
result First provably efficient algorithm for instrument-aided offline RL.

Model analyzes competitive pricing strategies in large markets of perishable products.

problem Maximizing profits in a competitive market of perishable products.
method Mean-field competition model, Hamilton-Jacobi-Bellman equation, iterative numerical algorithm.
result Properties of equilibrium pricing strategies and market dynamics.

New algorithms tackle robust RL with linear models, revealing unique challenges.

problem Distributionally robust offline RL with uncertainty in dynamics.
method Proposes minimax optimal and computationally efficient algorithms using novel function approximation mechanisms.
result Function approximation in robust offline RL is distinct and harder than in standard offline RL.

The paper tackles reward-relevance in offline RL with sparse decision dynamics.

problem Offline reinforcement learning with sparse decision dynamics and estimation sparsity.
method Reward-filtered least-squares policy evaluation using thresholded lasso.
result The method provides theoretical guarantees with sample complexity dependent on sparse component size.

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 ↗