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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for goal representation

GARIM theory explains how conscious manipulation of internal representations enhances goal-directed behavior.

problem Limited understanding of how consciousness supports flexible goal-directed cognition.
method Extending a three-component theory of flexible cognition, proposing GARIM theory.
result Conscious states actively manipulate internal representations to align with goals, enhancing flexibility.

DAGR improves navigation by refining goal representations conditioned on the current state.

problem Goal-conditioned reinforcement learning lacks state awareness, leading to inefficient policy recovery.
method DAGR refines static goal embeddings into state-conditioned ones using gated cross-attention with a state-goal discrepancy map.
result DAGR improves navigation tasks on OGBench, matching or outperforming base methods.

A key challenge in complex visuomotor control is learning abstract representations that are effective for specifying goals, planning, and generalization. To this end, we introduce universal planning networks (UPN). UPNs embed differentiable planning within a goal-directed policy. This planning computation unrolls a for…

2018-04-02abs ↗pdf ↗

New approach decouples skill learning and language grounding for autonomous agents.

problem Autonomous acquisition of skills without external instructions and feedback.
method Language-Goal-Behavior (LGB) architecture with semantic representation.
result Decouples skill learning and language grounding, enabling diversity and strategy switching.

Intrinsically motivated goal exploration processes enable agents to autonomously sample goals to explore efficiently complex environments with high-dimensional continuous actions. They have been applied successfully to real world robots to discover repertoires of policies producing a wide diversity of effects. Often th…

2018-07-04abs ↗pdf ↗

For an autonomous agent to fulfill a wide range of user-specified goals at test time, it must be able to learn broadly applicable and general-purpose skill repertoires. Furthermore, to provide the requisite level of generality, these skills must handle raw sensory input such as images. In this paper, we propose an algo…

2018-07-12abs ↗pdf ↗

The paper develops methods to create fair and transferable representations without subgroup discrimination.

problem Creating fair and transferable representations without discriminating subgroups in the population.
method The approach involves modifying data representations to meet fairness constraints, leveraging task similarities via low rank matrix factorization.
result The learned fair representation transfers well to novel tasks, improving prediction performance and fairness metrics.

Automated discovery of diverse self-organized patterns in complex systems.

problem Automated identification of interesting spatially localized patterns in self-organizing systems.
method Intrinsically motivated machine learning algorithms (POP-IMGEPs) combined with deep auto-encoders and CPPN primitives.
result Efficiency and effectiveness of the proposed method in discovering diverse patterns compared to baselines.

A very popular problem on braid groups has recently been solved by Bigelow and Krammer, namely, they have found a faithful linear representation for the braid group B_n. In their papers, Bigelow and Krammer suggested that their representation is the monodromy representation of a certain fibration. Our goal in this pape…

2001-11-16abs ↗pdf ↗

All-goals updating exploits the off-policy nature of Q-learning to update all possible goals an agent could have from each transition in the world, and was introduced into Reinforcement Learning (RL) by Kaelbling (1993). In prior work this was mostly explored in small-state RL problems that allowed tabular representati…

2018-06-22abs ↗pdf ↗

Robotic arm learns to manipulate a ball by choosing goals from learned experience.

problem Efficient discovery of skills for long-living autonomous agents without supervision.
method Intrinsically motivated goal exploration using learned goal spaces from deep representation learning.
result Recent results show applicability of learned goal spaces on real-world robotic tasks.

This work uses action equivariance to learn structured latent spaces for reinforcement learning.

problem Learning structured latent spaces for reinforcement learning.
method Introduced a contrastive loss function to enforce action equivariance on learned representations.
result Optimal policies in the abstract MDP can be successfully lifted to the original MDP.

This paper presents a locally decoupled network parameter learning with local propagation. Three elements are taken into account: (i) sets of nonlinear transforms that describe the representations at all nodes, (ii) a local objective at each node related to the corresponding local representation goal, and (iii) a local…

2018-05-20abs ↗pdf ↗

IRM learns representations invariant to training distributions for better generalization.

problem Learning generalizable models across different training distributions.
method IRM learns a data representation that remains consistent across multiple training distributions, ensuring an optimal classifier matches across them.
result IRM enables out-of-distribution generalization by learning invariant correlations.

Investigates optimal strategies for behavioral control problems with finite variation controls.

