arXiv research

Improved trajectory prediction for team sports using sparse outputs.

The paper improves lower bounds on deep neural network trajectories.

Paper infers human mobility from sparse trajectories.

Framework learns continuous dynamics from sparse trajectories.

PlanGAN uses GANs to plan efficient trajectories for multi-goal tasks in sparse reward environments.

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

This paper proposes a method to learn from expert trajectories by decomposing tasks into sub-goals.

This research enhances exploration in DDPG using latent trajectory optimization.

Novel deep learning method predicts reaction coordinates and future MD trajectories.

Deep learning models can infer individual trajectories from sparse data.

Reinforcement learning with sparse rewards is challenging because an agent can rarely obtain non-zero rewards and hence, gradient-based optimization of parameterized policies can be incremental and slow. Recent work demonstrated that using a memory buffer of previous successful trajectories can result in more effective…

This paper addresses the problem of identifying sparse linear time-invariant (LTI) systems from a single sample trajectory generated by the system dynamics. We introduce a Lasso-like estimator for the parameters of the system, taking into account their sparse nature. Assuming that the system is stable, or that it is eq…

Deep Reinforcement Learning has shown tremendous success in solving several games and tasks in robotics. However, unlike humans, it generally requires a lot of training instances. Trajectories imitating to solve the task at hand can help to increase sample-efficiency of deep RL methods. In this paper, we present a simp…

Enhances reinforcement learning from sparse data.

We present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number, as is the case in many fluid mechanics applications of practical interest. The method, based on principles used in graph coloring and spectral graph drawing algorithms, examines a measur…

New method learns dynamics from sparse data using geometric constraints.

Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the overall consensus process. Second, they generally lack the ability to incorpora…

Rotation invariant algorithms fail on sparse problems even with noise.

Deep neural network reconstructs traffic speeds from sparse vehicle data.

Novel methods improve Bayesian analysis of chaotic dynamical systems.

In this paper, we study the system identification problem for sparse linear time-invariant systems. We propose a sparsity promoting block-regularized estimator to identify the dynamics of the system with only a limited number of input-state data samples. We characterize the properties of this estimator under high-dimen…

In this work, we take a representation learning perspective on hierarchical reinforcement learning, where the problem of learning lower layers in a hierarchy is transformed into the problem of learning trajectory-level generative models. We show that we can learn continuous latent representations of trajectories, which…

Algorithm recovers graph from Glauber dynamics trajectory without mixing.

We present a method for identifying the coherent structures associated with individual Lagrangian flow trajectories even where only sparse particle trajectory data is available. The method, based on techniques in spectral graph theory, uses the Coherent Structure Coloring vector and associated eigenvectors to analyze t…

Proposes a method to estimate SDE noise from a single trajectory.

Paper proposes RRD to learn proxy rewards for sparse delayed rewards in episodic reinforcement learning.

Unsupervised exploration and representation learning become increasingly important when learning in diverse and sparse environments. The information-theoretic principle of empowerment formalizes an unsupervised exploration objective through an agent trying to maximize its influence on the future states of its environme…

Medical researchers are coming to appreciate that many diseases are in fact complex, heterogeneous syndromes composed of subpopulations that express different variants of a related complication. Time series data extracted from individual electronic health records (EHR) offer an exciting new way to study subtle differen…

We consider the problem of learning from sparse and underspecified rewards, where an agent receives a complex input, such as a natural language instruction, and needs to generate a complex response, such as an action sequence, while only receiving binary success-failure feedback. Such success-failure rewards are often …

Develops HMRL for sparse reward RL problems, improving meta policy efficiency and transferability.

Paper uses sparse learning to estimate quasi-potential and drift components in stochastic systems.

NoTMF forecasts sparse urban road movement speeds with nonstationary temporal matrix factorization.

This paper explores a simple regularizer for reinforcement learning by proposing Generative Adversarial Self-Imitation Learning (GASIL), which encourages the agent to imitate past good trajectories via generative adversarial imitation learning framework. Instead of directly maximizing rewards, GASIL focuses on reproduc…

Improves diversity of text-to-image models without sacrificing FID.

This paper proposes a new algorithm for learning guidance rewards in RL.

CCM improves context for Meta-RL by contrastive learning.

Novel method for SDE calibration from sparse data using neural flows.

Paper proposes a method to learn goal-reaching behaviors from scratch using imitation learning.

Modeling driver trajectories using inverse reinforcement learning and random utility.

Ability to quantify and predict progression of a disease is fundamental for selecting an appropriate treatment. Many clinical metrics cannot be acquired frequently either because of their cost (e.g. MRI, gait analysis) or because they are inconvenient or harmful to a patient (e.g. biopsy, x-ray). In such scenarios, in …

UCB-TQL learns from multiple tasks with shared dynamics and adapts to task-specific variations.

DEMOTE uses neural diffusion-reaction processes to capture temporal dynamics in sparse tensor data.

Active learning selects optimal measurement times for inferring continuous paths from sparse data.

Study shows reinforcement learning is possible with once-per-episode feedback.

We apply variational inference to learn vehicle trajectory parameters from noisy data.

This paper presents a novel framework for accurate pedestrian intent prediction at intersections. Given some prior knowledge of the curbside geometry, the presented framework can accurately predict pedestrian trajectories, even in new intersections that it has not been trained on. This is achieved by making use of the …

More than two thirds of mental health problems have their onset during childhood or adolescence. Identifying children at risk for mental illness later in life and predicting the type of illness is not easy. We set out to develop a platform to define subtypes of childhood social-emotional development using longitudinal,…

We present Memory Augmented Policy Optimization (MAPO), a simple and novel way to leverage a memory buffer of promising trajectories to reduce the variance of policy gradient estimate. MAPO is applicable to deterministic environments with discrete actions, such as structured prediction and combinatorial optimization ta…