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,742 papers · 148 categories

Trend · papers per month

16324864 · May 202619922001200920172026
48 results for nonparametric demand

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.

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.

Paper develops PGMM framework for debiased inference on nonparametric IV estimators.

problem Automatic debiased inference on nonparametric IV functionals.
method Penalized GMM (PGMM) framework for functionals of IV estimators.
result PGMM-based debiased estimator performs well, achieving near-nominal coverage.

New method estimates consumer surplus from randomized pricing data.

problem Estimating consumer surplus from observational data, especially in AI-driven pricing.
method Cumulative Propensity Weights (CPW) and Augmented CPW (ACPW) estimators.
result Validated methods for estimating consumer surplus from randomized pricing data.

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

Canonical correlation analysis (CCA) is a classical representation learning technique for finding correlated variables in multi-view data. Several nonlinear extensions of the original linear CCA have been proposed, including kernel and deep neural network methods. These approaches seek maximally correlated projections …

2015-11-16abs ↗pdf ↗

A new method uses GANs for robust optimization under uncertain data.

problem Optimizing supply chains under demand uncertainty with ambiguous distributions.
method Generative adversarial networks (GANs) for data-driven distributionally robust chance constrained programming.
result The approach effectively handles uncertain data distributions and improves supply chain optimization.

New method reduces bias in estimating causal effects from discretized variables.

problem Bias in estimating causal effects from discretized continuous variables.
method Proposes a bias-reduced functional that evaluates outcome regression at within-bin conditional means.
result Demonstrates substantial bias reduction and near-nominal confidence interval coverage.

We propose a framework for general probabilistic multi-step time series regression. Specifically, we exploit the expressiveness and temporal nature of Sequence-to-Sequence Neural Networks (e.g. recurrent and convolutional structures), the nonparametric nature of Quantile Regression and the efficiency of Direct Multi-Ho…

2017-11-29abs ↗pdf ↗

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension DD to increase with the sample size nn. First, we prove lower bounds that show that if we want accurate infe…

2013-09-26abs ↗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 ↗

This paper improves computational efficiency in kernel ridge regression under covariate shift.

problem Covariate shift in nonparametric regression.
method Random projections in RKHS to reduce computational demands.
result Significant computational savings can be achieved without compromising learning performance under covariate shift.

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.

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 ↗

NP-iMCMC algorithm for nonparametric models in universal PPLs.

problem Developing inference algorithms for arbitrary nonparametric models in universal PPLs.
method Unifying involutive MCMC framework with a general procedure for state movement.
result Proves the correctness of the NP-iMCMC sampler and shows significant performance improvements.

A boosting method improves nonparametric density estimation without smoothing assumptions.

problem Overfitting in nonparametric data fitting.
method Introduces a boosting algorithm for univariate nonparametric maximum likelihood estimation.
result Demonstrates the effectiveness of the boosting approach through simulations and real data experiments.

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 ↗

Proposes a new model for more accurate demand forecasting considering dynamic contextual information.

problem Traditional methods fail to capture spatio-temporal and dynamic contextual dependencies in demand forecasting.
method Integrates temporal, relational, spatial, and dynamic contextual dependencies using a Context Integrated Graph Neural Network (CIGNN).
result CIGNN outperforms state-of-the-art baselines in multi-step ahead demand forecasting.

The paper tackles ride-hailing fleet repositioning with a calibrated demand approach.

problem Repositioning idle supply before future demand is observed in ride-hailing.
method A predict-then-optimize approach using calibrated demand regimes, a similarity gate, and spatial queue-regret decomposition.
result The spatial gate reduces mean wait time to 82.3s compared to 85.3s for a hand-tuned similarity gate and 85.8s for a distributional-only baseline.

The study examines Fisher-Riemann geodesics for nonparametric probability densities.

problem Understanding nonparametric probability densities using Fisher-Riemann geometry.
method Obtaining Fisher-Riemann geodesics as a limit of parametric cases with increasing parameters.
result The weak limit approach for nonparametric probability densities.

We consider a firm that sells products over TT periods without knowing the demand function. The firm sequentially sets prices to earn revenue and to learn the underlying demand function simultaneously. A natural heuristic for this problem, commonly used in practice, is greedy iterative least squares (GILS). At each ti…

2016-04-25abs ↗pdf ↗

The Neyman-Pearson (NP) paradigm in binary classification seeks classifiers that achieve a minimal type II error while enforcing the prioritized type I error controlled under some user-specified level αα. This paradigm serves naturally in applications such as severe disease diagnosis and spam detection, where people h…

2018-02-07abs ↗pdf ↗

The volatility of financial instruments is rarely constant, and usually varies over time. This creates a phenomenon called volatility clustering, where large price movements on one day are followed by similarly large movements on successive days, creating temporal clusters. The GARCH model, which treats volatility as a…

2012-12-25abs ↗pdf ↗

Model predicts trading strategies based on latent demand and price impact.

problem Predicting strategic trading behavior of investors with private targets.
method Equilibrium model of dynamic trading, learning, and pricing by strategic investors.
result Trading strategies are a combination of target following, liquidity provision, and front-running based on latent demand and price pressure.

Paper optimizes demand aggregation for low-level electricity markets.

problem Accurate short-term load forecasting at low aggregation levels for market participants.
method Probabilistic portfolio optimization of residential households' demand using ARMA-GARCH models or KDE forecasts.
result Seasonal Residual approach outperforms others in accuracy and efficiency.

Bayesian nonparametric models improve OOD detection, especially with complex covariance structures.

problem Improving out-of-distribution detection methods, especially in complex scenarios.
method Proposes Bayesian nonparametric mixture models with hierarchical priors that generalize the Mahalanobis distance score.
result Bayesian nonparametric methods outperform existing OOD methods, especially in complex scenarios.

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.