中文
相关论文

相关论文: From Function to Distribution Modeling: A PAC-Gene…

200 篇论文

We study offline meta-reinforcement learning, a practical reinforcement learning paradigm that learns from offline data to adapt to new tasks. The distribution of offline data is determined jointly by the behavior policy and the task.…

机器学习 · 计算机科学 2022-06-22 Haoqi Yuan , Zongqing Lu

The best algorithm for a computational problem generally depends on the "relevant inputs," a concept that depends on the application domain and often defies formal articulation. While there is a large literature on empirical approaches to…

机器学习 · 计算机科学 2016-09-06 Rishi Gupta , Tim Roughgarden

Many decision processes in artificial intelligence and operations research are modeled by parametric optimization problems whose defining parameters are unknown and must be inferred from observable data. The Predict-Then-Optimize (PtO)…

人工智能 · 计算机科学 2024-02-13 My H Dinh , James Kotary , Ferdinando Fioretto

A key problem in off-policy Reinforcement Learning (RL) is the mismatch, or distribution shift, between the dataset and the distribution over states and actions visited by the learned policy. This problem is exacerbated in the fully offline…

机器学习 · 计算机科学 2023-11-28 Melrose Roderick , Gaurav Manek , Felix Berkenkamp , J. Zico Kolter

Offline Reinforcement Learning (RL) aims to learn a near-optimal policy from a fixed dataset of transitions collected by another policy. This problem has attracted a lot of attention recently, but most existing methods with strong…

机器学习 · 计算机科学 2023-05-23 Germano Gabbianelli , Gergely Neu , Nneka Okolo , Matteo Papini

Policy gradient methods are widely adopted reinforcement learning algorithms for tasks with continuous action spaces. These methods succeeded in many application domains, however, because of their notorious sample inefficiency their use…

Offline Reinforcement learning is commonly used for sequential decision-making in domains such as healthcare and education, where the rewards are known and the transition dynamics $T$ must be estimated on the basis of batch data. A key…

机器学习 · 计算机科学 2023-08-10 Leo Benac , Sonali Parbhoo , Finale Doshi-Velez

Data is often generated in streams, with new observations arriving over time. A key challenge for learning models from data streams is capturing relevant information while keeping computational costs manageable. We explore intelligent data…

机器学习 · 计算机科学 2025-12-23 Benedetta Lavinia Mussati , Freddie Bickford Smith , Tom Rainforth , Stephen Roberts

Machine unlearning seeks to remove the influence of particular data or class from trained models to meet privacy, legal, or ethical requirements. Existing unlearning methods tend to forget shallowly: phenomenon of an unlearned model pretend…

机器学习 · 计算机科学 2025-07-23 Jaeheun Jung , Bosung Jung , Suhyun Bae , Donghun Lee

This paper presents the first algorithm for model-based offline quantum reinforcement learning and demonstrates its functionality on the cart-pole benchmark. The model and the policy to be optimized are each implemented as variational…

量子物理 · 物理学 2025-02-06 Simon Eisenmann , Daniel Hein , Steffen Udluft , Thomas A. Runkler

The Predict-Then-Optimize framework uses machine learning models to predict unknown parameters of an optimization problem from exogenous features before solving. This setting is common to many real-world decision processes, and recently it…

机器学习 · 计算机科学 2024-09-10 James Kotary , Vincenzo Di Vito , Jacob Cristopher , Pascal Van Hentenryck , Ferdinando Fioretto

Offline reinforcement learning (RL) provides a promising approach to avoid costly online interaction with the real environment. However, the performance of offline RL highly depends on the quality of the datasets, which may cause…

机器人学 · 计算机科学 2024-05-08 Yiwen Hou , Haoyuan Sun , Jinming Ma , Feng Wu

Among the reasons hindering reinforcement learning (RL) applications to real-world problems, two factors are critical: limited data and the mismatch between the testing environment (real environment in which the policy is deployed) and the…

机器学习 · 计算机科学 2023-01-30 Xiaoteng Ma , Zhipeng Liang , Jose Blanchet , Mingwen Liu , Li Xia , Jiheng Zhang , Qianchuan Zhao , Zhengyuan Zhou

Learning from Observations (LfO) is a practical reinforcement learning scenario from which many applications can benefit through the reuse of incomplete resources. Compared to conventional imitation learning (IL), LfO is more challenging…

机器学习 · 计算机科学 2021-03-01 Zhuangdi Zhu , Kaixiang Lin , Bo Dai , Jiayu Zhou

Imitation Learning (IL) has proven highly effective for robotic and control tasks where manually designing reward functions or explicit controllers is infeasible. However, standard IL methods implicitly assume that the environment dynamics…

机器学习 · 计算机科学 2025-11-12 Rishabh Agrawal , Yusuf Alvi , Rahul Jain , Ashutosh Nayyar

Multi-objective optimization (MOO) arises in many real-world applications where trade-offs between competing objectives must be carefully balanced. In the offline setting, where only a static dataset is available, the main challenge is…

Many real-world decision processes are modeled by optimization problems whose defining parameters are unknown and must be inferred from observable data. The Predict-Then-Optimize framework uses machine learning models to predict unknown…

机器学习 · 计算机科学 2023-11-23 James Kotary , Vincenzo Di Vito , Jacob Christopher , Pascal Van Hentenryck , Ferdinando Fioretto

Learning is a process wherein a learning agent enhances its performance through exposure of experience or data. Throughout this journey, the agent may encounter diverse learning environments. For example, data may be presented to the leaner…

Deep learning provides a powerful tool for machine perception when the observations resemble the training data. However, real-world robotic systems must react intelligently to their observations even in unexpected circumstances. This…

机器学习 · 计算机科学 2018-12-31 Rowan McAllister , Gregory Kahn , Jeff Clune , Sergey Levine

In reinforcement learning, the classic objectives of maximizing discounted and finite-horizon cumulative rewards are PAC-learnable: There are algorithms that learn a near-optimal policy with high probability using a finite amount of samples…

机器学习 · 计算机科学 2023-07-04 Cambridge Yang , Michael Littman , Michael Carbin