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,657 papers · 148 categories

Trend · papers per month

137273410546 · Jun 202019922001200920172026
48 results for semi-implicit distributions

Continuous semi-implicit models enable faster training and better performance in generative modeling.

problem Slow convergence in hierarchical semi-implicit models during training.
method CoSIM, a continuous semi-implicit model that incorporates a continuous transition kernel for efficient training.
result CoSIM achieves superior performance on image generation tasks compared to existing methods.

Kernel semi-implicit variational inference improves variational inference without additional optimization.

problem Intractability of hierarchical semi-implicit distributions in variational inference.
method Kernel semi-implicit variational inference (KSIVI) using kernel methods to eliminate lower-level optimization.
result KSIVI reduces variational inference to kernel Stein discrepancy (KSD) optimization, improving expressiveness and tractability.

Kernel SIVI improves variational inference by avoiding lower-level optimization.

problem Intractable densities in semi-implicit variational distributions.
method Kernel SIVI-SM uses a minimax formulation and kernel tricks to avoid lower-level optimization.
result Kernel Stein discrepancy (KSD) objective is computable and leads to convergence guarantees.

Semi-Implicit Variational Inference (SIVI) is improved with SIVI-SM using score matching.

problem Intractable densities in variational distributions hinder SIVI training.
method SIVI-SM uses score matching to handle intractable densities in a minimax formulation.
result SIVI-SM outperforms ELBO-based SIVI methods in Bayesian inference tasks.

We extend the existing framework of semi-implicit variational inference (SIVI) and introduce doubly semi-implicit variational inference (DSIVI), a way to perform variational inference and learning when both the approximate posterior and the prior distribution are semi-implicit. In other words, DSIVI performs inference …

2018-10-05abs ↗pdf ↗

Improved phylogenetic tree reconstruction using flexible branch length distributions.

problem Inefficient Markov chain Monte Carlo methods for large sequence datasets.
method Variational Bayesian phylogenetic inference with semi-implicit branch length distributions.
result Proposed method improves marginal likelihood estimation and branch length posterior approximation.

Enhances graph modeling with hyperbolic geometry and variational inference.

problem Challenges in modeling relational data with complex dependencies.
method Semi-implicit hierarchical variational Bayes with Poincaré embedding and mutual information regularization.
result Improves graph representation quality and flexibility in edge prediction and node classification.

IDAC improves reinforcement learning efficiency by modeling implicit distributions.

problem Improving sample efficiency in reinforcement learning algorithms.
method IDAC uses two DGNs for a distributional critic and a semi-implicit actor to model implicit policy distributions.
result IDAC outperforms state-of-the-art algorithms on OpenAI Gym environments.

Unified theory for semi-implicit variational inference, bridging approximation and optimization.

problem Developing a statistical theory for semi-implicit variational inference.
method Unified theory combining approximation and optimization analyses.
result Unified theory characterizes SIVI's ability to recover target distributions and governs asymptotic behavior.

PVI improves SIVI by directly optimizing ELBO without parametric assumptions.

problem Intractable variational densities in SIVI methods.
method Particle Variational Inference (PVI) using empirical measures to approximate optimal mixing distributions.
result PVI directly optimizes the ELBO and performs favorably compared to other SIVI methods.

Semi-implicit variational inference (SIVI) is introduced to expand the commonly used analytic variational distribution family, by mixing the variational parameter with a flexible distribution. This mixing distribution can assume any density function, explicit or not, as long as independent random samples can be generat…

2018-05-28abs ↗pdf ↗

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with …

2019-08-19abs ↗pdf ↗

Improved UIVI method shows better performance than state-of-the-art SIVI methods.

problem Estimating the likelihood of samples from complex distributions in high dimensions.
method Replaced the inner MCMC loop of UIVI with importance sampling and learned the optimal proposal distribution.
result The refined UIVI approach demonstrates superior performance or parity with state-of-the-art methods.

