Deep k-nn for noisy labels

D Bahri, H Jiang, M Gupta - International Conference on …, 2020 - proceedings.mlr.press
Modern machine learning models are often trained on examples with noisy labels that hurt
performance and are hard to identify. In this paper, we provide an empirical study showing …

Robust nonparametric regression under poisoning attack

P Zhao, Z Wan - Proceedings of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
This paper studies robust nonparametric regression, in which an adversarial attacker can
modify the values of up to q samples from a training dataset of size N. Our initial solution is …

Is distribution-free inference possible for binary regression?

RF Barber - 2020 - projecteuclid.org
For a regression problem with a binary label response, we examine the problem of
constructing confidence intervals for the label probability conditional on the features. In a …

Nonparametric stochastic contextual bandits

M Guan, H Jiang - Proceedings of the AAAI Conference on Artificial …, 2018 - ojs.aaai.org
We analyze the K-armed bandit problem where the reward for each arm is a noisy
realization based on an observed context under mild nonparametric assumptions. We attain …

Dynamic contextual pricing with doubly non-parametric random utility models

E Chen, X Chen, L Gao, J Li - arxiv preprint arxiv:2405.06866, 2024 - arxiv.org
In the evolving landscape of digital commerce, adaptive dynamic pricing strategies are
essential for gaining a competitive edge. This paper introduces novel {\em doubly …

Flexible non-parametric regression models for compositional response data with zeros

M Tsagris, A Alenazi, C Stewart - Statistics and Computing, 2023 - Springer
Compositional data arise in many real-life applications and versatile methods for properly
analyzing this type of data in the regression context are needed. When parametric …

Malts: Matching after learning to stretch

H Parikh, C Rudin, A Volfovsky - Journal of Machine Learning Research, 2022 - jmlr.org
We introduce a flexible framework that produces high-quality almost-exact matches for
causal inference. Most prior work in matching uses ad-hoc distance metrics, often leading to …

Fast rates for a kNN classifier robust to unknown asymmetric label noise

H Reeve, A Kabán - International Conference on Machine …, 2019 - proceedings.mlr.press
We consider classification in the presence of class-dependent asymmetric label noise with
unknown noise probabilities. In this setting, identifiability conditions are known, but …

Matched learning for optimizing individualized treatment strategies using electronic health records

P Wu, D Zeng, Y Wang - Journal of the American Statistical …, 2020 - Taylor & Francis
Current guidelines for treatment decision making largely rely on data from randomized
controlled trials (RCTs) studying average treatment effects. They may be inadequate to …

Minimax optimal q learning with nearest neighbors

P Zhao, L Lai - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
Markov decision process (MDP) is an important model of sequential decision making
problems. Existing theoretical analysis focus primarily on finite state spaces. For continuous …