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.

169,051 papers · 148 categories

Trend · papers per month

2.5%5.0%7.5%10.0% · Jun 199419922001200920172026
48 results for Arrow-Debreu densities

Physics methods improve derivatives pricing accuracy and efficiency.

problem Developing accurate and efficient approximations for derivatives pricing.
method Effective-potential path-integrals methods from physics.
result The method provides remarkably accurate results for high volatility and multi-year time horizons.

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

2014-12-13abs ↗pdf ↗

The paper reviews historical and modern approaches to asset pricing probability measures.

problem Constructing or selecting probability measures for asset pricing.
method Historical review of various approaches including state price theory, martingale measures, and modern data-driven methods.
result Modern asset pricing involves constructing, transforming, or selecting probability measures to represent market prices.

It is shown that absence of arbitrage opportunity in financial markets is a particular case of existence of uncertainty in decision system. Absence of arbitrage opportunity is considered in the sense of the Arrow-Debreu model of financial market with a riskless asset, while uncertainty (or ambiguity) is defined on the …

2013-07-22abs ↗pdf ↗

We propose a simple dynamical model of the formation of production networks among monopolistically competitive firms. The model subsumes the standard general equilibrium approach à la Arrow-Debreu but displays a wide set of potential dynamic behaviors. It robustly reproduces key stylized facts of firms' demographics. O…

2015-09-03abs ↗pdf ↗

This paper provides an attempt to formalize Hayek's notion of spontaneous order within the framework of the Arrow-Debreu economy. Our study shows that if a competitive economy is enough fair and free, then a spontaneous economic order shall emerge in long-run competitive equilibria so that social members together occup…

2012-10-02abs ↗pdf ↗

Nonparametric pricing and hedging of exotic derivatives using signature payoffs.

problem Pricing and hedging exotic derivatives accurately and efficiently.
method Introducing signature payoffs and using them to approximate and price exotic derivatives nonparametrically.
result Signature payoffs enable accurate and computationally tractable pricing and hedging of exotic derivatives.

Our study shows that many firms would accumulate at zero output level (namely, Bankruptcy status) if a perfectly competitive market reaches full employment (namely, those people who should obtain employment have obtained employment). As a result, appearance of economic crisis is determined by two points; that is, (a). …

2010-10-22abs ↗pdf ↗

We provide a lean, non-technical exposition on the pricing of path-dependent and European-style derivatives in the Cox-Ross-Rubinstein (CRR) pricing model. The main tool used in the paper for cleaning up the reasoning is applying static hedging arguments. This can be accomplished by taking various routes through some a…

2017-04-29abs ↗pdf ↗

We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper and Shigeno. We give a polynomial time combinatorial algorithm for solving corresponding flow maximization problems, finding an epsi…

2011-09-18abs ↗pdf ↗

These notes discuss several topics in neoclassical economics and alternatives, with an aim of reviewing fundamental issues in modeling economic markets. I start with a brief, non-rigorous summary of the basic Arrow-Debreu model of general equilibrium, as well as its extensions to include time and contingency. I then ar…

2009-02-25abs ↗pdf ↗

We consider a financial contract that delivers a single cash flow given by the terminal value of a cumulative gains process. The problem of modelling and pricing such an asset and associated derivatives is important, for example, in the determination of optimal insurance claims reserve policies, and in the pricing of r…

2007-10-15abs ↗pdf ↗

MCD reformulates conditional density estimation into binary classification.

problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.

Paper proposes MMC to avoid high-density bias in clustering.

problem High-density bias in density-based clustering.
method Introduces mass distribution as a better foundation for clustering, proposing mass-maximization clustering (MMC).
result MMC avoids high-density bias and discovers clusters of arbitrary shapes, sizes, and densities.

New method minimizes robust density power-based divergences for general parametric densities.

problem Computational complexity of minimizing DPD for general parametric densities.
method Stochastic approach to minimize DPD for general parametric density models.
result Proposed method can be applied to minimize other density power-based γ-divergences.

Study exact minimax rates for density estimation over convex classes, extending previous work.

problem Deriving minimax rates for density estimation over convex density classes.
method Building on Le Cam's work, determine exact minimax rates using local metric entropy.
result Exact minimax rates derived for any convex density class, including nonparametric and parametric cases.

New method uses SoS densities and α-divergences for efficient sequential transport maps.

problem Efficiently generating samples from approximated densities.
method Sequential transport maps using Sum-of-Squares (SoS) densities and α-divergences.
result Convex optimization problems with efficient semidefinite programming solutions.

The volume density of a hyperbolic link is defined as the ratio of hyperbolic volume to crossing number. We study its properties and a closely-related invariant called the determinant density. It is known that the sets of volume densities and determinant densities of links are dense in the interval [0,v_{oct}]. We cons…

2015-10-20abs ↗pdf ↗

TAKDE optimizes kernel density estimation for real-time dynamic processes.

problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.

Optimizes kernel density ratios for better predictions and information measures.

problem Improving accuracy of kernel density estimates for density ratios.
method Derives an optimal weight function using calculus of variations.
result Reduces bias in kernel density estimates, leading to improved prediction posteriors and information-theoretic measures.

Quantum method improves neural density estimation in high dimensions.

problem High-dimensional density estimation with poor performance and high computational complexity.
method Adaptive Fourier features based on quantum density matrices, integrated with neural networks.
result Competitive performance compared to state-of-the-art methods in various datasets.

Defines hierarchical clustering axioms for various densities.

problem Defining hierarchical clustering for different types of densities.
method An axiomatic approach to piecewise constant densities, then extending to general densities.
result Our axiomatic definition results in Hartigan's cluster tree under certain conditions.

The paper analyzes kNN density estimation's convergence rates under different conditions.

problem Analyzing convergence rates of kNN density estimation under bounded and unbounded support conditions.
method Examined two cases: bounded support with known and unknown support sets, and unbounded support with smooth density function.
result kNN density estimation is minimax optimal under certain conditions and better than kernel density estimation in some cases.

Develops spherical density-equalizing maps for closed surfaces.

problem Lack of methods for genus-0 closed surfaces.
method Conformal parameterization onto unit sphere, density equalization, quasi-conformal theory, harmonic energy, landmark constraints.
result Landmark-aligned spherical density-equalizing maps balancing different distortion measures.

Method uses normalizing flows to efficiently sample from complex target densities.

problem Sampling from complex target densities with zero values in regions of transformation.
method Normalizing flows to address exploding reverse Kullback-Leibler divergence.
result Demonstrated efficient sampling from multi-mode complex density function.

DADC algorithm improves clustering for data with varying density.

problem Sparse cluster loss and cluster fragmentation in density peak clustering.
method Domain-adaptive density measurement, cluster center self-identification, and cluster self-ensemble.
result DADC achieves more reasonable clustering results on data with varying density.