Stochastic recurrent neural networks with latent random variables of complex dependency structures have shown to be more successful in modeling sequential data than deterministic deep models. However, the majority of existing methods have limited expressive power due to the Gaussian assumption of latent variables. In t…

2019-10-28abs ↗pdf ↗

Variational Inference is a powerful tool in the Bayesian modeling toolkit, however, its effectiveness is determined by the expressivity of the utilized variational distributions in terms of their ability to match the true posterior distribution. In turn, the expressivity of the variational family is largely limited by …

2019-05-08abs ↗pdf ↗

To combine explicit and implicit generative models, we introduce semi-implicit generator (SIG) as a flexible hierarchical model that can be trained in the maximum likelihood framework. Both theoretically and experimentally, we demonstrate that SIG can generate high quality samples especially when dealing with multi-mod…

2019-05-29abs ↗pdf ↗

SIFG uses noisy particles to efficiently sample from complex distributions.

problem Efficient sampling from complex distributions using particle-based methods.
method SIFG introduces a semi-implicit functional gradient flow with Gaussian noise to improve sampling efficiency and accuracy.
result SIFG achieves strong theoretical convergence guarantees and efficient sampling.

SGRNN models evolving graph data for better property prediction.

problem Modeling evolving graph data for property prediction.
method SGRNN uses stochastic latent variables to capture both node attribute and topology evolution, with semi-implicit variational inference and KL-divergence simplification.
result SGRNN improves property prediction on real-world datasets.

Neural network has attracted great attention for a long time and many researchers are devoted to improve the effectiveness of neural network training algorithms. Though stochastic gradient descent (SGD) and other explicit gradient-based methods are widely adopted, there are still many challenges such as gradient vanish…

2020-02-10abs ↗pdf ↗

In this work, we propose learnable Bernoulli dropout (LBD), a new model-agnostic dropout scheme that considers the dropout rates as parameters jointly optimized with other model parameters. By probabilistic modeling of Bernoulli dropout, our method enables more robust prediction and uncertainty quantification in deep m…

2020-02-12abs ↗pdf ↗

We present a dynamical system framework for understanding Nesterov's accelerated gradient method. In contrast to earlier work, our derivation does not rely on a vanishing step size argument. We show that Nesterov acceleration arises from discretizing an ordinary differential equation with a semi-implicit Euler integrat…

2019-05-17abs ↗pdf ↗

Neural dynamical systems are dynamical systems that are described at least in part by neural networks. The class of continuous-time neural dynamical systems must, however, be numerically integrated for simulation and learning. Here, we present a compact neural circuit for two common numerical integrators: the explicit …

2019-11-23abs ↗pdf ↗

We consider a numerical approach for the incompressible surface Navier-Stokes equation. The approach is based on the covariant form and uses discrete exterior calculus (DEC) in space and a semi-implicit discretization in time. The discretization is described in detail and related to finite difference schemes on stagger…

2016-11-14abs ↗pdf ↗

Thompson sampling is an efficient algorithm for sequential decision making, which exploits the posterior uncertainty to address the exploration-exploitation dilemma. There has been significant recent interest in integrating Bayesian neural networks into Thompson sampling. Most of these methods rely on global variable u…

2019-10-30abs ↗pdf ↗

SiD distills pretrained diffusion models into a fast one-step generator.

problem Efficiently distilling pretrained diffusion models into a fast generator.
method Reformulates forward diffusion processes as semi-implicit distributions and uses three score-related identities to create a loss mechanism.
result Achieves high FID performance and significantly reduces generation time.

Representation learning over graph structured data has been mostly studied in static graph settings while efforts for modeling dynamic graphs are still scant. In this paper, we develop a novel hierarchical variational model that introduces additional latent random variables to jointly model the hidden states of a graph…

2019-08-26abs ↗pdf ↗

Develops a new trading strategy for renewable producers to manage price volatility.

problem Price volatility and imbalance risk in power markets due to renewable generation.
method Data-driven continuous-time stochastic optimal control framework using SDEs and diffusion models.
result Trading strategy outperforms benchmarks and reduces profit and loss.

