4 citations · 7 across the 9 of their papers we have counts for
9 papers
Replicable Reinforcement Learning with Linear Function Approximation
Eric Eaton, Marcel Hussing, Michael Kearns +3
Replication of experimental results has been a challenge faced by many scientific disciplines, including the field of machine learning. Recent work on the theory of machine learnin…
Intersectional Fairness in Reinforcement Learning with Large State and Constraint Spaces
Eric Eaton, Marcel Hussing, Michael Kearns +3
In traditional reinforcement learning (RL), the learner aims to solve a single objective optimization problem: find the policy that maximizes expected reward. However, in many real…
Oracle-Efficient Reinforcement Learning for Max Value Ensembles
Marcel Hussing, Michael Kearns, Aaron Roth +2
Reinforcement learning (RL) in large or infinite state spaces is notoriously challenging, both theoretically (where worst-case sample and computational complexities must scale with…
Replicable Reinforcement Learning
Eric Eaton, Marcel Hussing, Michael Kearns +1
The replicability crisis in the social, behavioral, and data sciences has led to the formulation of algorithm frameworks for replicability -- i.e., a requirement that an algorithm…
Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization
Mark Bun, Marco Gaboardi, Max Hopkins +5
The notion of replicable algorithms was introduced in Impagliazzo et al. [STOC '22] to describe randomized algorithms that are stable under the resampling of their inputs. More pre…
Multicalibration as Boosting for Regression
Ira Globus-Harris, Declan Harrison, Michael Kearns +2
We study the connection between multicalibration and boosting for squared error regression. First we prove a useful characterization of multicalibration in terms of a ``swap regret…
Reproducibility in Learning
Russell Impagliazzo, Rex Lei, Toniann Pitassi +1
We introduce the notion of a reproducible algorithm in the context of learning. A reproducible learning algorithm is resilient to variations in its samples -- with high probability…
Boosting in the Presence of Massart Noise
Ilias Diakonikolas, Russell Impagliazzo, Daniel Kane +3
We study the problem of boosting the accuracy of a weak learner in the (distribution-independent) PAC model with Massart noise. In the Massart noise model, the label of each exampl…
Efficient, Noise-Tolerant, and Private Learning via Boosting
Mark Bun, Marco Leandro Carmosino, Jessica Sorrell
We introduce a simple framework for designing private boosting algorithms. We give natural conditions under which these algorithms are differentially private, efficient, and noise-…