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

3468101135 · Jun 202019922001200920172026
48 results for Posterior visualization

This work introduces a method for visualizing high-dimensional posteriors using hierarchical tree-valued predictions.

problem Visualizing high-dimensional posterior distributions for complex problems like image restoration.
method A neural network predicts a tree-valued hierarchical summarization of the posterior distribution in a single forward pass.
result The method efficiently summarizes and visualizes posteriors, achieving comparable results to hierarchical clustering but at a much faster speed.

New VAE models reveal hierarchical visual cortex computations.

problem Capturing hierarchical visual cortex computations in generative models.
method Sparse coding hierarchical VAEs trained on natural images with varied generative and recognition components.
result Representations similar to those in visual cortex emerge under inductive biases.

This work explores how XAI methods can visualize the diversity of feature representations in Bayesian Neural Networks.

problem Explaining the diversity of feature representations learned by Bayesian Neural Networks.
method Application of global XAI methods to visualize and quantify the diversity of feature representations.
result The diversity of learned feature representations correlates with uncertainty estimates and network width.

Uncertainty estimation in deep neural networks is essential for designing reliable and robust AI systems. Applications such as video surveillance for identifying suspicious activities are designed with deep neural networks (DNNs), but DNNs do not provide uncertainty estimates. Capturing reliable uncertainty estimates i…

2018-11-08abs ↗pdf ↗

CIPNN model tackles continuous latent variables, solving intractable posterior problems.

problem Solving intractable posterior calculation for continuous latent variables.
method Derives analytical solution for posterior of continuous latent variables, proposes CIPNN and CIPAE.
result CIPNN model demonstrates great classification capability, solving problems for continuous latent variables.

This paper explores Bayesian Neural Network posteriors, uncovering symmetries and their impact.

problem Understanding the complex posterior distribution of deep Bayesian Neural Networks.
method Investigates optimal approaches for approximating posteriors, analyzes modes, and explores visualizations.
result Uncovered weight-space symmetries and their impact on the posterior, particularly scaling symmetries.

More than 50 years ago Bongard introduced 100 visual concept learning problems as a testbed for intelligent vision systems. These problems are now known as Bongard problems. Although they are well known in the cognitive science and AI communities only moderate progress has been made towards building systems that can so…

2018-04-12abs ↗pdf ↗

Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is diffuse and it is hard to interpret the sampled partitionings. In this paper, we…

2013-10-01abs ↗pdf ↗

A new method for analyzing latent space models without reference configurations.

problem Posterior summaries of latent coordinates in Euclidean latent space models are not canonical due to likelihood invariance.
method Quotient-based posterior analysis using the centered Gram map.
result Intrinsic posterior summaries of mean structure and uncertainty can be computed directly from posterior samples.

In many domains, scientists build complex simulators of natural phenomena that encode their hypotheses about the underlying processes. These simulators can be deterministic or stochastic, fast or slow, constrained or unconstrained, and so on. Optimizing the simulators with respect to a set of parameter values is common…

2014-12-09abs ↗pdf ↗

BiDVL improves EBLVMs for visual tasks by optimizing two variational distributions.

problem Training EBLVMs is challenging due to intractable distributions.
method Bi-level doubly variational learning with two tractable distributions.
result BiDVL achieves impressive image generation and reconstruction performance.

A method predicts posterior PCs for faster uncertainty quantification in imaging.

problem Uncertainty visualization in image restoration models is limited by per-pixel variances.
method Neural Posterior Principal Components (NPPC) method for predicting PCs in a single forward pass.
result Orders of magnitude faster uncertainty quantification compared to posterior samplers.

Super-resolution methods form high-resolution images from low-resolution images. In this paper, we develop a new Bayesian nonparametric model for super-resolution. Our method uses a beta-Bernoulli process to learn a set of recurring visual patterns, called dictionary elements, from the data. Because it is nonparametric…

2012-09-22abs ↗pdf ↗

We present a new topic model that generates documents by sampling a topic for one whole sentence at a time, and generating the words in the sentence using an RNN decoder that is conditioned on the topic of the sentence. We argue that this novel formalism will help us not only visualize and model the topical discourse s…

