activity
20082026
most citedFlexibly Fair Representation Learning by Disentanglement

133 citations · 208 across the 16 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

cs.LG2023

Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models

Thomas P. Zollo, Todd Morrill, Zhun Deng +3

The recent explosion in the capabilities of large language models has led to a wave of interest in how best to prompt a model to perform a given task. While it may be tempting to s…

cs.CC2023

An improved protocol for ExactlyN with more than 3 players

Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif +2

The ExactlyN problem in the number-on-forehead (NOF) communication setting asks players, each of whom can see every input but their own, if the input numbers add up to .…

cs.LG2023

Distribution-Free Statistical Dispersion Control for Societal Applications

Zhun Deng, Thomas P. Zollo, Jake C. Snell +2

Explicit finite-sample statistical guarantees on model performance are an important ingredient in responsible machine learning. Previous work has focused mainly on bounding either…

cs.DS2023

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing

Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano +3

We present a simple and provably optimal non-adaptive cell probe data structure for the static dictionary problem. Our data structure supports storing a set of n key-value pairs fr…

cs.CC2023

On the algebraic proof complexity of Tensor Isomorphism

Nicola Galesi, Joshua A. Grochow, Toniann Pitassi +1

The Tensor Isomorphism problem (TI) has recently emerged as having connections to multiple areas of research within complexity and beyond, but the current best upper bound is essen…