Paper studies non-tight reconstruction threshold in a 4-state model with different in/out block mutations.
problem Non-tight reconstruction threshold in a 4-state symmetric model with different in-block and out-block mutations.
method Inspired by the q1+q2 stochastic block model, rigorously analyzes conditions for non-tightness of the reconstruction threshold. result Rigorously gives conditions for the non-tightness of the reconstruction threshold in a 4-state symmetric model.
Improves deep network generalization for image sequence reconstruction.
problem Improving generalization of deep networks for inverse image reconstruction.
method Proposes a network optimized by a variational approximation of the information bottleneck principle with stochastic latent space.
result Demonstrates improved generalization ability of inverse reconstruction networks through stochasticity and information bottleneck.
Generative adversarial networks reconstruct oolitic limestone micro-structures.
problem Stochastic image reconstruction of oolitic limestone micro-structures.
method Generative adversarial neural networks (GANs) for unsupervised learning.
result GANs accurately reconstruct oolitic limestone micro-structures.
Generative LLE modifies LLE to generate stochastic embeddings.
problem Nonlinear dimensionality reduction and manifold learning.
method Generative LLE modifies LLE by using stochastic linear reconstruction.
result Generative LLE can generate various LLE embeddings stochastically.
Paper improves deep learning models for cardiac potential reconstruction.
problem Improving generalization of sequence models for cardiac potential reconstruction.
method Constrained stochasticity and global aggregation of temporal information in latent space.
result Improved generalization of inverse reconstruction networks.
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.
New method learns stochastic process representations without exact reconstruction.
problem Learning exact representations of high-dimensional noisy stochastic processes.
method CReSP framework for contrastive learning of stochastic processes.
result Effective for learning representations of various stochastic processes.
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…
Bayesian approach improves deep image prior for image reconstruction.
problem Improving performance of deep image prior for image reconstruction tasks.
method Derive Bayesian approach using stochastic gradient Langevin, showing asymptotic equivalence to Gaussian process prior.
result Improves denoising and impainting results for image reconstruction tasks.
New method reconstructs networks with unknown and varying errors.
problem Network datasets often contain errors and omissions, limiting traditional analysis.
method Bayesian reconstruction approach that handles heterogeneous errors and single edge measurements.
result Efficient nonparametric inference for hierarchical community structure from noisy data.
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.
New algorithm reconstructs genealogies from genetic data.
problem Reconstructing genealogies from genetic data.
method Iterative algorithm {\sc Rec-Gen} for pedigrees from a generative model.
result Accurate reconstruction of a large fraction of pedigrees with low sample complexity.
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.
Bayesian framework optimizes 3D view selection for specific tasks.
problem Optimizing 3D view selection for specific tasks in reconstruction.
method Bayesian decision theory, prior and posterior distributions, stochastic surface reconstruction.
result Framework achieves superior performance with fewer views.
A scalable GPLVM model using stochastic variational inference.
problem Scalable inference for Gaussian process latent variable models.
method Doubly stochastic formulation of Bayesian GPLVM with minibatch training.
result High-fidelity reconstructions in the presence of missing data.
Unsupervised image inpainting models generate plausible reconstructions from incomplete data.
problem Inpainting without paired or unpaired training data.
method Conditional GAN with latent component dependency for generating image distributions.
result Model generates a distribution of plausible images from incomplete observations.
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.
A new algorithm reconstructs population dynamics from coarse samples.
problem Reconstructing population dynamics from unlabeled samples at coarse time intervals.
method Deep Momentum Multi-Marginal Schrödinger Bridge (DMSB) framework.
result Significantly outperforms baselines in synthetic and real-world datasets.
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…
Bayesian method for feature selection with grouping info using expectation propagation.
problem Feature selection with grouping info and sparsity constraints.
method Sparse-group Bayesian feature selection using expectation propagation.
result Our method outperforms existing methods in terms of feature selection accuracy and computational efficiency.
Generative model predicts future frames efficiently and at arbitrary points.
problem Slow autoregressive video prediction models and inability to sample non-consecutive frames.
method Introduces a model that generates a latent representation from an arbitrary set of frames, enabling simultaneous and efficient sampling of future frames at arbitrary time-points.
result Substantial gains in speed and functionality without loss in fidelity, demonstrated on synthetic videos and 3D scene reconstruction datasets.
VAE learns interpretable representations by chance, aligning with PCA.
problem Understanding why VAEs learn interpretable representations.
method Analyzed the diagonal approximation and stochasticity in VAEs.
result Variance autoencoders learn interpretable representations due to local orthogonality.
Grad-TTS models speech from text using diffusion probabilistic techniques.
problem Creating high-quality speech from text input.
method Score-based decoder with stochastic differential equations for noise-to-speech transformation.
result Grad-TTS produces mel-spectrograms from text input with competitive quality.
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.
Spreading processes are often modelled as a stochastic dynamics occurring on top of a given network with edge weights corresponding to the transmission probabilities. Knowledge of veracious transmission probabilities is essential for prediction, optimization, and control of diffusion dynamics. Unfortunately, in most ca…
VCAE improves autoencoder quality on MNIST and CelebA.
problem Overfitting and poor generative/reconstruction quality in autoencoders.
method Proposes variance-constrained autoencoder (VCAE) to enforce variance constraint on latent distribution.
result VCAE outperforms Wasserstein Autoencoder and Variational Autoencoder in quality.
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.
This paper improves VAEs with regularization for better image reconstruction.
problem Improving image reconstruction quality in Variational Autoencoders.
method Least square loss function with regularization for better approximation of data.
result Least square loss function leads to better reconstructed images and faster training.
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.
Unified approach to training stochastic RNNs with latent variables.
problem Training generative latent variable models with autoregressive decoders.
method Amortized variational inference with backward RNN conditioning and auxiliary reconstruction cost.
result Improved performance on speech and sequential MNIST benchmarks.
Proposes flexible auto-encoders for varying data dimensions.
problem Fixed latent dimensions limit data flexibility.
method Stochastic bottleneck with weighted dropouts.
result Seamless variable dimensionality reduction with high performance.
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.
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…
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.
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…
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.
A novel approach termed \emph{stochastic truncated amplitude flow} (STAF) is developed to reconstruct an unknown n-dimensional real-/complex-valued signal x from m `phaseless' quadratic equations of the form ψi=∣⟨ai,x⟩∣. This problem, also known as phase retrieval from magnitude-onl…
New algorithm reconstructs sparse networks in subquadratic time.
problem Reconstructing sparse networks from limited data.
method Stochastic second neighbor search to bypass quadratic complexity.
result Subquadratic time complexity, up to O(N3/2logN). 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 …
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.
We propose a robust, scalable, integrated methodology for community detection and community comparison in graphs. In our procedure, we first embed a graph into an appropriate Euclidean space to obtain a low-dimensional representation, and then cluster the vertices into communities. We next employ nonparametric graph in…