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

102204306408 · Jun 202019922001200920172026
48 results for latent objective

In this paper we address the problem of modeling relational data, which appear in many applications such as social network analysis, recommender systems and bioinformatics. Previous studies either consider latent feature based models but disregarding local structure in the network, or focus exclusively on capturing loc…

2012-04-11abs ↗pdf ↗

We propose an unsupervised object matching method for relational data, which finds matchings between objects in different relational datasets without correspondence information. For example, the proposed method matches documents in different languages in multi-lingual document-word networks without dictionaries nor ali…

2018-10-09abs ↗pdf ↗

One of the challenges in training generative models such as the variational auto encoder (VAE) is avoiding posterior collapse. When the generator has too much capacity, it is prone to ignoring latent code. This problem is exacerbated when the dataset is small, and the latent dimension is high. The root of the problem i…

2019-10-29abs ↗pdf ↗

This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…

2012-07-11abs ↗pdf ↗

Proposes a framework to maximize mutual information in VAE models for better latent code representation.

problem Lack of explicit measurement of the quality of learned representations in VAE models.
method Variational Mutual Information Maximization Framework for VAE.
result Maximizes mutual information between latent codes and observations, improving latent code representation.

Latent feature modeling allows capturing the latent structure responsible for generating the observed properties of a set of objects. It is often used to make predictions either for new values of interest or missing information in the original data, as well as to perform data exploratory analysis. However, although the…

2017-06-12abs ↗pdf ↗

Modeling interacting objects with latent Gaussian process ODEs.

problem Time uncertainty-aware modeling of continuous-time dynamics of interacting objects.
method A new model using latent Gaussian process ordinary differential equations to infer independent dynamics and interactions.
result Our model improves long-term predictions and successfully encapsulates independent dynamics and interactions.

This work improves multi-modal generative models by using permutation-invariant neural networks.

problem Improving multi-modal generative models with tighter variational objectives.
method Developed more flexible aggregation schemes based on permutation-invariant neural networks.
result Our variational objective and flexible aggregation models can better approximate the true joint distribution.

Bayesian framework learns latent preference archetypes for many-objective optimization.

problem Expanding space of trade-offs and context-dependent human values.
method Dirichlet-process mixture model for latent preference archetypes, hybrid queries for efficient information.
result Mixture-aware Bayesian optimization outperforms standard methods on synthetic and real-world benchmarks.

This paper introduces a general Bayesian non- parametric latent feature model suitable to per- form automatic exploratory analysis of heterogeneous datasets, where the attributes describing each object can be either discrete, continuous or mixed variables. The proposed model presents several important properties. First…

2017-07-26abs ↗pdf ↗

Improved Monte-Carlo models by constraining mutual information between latent and observable variables.

problem Training density models leads to latent variables being useless.
method Weave tighter Monte-Carlo bounds with mutual information constraints.
result Improved training of models with continuous and discrete latent variables.

Compositional structures between parts and objects are inherent in natural scenes. Modeling such compositional hierarchies via unsupervised learning can bring various benefits such as interpretability and transferability, which are important in many downstream tasks. In this paper, we propose the first deep latent vari…

2019-10-21abs ↗pdf ↗

We extend the framework of variational autoencoders to represent transformations explicitly in the latent space. In the family of hierarchical graphical models that emerges, the latent space is populated by higher order objects that are inferred jointly with the latent representations they act on. To explicitly demonst…

2019-12-09abs ↗pdf ↗

Optimizes latent space of VAEs using decoder uncertainty to generate valid objects.

problem Lack of robustness in optimizing VAE latent space for black-box properties.
method Importance sampling-based estimator of decoder epistemic uncertainty to guide optimization.
result Improves trade-off between black-box objective and validity of generated samples.

Improved method for efficient black-box optimization in latent space.

