Ambuj Tewari

Generalization error bounds for learning to rank: Does the length of\n document lists matter?

2016 · arXiv (Cornell University)

We consider the generalization ability of algorithms for learning to rank at\na query level, a problem also called subset ranking. Existing generalization\nerror bounds necessarily degrade as the size of the document list associated\nwith a query …

Balancing Adaptability and Non-exploitability in Repeated Games

2021 · arXiv (Cornell University)

We study the problem of guaranteeing low regret in repeated games against an opponent with unknown membership in one of several classes. We add the constraint that our algorithm is non-exploitable, in that the opponent …

mHealth Systems Need a Privacy-by-Design Approach: Commentary on “Federated Machine Learning, Privacy-Enhancing Technologies, and Data Protection Laws in Medical Research: Scoping Review”

2023 · Journal of Medical Internet Research

Brauneck and colleagues have combined technical and legal perspectives in their timely and valuable paper "Federated Machine Learning, Privacy-Enhancing Technologies, and Data Protection Laws in Medical Research: Scoping Review." Researchers who design mobile health (mHealth) …

A Training-free Method for LLM Text Attribution

2025 · arXiv (Cornell University)

Verifying the provenance of content is crucial to the functioning of many organizations, e.g., educational institutions, social media platforms, and firms. This problem is becoming increasingly challenging as text generated by Large Language Models (LLMs) …