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

3046089111,215 · Jun 202019922001200920172026
48 results for Latent Feature State Space

Efficient RL in large POMDPs with latent determinism and embeddings.

problem Efficient reinforcement learning in large-scale POMDPs with latent states and observations.
method Conditional Hilbert space embeddings, linear optimal QQ-function, deterministic latent transitions, gap assumption.
result Computationally and statistically efficient algorithm for exact optimal policy.

A DRL framework optimizes portfolios using a LFSS module for feature extraction.

problem Optimizing dynamic portfolios in financial markets.
method Deep Reinforcement Learning with a Latent Feature State Space module.
result The proposed DRL framework outperforms benchmarks in portfolio optimization.

Proposes a novel method for detecting novelty in multi-modal data.

problem Challenges in detecting novelty in high-dimensional, multi-modal data.
method Orthogonalized latent space for disentangling features and defining novelty score.
result Proposed method outperforms state-of-the-art algorithms in novelty detection.

Develops a new method for nonlinear dimension reduction using random features.

problem Statistical challenges in generalizing Gaussian process-based latent variable models to non-Gaussian data.
method Random feature latent variable models (RFLVMs) that approximate nonlinear relationships with linear functions of random features.
result RFLVMs produce comparable results to state-of-the-art methods on various data types.

Bayesian non-linear latent variable modeling for complex data.

problem Inference for GPLVMs is computationally limited and often leads to overfitting or underestimates uncertainty.
method Approximate Gaussian process mappings with random Fourier features for MCMC inference.
result Generalized RFLVMs perform well on various data types and applications.

ContextBench benchmarks methods for generating linguistically fluent inputs that activate specific latent features in language models.

problem Identifying inputs that trigger specific behaviours or latent features in language models.
method Context modification and benchmarking methods like Evolutionary Prompt Optimisation (EPO) with LLM-assistance and diffusion model inpainting.
result Enhanced methods achieve state-of-the-art performance in balancing elicitation effectiveness and fluency.

DMRL improves UDA by mixing source and target samples and enriching latent space structures.

problem Lack of class-aware information and insufficient samples for domain-invariant feature extraction.
method Dual Mixup Regularized Learning (DMRL) that conducts category and domain mixup regularizations.
result DMRL achieves state-of-the-art performance on domain adaptation benchmarks.

We propose a new approach to inverse reinforcement learning (IRL) based on the deep Gaussian process (deep GP) model, which is capable of learning complicated reward structures with few demonstrations. Our model stacks multiple latent GP layers to learn abstract representations of the state feature space, which is link…

2015-12-26abs ↗pdf ↗

Our work improves VAE latent space clustering by enforcing invariant and equivariant learning.

problem Current VAEs fail to learn invariant and equivariant clusters in latent space.
method We use a mixture model pdf like Gaussian mixtures to enforce deep, group-invariant learning and separate semantic and equivariant variables.
result Our model effectively learns to disentangle invariant and equivariant representations, improving learning rate and image recognition.

Complex textual information extraction tasks are often posed as sequence labeling or \emph{shallow parsing}, where fields are extracted using local labels made consistent through probabilistic inference in a graphical model with constrained transitions. Recently, it has become common to locally parametrize these models…

2018-09-28abs ↗pdf ↗

New method flattens decision boundary by targeting shortcut-aligned axes in disentangled latent space.

problem Shortcut learning in neural networks, leading to poor out-of-distribution generalization.
method Injects targeted anisotropic noise to regularize classifier sensitivity along shortcut-aligned axes.
result Achieves state-of-the-art OOD performance without shortcut labels or conflicting samples.

New model for high rank matrix completion with online and batch methods.

problem Matrix completion for high rank matrices with latent structure.
method Kernel trick to map data into a high dimensional feature space, explicit parametrization of low dimensional subspace, online fitting procedure.
result Online method can handle streaming data and adapt to non-stationary latent structure.

Unified framework for disentangled VAEs improves latent space interpretability.

problem Challenges in evaluating and interpreting latent representations, especially for diverse data types.
method Unified bfVAE framework, FVH-LT, DBSR-LS, GAS, LSSI.
result bfVAE provides more favorable trade-off between disentanglement and reconstruction.