problem Efficiently optimize expensive black-box functions over complex input spaces.
method Optimize in latent space of deep generative models, retrain model periodically and weight data points.
result Significantly improved efficiency and performance on synthetic and real-world problems.

OBSER framework infers sub-environments from objects, outperforming scene-based methods.

problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.

Evaluating novel contextual bandit policies using logged data is crucial in applications where exploration is costly, such as medicine. But it usually relies on the assumption of no unobserved confounders, which is bound to fail in practice. We study the question of policy evaluation when we instead have proxies for th…

2019-08-06abs ↗pdf ↗

Contrastive learning recovers latent distributions for ambiguous inputs, including aleatoric uncertainty.

problem Real-world observations often have inherent ambiguities, making the true posterior probabilistic with heteroscedastic uncertainty.
method Extended InfoNCE objective and encoders to predict latent distributions, proving they recover the correct posteriors, including aleatoric uncertainty.
result Contrastive learning encoders can recover the correct posteriors of data-generating processes, including aleatoric uncertainty, up to a rotation of the latent space.

We address the problem of learning hierarchical deep neural network policies for reinforcement learning. In contrast to methods that explicitly restrict or cripple lower layers of a hierarchy to force them to use higher-level modulating signals, each layer in our framework is trained to directly solve the task, but acq…

2018-04-09abs ↗pdf ↗

GraphOpt learns the formation mechanism of graphs from observed structures.

problem Learning formation mechanisms from observed graphs with complex structural properties.
method GraphOpt uses maximum entropy inverse reinforcement learning to solve the link formation problem in a sequential decision-making process.
result GraphOpt discovers a latent objective function that can explain and transfer across different graphs.

MIRO learns robust latent spaces by maximizing mutual information with future information.

problem Robust perception in complex, unstructured environments with low sample complexity.
method MIRO maximizes mutual information in a latent space for model-based reinforcement learning.
result MIRO outperforms reconstruction objectives in cluttered scenes.

A new method for training generative models with sparse supervision.

problem Training deep generative models with sparse and varying supervision.
method Caffeinated Wake-Sleep (CWS) method, combining reweighted wake-sleep and teacher-forcing.
result The CWS method is robust to variable length supervision and performs well on various datasets.

StrTransformer recovers sources without labels by optimizing latent matrices and enforcing structural constraints.

problem Unsupervised blind source recovery in signal processing.
method Source-wise structured Transformer framework with latent source matrix optimization, structural regularization, and branch-specific weights.
result StrTransformer learns distinct temporal-scale structures and recovers source-aligned latent trajectories.

Recurrent-DBN models dynamic relational data with interpretable latent structures.

problem Interpreting dynamic relational data with hidden structures.
method Recurrent Dirichlet Belief Network framework with hierarchical latent structures and efficient inference strategy.
result Recurrent-DBN discovers interpretable latent structures and improves link prediction.

This work discovers latent field effects governing interacting dynamical systems.

problem Discovering field effects governing interacting dynamical systems.
method Proposes neural fields to learn latent force fields from observed dynamics, disentangling local object interactions and global field effects.
result Accurately discovers latent field effects in various dynamical systems.

We develop a generalisation of disentanglement in VAEs---decomposition of the latent representation---characterising it as the fulfilment of two factors: a) the latent encodings of the data having an appropriate level of overlap, and b) the aggregate encoding of the data conforming to a desired structure, represented t…

2018-12-06abs ↗pdf ↗

There has been much recent, exciting work on combining the complementary strengths of latent variable models and deep learning. Latent variable modeling makes it easy to explicitly specify model constraints through conditional independence properties, while deep learning makes it possible to parameterize these conditio…

2018-12-17abs ↗pdf ↗

A novel approach for safe offline RL using latent safety constraints.

problem Balancing safety constraints and reward maximization in offline RL.
method Conditional Variational Autoencoders for latent safety modeling, Constrained Reward-Return Maximization.
result Our approach maintains safety compliance while optimizing rewards, outperforming existing methods.