Author of the publication

Near-optimal reinforcement learning in polynomial time

, and . Proc. 15th International Conf. on Machine Learning, page 260--268. Morgan Kaufmann, San Francisco, CA, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Balanced Filtering via Non-Disclosive Proxies., , , and . CoRR, (2023)Confidence-Ranked Reconstruction of Census Microdata from Published Statistics., , , , , , and . CoRR, (2022)AI Model Disgorgement: Methods and Choices., , , and . CoRR, (2023)Near-optimal reinforcement learning in polynomial time, and . Proc. 15th International Conf. on Machine Learning, page 260--268. Morgan Kaufmann, San Francisco, CA, (1998)An Experimental Study of the Coloring Problem on Human Subject Networks, , and . (August 2006)Algorithms and Learning for Fair Portfolio Design., , , , , , , and . EC, page 371-389. ACM, (2021)Scalable Membership Inference Attacks via Quantile Regression., , , , , and . CoRR, (2023)Multiaccurate Proxies for Downstream Fairness., , , , , and . CoRR, (2021)Recent Results on Boolean Concept Learning, , , and . Proceedings of the Fourth International Workshop on Machine Learning, San Francisco, CA, Morgan Kaufmann, (1987)An Algorithmic Framework for Fairness Elicitation., , , , , and . FORC, volume 192 of LIPIcs, page 2:1-2:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)