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

3707401,1091,479 · Jun 202019922001200920172026
48 results for energy-based latent variable models

New method for LVEBMs using saddle-point optimization and Langevin updates.

problem Expressive generative modeling of latent variables with hidden structure.
method Reformulate LVEBM training as a saddle problem, using Langevin updates and gradient flows.
result Proves existence and convergence of the algorithm under standard assumptions, with improved ELBO bounds.

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.

Future autonomous systems need reliable world models and complex action sequences.

problem Current automated systems lack reliable world models and complex action sequences.
method Introduce energy-based and latent variable models combined in a hierarchical joint embedding predictive architecture (H-JEPA).
result Combining energy-based and latent variable models in H-JEPA can lead to reliable world models and complex action sequences.

Paper proposes a method to improve MCMC sampling for energy-based models.

problem MCMC sampling of energy-based models is often not mixing in high-dimensional data.
method Proposes using a flow-based model as a backbone to correct the energy-based model, enabling mixing in latent space.
result MCMC sampling of the corrected EBM in the latent space mixes well and traverses modes in the data space.

Paper presents variational estimates for EBLVMs without structural assumptions.

problem Challenges in learning and evaluating EBLVMs due to intractable true posteriors and partition functions.
method Variational estimates of the score function and its gradient (VaES and VaGES) in a general EBLVM.
result The estimates can be applied to KSD and SM-based methods to learn EBLVMs and estimate Fisher divergence.

Autoregressive models struggle with hard-to-compute distributions, alternatives like energy-based and latent-variable models solve this.

problem Autoregressive models struggle with distributions whose next-symbol probability is hard to compute.
method Alternatives include energy-based models and latent-variable autoregressive models.
result Alternatives to autoregressive models can escape limitations of hard-to-compute distributions.

Improves sample quality of generative models using energy-based methods.

problem Low sample quality in generative models.
method Constructs an energy function on latent space, trains an energy-based model, and generates improved samples.
result Significant improvement in sample quality with minimal computational overhead.

This paper introduces a new neural ODE model for continuous-time sequence generation.

problem Representing and predicting continuous-time sequences with high accuracy.
method A neural emission model and neural ODE define the latent state evolution, with an Energy-based model for prior distribution.
result The model outperforms existing methods in various tasks, including long-horizon predictions.

EDG generates Boltzmann samples from latent variables efficiently.

problem Sampling from complex energy functions in high dimensions.
method Combines variational autoencoders and diffusion models; uses a decoder and diffusion-based encoder.
result EDG outperforms existing methods in various sampling tasks.

This paper tackles sampling issues in latent space EBMs by introducing diffusion-based amortization.

problem Degenerate MCMC sampling quality hinders latent space EBM learning and generation quality.
method Introduces diffusion-based amortization for long-run MCMC sampling.
result The learned amortization of MCMC is a valid long-run MCMC sampler.

A new method to learn EBM in latent space for better data modeling.

problem Efficiently modeling data with complex structures.
method Joint learning of latent space EBM and top-down network using maximum likelihood and MCMC sampling.
result Simple EBM in latent space captures data regularities effectively and performs well in generation and anomaly detection.

Proposes a model to generate 3D-aware images from 2D images.

problem Generating 3D-aware images from 2D images.
method Likelihood-based top-down model using Neural Radiance Fields and energy-based latent variables.
result Model can infer 3D object structures from 2D images and generate novel views.

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.

Paper proposes a method to design molecules with specific properties.

problem Designing molecules with desired chemical and biological properties.
method Energy-based model in latent space, SGDS algorithm for gradual distribution shifting.
result Method achieves strong performances on various molecule design tasks.

Improves GANs by sampling from an energy-based model induced by discriminator scores.

problem Improving the quality of images generated by GANs.
method DDLS (Discriminator Driven Latent Sampling) using the sum of latent prior log-density and discriminator output score.
result Significantly improves Inception Score on CIFAR-10 dataset.