problem Behavioral singular stochastic control problems with finite variation controls.
method Abstract framework, applied to storage management and portfolio investment problems, using CPT preferences and Skorokhod representation theorem.
result Existence of optimal strategies for various goal functionals, including CPT preferences.

Agent learns diverse hierarchical structures in unknown environments.

problem Autonomous discovery and learning of diverse structures in unknown changing environments.
method Progressive construction of a Hierarchy of Observation Latent Models for Exploration Stratification (HOLMES).
result Agent can learn and reuse representations to progressively explore and discover diverse structures.

Self-supervised reward prediction improves RL in sparse reward settings.

problem Data efficiency and sparse reward signals in reinforcement learning.
method Learning a state representation for reward prediction and using it to shape rewards.
result Self-supervised reward prediction enhances RL algorithms in single-goal environments.

This paper proposes a new method to connect language and physical actions in reinforcement learning.

problem Connecting linguistic representations to the physical world in embodied agents.
method Language-conditioned goal generators to decouple sensorimotor learning from language acquisition.
result Agents can demonstrate a diversity of behaviors for any given instruction.

Deep-embedding methods aim to discover representations of a domain that make explicit the domain's class structure and thereby support few-shot learning. Disentangling methods aim to make explicit compositional or factorial structure. We combine these two active but independent lines of research and propose a new parad…

2018-02-14abs ↗pdf ↗

In recent years, deep generative models have been shown to 'imagine' convincing high-dimensional observations such as images, audio, and even video, learning directly from raw data. In this work, we ask how to imagine goal-directed visual plans -- a plausible sequence of observations that transition a dynamical system …

2018-07-24abs ↗pdf ↗

Paper summarizes unsupervised learning challenges for disentangled representations.

problem Unsupervised learning of disentangled representations without inductive biases.
method Theoretical and practical analysis of existing approaches.
result Unsupervised disentanglement is fundamentally impossible without inductive biases.

New approach identifies latent properties from mechanisms, not just data.

problem Identifying latent properties from data generating processes.
method Equivariance perspective on identifiable representation learning.
result Identification of latent properties is possible up to shared equivariances in known mechanisms.

Deep Sets improve reinforcement learning agent's object-centered navigation and generalization.

problem Improving reinforcement learning agents' ability to generalize to unseen objects and goals.
method Combining object-wise permutation invariant networks (Deep Sets) and gated-attention mechanisms.
result Agent demonstrates strong generalization to out-of-distribution goals in a procedurally-generated 2D world.

In this paper, we advocate for representation learning as the key to mitigating unfair prediction outcomes downstream. Motivated by a scenario where learned representations are used by third parties with unknown objectives, we propose and explore adversarial representation learning as a natural method of ensuring those…

2018-02-17abs ↗pdf ↗

Unified algorithm tackles various RL goals like reward-free and preference-based learning.

problem Unified approach to multiple RL learning goals.
method Decision-Estimation Coefficient (DEC) framework.
result Unified algorithm handles various learning goals with a single framework.

Unpaired multi-domain causal representation learning is possible with sufficient conditions.

problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.

The rho-invariant is an invariant of odd-dimensional manifolds with finite fundamental group, and lies in the representations modulo the regular representations (after tensoring with Q). It is a fundamental invariant that occurs in classifying lens spaces, their homotopy analogues, and is intimately related to the eta-…

1997-12-04abs ↗pdf ↗

We release a large ECG dataset for arrhythmia subtype discovery.

problem Discovering unknown subtypes of arrhythmia from continuous raw signals.
method Unsupervised representation learning task using semi-supervised evaluation.
result Qualitative evaluations show potential for representation learning in arrhythmia sub-type discovery.

Unsupervised learning techniques in computer vision often require learning latent representations, such as low-dimensional linear and non-linear subspaces. Noise and outliers in the data can frustrate these approaches by obscuring the latent spaces. Our main goal is deeper understanding and new development of robust ap…

2017-07-31abs ↗pdf ↗

Paper proposes a new speech representation benchmark and model.

problem Lack of benchmarks for comparing speech representations.
method Unsupervised triplet-loss objective for training a universal non-semantic speech representation.
result Proposed representation outperforms other models on benchmark and transfer learning tasks.

New RL environments help AI learn causal relationships from visual data.

problem Learning causal relationships from visual data for AI agents.
method Designing benchmark RL environments and evaluating representation learning algorithms.
result Explicitly incorporating structure and modularity improves causal induction in model-based RL.