Deep reinforcement learning has recently gained a focus on problems where policy or value functions are independent of goals. Evidence exists that the sampling of goals has a strong effect on the learning performance, but there is a lack of general mechanisms that focus on optimizing the goal sampling process. In this …
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
48 results for “performance goals”
Optimizes revenue and performance goals in e-commerce advertising with budget constraints.
problem Maximizing revenue and satisfying multiple performance goals in e-commerce advertising systems.
method Linear programming approach to optimize revenue and performance goals simultaneously.
result Our algorithm improves campaign performance and platform revenue effectively.
PlanGAN uses GANs to plan efficient trajectories for multi-goal tasks in sparse reward environments.
problem Learning with sparse rewards in multi-goal environments.
method PlanGAN combines GANs to generate trajectories leading to specified goals, then combines these into a planning algorithm.
result PlanGAN achieves comparable performance to model-free RL but is 4-8 times more sample efficient.
Paper proposes a method to learn goal-reaching behaviors from scratch using imitation learning.
problem Current reinforcement learning algorithms are brittle and require expert demonstrations.
method Iterated supervised learning where agents relabel and imitate generated trajectories.
result Improved goal-reaching performance and robustness over current RL algorithms.
In Multi-Goal Reinforcement Learning, an agent learns to achieve multiple goals with a goal-conditioned policy. During learning, the agent first collects the trajectories into a replay buffer, and later these trajectories are selected randomly for replay. However, the achieved goals in the replay buffer are often biase…
A new EM framework for goal-conditioned RL improves performance on sparse reward tasks.
problem Handling sparse rewards in goal-conditioned reinforcement learning.
method A graphical model framework with an EM algorithm that includes a learning-in-hindsight E-step and a supervised M-step.
result hEM significantly outperforms model-free baselines on goal-conditioned benchmarks with sparse rewards.
Agents need world models to generalize multi-step tasks.
problem The necessity of world models for flexible, goal-directed behavior.
method Formal analysis and demonstration of the necessity of world models for agents to generalize multi-step tasks.
result World models are necessary for agents to generalize to multi-step goal-directed tasks.
Agent learns causal relationships from visual data to perform tasks.
problem Performing tasks in novel environments with latent causal structures.
method Learning-based approach to induce causal graphs from visual observations, using attention mechanisms.
result Effective generalization to new tasks with unseen causal structures.
This paper introduces glocal explanations for expected goal models in soccer.
problem Limited interpretability of expected goal models trained with black-box methods.
method Proposes glocal explanations using aggregated SHAP values and partial dependence profiles.
result Extracts knowledge from expected goal models for teams and players, enhancing performance analysis.
OptiGAN uses GAN and RL to optimize sequence generation for specific goals.
problem Challenging in sequence generation tasks to generate sequences with specific desired goals.
method Integrates GAN and RL to optimize desired goal scores using policy gradients.
result Achieves higher desired scores in text and real-valued sequence generation.
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…
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…
Sparse reward problems are one of the biggest challenges in Reinforcement Learning. Goal-directed tasks are one such sparse reward problems where a reward signal is received only when the goal is reached. One promising way to train an agent to perform goal-directed tasks is to use Hindsight Learning approaches. In thes…
A method for setting up an automatic curriculum for reinforcement learning tasks.
problem Improving sample efficiency in multi-task reinforcement learning.
method Propose a goal proposal module that prioritizes goals maximizing epistemic uncertainty of the Q-function.
result Significant performance gains over current methods in 13 multi-goal robotic tasks and 5 navigation tasks.
Automatically generates curricula for reinforcement learning agents.
problem Learning in dynamic, sparse reward environments.
method Setter-solver paradigm focusing on goal validity, feasibility, and coverage.
result Demonstrated success in 2D and 3D environments with varying goals.
Autonomous agents that must exhibit flexible and broad capabilities will need to be equipped with large repertoires of skills. Defining each skill with a manually-designed reward function limits this repertoire and imposes a manual engineering burden. Self-supervised agents that set their own goals can automate this pr…
Eikonal-Constrained QRL improves goal-reaching in reinforcement learning.
problem Reward design and out-of-distribution generalization in reinforcement learning.
method Eikonal-Constrained Quasimetric Reinforcement Learning (Eik-QRL) using the Eikonal PDE.
result Eik-QRL achieves state-of-the-art performance in offline goal-conditioned navigation and manipulation tasks.
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.
Sparse reward is one of the most challenging problems in reinforcement learning (RL). Hindsight Experience Replay (HER) attempts to address this issue by converting a failed experience to a successful one by relabeling the goals. Despite its effectiveness, HER has limited applicability because it lacks a compact and un…
Generative neural nets learn deep policies conditioned on goals.
problem Learning optimal policies for specific goals in reinforcement learning.
method Goal-conditioned neural nets that generate deep neural policies.
result Single learned policy generator can achieve any desired return.
In hierarchical reinforcement learning a major challenge is determining appropriate low-level policies. We propose an unsupervised learning scheme, based on asymmetric self-play from Sukhbaatar et al. (2018), that automatically learns a good representation of sub-goals in the environment and a low-level policy that can…
Framework improves agent's ability to learn from noisy images.
problem Agents tend to focus on distracting regions in unsupervised image-based goal exploration.
method Proposes a novel framework combining absolute Learning Progress with unsupervised image-based goal exploration.
result Agents successfully identify and ignore distracting regions, improving overall performance.
GOALS improves learning rate selection for dynamic MBSS in deep learning.
problem Challenges in selecting learning rates for dynamic MBSS in deep learning.
method Gradient-only approximation line search (GOALS) for dynamic MBSS loss functions.
result GOALS reduces model errors in multimodal cases.
This paper proposes a method to learn from expert trajectories by decomposing tasks into sub-goals.
problem Learning complex goal-oriented tasks with sparse rewards and limited samples.
method The approach uses expert trajectories to decompose tasks into sub-goals, learning an extrinsic reward function and modulating sub-goal predictions.
result The method alleviates errors in imitation learning and solves complex tasks that other methods cannot.
GOIMDA selects inputs to maximize expected influence on a goal functional, reducing data acquisition needs.
problem Challenges in active data acquisition for learning and optimization tasks in deep neural networks.
method GOIMDA uses inverse curvature and goal gradient to select inputs maximizing expected influence on a specified goal functional.
result GOIMDA achieves target performance with fewer labeled samples or function evaluations compared to baselines.
The health outcomes of high-need patients can be substantially influenced by the degree of patient engagement in their own care. The role of care managers includes that of enrolling patients into care programs and keeping them sufficiently engaged in the program, so that patients can attain various goals. The attainmen…
The paper introduces an adjacency constraint to improve goal-conditioned HRL.
problem Training inefficiency in goal-conditioned HRL due to large action space.
method Restricting the high-level action space to a k-step adjacent region of the current state.
result The adjacency constraint preserves optimal hierarchical policies and improves HRL performance.
Improves reinforcement learning for complex tasks with sparse feedback.
problem Learning optimal policies from sparse feedback is challenging.
method Three algorithms based on Hindsight Experience Replay (HER) to improve performances.
result Vast improvement in final success rate and sample efficiency.
Goals for reinforcement learning problems are typically defined through hand-specified rewards. To design such problems, developers of learning algorithms must inherently be aware of what the task goals are, yet we often require agents to discover them on their own without any supervision beyond these sparse rewards. W…
AI bias arises from human-defined goals, not algorithmic flaws.
problem AI bias due to human-defined goals in LLMs.
method Purpose-conditioned cognition and revealing downstream use of LLM outputs.
result AI bias can be reduced by purpose-aware prompting but not fully by regularization.
The paper proposes a method to transfer skills between tasks using disentangled latent policies.
problem Transfer learning in reinforcement learning struggles with diverse tasks without explicit supervision.
method Learning a small set of policies in a disentangled latent space that can be recombined to solve many tasks.
result Disentangled latent policies enable quick performance on many diverse tasks.
For autonomous vehicles (AVs) to behave appropriately on roads populated by human-driven vehicles, they must be able to reason about the uncertain intentions and decisions of other drivers from rich perceptual information. Towards these capabilities, we present a probabilistic forecasting model of future interactions b…
Advances in Deep Reinforcement Learning have led to agents that perform well across a variety of sensory-motor domains. In this work, we study the setting in which an agent must learn to generate programs for diverse scenes conditioned on a given symbolic instruction. Final goals are specified to our agent via images o…
An agent that has well understood the environment should be able to apply its skills for any given goals, leading to the fundamental problem of learning the Universal Value Function Approximator (UVFA). A UVFA learns to predict the cumulative rewards between all state-goal pairs. However, empirically, the value functio…
KEMP predicts long-term trajectories for autonomous driving using keyframes.
problem Predicting future trajectories of road agents for autonomous driving.
method Keyframe-based hierarchical end-to-end deep learning framework.
result Ranked 1st on Waymo Open Motion Dataset Leaderboard.
WayDCM predicts trajectories considering long-term goals, improving accuracy.
problem Predicting future trajectories of dynamic agents in complex environments.
method WayDCM combines DCM and NN to predict intermediate goals and trajectories, considering long-term goals.
result WayDCM outperforms previous methods on the Waymo Open dataset.
Max entropy exploration guides reinforcement learning agents to pursue achievable goals.
problem Achieving distant test-time goals in long-horizon tasks.
method Optimize entropy of historical achieved goals by focusing on sparsely explored areas.
result Order of magnitude better sample efficiency on long-horizon multi-goal tasks.
The UN Sustainable Development Goals allude to the importance of infrastructure quality in three of its seventeen goals. However, monitoring infrastructure quality in developing regions remains prohibitively expensive and impedes efforts to measure progress toward these goals. To this end, we investigate the use of wid…
New approach tackles decision-making under predictions that shape outcomes.
problem Challenges in learning optimal decision rules when predictions influence outcomes.
method Introduces performative omniprediction, a predictor that encodes optimal decision rules for multiple objectives.
result Efficient performative omnipredictors exist under a natural restriction of outcome performativity.
Despite its popularity, it is widely recognized that the investigation of some theoretical aspects of clustering has been relatively sparse. One of the main reasons for this lack of theoretical results is surely the fact that, whereas for other statistical problems the theoretical population goal is clearly defined (as…
Hierarchical Foresight: Self-Supervised Learning of Long-Horizon Tasks via Visual Subgoal Generationcs.LG
Video prediction models combined with planning algorithms have shown promise in enabling robots to learn to perform many vision-based tasks through only self-supervision, reaching novel goals in cluttered scenes with unseen objects. However, due to the compounding uncertainty in long horizon video prediction and poor s…
Transfer learning across different reinforcement learning (RL) tasks is becoming an increasingly valuable area of research. We consider a goal-based multi-task RL framework and mechanisms by which previously solved tasks can reduce sample complexity and regret when the agent is faced with a new task. Specifically, we i…
Developing learning methods which do not discriminate subgroups in the population is a central goal of algorithmic fairness. One way to reach this goal is by modifying the data representation in order to meet certain fairness constraints. In this work we measure fairness according to demographic parity. This requires t…
Paper explores how text generation quality and diversity metrics relate to distribution fitting.
problem Unclear relation between text generation quality and diversity metrics and distribution fitting.
method Theoretical approach to prove a linear combination of quality and diversity metrics can be a divergence metric.
result CR/NRR proposed as a better substitute for BLEU/Self-BLEU metrics.
New RL method uses distance between states instead of rewards for sparse reward environments.
problem Sparse rewards or non-reward environments in reinforcement learning.
method Uses goal-distance gradient and bridge point planning for policy improvement.
result Significantly better performance on sparse reward and local optimal problems in complex environments.
The enactive approach to cognition is typically proposed as a viable alternative to traditional cognitive science. Enactive cognition displaces the explanatory focus from the internal representations of the agent to the direct sensorimotor interaction with its environment. In this paper, we investigate enactive learnin…
Improved cooperation between levels boosts reinforcement learning performance.
problem Training multi-level policies in hierarchical reinforcement learning.
method Modeling policy optimization as a multi-agent process and inducing cooperation between sub-policies.
result Inducing cooperation between sub-policies leads to stronger and more sample-efficient policies.
Developing a dialogue agent that is capable of making autonomous decisions and communicating by natural language is one of the long-term goals of machine learning research. Traditional approaches either rely on hand-crafting a small state-action set for applying reinforcement learning that is not scalable or constructi…