Precision-recall versus accuracy and the role of large data sets

B Juba, HS Le - Proceedings of the AAAI conference on artificial …, 2019 - ojs.aaai.org
Practitioners of data mining and machine learning have long observed that the imbalance of
classes in a data set negatively impacts the quality of classifiers trained on that data …

The power of localization for efficiently learning linear separators with noise

P Awasthi, MF Balcan, PM Long - Journal of the ACM (JACM), 2017 - dl.acm.org
We introduce a new approach for designing computationally efficient learning algorithms
that are tolerant to noise, and we demonstrate its effectiveness by designing algorithms with …

Learning abductive reasoning using random examples

B Juba - Proceedings of the AAAI Conference on Artificial …, 2016 - ojs.aaai.org
We consider a new formulation of abduction in which degrees of" plausibility" of
explanations, along with the rules of the domain, are learned from concrete examples …

Conditional sparse linear regression

B Juba - arXiv preprint arXiv:1608.05152, 2016 - arxiv.org
Machine learning and statistics typically focus on building models that capture the vast
majority of the data, possibly ignoring a small subset of data as" noise" or" outliers." By …

Algorithms for learning a mixture of linear classifiers

A Chen, A De… - … Conference on Algorithmic …, 2022 - proceedings.mlr.press
Linear classifiers are a basic model in supervised learning. We study the problem of
learning a mixture of linear classifiers over Gaussian marginals. Despite significant interest …

Integrated common sense learning and planning in POMDPs

B Juba - Journal of Machine Learning Research, 2016 - jmlr.org
We formulate a new variant of the problem of planning in an unknown environment, for
which we can provide algorithms with reasonable theoretical guarantees in spite of large …

Adversarial online learning with changing action sets: Efficient algorithms with approximate regret bounds

E Emamjomeh-Zadeh, CY Wei… - Algorithmic Learning …, 2021 - proceedings.mlr.press
We revisit the problem of online learning with sleeping experts/bandits: in each time step,
only a subset of the actions are available for the algorithm to choose from (and learn about) …

Conditional linear regression

D Calderon, B Juba, S Li, Z Li… - … Conference on Artificial …, 2020 - proceedings.mlr.press
Work in machine learning and statistics commonly focuses on building models that capture
the vast majority of data, possibly ignoring a segment of the population as outliers. However …

An improved algorithm for learning to perform exception-tolerant abduction

M Zhang, T Mathew, B Juba - Proceedings of the AAAI Conference on …, 2017 - ojs.aaai.org
Inference from an observed or hypothesized condition to a plausible cause or explanation
for this condition is known as abduction. For many tasks, the acquisition of the necessary …

[PDF][PDF] Agnostic learning of disjunctions on symmetric distributions

V Feldman, P Kothari - The Journal of Machine Learning Research, 2015 - jmlr.org
We consider the problem of approximating and learning disjunctions (or equivalently,
conjunctions) on symmetric distributions over {0, 1} n. Symmetric distributions are …