Zobrazeno 1 - 10
of 272
pro vyhledávání: '"R. Teal"'
Autor:
Liu, Yurong, Witter, R. Teal, Korn, Flip, Alrashed, Tarfah, Paparas, Dimitris, Freire, Juliana
Banzhaf values offer a simple and interpretable alternative to the widely-used Shapley values. We introduce Kernel Banzhaf, a novel algorithm inspired by KernelSHAP, that leverages an elegant connection between Banzhaf values and linear regression. T
Externí odkaz:
http://arxiv.org/abs/2410.08336
Autor:
Rosenblatt, Lucas, Witter, R. Teal
Fair predictive algorithms hinge on both equality and trust, yet inherent uncertainty in real-world data challenges our ability to make consistent, fair, and calibrated decisions. While fairly managing predictive error has been extensively explored,
Externí odkaz:
http://arxiv.org/abs/2410.02005
Autor:
Musco, Christopher, Witter, R. Teal
Originally introduced in game theory, Shapley values have emerged as a central tool in explainable machine learning, where they are used to attribute model predictions to specific input features. However, computing Shapley values exactly is expensive
Externí odkaz:
http://arxiv.org/abs/2410.01917
Autor:
Witter, R. Teal, Musco, Christopher
Estimating the effect of treatments from natural experiments, where treatments are pre-assigned, is an important and well-studied problem. We introduce a novel natural experiment dataset obtained from an early childhood literacy nonprofit. Surprising
Externí odkaz:
http://arxiv.org/abs/2409.04500
Autor:
Witter, R. Teal, Hellerstein, Lisa
Restless Multi-Armed Bandits (RMABs) offer a powerful framework for solving resource constrained maximization problems. However, the formulation can be inappropriate for settings where the limiting constraint is a reward threshold rather than a budge
Externí odkaz:
http://arxiv.org/abs/2409.03071
Autor:
Witter, R. Teal, Rosenblatt, Lucas
The open streets initiative "opens" streets to pedestrians and bicyclists by closing them to cars and trucks. The initiative, adopted by many cities across North America, increases community space in urban environments. But could open streets also ma
Externí odkaz:
http://arxiv.org/abs/2312.07680
The general adversary dual is a powerful tool in quantum computing because it gives a query-optimal bounded-error quantum algorithm for deciding any Boolean function. Unfortunately, the algorithm uses linear qubits in the worst case, and only works i
Externí odkaz:
http://arxiv.org/abs/2306.15040
We consider the problem of solving the Min-Sum Submodular Cover problem using local search. The Min-Sum Submodular Cover problem generalizes the NP-complete Min-Sum Set Cover problem, replacing the input set cover instance with a monotone submodular
Externí odkaz:
http://arxiv.org/abs/2209.03054
Autor:
Rosenblatt, Lucas, Witter, R. Teal
Making fair decisions is crucial to ethically implementing machine learning algorithms in social settings. In this work, we consider the celebrated definition of counterfactual fairness [Kusner et al., NeurIPS, 2017]. We begin by showing that an algo
Externí odkaz:
http://arxiv.org/abs/2208.03843
We consider the Stochastic Boolean Function Evaluation (SBFE) problem where the task is to efficiently evaluate a known Boolean function $f$ on an unknown bit string $x$ of length $n$. We determine $f(x)$ by sequentially testing the variables of $x$,
Externí odkaz:
http://arxiv.org/abs/2208.03810