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

2.5%5.1%7.6%10.1% · Dec 200219922001200920172026
48 results for Density Evolution

Paper uses RNNs to design LDPC codes for binary erasure channels.

problem Designing capacity-approaching LDPC codes for binary erasure channels.
method Model Density Evolution using RNNs to determine LDPC code coefficients and structure.
result NDE improves LDPC design performance and complexity compared to differential evolution.

The paper proposes a method to learn evolving multivariate distributions from sample paths.

problem Learning the temporal evolution of multivariate densities from sample data.
method Normalizing flows to construct time-dependent mappings.
result The method can approximate evolving probability density functions from observed data.

Model financial markets using open quantum systems to understand market imperfections.

problem Understanding market imperfections through imperfect trading mechanisms.
method Using open quantum systems to represent financial markets, characterizing orbits, and analyzing reduced density matrices.
result Non-classical modes of time evolution can incorporate factors like illiquid trades and imperfect trading mechanisms.

In Rn\mathbb{R}^n with a density eψe^ψ, we study the mean curvature flow associated to the density (ψψ-mean curvature flow or ψψMCF) of a hypersurface. The main results concern with the description of the evolution under ψψMCF of a closed embedded curve in the plane with a radial density, and with a statement of sub…

2015-03-09abs ↗pdf ↗

Parallel score matching accelerates DPM training and improves density estimation.

problem Extended training periods and limited modeling flexibility in DPMs.
method Partitioning the learning task into independent time sub-intervals and modeling the score at each time point separately.
result Significant acceleration of training process and improved density estimation performance.

Flow-based models use ODEs to generate complex data distributions.

problem Generating high-dimensional data with complex probability distributions.
method Flow-based models use invertible mappings governed by ODEs to capture these distributions.
result Flow-based models provide exact likelihood estimation and efficient sampling.

We define Type I singularities for the mean curvature flow associated to a density ψψ (ψψMCF) and describe the blow-up at singular time of these singularities. Special attention is paid to the case where the singularity come from the part of the ψψ-curvature due to the density. We describe a family of curves whose e…

2016-07-28abs ↗pdf ↗

Hierarchical nucleation patterns emerge in deep neural network layers.

problem Understanding the generation of meaningful representations in deep neural networks.
method Analysis of the probability density of ImageNet dataset across hidden layers.
result Density peaks in subsequent layers mirror the semantic hierarchy of concepts, resembling nucleation process.

We consider the evolution of a nn-dimensional convex hypersurface in the euclidean space under mean curvature flow with densities eε12nμ2x2e^{\varepsilon \frac12 nμ^2 |x|^2}, ε=±1\varepsilon =\pm 1, and completely determine it depending on the relation between μμ and the upper or lower bound of the normal curvatures of the ev…

2009-12-22abs ↗pdf ↗

Study measures inequality in social-economic systems using Fokker-Planck equations and Lotka-Volterra dynamics.

problem Measuring inequality in oscillatory social-economic systems described by Fokker-Planck equations and Lotka-Volterra dynamics.
method Used Fokker-Planck equations and Lotka-Volterra dynamics to model inequality, focusing on coefficient of variation as a measure.
result Inequality initially tends to decrease in oscillatory systems, contrary to steady-state models.

The paper studies geometric properties of hydrodynamical density manifolds.

problem Understanding the geometry of hydrodynamical density manifolds.
method Formulating connections, gradients, Hessians, parallel transports, and curvatures on these manifolds.
result Closed-form formulas for sectional curvatures in one-dimensional density manifolds.

Optimal transport (OT) distances between probability distributions are parameterized by the ground metric they use between observations. Their relevance for real-life applications strongly hinges on whether that ground metric parameter is suitably chosen. Selecting it adaptively and algorithmically from prior knowledge…

2019-11-08abs ↗pdf ↗

The study analyzes the evolution of Gaussian measures under a specific gradient flow.

problem Analyzing the evolution of Gaussian measures under a specific gradient flow.
method Derives ordinary differential equations governing the evolution of mean, covariance, and mass under the HK-Boltzmann gradient flow.
result Exponential convergence to equilibrium demonstrated through Polyak-Lojasiewicz-type inequalities.

Paper proposes an alternative to MCMC for sampling in energy-based models.

problem Difficulty in generating samples from the current energy function in contrastive approaches.
method Viewing the evolution of the modeling distribution as the evolution of the energy function and samples from this distribution along a time-dependent vector field.
result The proposed method efficiently matches the current distribution in a finite time, unlike MCMC.

We introduce a geometric evolution equation of hyperbolic type, which governs the evolution of a hypersurface moving in the direction of its mean curvature vector. The flow stems from a geometrically natural action containing kinetic and internal energy terms. As the mean curvature of the hypersurface is the main drivi…

2007-12-01abs ↗pdf ↗

Study on evolving interfaces with complex curvature and density effects.

