2 papers
cs.DS2026
Sketching Intersection Profiles: A Simple Proof and Three Applications
Flavio Chierichetti, Mirko Giacchini, Ravi Kumar +3
In this work we settle the complexity of three sketching problems. (i) We show that sketching vertex neighborhood sizes in graphs requires bits, standing in sharp contras…
cs.DS2026
Learning Multinomial Logits in time
Flavio Chierichetti, Mirko Giacchini, Ravi Kumar +4
A Multinomial Logit (MNL) model is composed of a finite universe of items , each assigned a positive weight. A query specifies an admissible subset -- called a sl…