6 papers
Power and Limits of Subset Selection in Statistical Estimation
Dina Barak-Pelleg, Daniel Berend
We study the power and limitations of subset selection in statistical estimation through the framework of \emph{super-teaching}, where a teacher selects a subset of i.i.d. data to…
Fano Geometry and Slow Coupon Collecting
Dina Barak-Pelleg, Daniel Berend
We study the coupon collector's problem in a generalized setting where each draw reveals a fixed number of coupons and the sampling mechanism is required to be \emph{fair}, meaning…
On a Conjecture on Uniform Group Drawings in the Coupon Collector Problem
Daniel Berend, Tomer Sher
We address a conjecture of Schilling concerning the optimality of the uniform distribution in the generalized Coupon Collector's Problem (CCP) where, in each round, a subset (packa…
Asymptotic Results for Uniform Group Drawing in the Coupon Collector's Problem
Daniel Berend, Tomer Sher
The article explores the asymptotic behavior of the expected number of drawings in the Coupon Collector's Problem with group-drawing under the uniform distribution. In this variant…
DynamicAdaptiveClimb: Adaptive Cache Replacement with Dynamic Resizing
Daniel Berend, Shlomi Dolev, Sweta Kumari +3
Efficient cache management is critical for optimizing the system performance, and numerous caching mechanisms have been proposed, each exploring various insertion and eviction stra…
On Conjectures concerning the Labeled Coupon Collector Problem
Dina Barak-Pelleg, Daniel Berend
We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed…