3 papers
cs.DS2022
The DAG Visit approach for Pebbling and I/O Lower Bounds
Gianfranco Bilardi, Lorenzo De Stefani
We introduce the notion of an -visit of a Directed Acyclic Graph DAG , a sequence of the vertices of the DAG complying with a given rule . A rule specifies for e…
eess.SP2019
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis
Lorenzo De Stefani, Eli Upfal
While standard statistical inference techniques and machine learning generalization bounds assume that tests are run on data selected independently of the hypotheses, practical dat…
cs.DB2016
Controlling False Discoveries During Interactive Data Exploration
Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen +3
Recent tools for interactive data exploration significantly increase the chance that users make false discoveries. The crux is that these tools implicitly allow the user to test a…