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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for inverse demand function

Model predicts asset prices from initial shocks using neural networks.

problem Missing data on actual asset liquidations limits model calibration.
method Dual neural network structure, first stage maps shocks to liquidations, second stage uses liquidations to predict prices.
result Model accurately predicts equilibrium prices from initial shocks without liquidation data.

Learning customer preferences from an observed behaviour is an important topic in the marketing literature. Structural models typically model forward-looking customers or firms as utility-maximizing agents whose utility is estimated using methods of Stochastic Optimal Control. We suggest an alternative approach to stud…

2017-12-13abs ↗pdf ↗

Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to compute the inverse or inverse square root of a matrix whose size is quadratic of …

2018-04-16abs ↗pdf ↗

The Gaussian process (GP) is a nonparametric prior distribution over functions indexed by time, space, or other high-dimensional index set. The GP is a flexible model yet its limitation is given by its very nature: it can only model Gaussian marginal distributions. To model non-Gaussian data, a GP can be warped by a no…

2019-06-23abs ↗pdf ↗

VISION-XL improves HD video quality using latent image diffusion models.

problem Improving high-definition video quality and resolution.
method Latent image diffusion models and pseudo-batch consistent sampling.
result State-of-the-art video reconstruction across various inverse problems.

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 ↗

Develops flexible non-parametric ACFs using B-spline kernels.

problem Flexible modelling of the autocovariance function (ACF) in time-series, spatial, and spatio-temporal analysis.
method Derives the inverse Fourier transform of B-spline spectral bases to create a general class of non-parametric ACFs.
result Provides a provably dense, flexible, and general class of non-parametric ACFs for various types of processes.

The paper addresses uncertainty in demand prediction for dynamic pricing.

problem Uncertainty quantification in the demand function for dynamic pricing.
method Developed a debiased approach to construct accurate confidence intervals for the demand function.
result Asymptotic normality guarantee of the debiased estimator for the demand function.

Generative model creates frictional surfaces from friction laws.

problem Designing frictional interfaces with prescribed behavior is challenging.
method Uses Variational Autoencoders (VAEs) to infer surface topographies from friction laws.
result Efficiently generates candidate topographies without contact simulations.

Network models assume unrealistic idiosyncratic risk, which can be mitigated by allowing for correlated shocks.

problem Network models assume idiosyncratic risk, which can be unrealistic and lead to incorrect predictions.
method Proposed a production-based asset pricing model to account for substitutability between trade partners and correlation in supply and demand shocks.
result Assets positively exposed to average propagation of upstream and downstream shocks earn lower average risk premia.

FlowChef steers RFMs to efficiently guide image generation tasks.

problem Efficiently guiding image generation tasks with RFMs.
method Developed a theoretical and empirical understanding of RFMs' vector field dynamics, proposing FlowChef for gradient-free navigation.
result FlowChef significantly outperforms baselines in performance, memory, and time requirements.

This research improves demand forecasting by predicting complete probability density functions using machine learning.

problem Forecasting complete probability density functions for better operational decision making.
method Supervised machine learning method 'Cyclic Boosting' for explainable predictions.
result Predicted probability density functions are fully explainable and avoid 'black-box' models.

This study proposes an efficient surrogate for Darcy flow inverse problems.

problem Efficiently constructing accurate surrogate models for high-dimensional complex inverse problems.
method Sequential Bayesian design strategy to acquire a locally accurate surrogate model focusing on high-probability regions.
result The proposed method accelerates inversion accuracy and computational speed.

Study finds non-monotonic Value of Information in dynamic multi-market monopoly.

problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.

In the present work we demonstrate the application of different physical methods to high-frequency or tick-by-tick financial time series data. In particular, we calculate the Hurst exponent and inverse statistics for the price time series taken from a range of futures indices. Additionally, we show that in a limit orde…

2007-12-18abs ↗pdf ↗

Scientists often express their understanding of the world through a computationally demanding simulation program. Analyzing the posterior distribution of the parameters given observations (the inverse problem) can be extremely challenging. The Approximate Bayesian Computation (ABC) framework is the standard statistical…

2014-01-13abs ↗pdf ↗

Efficiently optimizes hyperparameters for PDE and inverse problems using Gaussian processes.

problem Hyperparameter optimization for scientific computing and inference methods.
method Bilevel optimization with Gauss-Newton linearization for efficient hyperparameter updates.
result Significant improvements in accuracy and robustness compared to random initialization.

This paper compares AMMs and LOBs in exchange mechanisms, formalizing complexity vs. expressiveness trade-offs.

problem Designing efficient exchange mechanisms between assets.
method Formalizes a complexity-approximation trade-off for CFMMs and LOBs, introducing an exchange complexity measure.
result Optimally expressive mechanisms can be designed with minimal complexity, allowing for arbitrary demand curves.

Inverse reinforcement learning (IRL) is the problem of learning the preferences of an agent from the observations of its behavior on a task. While this problem has been well investigated, the related problem of {\em online} IRL---where the observations are incrementally accrued, yet the demands of the application often…

2018-05-21abs ↗pdf ↗

Unified framework for Bayesian PDE-constrained inversion using physics-informed neural networks.

problem Incorporating prior distributions in function space into Bayesian PINN-based inversion.
method Functional-prior-based approaches (fpBPINN) to Bayesian PDE-constrained inversion using physics-informed neural networks (PINNs). Two complementary approaches: FPI-BPINN and fParVI-PINN.
result Accurate estimation of posterior distributions in seismic traveltime tomography and Darcy-flow permeability inversion.

The paper proves a generalized inverse function theorem for curved LL_\infty spaces.

problem Proving a generalized inverse function theorem for curved LL_\infty spaces.
method Obstruction theory for LL_\infty homomorphisms and homotopy transfer theorem for curved LL_\infty algebras.
result A morphism of curved LL_\infty spaces which is a quasi-isomorphism at a point has a local homotopy inverse.

This article presents a proof of the existence of Bertrand-Nash equilibrium prices with multi-product firms and under the Logit model of demand that does not rely on restrictive assumptions on product characteristics, firm homogeneity or symmetry, product costs, or linearity of the utility function. The proof is based …

2010-12-28abs ↗pdf ↗

Flow Annealing Posterior Sampling unifies stochastic-process regression and PDE inverse problems.

problem Function-space posterior sampling for stochastic processes and inverse problems.
method Flow Annealing Posterior Sampling (FAPS) using pretrained function-space flow-matching priors.
result Coherent posterior samples with accurate uncertainty quantification.

New method for estimating parameters in inverse problems using double robustness.

problem Estimating parameters defined as linear functionals of solutions to linear inverse problems.
method Source condition double robust inference method that uses iterated Tikhonov regularized adversarial estimators.
result Asymptotic normality of the parameter of interest as long as either the primal or dual inverse problem is sufficiently well-posed.

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

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

New framework estimates demand responses across multiple contexts with limited price variation.

problem Estimating heterogeneous linear price-response functions across multiple contexts with limited price variation and confounding.
method Meta-learning framework that identifies conditional mean of task-specific causal demand parameters given a subset of task-specific observables.
result Improved recovery of demand responses relative to standard transfer-learning baselines.

Proposes a method to learn both constraints and objective functions from data.

problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.

New algorithms handle online prediction with bandit and delayed feedback, improving regret bounds.

problem Achieving finite bounds on surrogate regret with limited feedback.
method Proposed algorithms for bandit and delayed feedback, including inverse-weighted gradient and pseudo-inverse matrix estimators.
result Achieved improved surrogate regret bounds of O(KT)O(\sqrt{KT}) and O(T2/3)O(T^{2/3}).