no code implementations • 29 Nov 2022 • Alexander Guyer, Thomas G. Dietterich
By inverting PCQR, we obtain marginal guarantees for the probability that the cumulative reward of an autonomous system will fall within an arbitrary user-specified target intervals.
no code implementations • 10 Jun 2022 • Thomas G. Dietterich, Jesse Hostetler
This paper extends previous work on conformal prediction for functional data and conformalized quantile regression to provide conformal prediction intervals over the future behavior of an autonomous system executing a fixed control policy on a Markov Decision Process (MDP).
no code implementations • 4 Mar 2022 • Thomas G. Dietterich, Alexander Guyer
In many object recognition applications, the set of possible categories is an open set, and the deployed recognition system will encounter novel objects belonging to categories unseen during training.
1 code implementation • 3 Feb 2022 • Kiri L. Wagstaff, Thomas G. Dietterich
However, these methods are unable to detect subpopulations where calibration could also improve prediction accuracy.
no code implementations • 1 May 2021 • Erich Merrill, Stefan Lee, Li Fuxin, Thomas G. Dietterich, Alan Fern
We consider the problem of modeling the dynamics of continuous spatial-temporal processes represented by irregular samples through both space and time.
no code implementations • ICCV 2021 • Yunye Gong, Xiao Lin, Yi Yao, Thomas G. Dietterich, Ajay Divakaran, Melinda Gervasio
Existing calibration algorithms address the problem of covariate shift via unsupervised domain adaptation.
no code implementations • 31 Dec 2020 • Shiv Shankar, Daniel Sheldon, Tao Sun, John Pickering, Thomas G. Dietterich
However, it will remove intrinsic variability if the variables are dependent, and therefore does not apply to many situations, including modeling of species counts that are controlled by common causes.
no code implementations • 24 Sep 2020 • Lukas Ruff, Jacob R. Kauffmann, Robert A. Vandermeulen, Grégoire Montavon, Wojciech Samek, Marius Kloft, Thomas G. Dietterich, Klaus-Robert Müller
Deep learning approaches to anomaly detection have recently improved the state of the art in detection performance on complex datasets such as large collections of images or text.
no code implementations • 27 Nov 2018 • Thomas G. Dietterich
Every AI system is deployed by a human organization.
no code implementations • 11 Sep 2018 • J. Walker Orr, Prasad Tadepalli, Janardhan Rao Doppa, Xiaoli Fern, Thomas G. Dietterich
Scripts have been proposed to model the stereotypical event sequences found in narratives.
no code implementations • 5 Sep 2018 • Thomas G. Dietterich, Tadesse Zemicheal
We recommend proportional distribution for IF, MAP imputation for LODA, and marginalization for EGMM.
1 code implementation • ICML 2018 • Si Liu, Risheek Garrepalli, Thomas G. Dietterich, Alan Fern, Dan Hendrycks
Further, while there are algorithms for open category detection, there are few empirical results that directly report alien detection rates.
2 code implementations • ICLR 2019 • Dan Hendrycks, Thomas G. Dietterich
Then we propose a new dataset called Icons-50 which opens research on a new kind of robustness, surface variation robustness.
no code implementations • ICML 2018 • Thomas G. Dietterich, George Trimponias, Zhitang Chen
Exogenous state variables and rewards can slow down reinforcement learning by injecting uncontrolled variation into the reward signal.
2 code implementations • 30 Aug 2017 • Shubhomoy Das, Weng-Keen Wong, Alan Fern, Thomas G. Dietterich, Md Amran Siddiqui
Unfortunately, in realworld applications, this process can be exceedingly difficult for the analyst since a large fraction of high-ranking anomalies are false positives and not interesting from the application perspective.
no code implementations • 28 Mar 2017 • Sean McGregor, Rachel Houtman, Claire Montgomery, Ronald Metoyer, Thomas G. Dietterich
SMAC is applied to find the optimal policy in this class for the reward functions of each of the stakeholder constituencies.
no code implementations • 28 Mar 2017 • Sean McGregor, Rachel Houtman, Claire Montgomery, Ronald Metoyer, Thomas G. Dietterich
One visualization approach is to invoke the simulator to generate on-policy trajectories and then visualize those trajectories.
no code implementations • 20 Oct 2015 • Li-Ping Liu, Thomas G. Dietterich, Nan Li, Zhi-Hua Zhou
This paper introduces a new approach, Transductive Top K (TTK), that seeks to minimize the hinge loss over all training instances under the constraint that exactly $k$ test instances are predicted as positive.
no code implementations • CVPR 2015 • Michael Lam, Janardhan Rao Doppa, Sinisa Todorovic, Thomas G. Dietterich
The mainstream approach to structured prediction problems in computer vision is to learn an energy function such that the solution minimizes that function.
no code implementations • 28 Feb 2015 • Md Amran Siddiqui, Alan Fern, Thomas G. Dietterich, Weng-Keen Wong
An SFE of an anomaly is a sequence of features, which are presented to the analyst one at a time (in order) until the information contained in the highlighted features is enough for the analyst to make a confident judgement about the anomaly.
no code implementations • 20 May 2014 • Li-Ping Liu, Daniel Sheldon, Thomas G. Dietterich
The Collective Graphical Model (CGM) models a population of independent and identically distributed individuals when only collective statistics (i. e., counts of individuals) are observed.
no code implementations • NeurIPS 2011 • Daniel R. Sheldon, Thomas G. Dietterich
This paper introduces Collective Graphical Models---a framework for modeling and probabilistic inference that operates directly on the sufficient statistics of the individual model.
no code implementations • NeurIPS 2011 • Mohammad S. Sorower, Janardhan R. Doppa, Walker Orr, Prasad Tadepalli, Thomas G. Dietterich, Xiaoli Z. Fern
However, unlike standard approaches to missing data, in this setting we know that facts are more likely to be missing from the text in cases where the reader can infer them from the facts that are mentioned combined with the domain knowledge.
5 code implementations • 21 May 1999 • Thomas G. Dietterich
The paper presents an online model-free learning algorithm, MAXQ-Q, and proves that it converges wih probability 1 to a kind of locally-optimal policy known as a recursively optimal policy, even in the presence of the five kinds of state abstraction.