Despite the remarkable performance of deep neural networks on various computer vision tasks, they are known to be susceptible to adversarial perturbations, which makes it challenging to deploy them in real-world safety-critical applications. In this paper, we conjecture that the leading cause of adversarial vulnerabili…

2019-08-12abs ↗pdf ↗

New technologies for recording the activity of large neural populations during complex behavior provide exciting opportunities for investigating the neural computations that underlie perception, cognition, and decision-making. Nonlinear state space models provide an interpretable signal processing framework by combinin…

2017-07-27abs ↗pdf ↗

Model reduction of Markov processes is a basic problem in modeling state-transition systems. Motivated by the state aggregation approach rooted in control theory, we study the statistical state compression of a discrete-state Markov chain from empirical trajectories. Through the lens of spectral decomposition, we study…

2018-02-08abs ↗pdf ↗

All reinforcement learning algorithms must handle the trade-off between exploration and exploitation. Many state-of-the-art deep reinforcement learning methods use noise in the action selection, such as Gaussian noise in policy gradient methods or εε-greedy in Q-learning. While these methods are appealing due to their…

2018-04-04abs ↗pdf ↗

A new tree-Wasserstein distance for high-dimensional data with latent feature hierarchy.

problem Finding meaningful distances between high-dimensional data samples with latent feature hierarchy.
method Proposes a new tree-Wasserstein distance (TWD) for high-dimensional data with a latent feature hierarchy, using diffusion geometry and tree decoding.
result The proposed TWD effectively recovers the latent feature hierarchy and is efficient and scalable.

Adversarial attacks on probabilistic state-space models affect latent state and policy decisions.

problem Robust reinforcement learning under adversarial observability.
method Analyzing adversarial attacks on linear probabilistic state-space models.
result Demonstrating the influence of adversarial observations on latent state and policy decisions.

The ability of the Generative Adversarial Networks (GANs) framework to learn generative models mapping from simple latent distributions to arbitrarily complex data distributions has been demonstrated empirically, with compelling results showing that the latent space of such generators captures semantic variation in the…

2016-05-31abs ↗pdf ↗

Archetypal analysis is a data decomposition method that describes each observation in a dataset as a convex combination of "pure types" or archetypes. These archetypes represent extrema of a data space in which there is a trade-off between features, such as in biology where different combinations of traits provide opti…

2019-01-25abs ↗pdf ↗

We present a novel cost function for semi-supervised learning of neural networks that encourages compact clustering of the latent space to facilitate separation. The key idea is to dynamically create a graph over embeddings of labeled and unlabeled samples of a training batch to capture underlying structure in feature …

2018-06-07abs ↗pdf ↗

This research improves dynamical systems understanding by identifying latent states and their nonlinear transitions.

problem Previous work on dynamical systems could not identify nonlinear transition dynamics, leading to unreliable predictions.
method Proposes a state-space modeling framework using variational auto-encoders to identify latent states and their nonlinear transition functions.
result Demonstrates high accuracy in recovering latent state dynamics and future prediction accuracy.

Variational autoencoders are powerful algorithms for identifying dominant latent structure in a single dataset. In many applications, however, we are interested in modeling latent structure and variation that are enriched in a target dataset compared to some background---e.g. enriched in patients compared to the genera…

2019-02-12abs ↗pdf ↗

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 ↗

Method determines latent dimensionality in international trade flows.

problem Finding meaningful low-dimensional latent features in high-dimensional international trade data.
method Proposes a latent dimension determination method based on clustering of nonnegative RESCAL decompositions.
result Validates the latent features against empirical economic facts.

New model captures state-dependent variability in partially observed systems.

problem Structured stochasticity not captured by constant-variance models.
method State-coupled stochastic volatility framework with particle expectation-maximization.
result Model consistently reduces recovery bias under partial observation.

Generative Kernel PCA explores latent spaces for data interpretation and novelty detection.

problem Exploring latent spaces of datasets for better data interpretation.
method Generative Kernel PCA using hidden and visible units similar to Restricted Boltzmann Machines.
result Gradually moving in the latent space allows for interpretation of components and detection of novel patterns.

Unified approach for learning state representations from streaming data.

problem Learning reusable state representations from high-dimensional, non-stationary data.
method Unified mathematical formulation for learning latent relations, enabling flexible and principled shaping of latent space.
result Improved understanding and evaluation of existing unsupervised learning approaches.