no code implementations • 29 Sep 2021 • Jack Henry Good, Kyle Miller, Artur Dubrawski
FDTs address the sensitivity and tendency to overfitting of decision trees by representing uncertainty through fuzzy partitions.
no code implementations • 1 Jan 2021 • Sibi Venkatesan, Kyle Miller, Artur Dubrawski
Our synthetic and real-world experiments show promising results for the application of these models to robust representation learning.
no code implementations • 11 May 2020 • Kyle Miller, Artur Dubrawski
This paper reviews current literature in the field of predictive maintenance from the system point of view.
1 code implementation • NeurIPS 2019 • Ifigeneia Apostolopoulou, Scott Linderman, Kyle Miller, Artur Dubrawski
Despite many potential applications, existing point process models are limited in their ability to capture complex patterns of interaction.
no code implementations • 2 Sep 2019 • Chris Anderson, Kenneth L. Baker, Xinghua Gao, Marc Kegel, Khanh Le, Kyle Miller, Sinem Onaran, Geoffrey Sangston, Samuel Tripp, Adam Wood, Ana Wright
In Dunfield's catalog of the hyperbolic manifolds in the SnapPy census which are complements of L-space knots in $S^3$, we determine that $22$ have tunnel number $2$ while the remaining all have tunnel number $1$.
Geometric Topology 57M25
no code implementations • NeurIPS 2017 • Yichong Xu, Hongyang Zhang, Kyle Miller, Aarti Singh, Artur Dubrawski
We study the problem of interactively learning a binary classifier using noisy labeling and pairwise comparison oracles, where the comparison oracle answers which one in the given two instances is more likely to be positive.
no code implementations • 17 Sep 2017 • Eric Lei, Kyle Miller, Michael R. Pinsky, Artur Dubrawski
We aim to investigate the usefulness of nonlinear multi-view relations to characterize multi-view data in an explainable manner.
no code implementations • 19 Apr 2017 • Yichong Xu, Hongyang Zhang, Aarti Singh, Kyle Miller, Artur Dubrawski
We study the problem of interactively learning a binary classifier using noisy labeling and pairwise comparison oracles, where the comparison oracle answers which one in the given two instances is more likely to be positive.
no code implementations • 10 Sep 2015 • Matt Barnes, Kyle Miller, Artur Dubrawski
One significant challenge to scaling entity resolution algorithms to massive datasets is understanding how performance changes after moving beyond the realm of small, manually labeled reference datasets.