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

3367100133 · Jun 202019922001200920172026
48 results for unknown demand

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.

The paper tackles revenue management with time-varying demand using posterior sampling.

problem Maximizing revenue in real-time applications with unknown and time-varying demand.
method Episodic generalization of RM problem, posterior sampling algorithm for linear programming optimization.
result The proposed algorithm outperforms other methods and is comparable to the optimal policy in hindsight.

This paper addresses privacy issues in personalized pricing using nonparametric demand models.

problem Privacy violation in personalized pricing algorithms with unknown nonparametric demand models.
method Develops algorithms to make pricing decisions and learn demand while ensuring central and local differential privacy.
result Proves near-optimal regret bounds for algorithms with CDP and LDP guarantees.

Motivated by posted price auctions where buyers are grouped in an unknown number of latent types characterized by their private values for the good on sale, we investigate revenue maximization in stochastic dynamic pricing when the distribution of buyers' private values is supported on an unknown set of points in [0,1]…

2018-07-09abs ↗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.

Dynamic pricing policy converges to Nash equilibrium with low regret.

problem Sequential price competition among sellers over multiple periods.
method Semi-parametric least-squares estimation of s-concave demand functions.
result Prices converge to Nash equilibrium with rate O(T1/7)O(T^{-1/7}) and sellers incur regret O(T5/7)O(T^{5/7}).

New approach uses deep generative models for inventory and pricing decisions.

problem Data-driven inventory and pricing decisions in feature-based newsvendor problems.
method Conditional deep generative models (cDGMs) to learn demand distribution and generate probabilistic forecasts.
result Effective in optimizing inventory and pricing decisions, with theoretical guarantees and real-world applications.

We consider a fundamental dynamic allocation problem motivated by the problem of securities lending\textit{securities lending} in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource to nn clients, each of whom has a priv…

2019-12-12abs ↗pdf ↗

Bayesian neural networks' performance varies with prior choice, affecting their ability to identify unknowns.

problem The impact of prior choice on Bayesian neural networks' ability to identify unknowns.
method Evaluation of different prior distributions on classification tasks using BNNs and NNs with Monte Carlo dropout.
result Prior choice significantly impacts BNNs' ability to identify unknowns, affecting true and false positive rates.

This paper addresses dynamic price discrimination with fairness constraints.

problem Dynamic price discrimination with fairness constraints in online retailing.
method Nonparametric demand models, dynamic pricing policy, regret minimization.
result Optimal dynamic pricing policy with ildeO(T4/5) ilde{O}(T^{4/5}) regret for price fairness.

Supplier learns to price contracts against a learning retailer.

problem Designing data-driven pricing policies for a supplier facing a learning retailer.
method Connecting to non-stationary online learning, proposing dynamic pricing policies for discrete and continuous demand.
result Supplier's pricing policies lead to sublinear regret bounds under various retailer learning policies.

New adaptive test for NPIV models controls size and has superior power.

problem Testing inequality and equality restrictions in nonparametric IV models.
method Adaptive hypothesis test based on modified leave-one-out sample quadratic distance.
result Adaptive test attains the adaptive minimax rate of testing in L2L^{2}.

We study the problem of learning shared structure \emph{across} a sequence of dynamic pricing experiments for related products. We consider a practical formulation where the unknown demand parameters for each product come from an unknown distribution (prior) that is shared across products. We then propose a meta dynami…

2019-02-28abs ↗pdf ↗

Demand variance can result in a mismatch between planned supply and actual demand. Demand shaping strategies such as pricing can be used to shift elastic demand to reduce the imbalance. In this work, we propose to consider elastic demand in the forecasting phase. We present a method to reallocate the historical elastic…

2018-09-09abs ↗pdf ↗

ECP optimizes expensive functions without knowing Lipschitz constant.

problem Optimizing expensive, non-convex functions with unknown Lipschitz constants.
method ECP minimizes evaluations by focusing on potentially optimal regions, eliminating Lipschitz constant estimation.
result Guaranteed no-regret performance and minimax-optimal regret bounds.

In this paper, we combine ideas from machine learning (ML) and operations research and management science (OR/MS) in developing a framework, along with specific methods, for using data to prescribe optimal decisions in OR/MS problems. In a departure from other work on data-driven optimization and reflecting our practic…

2014-02-22abs ↗pdf ↗

A new metric optimizes forecasts for lumpy, intermittent demand.

problem Inaccurate demand forecasts lead to suboptimal logistics and production.
method Developed a novel metric that considers both statistical and business aspects.
result The new metric yields more accurate predictions for lumpy and intermittent demand.

Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

problem Global constraints in mean-field reinforcement learning for multi-agent systems.
method Safe-M3^3-UCRL uses epistemic uncertainty and log-barrier approach to ensure constraints satisfaction.
result Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

Paper introduces Decentralized Non-stationary Competing Bandits ( exttt{DNCB}) for dynamic matching markets.

problem Understanding dynamic two-sided matching markets with competing agents.
method Proposes a decentralized asynchronous learning algorithm ( exttt{DNCB}) for non-stationary environments.
result Obtains sub-linear (logarithmic) regret of exttt{DNCB} in dynamic settings.

Recommending the right products is the central problem in recommender systems, but the right products should also be recommended at the right time to meet the demands of users, so as to maximize their values. Users' demands, implying strong purchase intents, can be the most useful way to promote products sales if well …

2019-02-12abs ↗pdf ↗

Novel probabilistic models forecast residential heating and electricity demand at hourly resolution.

problem Accurate hourly forecasting of residential heating and electricity demand.
method Probabilistic deep learning models trained on gas-heated region data.
result Significant improvement in forecast accuracy compared to NREL's ResStock model.

Heat demand prediction is a prominent research topic in the area of intelligent energy networks. It has been well recognized that periodicity is one of the important characteristics of heat demand. Seasonal-trend decomposition based on LOESS (STL) algorithm can analyze the periodicity of a heat demand series, and decom…

2018-07-28abs ↗pdf ↗

Intermittent demand, where demand occurrences appear sporadically in time, is a common and challenging problem in forecasting. In this paper, we first make the connections between renewal processes, and a collection of current models used for intermittent demand forecasting. We then develop a set of models that benefit…

2019-11-23abs ↗pdf ↗