中文
相关论文

相关论文: Universal Psychometrics Tasks: difficulty, composi…

200 篇论文

We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained during execution of one task has value for the execution of…

机器学习 · 计算机科学 2012-09-06 Christos Dimitrakakis

We formalise the essential data of objective functions as equality constraints on composites of learners. We call these constraints "tasks", and we investigate the idealised view that such tasks determine model behaviours. We develop a…

We present a conceptual framework that unifies a variety of evaluation metrics for different structured prediction tasks (e.g. event and relation extraction, syntactic and semantic parsing). Our framework requires representing the outputs…

计算与语言 · 计算机科学 2023-10-24 Yunmo Chen , William Gantt , Tongfei Chen , Aaron Steven White , Benjamin Van Durme

This paper argues that explainability is only one facet of a broader ideal that shapes our expectations towards artificial intelligence (AI). Fundamentally, the issue is to what extent AI exhibits systematicity--not merely in being…

人工智能 · 计算机科学 2025-07-31 Matthieu Queloz

The principle of optimism in the face of uncertainty underpins many theoretically successful reinforcement learning algorithms. In this paper we provide a general framework for designing, analyzing and implementing such algorithms in the…

机器学习 · 计算机科学 2020-07-07 Gergely Neu , Ciara Pike-Burke

Numerous deep learning applications benefit from multi-task learning with multiple regression and classification objectives. In this paper we make the observation that the performance of such systems is strongly dependent on the relative…

计算机视觉与模式识别 · 计算机科学 2018-04-25 Alex Kendall , Yarin Gal , Roberto Cipolla

Trustworthy artificial intelligence increasingly relies on probabilistic computation to achieve robustness, interpretability, security and privacy. In practical systems, such workloads interleave deterministic data access with repeated…

机器学习 · 计算机科学 2026-03-27 Xueji Zhao , Likai Pei , Jianbo Liu , Kai Ni , Ningyuan Cao

In a sequential decision-making problem, the information structure is the description of how events in the system occurring at different points in time affect each other. Classical models of reinforcement learning (e.g., MDPs, POMDPs)…

机器学习 · 计算机科学 2024-05-29 Awni Altabaa , Zhuoran Yang

Multi-task learning is a very challenging problem in reinforcement learning. While training multiple tasks jointly allow the policies to share parameters across different tasks, the optimization problem becomes non-trivial: It remains…

机器学习 · 计算机科学 2020-12-08 Ruihan Yang , Huazhe Xu , Yi Wu , Xiaolong Wang

We introduce the notion of fault tolerant mechanism design, which extends the standard game theoretic framework of mechanism design to allow for uncertainty about execution. Specifically, we define the problem of task allocation in which…

计算机科学与博弈论 · 计算机科学 2013-01-07 Ryan Porter , Amir Ronen , Yoav Shoham , Moshe Tennenholtz

We introduce a method for analyzing the complexity of natural language processing tasks, and for predicting the difficulty new NLP tasks. Our complexity measures are derived from the Kolmogorov complexity of a class of automata --- {\it…

cmp-lg · 计算机科学 2016-08-31 Wlodek Zadrozny

In human-robot teams where agents collaborate together, there needs to be a clear allocation of tasks to agents. Task allocation can aid in achieving the presumed benefits of human-robot teams, such as improved team performance. Many task…

机器人学 · 计算机科学 2022-10-10 Arsha Ali , Dawn M. Tilbury , Lionel P. Robert

The ability to compute reward-optimal policies for given and known finite Markov decision processes (MDPs) underpins a variety of applications across planning, controller synthesis, and verification. However, we often want policies (1) to…

计算机科学中的逻辑 · 计算机科学 2025-11-18 Linus Heck , Filip Macák , Milan Češka , Sebastian Junges

One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. Almost no computational tasks in real life are…

计算复杂性 · 计算机科学 2011-11-23 Rodney G. Downey , Dimitrios M. Thilikos

In lifelong learning, a learner faces a sequence of tasks with shared structure and aims to identify and leverage it to accelerate learning. We study the setting where such structure is captured by a common representation of data. Unlike…

机器学习 · 计算机科学 2025-11-04 Zhi Wang , Chicheng Zhang , Ramya Korlakai Vinayak

A quite general interaction process of a multi-component system is analysed by the extended effective potential method liberated from usual limitations of perturbation theory or integrable model. The obtained causally complete solution of…

综合物理 · 物理学 2014-04-18 Andrei P. Kirilyuk

Learning from Demonstration~(LfD) should capture not only how a task is executed, but also its high-level task structure that explains the demonstrated behavior. As robots become more autonomous, such task representations must be…

机器人学 · 计算机科学 2026-05-27 Oleh Borys , Karla Stepanova

Recent work in the behavioural sciences has begun to overturn the long-held belief that human decision making is irrational, suboptimal and subject to biases. This turn to the rational suggests that human decision making may be a better…

机器学习 · 计算机科学 2020-06-09 Haiyang Chen , Hyung Jin Chang , Andrew Howes

Interpretability is a pressing issue for machine learning. Common approaches to interpretable machine learning constrain interactions between features of the input, rendering the effects of those features on a model's output comprehensible…

机器学习 · 计算机科学 2023-05-11 Kieran A. Murphy , Dani S. Bassett

The main goal in task planning is to build a sequence of actions that takes an agent from an initial state to a goal state. In robotics, this is particularly difficult because actions usually have several possible results, and sensors are…