中文
相关论文

相关论文: Solving the scalarization issues of Advantage-base…

200 篇论文

Agents trained with deep reinforcement learning algorithms are capable of performing highly complex tasks including locomotion in continuous environments. We investigate transferring the learning acquired in one task to a set of previously…

机器学习 · 计算机科学 2024-03-06 Suzan Ece Ada , Emre Ugur , H. Levent Akin

This paper investigates the so-called reward-balancing methods, a novel class of algorithms for solving discounted-return reinforcement learning (RL) problems. These methods consist of iteratively adjusting the reward function to transform…

最优化与控制 · 数学 2026-04-23 Simone Baroncini , Bahman Gharesifard , Giuseppe Notarstefano

Imitation learning can reproduce policies by observing experts, which poses a problem regarding policy privacy. Policies, such as human, or policies on deployed robots, can all be cloned without consent from the owners. How can we protect…

机器学习 · 计算机科学 2020-08-04 Albert Zhan , Stas Tiomkin , Pieter Abbeel

This paper presents a new method --- adversarial advantage actor-critic (Adversarial A2C), which significantly improves the efficiency of dialogue policy learning in task-completion dialogue systems. Inspired by generative adversarial…

计算与语言 · 计算机科学 2018-02-09 Baolin Peng , Xiujun Li , Jianfeng Gao , Jingjing Liu , Yun-Nung Chen , Kam-Fai Wong

This paper addresses the scalar regression problem through a novel solution to exactly optimize the Huber loss in a general semi-supervised setting, which combines multi-view learning and manifold regularization. We propose a principled…

机器学习 · 计算机科学 2016-06-28 Jacopo Cavazza , Vittorio Murino

Robust real-world learning should benefit from both demonstrations and interactions with the environment. Current approaches to learning from demonstration and reward perform supervised learning on expert demonstration data and use…

人工智能 · 计算机科学 2019-05-31 Yang Gao , Huazhe Xu , Ji Lin , Fisher Yu , Sergey Levine , Trevor Darrell

Given a finite set of sample points, meta-learning algorithms aim to learn an optimal adaptation strategy for new, unseen tasks. Often, this data can be ambiguous as it might belong to different tasks concurrently. This is particularly the…

机器学习 · 计算机科学 2024-10-24 Alfredo Reichlin , Gustaf Tegnér , Miguel Vasco , Hang Yin , Mårten Björkman , Danica Kragic

In this paper we propose a novel gradient algorithm to learn a policy from an expert's observed behavior assuming that the expert behaves optimally with respect to some unknown reward function of a Markovian Decision Problem. The…

机器学习 · 计算机科学 2012-06-26 Gergely Neu , Csaba Szepesvari

While deep learning in the form of recurrent neural networks (RNNs) has caused a significant improvement in neural language modeling, the fact that they are extremely prone to overfitting is still a mainly unresolved issue. In this paper we…

计算与语言 · 计算机科学 2022-11-18 Sajad Movahedi , Azadeh Shakery

Reinforcement Learning (RL) for training Large Language Models is notoriously unstable. While recent studies attribute this to "training inference mismatch stemming" from inconsistent hybrid engines, standard remedies, such as Importance…

机器学习 · 计算机科学 2026-02-03 Yaxiang Zhang , Yingru Li , Jiacai Liu , Jiawei Xu , Ziniu Li , Qian Liu , Haoyuan Li

Reinforcement Learning (RL) techniques have drawn great attention in many challenging tasks, but their performance deteriorates dramatically when applied to real-world problems. Various methods, such as domain randomization, have been…

机器学习 · 计算机科学 2022-08-05 Wangyang Yue , Yuan Zhou , Xiaochuan Zhang , Yuchen Hua , Zhiyuan Wang , Guang Kou

Dropout and other feature noising schemes control overfitting by artificially corrupting the training data. For generalized linear models, dropout performs a form of adaptive regularization. Using this viewpoint, we show that the dropout…

机器学习 · 统计学 2013-11-04 Stefan Wager , Sida Wang , Percy Liang

Many machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons:…

机器学习 · 计算机科学 2018-05-23 Qunwei Li , Bhavya Kailkhura , Ryan Goldhahn , Priyadip Ray , Pramod K. Varshney

The large capacity of neural networks enables them to learn complex functions. To avoid overfitting, networks however require a lot of training data that can be expensive and time-consuming to collect. A common practical approach to…

机器学习 · 计算机科学 2020-03-10 Majed El Helou , Frederike Dümbgen , Sabine Süsstrunk

Learning to learn has emerged as an important direction for achieving artificial intelligence. Two of the primary barriers to its adoption are an inability to scale to larger problems and a limited ability to generalize to new tasks. We…

Adversarial Imitation Learning alternates between learning a discriminator -- which tells apart expert's demonstrations from generated ones -- and a generator's policy to produce trajectories that can fool this discriminator. This…

机器学习 · 计算机科学 2021-04-19 Paul Barde , Julien Roy , Wonseok Jeon , Joelle Pineau , Christopher Pal , Derek Nowrouzezahrai

Adversarial training provides a principled approach for training robust neural networks. From an optimization perspective, adversarial training is essentially solving a bilevel optimization problem. The leader problem is trying to learn a…

机器学习 · 计算机科学 2021-05-04 Haoming Jiang , Zhehui Chen , Yuyang Shi , Bo Dai , Tuo Zhao

Deep reinforcement learning (DRL) algorithms have successfully been demonstrated on a range of challenging decision making and control tasks. One dominant component of recent deep reinforcement learning algorithms is the target network…

机器学习 · 计算机科学 2020-11-12 Lin Shao , Yifan You , Mengyuan Yan , Qingyun Sun , Jeannette Bohg

Actor-critic (AC) methods are widely used in reinforcement learning (RL) and benefit from the flexibility of using any policy gradient method as the actor and value-based method as the critic. The critic is usually trained by minimizing the…

机器学习 · 计算机科学 2023-11-01 Sharan Vaswani , Amirreza Kazemi , Reza Babanezhad , Nicolas Le Roux

We study the performance of stochastic first-order methods for finding saddle points of convex-concave functions. A notorious challenge faced by such methods is that the gradients can grow arbitrarily large during optimization, which may…

机器学习 · 计算机科学 2024-06-10 Gergely Neu , Nneka Okolo