PPaperPicks

Yishay Mansour

Tel Aviv University, School of Computer Science, Israel

27 papers at tracked venues · 16 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. Learning Conditional Averages
  2. Learning from Equivalence Queries, Revisited
  3. The Hidden Cost of Approximation in Online Mirror Descent
  4. The Sample Complexity of Multiclass and Sparse Contextual Bandits
  5. A Fine-grained Characterization of PAC Learnability
  6. Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
  7. Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
  8. Delay as Payoff in MAB
  9. Dueling Convex Optimization with General Preferences
  10. Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
  11. Individual Regret in Cooperative Stochastic Multi-Armed Bandits
  12. Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
  13. Of Dice and Games: A Theory of Generalized Boosting
  14. Principled Model Routing for Unknown Mixtures of Source Domains
  15. Probably Approximately Precision and Recall Learning
  16. Rate-Preserving Reductions for Blackwell Approachability
  17. Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
  18. A Theory of Interpretable Approximations
  19. Eluder-based Regret for Stochastic Contextual MDPs
  20. Fast Rates for Bandit PAC Multiclass Classification
  21. Faster Convergence with MultiWay Preferences
  22. How to Boost Any Loss Function
  23. Learnability Gaps of Strategic Classification
  24. Learning-Augmented Algorithms with Explicit Predictors
  25. Principal-Agent Reward Shaping in MDPs
  26. Rate-Optimal Policy Optimization for Linear Markov Decision Processes
  27. The Real Price of Bandit Information in Multiclass Classification