Jessica Sorrell

Orcid: 0000-0001-9227-1032

Affiliations:
  • Johns Hopkins University, Baltimore, MD, USA


According to our database1, Jessica Sorrell authored at least 18 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Model Agreement via Anchoring.
CoRR, February, 2026

Computationally Efficient Replicable Learning of Parities.
CoRR, February, 2026

The Cost of Replicability in Active Learning.
Trans. Mach. Learn. Res., 2026

2025
Replicable Reinforcement Learning with Linear Function Approximation.
CoRR, September, 2025

Sensitivity of Stability: Theoretical & Empirical Analysis of Replicability for Adaptive Data Selection in Transfer Learning.
CoRR, August, 2025

Intersectional Fairness in Reinforcement Learning with Large State and Constraint Spaces.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
Oracle-Efficient Reinforcement Learning for Max Value Ensembles.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Replicable Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multicalibration as Boosting for Regression.
Proceedings of the International Conference on Machine Learning, 2023

2022
Algorithmic Stability for Responsible Computing
PhD thesis, 2022

Reproducibility in learning.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Securing Approximate Homomorphic Encryption Using Differential Privacy.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Boosting in the Presence of Massart Noise.
Proceedings of the Conference on Learning Theory, 2021

2020
Efficient, Noise-Tolerant, and Private Learning via Boosting.
Proceedings of the Conference on Learning Theory, 2020

Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2018
The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants.
Proceedings of the Secure IT Systems - 23rd Nordic Conference, NordSec 2018, Oslo, Norway, 2018

Ring Packing and Amortized FHEW Bootstrapping.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018


  Loading...