The classical linear Black--Scholes model for pricing derivative securities is a popular model in financial industry. It relies on several restrictive assumptions such as completeness, and frictionless of the market as well as the assumption on the underlying asset price dynamics following a geometric Brownian motion. …

2019-01-19abs ↗pdf ↗

The paper explores solutions to the distributional Bellman equation in reinforcement learning.

problem Distributional reinforcement learning considers complete return distributions, not just expected returns.
method Study existence and uniqueness of solutions to general distributional Bellman equations, linking them to multivariate affine equations.
result Any solution to a distributional Bellman equation can be derived from a multivariate affine distributional equation.

Proposes vMF distribution for skewed elliptical distributions.

problem Skewed distributions not adequately modeled by symmetric distributions.
method Introduces von-Mises-Fisher (vMF) distribution to represent skewed elliptical distributions.
result vMF distribution provides an explicit and simple probability representation of skewed elliptical distributions.

We realise the first and second Grushin distributions as symmetry reductions of the 3-dimensional Heisenberg distribution and 4-dimensional Engel distribution respectively. Similarly, we realise the Martinet distribution as an alternative symmetry reduction of the Engel distribution. These reductions allow us to derive…

2012-07-23abs ↗pdf ↗

Income and wealth distribution affect stability of a society to a large extent and high inequality affects it negatively. Moreover, in the case of developed countries, recently has been proven that inequality is closely related to all negative phenomena affecting society. So far, Econophysics papers tried to analyse in…

2014-10-17abs ↗pdf ↗

Study clusters distributions with known or unknown clusters using distribution testing.

problem Cluster distributions that are ε\varepsilon-far in total variation.
method Distribution testing approach to establish upper and lower bounds on sample complexity.
result Achieves tight sample complexity bounds for all regimes (up to a logarithmic factor).

Gradually Truncated Log-normal distribution - Size distribution of firms Abstract Many natural and economical phenomena are described through power law or log- normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these di…

2001-11-30abs ↗pdf ↗

A new distribution family extends the α\alpha-stable distribution with a degree of freedom parameter.

problem Lack of moments in the α\alpha-stable distribution.
method Wright function framework to combine and extend distribution families.
result Generalized α\alpha-stable distribution with valid moments.

Paper develops a new method to improve model calibration under distribution shifts.

problem Challenges in uncertainty quantification with different training and test distributions.
method Develops multi-domain temperature scaling to handle distribution shifts.
result Outperforms existing methods on in-distribution and out-of-distribution test sets.

New class of heavy-tailed distributions shows weighted averages dominate individual variables.

problem Understanding and comparing risks in heavy-tailed distributions.
method Introducing a new class of heavy-tailed distributions and proving stochastic dominance relations.
result Weighted averages of random variables in this class are stochastically larger than individual variables.

Researchers derived formulas for joint moments of elliptical distributions.

problem Calculating joint moments of elliptical distributions.
method Used Stein's lemma and two different methods to derive expressions.
result New formulae for expectations of product of normally distributed random variables and simplified expressions for other distributions.

Paper proposes a new method for designing materials using deep learning.

problem Designing high-performance material distributions from given distributions.
method Iterative process of selecting, generating, and merging material distributions using a deep generative model.
result The method improves material performance through iterative refinement.

One-shot algorithm for feature-distributed kernel PCA reduces communication costs.

problem Efficiently perform kernel PCA in distributed computing environments.
method Inspired by dual relationship between sample-distributed and feature-distributed scenarios, proposes a one-shot algorithm for feature-distributed kernel PCA.
result The algorithm provides high-quality results with low communication costs, especially when eigenvalues decay fast.

Paper finds how many neurons are needed to approximate histogram distributions.

problem How many neurons are needed to approximate a target probability distribution?
method Examined for uniform input distribution and histogram target distributions, using efficient neural net construction.
result Obtained a new upper bound on the number of required neurons, strictly better than previous bounds.