492 citations · 1.7k across the 126 of their papers we have counts for
137 papers
Beyond Binary: Continuous State Optimization with Graph-Structured Objectives
Corinna Cortes, Yishay Mansour, Mehryar Mohri
Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives, such as fairness, accuracy, and latency. While recent work has formal…
Swap Regret and Correlated Equilibria Beyond Normal-Form Games
Eshwar Ram Arunachaleswaran, Natalie Collina, Yishay Mansour +3
Swap regret is a notion that has proven itself to be central to the study of general-sum normal-form games, with swap-regret minimization leading to convergence to the set of corre…
Rate-Preserving Reductions for Blackwell Approachability
Christoph Dann, Yishay Mansour, Mehryar Mohri +2
Abernethy et al. (2011) showed that Blackwell approachability and no-regret learning are equivalent, in the sense that any algorithm that solves a specific Blackwell approachabilit…
Faster Convergence with Multiway Preferences
Aadirupa Saha, Vitaly Feldman, Tomer Koren +1
We address the problem of convex optimization with preference feedback, where the goal is to minimize a convex function given a weaker form of comparison queries. Each query consis…
Rate-Optimal Policy Optimization for Linear Markov Decision Processes
Uri Sherman, Alon Cohen, Tomer Koren +1
We study regret minimization in online episodic linear Markov Decision Processes, and obtain rate-optimal regret where denotes the number of episodes.…
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
Nataly Brukhim, Amit Daniely, Yishay Mansour +1
We study a generalization of boosting to the multiclass setting. We introduce a weak learning condition for multiclass classification that captures the original notion of weak lear…