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

3875113150 · Jun 202019922001200920172026
48 results for density reconstruction

Method reconstructs financial networks from aggregate data, revealing critical link density.

problem Reconstructing financial networks from aggregate data is challenging due to unreconstructability phases.
method Random graph generation with desired link density and replicated constraints.
result There is a critical link density below which networks become unreconstructable.

In this work, we study the problem of reconstructing shapes from simple nonasymptotic densities measured only along shape boundaries. The particular density we study is also known as the integral area invariant and corresponds to the area of a disk centered on the boundary that is also inside the shape. It is easy to s…

2013-08-12abs ↗pdf ↗

We introduce a novel conditional density estimation model termed the conditional density operator (CDO). It naturally captures multivariate, multimodal output densities and shows performance that is competitive with recent neural conditional density models and Gaussian processes. The proposed model is based on a novel …

2019-05-27abs ↗pdf ↗

Reconstruction of density functions and their characteristic functions by radial basis functions with scattered data points is a popular topic in the theory of pricing of basket options. Such functions are usually entire or admit an analytic extension into an appropriate tube and "bell-shaped" with rapidly decaying tai…

2014-04-21abs ↗pdf ↗

Reconstructing weighted networks from partial information is necessary in many important circumstances, e.g. for a correct estimation of systemic risk. It has been shown that, in order to achieve an accurate reconstruction, it is crucial to reliably replicate the empirical degree sequence, which is however unknown in m…

2016-10-18abs ↗pdf ↗

Algorithms for Magnetic Resonance (MR) image reconstruction from undersampled measurements exploit prior information to compensate for missing k-space data. Deep learning (DL) provides a powerful framework for extracting such information from existing image datasets, through learning, and then using it for reconstructi…

2017-11-30abs ↗pdf ↗

GCVAE improves disentanglement in VAEs while balancing reconstruction error.

problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.

New quantum state reconstruction method accelerates convergence.

problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.

We present a novel synthesis of Fisher information and asset pricing theory that yields a practical method for reconstructing the probability density implicit in security prices. The Fisher information approach to these inverse problems transforms the search for a probability density into the solution of a differential…

2003-02-27abs ↗pdf ↗

We introduce the problem of reconstructing a sequence of multidimensional real vectors where some of the data are missing. This problem contains regression and mapping inversion as particular cases where the pattern of missing data is independent of the sequence index. The problem is hard because it involves possibly m…

2011-09-15abs ↗pdf ↗

Training of the neural autoregressive density estimator (NADE) can be viewed as doing one step of probabilistic inference on missing values in data. We propose a new model that extends this inference scheme to multiple steps, arguing that it is easier to learn to improve a reconstruction in kk steps rather than to lea…

2014-06-05abs ↗pdf ↗

Enhances diffusion models by preprocessing data to improve reconstruction quality.

problem Slow sampling and poor reconstruction quality in diffusion models, especially for small-scale networks.
method Applying Gaussianization preprocessing to the training data to make the target distribution more Gaussian-like.
result Improves generation quality, especially in the early stages of reconstruction with small networks.

Jointly estimates flow fields and particle properties from Lagrangian data.

problem Estimating flow fields and particle properties from sparse, noisy Lagrangian data.
method Data assimilation framework coupling Eulerian and Lagrangian models.
result Joint estimation of flow fields and particle properties in various flow regimes.

Bayesian inference reconstructs external potentials in DFT for many-particle systems.

problem Reconstructing external potentials in classical density-functional theory (DFT) for many-particle systems.
method Combines Bayesian inference with classical DFT to probabilistically reconstruct external potentials.
result Accurately infers external potentials and density profiles with uncertainty quantification.

Reduces field theories on principal bundles by a subgroup, deriving reduced equations.

problem Hamiltonian field theories on principal G-bundles with invariant densities.
method Lie-Poisson reduction using covariant bracket formulation.
result Derives reduced observables, brackets, and equations of motion for field theories.

Method estimates joint probability density from samples using low-rank decomposition and random projections.

problem Estimating joint probability density from limited samples.
method Low-rank tensor decomposition, dictionaries, and Radon transforms.
result Algorithm outperforms previous methods in estimating synthetic probability densities.

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.

Adaptive multi-stage density ratio estimation improves learning of latent space EBM.

problem Learning energy-based models in latent space is computationally expensive and challenging.
method Adaptive multi-stage density ratio estimation using NCE to bridge the gap between prior and posterior densities.
result The method enables more expressive prior models and sharpens the latent space EBM.

BMTI method estimates densities without bins, outperforming traditional estimators.

problem Nonparametric, robust, and data-efficient density estimation in high-dimensional spaces.
method BMTI integrates log-density differences between neighboring points, weighted by uncertainties, using a maximum-likelihood formulation.
result BMTI reconstructs smooth profiles in high-dimensional spaces, outperforming traditional estimators.

Derives continuum model from discrete ε\varepsilon-graphs with connectivity functional.

problem Modeling diffusion in networks with varying connectivity.
method Energy-based continuum limit derivation, neural-network reconstruction of connectivity.
result Error between discrete and continuum energies is O(ε)O(\varepsilon), valid even with fluctuations.

EnVAE uses energy score for likelihood-free VAEs, improving image reconstructions.

problem Likelihood misspecification in VAEs leads to blurry reconstructions and poor data fidelity.
method Deterministic decoder, energy score as reconstruction loss, fast variant for efficiency.
result EnVAE achieves superior reconstruction and generation quality compared to likelihood-based baselines.

Paper proposes a novel auto-encoder for latent density estimation.

problem Challenges of learning generative probabilistic models due to curse of dimensionality.
method Joint dimensionality reduction and non-parametric density estimation framework using a novel estimator.
result Proposed model achieves promising results on various datasets.

Deep-learning improves 6x6-mm OCTA angiograms by reducing noise and artifacts.

problem Reduced scan quality in 6x6-mm OCTA angiograms due to undersampling.
method Deep-learning-based high-resolution angiogram reconstruction network (HARNet) trained on 3x3-mm and 6x6-mm angiogram data.
result Reconstructed 6x6-mm angiograms have lower noise and better vascular connectivity.

Acquisition of Magnetic Resonance Imaging (MRI) scans can be accelerated by under-sampling in k-space (i.e., the Fourier domain). In this paper, we consider the problem of optimizing the sub-sampling pattern in a data-driven fashion. Since the reconstruction model's performance depends on the sub-sampling pattern, we c…

2019-01-07abs ↗pdf ↗

Paper proposes an alternative to set losses for predicting unordered variables without imposing structure.

problem Learning unordered variables with unknown interrelations without imposing structure.
method Viewing set prediction as conditional density estimation and using deep energy-based models with gradient-guided sampling.
result Empirically demonstrates capability to learn multi-modal densities and produce different plausible predictions.

New method reconstructs interbank networks enforcing reciprocity to improve stability and risk prediction.

problem Lack of public interbank network data and difficulty in replicating cycles.
method Proposes a new network reconstruction method enforcing sparsity and link reciprocity from aggregate data.
result Adding reciprocity improves prediction of network properties, including largest real eigenvalue and eccentricity of eigenvalues.