2014 - ACM Fellow For contributions to machine learning, algorithmic game theory, distributed computing, and communication networks.
1994 - IEEE Fellow For contributions to the understanding of voltage stability in large power system networks.
Yishay Mansour spends much of his time researching Mathematical optimization, Algorithm, Discrete mathematics, Combinatorics and Mathematical economics. His research integrates issues of Function, Partially observable Markov decision process, Game theory and Reinforcement learning in his study of Mathematical optimization. He interconnects Markov decision process, Incremental decision tree, Decision tree learning and Control theory in the investigation of issues within Algorithm.
His studies in Discrete mathematics integrate themes in fields like Stream cipher, Pseudorandom permutation, Substitution-permutation network and Transposition cipher. His work deals with themes such as Computational complexity theory, Upper and lower bounds, Distribution and Constant, which intersect with Combinatorics. The various areas that Yishay Mansour examines in his Mathematical economics study include Common value auction, Bounded function and Approximation algorithm.
His primary areas of investigation include Mathematical optimization, Algorithm, Combinatorics, Discrete mathematics and Regret. His study looks at the relationship between Mathematical optimization and topics such as Competitive analysis, which overlap with Scheduling. Yishay Mansour usually deals with Algorithm and limits it to topics linked to Network packet and Distributed computing.
Combinatorics is closely attributed to Upper and lower bounds in his research. His Discrete mathematics research incorporates elements of Function and Computation. His Regret study frequently links to adjacent areas such as Sequence.
Regret, Mathematical optimization, Combinatorics, Upper and lower bounds and Reinforcement learning are his primary areas of study. His study in Regret is interdisciplinary in nature, drawing from both Adversarial system, Discrete mathematics, Shortest path problem, Markov decision process and Bounded function. His Discrete mathematics research incorporates themes from Function and Rational agent.
Specifically, his work in Mathematical optimization is concerned with the study of Online algorithm. As part of one scientific family, Yishay Mansour deals mainly with the area of Combinatorics, narrowing it down to issues related to the Sequence, and often Random variable and Thompson sampling. His research in Reinforcement learning intersects with topics in Travelling salesman problem and State.
Yishay Mansour focuses on Regret, Mathematical optimization, Discrete mathematics, Convex optimization and Upper and lower bounds. His Regret research includes themes of Contrast, Quadratic equation, Shortest path problem, Linear quadratic and Function. Within one scientific family, he focuses on topics pertaining to State space under Function, and may sometimes address concerns connected to Online algorithm and Regularization.
By researching both Mathematical optimization and Mean squared prediction error, Yishay Mansour produces research that crosses academic boundaries. He combines subjects such as Leader election, Rational agent, Asynchronous communication, Node and Tree with his study of Discrete mathematics. His Upper and lower bounds research integrates issues from Sampling scheme, Order, Combinatorics and Gibbs sampling.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Policy Gradient Methods for Reinforcement Learning with Function Approximation
Richard S Sutton;David A. McAllester;Satinder P. Singh;Yishay Mansour.
neural information processing systems (1999)
Learning decision trees using the Fourier spectrum
Eyal Kushilevitz;Yishay Mansour.
SIAM Journal on Computing (1993)
Constant depth circuits, Fourier transform, and learnability
Nathan Linial;Yishay Mansour;Noam Nisan.
Journal of the ACM (1993)
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
Michael Kearns;Yishay Mansour;Andrew Y. Ng.
Machine Learning (2002)
The shrinking generator
Don Coppersmith;Hugo Krawczyk;Yishay Mansour.
international cryptology conference (1994)
Domain adaptation: Learning bounds and algorithms
Yishay Mansour;Mehryar Mohri;Afshin Rostamizadeh.
conference on learning theory (2009)
Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems
Eyal Even-Dar;Shie Mannor;Yishay Mansour.
Journal of Machine Learning Research (2006)
On the Boosting Ability of Top-Down Decision Tree Learning Algorithms
Michael Kearns;Yishay Mansour.
Journal of Computer and System Sciences (1999)
Domain Adaptation with Multiple Sources
Yishay Mansour;Mehryar Mohri;Afshin Rostamizadeh.
neural information processing systems (2008)
A construction of a cipher from a single pseudorandom permutation
Shimon Even;Yishay Mansour.
Journal of Cryptology (1997)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Tel Aviv University
Toyota Technological Institute at Chicago
University of Pennsylvania
Tel Aviv University
New Jersey Institute of Technology
University of Milan
Technion – Israel Institute of Technology
Hebrew University of Jerusalem
Technion – Israel Institute of Technology
Carnegie Mellon University
Université Catholique de Louvain
Indiana University
Cornell University
University of Oklahoma
Nanchang University
University of Montpellier
University of Utah
Yale University
Noble Research Institute
Physical Research Laboratory
Vrije Universiteit Amsterdam
Forschungszentrum Jülich
New York University
University of Cincinnati
University of Cape Town
University of Leeds