5 papers · 1 filter
Protecting the Undeleted in Machine Unlearning
Aloni Cohen, Refael Kohen, Kobbi Nissim +1
Machine unlearning aims to remove specific data points from a trained model, often striving to emulate "perfect retraining", i.e., producing the model that would have been obtained…
Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
Orin Levy, Aviv Rosenberg, Alon Cohen +1
We introduce \texttt{OPO-CMDP}, the first policy optimization algorithm for stochastic Contextual Markov Decision Process (CMDPs) under general offline function approximation. Our…
Improved Bounds for Reward-Agnostic and Reward-Free Exploration
Oran Ridel, Alon Cohen
We study reward-free and reward-agnostic exploration in episodic finite-horizon Markov decision processes (MDPs), where an agent explores an unknown environment without observing e…
Regret Guarantees for Linear Contextual Stochastic Shortest Path
Dor Polikar, Alon Cohen
We define the problem of linear Contextual Stochastic Shortest Path (CSSP), where at the beginning of each episode, the learner observes an adversarially chosen context that determ…
Private PAC Learning May be Harder than Online Learning
Mark Bun, Aloni Cohen, Rathin Desai
We continue the study of the computational complexity of differentially private PAC learning and how it is situated within the foundations of machine learning. A recent line of wor…