Sílvia Casacuberta

Sílvia Casacuberta

Auto-generated profile, based on publicly available information

Sílvia Casacuberta

University of Oxford, Oxford, United Kingdom

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 June 2024
Verified
Conference Paper
Open access
SCSílvia Casacuberta
Sílvia Casacuberta
CDCynthia Dwork
Cynthia Dwork
SVSalil Vadhan
Salil Vadhan
We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are correct in expectation on each member of an arbitrary collection of pre-specified sets. Multicalibrated predictors satisfy a stronger condition: they are calibrated on each set in the collection. Multiaccuracy is equivalent to a regularity notion for functions defined by Trevisan, Tulsiani, and Vadhan (2009). They showed that, given a class F of (possibly simple) functions, an arbitrarily complex function g can be approximated by a low-complexity function h that makes a small number of oracle calls to members of F, where the notion of approximation requires that h cannot be distinguished from g by members of F. This complexity-theoretic Regularity Lemma is known to have implications in different areas, including in complexity theory, additive number theory, information theory, graph theory, and cryptography. Starting from the stronger notion of multicalibration, we obtain stronger and more general versions of a number of applications of the Regularity Lemma, including the Hardcore Lemma, the Dense Model Theorem, and the equivalence of conditional pseudo-min-entropy and unpredictability. For example, we show that every boolean function (regardless of its hardness) has a small collection of disjoint hardcore sets, where the sizes of those hardcore sets are related to how balanced the function is on corresponding pieces of an efficient partition of the domain.

23 June 2025
Verified
Conference Paper
Open access
TBTina Behzad
Tina Behzad
SCSílvia Casacuberta
Sílvia Casacuberta
EDEmily Ruth Diana
Emily Ruth Diana
ATAlexander Williams Tolbert
Alexander Williams Tolbert

2 July 2025
Verified
Conference Paper
Open access
RBRatip Emin Berker
Ratip Emin Berker
SCSílvia Casacuberta
Sílvia Casacuberta
IRIsaac Robinson
Isaac Robinson
COChristopher Ong
Christopher Ong
VCVincent Conitzer
Vincent Conitzer
EEEdith Elkind
Edith Elkind