Fetching the paper…
Reading the bibliography…
We consider an online learning problem with one-sided feedback, in which the learner is able to observe the true label only for positively predicted instances.
Approximation to bayes risk in repeated play
Hannan, J. (1957) · 1957
Earlier work this paper cites.
Aggregating strategies
Vovk, V. G. (1990) · 1990
Earlier work this paper cites.
The weighted majority algorithm
Littlestone, N. and Warmuth, M. K. (1994) · 1994
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-arm bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. (1995) · 1995
Earlier work this paper cites.
How to use expert advice
Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., and Warmuth, M. K. (1997) · 1997
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y. and Schapire, R. E. (1997) · 1997
Earlier work this paper cites.
Apple tasting
Helmbold, D. P., Littlestone, N., and Long, P. M. (2000) · 2000
Earlier work this paper cites.
Efficient algorithms for online decision problems
Kalai, A. T. and Vempala, S. S. (2005) · 2005
Earlier work this paper cites.
The price of bandit information for online optimization
Dani, V., Hayes, T. P., and Kakade, S. M. (2007) · 2007
Earlier work this paper cites.
The on-line shortest path problem under partial monitoring
György, A., Linder, T., Lugosi, G., and Ottucsák, G. (2007) · 2007
Earlier work this paper cites.
Practical learning from one-sided feedback
Sculley, D. (2007) · 2007
Earlier work this paper cites.
Combinatorial bandits
Cesa-Bianchi, N. and Lugosi, G. (2009) · 2009
Earlier work this paper cites.
Towards minimax policies for online linear optimization with bandit feedback
Bubeck, S., Cesa-Bianchi, N., and Kakade, S. M. (2012) · 2012
Earlier work this paper cites.
Fairness through awareness
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., and Zemel, R. S. (2012) · 2012
Earlier work this paper cites.
Toward a classification of finite partial-monitoring games
Antos, A., Bartók, G., Pál, D., and Szepesvári, C. (2013) · 2013
Cited alongside, same era.
An efficient algorithm for learning with semi-bandit feedback
Neu, G. and Bartók, G. (2013) · 2013
Cited alongside, same era.
Equality of opportunity in supervised learning
Hardt, M., Price, E., Price, E., and Srebro, N. (2016) · 2016
Cited alongside, same era.
Fairness in learning: Classic and contextual bandits
Joseph, M., Kearns, M. J., Morgenstern, J. H., and Roth, A. (2016) · 2016
Cited alongside, same era.
Efficient algorithms for adversarial contextual learning
Syrgkanis, V., Krishnamurthy, A., and Schapire, R. E. (2016) · 2016
Cited alongside, same era.
Human Decisions and Machine Predictions
Kleinberg, J., Lakkaraju, H., Leskovec, J., Ludwig, J., and Mullainathan, S. (2017) · 2017
Cited alongside, same era.
Probably approximately metric-fair learning
Rothblum, G. N. and Yona, G. (2018) · 2018
Later among the works it cites.
Equal opportunity in online classification with partial feedback
Bechavod, Y., Ligett, K., Roth, A., Waggoner, B., and Wu, Z. S. (2019) · 2019
Later among the works it cites.
Fair algorithms for learning in allocation problems
Elzayn, H., Jabbari, S., Jung, C., Kearns, M., Neel, S., Roth, A., and Schutzman, Z. (2019) · 2019
Later among the works it cites.
Individual fairness in hindsight
Gupta, S. and Kamble, V. (2019) · 2019
Later among the works it cites.
Operationalizing individual fairness with pairwise fair representations
Lahoti, P., Gummadi, K. P., and Weikum, G. (2019) · 2019
Later among the works it cites.
How to use heuristics for differential privacy
Neel, S., Roth, A., and Wu, Z. S. (2019) · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The selective labels problem: Evaluating algorithmic predictions in the presence of unobservables
Lakkaraju, H., Kleinberg, J. M., Leskovec, J., Ludwig, J., and Mullainathan, S. (2017) · 2017
Cited alongside, same era.
Learning cost-effective and interpretable treatment regimes
Lakkaraju, H. and Rudin, C. (2017) · 2017
Cited alongside, same era.
Interpretable classification models for recidivism prediction
Zeng, J., Ustun, B., and Rudin, C. (2017) · 2017
Cited alongside, same era.
Learning under selective labels in the presence of expert consistency
De-Arteaga, M., Dubrawski, A., and Chouldechova, A. (2018) · 2018
Cited alongside, same era.
Decision making with limited feedback
Ensign, D., Sorelle, F., Scott, N., Carlos, S., and Suresh, V. (2018) · 2018
Cited alongside, same era.
Online learning with an unknown fairness metric
Gillen, S., Jung, C., Kearns, M. J., and Roth, A. (2018) · 2018
Cited alongside, same era.
Metric-free individual fairness in online learning
Bechavod, Y., Jung, C., and Wu, Z. S. (2020) · 2020
Later among the works it cites.
Metric learning for individual fairness
Ilvento, C. (2020) · 2020
Later among the works it cites.
Two simple ways to learn individual fairness metrics from data
Mukherjee, D., Yurochkin, M., Banerjee, M., and Sun, Y. (2020) · 2020
Later among the works it cites.
Training individually fair ML models with sensitive subspace robustness
Yurochkin, M., Bower, A., and Sun, Y. (2020) · 2020
Later among the works it cites.
Characterizing fairness over the set of good models under selective labels
Coston, A., Rambachan, A., and Chouldechova, A. (2021) · 2021
Later among the works it cites.
Learning the truth from only one side of the story
Jiang, H., Jiang, Q., and Pacchiano, A. (2021) · 2021
Later among the works it cites.
An algorithmic framework for fairness elicitation
Jung, C., Kearns, M., Neel, S., Roth, A., Stapleton, L., and Wu, Z. S. (2021) · 2021
Later among the works it cites.