Probabilistic models can be defined by an energy function, where the probability of each state is proportional to the exponential of the state's negative energy. This paper considers a generalization of energy-based models in which the probability of a state is proportional to an arbitrary positive, strictly decreasing…

2016-05-24abs ↗pdf ↗

A new method for decomposing non-negative tensors using energy-based modeling.

problem Challenges in traditional tensor decomposition methods, especially global optimization and rank selection.
method Energy-based modeling of tensors, considering interactions between modes for global optimization.
result Demonstrates effectiveness in tensor completion and approximation, revealing a relationship between many-body and low-rank approximations.

EBM reduces dimensionality for estimating heterogeneous CATEs.

problem Estimating CATEs requires many confounding variables, increasing sample complexity.
method Proposes an EBM that learns a low-dimensional representation of variables.
result EBM representations keep CATE estimates consistent and perform better than other methods.

VAV method optimizes learning rate for faster, stable SGD convergence.

problem Optimizing learning rate for efficient and stable machine learning models.
method Energy-based self-adaptive learning rate with auxiliary variable rr.
result VAV method achieves faster convergence and superior stability with larger learning rates.

EBMs trained with ML are shown to behave like GANs with a self-adversarial loss.

problem Training EBMs with ML is intractable due to intractable unnormalized distributions.
method Replaced MCMC with deterministic gradient descent ODE solutions to study density induced by dynamics.
result EBM training is effectively a self-adversarial procedure rather than ML estimation.

MPT improves CNN and energy-based models' OOD detection and generalization.

problem Challenging out-of-distribution detection in computer vision.
method Applying Maximum Probability Theorem as a regularization scheme in CNN and energy-based models.
result MPT-based regularization strategy stabilizes and improves generalization and robustness of base models.

Two fundamental problems in unsupervised learning are efficient inference for latent-variable models and robust density estimation based on large amounts of unlabeled data. Algorithms for the two tasks, such as normalizing flows and generative adversarial networks (GANs), are often developed independently. In this pape…

2017-09-04abs ↗pdf ↗

Gradient-based MCMC for discrete spaces improves sampling performance.

problem Sampling in discrete spaces using traditional methods is challenging.
method Introduced new discrete Metropolis-Hastings samplers inspired by MALA, with a novel preconditioning technique.
result Demonstrated strong empirical performance across various challenging sampling problems.

The problem of continuous inverse optimal control (over finite time horizon) is to learn the unknown cost function over the sequence of continuous control variables from expert demonstrations. In this article, we study this fundamental problem in the framework of energy-based model, where the observed expert trajectori…

2019-04-10abs ↗pdf ↗

EB-RANSAC uses energy-based model for robust estimation without complex sampling.

problem Robust estimation of parameters in noisy data.
method EB-RANSAC combines RANSAC's sampling scheme with an energy-based model, simplifying the process and reducing hyperparameter requirements.
result EB-RANSAC effectively solves linear regression and maximum likelihood estimation problems.

Paper proposes CoopFlow, a two-flow generator for energy-based models.

problem Training energy-based models with Langevin flow and normalizing flow.
method CoopFlow trains an energy-based model using a normalizing flow initialization and a short-run Langevin flow revision.
result CoopFlow converges to a moment matching estimator and synthesizes realistic images.

Researchers identify latent variables and causal structures from nonlinear hierarchical models.

problem Challenging task of identifying latent variables and causal structures from observational data, especially when relationships are nonlinear.
method Investigated nonlinear latent hierarchical causal models, developed identification criterion, and constructed an estimation procedure.
result Identifiability of causal structures and latent variables achieved under mild assumptions.

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.

A neural network finds causal relationships among latent variables.

problem Learning causal structure among latent variables in high-dimensional data.
method Redundant Input Neural Network (RINN) with modified architecture and regularized objective function.
result The RINN method successfully recovers latent causal structure between input and output variables.

New method identifies latent relationships in deep models without additional constraints.

problem Latent representations in deep latent variable models are not statistically identifiable.
method Identifies relationships between latent variables (distances, angles, volumes) under mild model conditions.
result Empirically demonstrates more reliable latent distances without additional labeled data.