2017-08-01abs ↗pdf ↗

Bayesian Tensor Network combines prior and data likelihood for efficient prediction and parameter estimation.

problem Overfitting and poor performance in Tensor Network models.
method Introduce prior distribution, use Laplace approximation for posterior predictive distribution, and propose stable initialization for parameter estimation.
result Reduces overfitting and improves performance of Tensor Network models.

Analysis of flow cytometry data is an essential tool for clinical diagnosis of hematological and immunological conditions. Current clinical workflows rely on a manual process called gating to classify cells into their canonical types. This dependence on human annotation limits the rate, reproducibility, and complexity …

2017-11-21abs ↗pdf ↗

We propose Graphical Generative Adversarial Networks (Graphical-GAN) to model structured data. Graphical-GAN conjoins the power of Bayesian networks on compactly representing the dependency structures among random variables and that of generative adversarial networks on learning expressive dependency functions. We intr…

2018-04-10abs ↗pdf ↗

Robust visual tracking for long video sequences is a research area that has many important applications. The main challenges include how the target image can be modeled and how this model can be updated. In this paper, we model the target using a covariance descriptor, as this descriptor is robust to problems such as p…

2013-03-24abs ↗pdf ↗

ParaMonte::Python streamlines Bayesian data analysis with fast Monte Carlo and MCMC routines.

problem Efficiently sampling posterior distributions in Bayesian modeling and data science.
method Serial and MPI-parallelized Markov Chain Monte Carlo (MCMC) routines.
result Automated model calibration and uncertainty quantification in Bayesian analysis.

Modern datasets are becoming heterogeneous. To this end, we present in this paper Mixed-Variate Restricted Boltzmann Machines for simultaneously modelling variables of multiple types and modalities, including binary and continuous responses, categorical options, multicategorical choices, ordinal assessment and category…

2014-08-06abs ↗pdf ↗

Bayesian inverse reinforcement learning (IRL) methods are ideal for safe imitation learning, as they allow a learning agent to reason about reward uncertainty and the safety of a learned policy. However, Bayesian IRL is computationally intractable for high-dimensional problems because each sample from the posterior req…

2019-12-10abs ↗pdf ↗

Generative Adversarial Networks (GAN) training process, in most cases, apply Uniform or Gaussian sampling methods in the latent space, which probably spends most of the computation on examples that can be properly handled and easy to generate. Theoretically, importance sampling speeds up stochastic optimization in supe…

2019-10-06abs ↗pdf ↗

Variational approach improves diffusion models for solving inverse problems.

problem Challenges in solving inverse problems with diffusion models due to the nonlinear and iterative nature of the diffusion process.
method Proposes a variational approach to approximate the posterior distribution, leading to regularization by denoising diffusion process (RED-Diff).
result Demonstrates improved performance in image restoration tasks compared to state-of-the-art sampling-based diffusion models.

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the computational complexity of solving a non-convex optimisation problem. We propose fin…

2018-12-19abs ↗pdf ↗

STRODE learns timings and dynamics from unlabeled time series data.

problem Learning dynamics of random event timings from unlabeled sensory inputs.
method Probabilistic Ordinary Differential Equation (STRODE) that samples from posterior point processes.
result Successfully infers event timings from synthetic and real-world datasets.

Proposes a spectral method to assess and combine multiple data visualizations.

problem Evaluating and combining the strengths of different data visualization algorithms.
method Spectral method for assessing and combining multiple visualizations.
result Proposes a visualization eigenscore to quantify relative performance and a consensus visualization.

VERA-V uses variational inference to discover vulnerabilities in multimodal vision-language models.

problem Existing methods for jailbreaking vision-language models are brittle, limited, and focus on single attacks.
method VERA-V recasts jailbreak discovery as learning a joint posterior distribution over text-image prompts, using variational inference and three complementary strategies.
result VERA-V consistently outperforms state-of-the-art baselines, achieving up to 53.75% higher attack success rate.