R. Teal Witter

According to our database, R. Teal Witter authored at least 25 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Proxy-Based Approximation of Shapley and Banzhaf Interactions.

Santo M. A. R. Thies, Hubert Baniecki, R. Teal Witter, Eyke Hüllermeier, Maximilian Muschalik, Fabian Fumagalli

CoRR, May, 2026

Exactly Computing do-Shapley Values.

R. Teal Witter, Álvaro Parafita, Tomas Garriga, Maximilian Muschalik, Fabian Fumagalli, Axel Brando, Lucas Rosenblatt

CoRR, February, 2026

An Odd Estimator for Shapley Values.

Fabian Fumagalli, Landon Butler, Justin Singh Kang, Kannan Ramchandran, R. Teal Witter

CoRR, February, 2026

PolySHAP: Extending KernelSHAP with Interaction-Informed Polynomial Regression.

Fabian Fumagalli, R. Teal Witter, Christopher Musco

CoRR, January, 2026

2025

SimKey: A Semantically Aware Key Module for Watermarking Language Models.

Shingo Kodama, Haya Diwan, Lucas Rosenblatt, R. Teal Witter, Niv Cohen

CoRR, October, 2025

Regression-adjusted Monte Carlo Estimators for Shapley Values and Probabilistic Values.

R. Teal Witter, Yurong Liu, Christopher Musco

CoRR, June, 2025

Provably Accurate Shapley Value Estimation via Leverage Score Sampling.

Christopher Musco, R. Teal Witter

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Hidden in the Noise: Two-Stage Robust Watermarking for Images.

Kasra Arabi, Benjamin Feuer, R. Teal Witter, Chinmay Hegde, Niv Cohen

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

SEAL: Semantic Aware Image Watermarking.

Kasra Arabi, R. Teal Witter, Chinmay Hegde, Niv Cohen

Proceedings of the IEEE/CVF International Conference on Computer Vision, 2025

2024

Kernel Banzhaf: A Fast and Robust Estimator for Banzhaf Values.

Yurong Liu, R. Teal Witter, Flip Korn, Tarfah Alrashed, Dimitris Paparas, Juliana Freire

CoRR, 2024

FairlyUncertain: A Comprehensive Benchmark of Uncertainty in Algorithmic Fairness.

Lucas Rosenblatt, R. Teal Witter

CoRR, 2024

Minimizing Cost Rather Than Maximizing Reward in Restless Multi-Armed Bandits.

R. Teal Witter, Lisa Hellerstein

CoRR, 2024

Benchmarking Estimators for Natural Experiments: A Novel Dataset and a Doubly Robust Algorithm.

R. Teal Witter, Christopher Musco

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

I Open at the Close: A Deep Reinforcement Learning Evaluation of Open Streets Initiatives.

R. Teal Witter, Lucas Rosenblatt

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Robust and Space-Efficient Dual Adversary Quantum Query Algorithms.

Michael Czekanski, Shelby Kimmel, R. Teal Witter

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Counterfactual Fairness Is Basically Demographic Parity.

Lucas Rosenblatt, R. Teal Witter

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem.

Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

A Local Search Algorithm for the Min-Sum Submodular Cover Problem.

R. Teal Witter

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Adaptivity gap of the SBFE problem.

Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

A Local Search Algorithm for the Min-Sum Submodular Cover Problem.

Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

How to Quantify Polarization in Models of Opinion Dynamics.

Christopher Musco, Indu Ramesh, Johan Ugander, R. Teal Witter

CoRR, 2021

A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs.

Shelby Kimmel, R. Teal Witter

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Backgammon Is Hard.

R. Teal Witter

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Applications of Graph Theory and Probability in the Board Game Ticket to Ride.

R. Teal Witter, Alex Lyford

Proceedings of the FDG '20: International Conference on the Foundations of Digital Games, 2020

2019

Applications of the Quantum Algorithm for st-Connectivity.

Kai DeLorenzo, Shelby Kimmel, R. Teal Witter

Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019