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

91181272362 · Jun 202019922001200920172026
48 results for Stochastic Reconstruction

Single linear solve combines surface reconstruction and uncertainty quantification.

problem Reconstructing surfaces from partial point clouds with uncertainty.
method Geometric Gaussian processes for stochastic surface reconstruction.
result Single linear solve for surface reconstruction with probabilistic capabilities.

Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.

problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.

This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.

problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two en…

2015-02-11abs ↗pdf ↗

Cryo-EM reconstruction is reformulated as a stochastic inverse problem to handle structural heterogeneity.

problem Handling structural heterogeneity in cryo-EM 3D reconstruction.
method Formulated as a stochastic inverse problem over probability measures, using variational discrepancy and Wasserstein gradient flow.
result Validated approach using synthetic examples, demonstrating recovery of continuous structural distributions.

Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.

problem Impact of numerical discretization on parameter reconstructions and model parameter distributions.
method Bayesian target vector optimization, finite element model, Gaussian process, stochastic machine learning surrogate models, Markov chain Monte Carlo sampler.
result Numerical discretization parameters impact the accuracy and distribution of reconstructed model parameters.

This study uses CNN-IOs to estimate MRI image reconstruction performance bounds.

problem Estimating task-based performance limits for MRI image reconstruction methods.
method Utilized stylized multi-coil SENSE MRI systems and deep-generated stochastic models to estimate IO performance.
result Estimation of IO performance provides guidance for designing under-sampled MRI systems.

Develops a new method to create object models from medical images.

problem Variability in anatomical structures and textures limits observer performance.
method Progressive Growing AmbientGAN (ProAmGAN) for creating stochastic object models from medical imaging measurements.
result Demonstrates the effectiveness of ProAmGAN in creating realistic object models.

This work combines deep learning and sparse coding for CT image reconstruction.

problem Improving image quality in low-dose CT scans.
method Sparse signal representation using learned dictionaries, inspired by variational autoencoders and deep learning techniques.
result Regularization with learned dictionaries achieves competitive performance in CT reconstruction.

We present a method for the reconstruction of networks, based on the order of nodes visited by a stochastic branching process. Our algorithm reconstructs a network of minimal size that ensures consistency with the data. Crucially, we show that global consistency with the data can be achieved through purely local consid…

2010-06-04abs ↗pdf ↗

Paper extracts features from time series to improve forecasting accuracy.

problem Forecasting time series generated by Itô-type processes with unknown coefficients.
method Statistical adjustment of mixture-type models to extract features from time series data.
result Additional statistical features enhance time series prediction accuracy.

This research improves deep neural networks for parameter identification and prediction in stochastic Volterra integral equations.

problem Parameter identification and prediction in Volterra integral equations driven by Gaussian noise.
method Improved deep neural networks framework that incorporates inter-output relationships into the loss function.
result The framework enhances parameter estimation accuracy and provides accurate solutions for modeling stochastic systems.

We consider inpainting in an unsupervised setting where there is neither access to paired nor unpaired training data. The only available information is provided by the uncomplete observations and the inpainting process statistics. In this context, an observation should give rise to several plausible reconstructions whi…

2019-12-18abs ↗pdf ↗

Scalable model checking for stochastic systems using Gaussian Processes and Bayesian Neural Networks.

problem Efficiently verifying properties of stochastic systems with high-dimensional parameter spaces.
method Stochastic Variational Smoothed Model Checking (SV-smMC) using Gaussian Processes and Bayesian Neural Networks.
result SV-smMC scales to larger datasets and enables application to high-dimensional parameter spaces.

A semi-supervised framework using stochastic interpolation and latent representations.

problem Challenges in conditional generative modeling with scarce labeled data.
method Combines conditional stochastic interpolation with low-dimensional latent representations.
result Significantly improves sample complexity and achieves faster convergence rate.

Paper analyzes PSGLD for adaptive IRL with finite-sample bounds.

problem Estimating cost function of a forward learner using noisy gradients.
method Passive stochastic gradient Langevin dynamics (PSGLD) algorithm.
result Explicit bounds on 2-Wasserstein distance between PSGLD sample measure and stationary measure.

We solve the compressive sensing problem via convolutional factor analysis, where the convolutional dictionaries are learned {\em in situ} from the compressed measurements. An alternating direction method of multipliers (ADMM) paradigm for compressive sensing inversion based on convolutional factor analysis is develope…

2017-01-11abs ↗pdf ↗

CNPs improve function approximation by contrastive learning.

problem Learning from non-i.i.d function instantiations in high-dimensional, noisy spaces.
method CNPs with TCL and FCL contrastive branches for better function approximation.
result CNPs outperform other variants in function distribution reconstruction and parameter identification.

Based on criteria of mathematical simplicity and consistency with empirical market data, a stochastic volatility model is constructed, the volatility process being driven by fractional noise. Price return statistics and asymptotic behavior are derived from the model and compared with data. Deviations from Black-Scholes…

2006-02-01abs ↗pdf ↗

New method generates clean data from corrupted observations.

problem Generating clean data from corrupted observations.
method Iterative update of a transport map using black-box corruption channel access.
result Converges to a self-consistent transport map that effectively inverts the corruption channel.

The study uses Markov chains to forecast cryptocurrency market dynamics.

problem Forecasting and understanding market fluctuations in cryptocurrencies.
method Markov chains of orders one to eight were used to forecast intra-day returns of three major cryptocurrencies.
result Predictions from empirical probabilities outperform random choices.

FM4PDE learns PDE solutions from sparse data.

problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.

The vast majority of network datasets contains errors and omissions, although this is rarely incorporated in traditional network analysis. Recently, an increasing effort has been made to fill this methodological gap by developing network reconstruction approaches based on Bayesian inference. These approaches, however, …

2018-06-09abs ↗pdf ↗

We model non-stationary volume-price distributions with a log-normal distribution and collect the time series of its two parameters. The time series of the two parameters are shown to be stationary and Markov-like and consequently can be modelled with Langevin equations, which are derived directly from their series of …

2017-04-30abs ↗pdf ↗

New method learns dynamics from sparse data using geometric constraints.

problem Learning dynamics from sparse, undersampled data.
method Reformulates inference as a stochastic control problem, using geometry-driven path augmentation.
result Accurately recovers stochastic dynamics from extremely undersampled data.

In recent years Variation Autoencoders have become one of the most popular unsupervised learning of complicated distributions.Variational Autoencoder (VAE) provides more efficient reconstructive performance over a traditional autoencoder. Variational auto enocders make better approximaiton than MCMC. The VAE defines a …

2017-07-11abs ↗pdf ↗

We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall output is the average of all leaves weighted by the gating values on their path. …

2014-09-26abs ↗pdf ↗