2 papers
cs.LG2026
Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space
Alon Bebchuk, Nir Shavit
The lottery ticket hypothesis posits that dense networks contain sparse subnetworks, ``winning tickets,'' that, when rewound to their initial weights and retrained in isolation, ma…
cs.GT2025
NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations
Alon Bebchuk
We study the problem of allocating a set of indivisible items to agents with supermodular utilities to maximize the Nash social welfare. We show that the problem is NP-hard for any…