problem Understanding the dynamics of evolving heterogeneous elastic interfaces.
method Modeling an evolving curve with a density function, analyzing the associated gradient flow evolution.
result Analysis of the preservation and asymptotic behavior of geometric properties in the evolving system.

REGS samples from unnormalized distributions using gradient flow and neural networks.

problem Sampling from unnormalized distributions with high accuracy and efficiency.
method REGS is a particle method that iteratively transforms samples from a reference distribution to match an unnormalized target distribution using Wasserstein gradient flow and neural networks.
result REGS outperforms state-of-the-art methods in sampling from challenging multimodal distributions and real datasets.

We study the temporal evolution of the market efficiency in the stock markets using the complexity, entropy density, standard deviation, autocorrelation function, and probability distribution of the log return for Standard and Poor's 500 (S&P 500), Nikkei stock average index, and Korean composition stock price index (K…

2007-01-16abs ↗pdf ↗

Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using subsampling methods from randomized numerical linear algebra. We derive a simulation tech…

2018-04-06abs ↗pdf ↗

Modeling the evolution of a financial index as a stochastic process is a problem awaiting a full, satisfactory solution since it was first formulated by Bachelier in 1900. Here it is shown that the scaling with time of the return probability density function sampled from the historical series suggests a successful mode…

2008-04-02abs ↗pdf ↗

We analyze the relationships between game theory and quantum mechanics and the extensions to statistical physics and information theory. We use certain quantization relationships to assign quantum states to the strategies of a player. These quantum states are contained in a density operator which describes the new quan…

2006-09-11abs ↗pdf ↗

In this work, we introduce a novel class of adaptive Monte Carlo methods, called adaptive independent sticky MCMC algorithms, for efficient sampling from a generic target probability density function (pdf). The new class of algorithms employs adaptive non-parametric proposal densities which become closer and closer to …

2013-08-17abs ↗pdf ↗

Uncertainty propagation in nonlinear dynamic systems remains an outstanding problem in scientific computing and control. Numerous approaches have been developed, but are limited in their capability to tackle problems with more than a few uncertain variables or require large amounts of simulation data. In this paper, we…

2019-11-21abs ↗pdf ↗

We study optimal estimation for sparse principal component analysis when the number of non-zero elements is small but on the same order as the dimension of the data. We employ approximate message passing (AMP) algorithm and its state evolution to analyze what is the information theoretically minimal mean-squared error …

2015-03-01abs ↗pdf ↗

There is a recent surge of interest in identifying the sharp recovery thresholds for cluster recovery under the stochastic block model. In this paper, we address the more refined question of how many vertices that will be misclassified on average. We consider the binary form of the stochastic block model, where nn ver…

2015-09-10abs ↗pdf ↗

A new kernel framework analyzes spatio-temporal data from dynamic equations.

problem Analyzing spatio-temporal data from dynamic equations with noisy measurements.
method Kernel-based framework with representer theorem for minimizing error with given samples.
result Minimizes error in solutions of dynamic equations with noisy spatio-temporal data.

Develops a neural framework for probabilistic forecasting of dynamical systems.

problem Uncertainty quantification in dynamical systems using trajectory-oriented approaches.
method D2D neural probabilistic forecasting framework using kernel mean embeddings and mixture density networks.
result The D2D model captures distributional evolution in chaotic systems and produces skillful probabilistic forecasts.

SAGE improves memory efficiency by selectively adding, merging, or ignoring new facts.

problem Efficiently managing new facts in agentic LLMs to avoid costly write-time reasoning.
method SAGE uses a von Mises-Fisher-based density estimator to score and route candidate facts.
result SAGE achieves the best average token-F1 on LoCoMo and reduces add-phase API cost by 3.4x on GPT-4o-mini.

A statistical physics model for the time evolutions of stock portfolios is proposed. In this model the time series of price changes are coded into the sequences of up and down spins. The Hamiltonian of the system is introduced and is expressed by spin-spin interactions as in spin glass models of disordered magnetic sys…

2000-11-09abs ↗pdf ↗

Indirect competition emerged from the complex organization of human societies, and knowledge of the existing network topology may aid in developing effective strategies for success. Here, we propose an agent-based model of competition with systems co-existing in a `small-world' social network. We show that within the r…

2008-07-19abs ↗pdf ↗

Physics-informed neural networks approximate diffusion process pdfs efficiently.

problem Approximating the probability density function of diffusion processes.
method Physics-informed neural networks solving Fokker-Planck or integro-differential equations.
result Neural network solutions approximate target solutions for various types of differential equations.

We present results about financial market observables, specifically returns and traded volumes. They are obtained within the current nonextensive statistical mechanical framework based on the entropy Sq=k1i=1Wpiq1q(q)S_{q}=k\frac{1-\sum\limits_{i=1}^{W} p_{i} ^{q}}{1-q} (q\in \Re) ($S_{1} \equiv S_{BG}=-k\sum\limits_{i=1}^{W}p_{i} \l…

2006-01-31abs ↗pdf ↗