Παρακολούθηση
Yishay Mansour
Yishay Mansour
Tel Aviv University
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα tauex.tau.ac.il - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Policy Gradient Methods for Reinforcement Learning with Function Approximation.
RS Sutton, DA McAllester, S Singh, Y Mansour
NIPS, 1999
56821999
Constant depth circuits, Fourier transform, and learnability
N Linial, Y Mansour, N Nisan
Journal of the ACM (JACM) 40 (3), 607-620, 1993
8101993
A sparse sampling algorithm for near-optimal planning in large Markov decision processes
M Kearns, Y Mansour, AY Ng
Machine learning 49 (2), 193-208, 2002
7172002
Domain adaptation: Learning bounds and algorithms
Y Mansour, M Mohri, A Rostamizadeh
arXiv preprint arXiv:0902.3430, 2009
6022009
Learning decision trees using the Fourier spectrum
E Kushilevitz, Y Mansour
SIAM Journal on Computing 22 (6), 1331-1348, 1993
5571993
Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems.
E Even-Dar, S Mannor, Y Mansour, S Mahadevan
Journal of machine learning research 7 (6), 2006
5512006
The shrinking generator
D Coppersmith, H Krawczyk, Y Mansour
Annual International Cryptology Conference, 22-39, 1993
5421993
Learning Rates for Q-learning.
E Even-Dar, Y Mansour, P Bartlett
Journal of machine learning Research 5 (1), 2003
4962003
Domain adaptation with multiple sources
Y Mansour, M Mohri, A Rostamizadeh
Advances in neural information processing systems 21, 2008
4672008
PAC bounds for multi-armed bandit and Markov decision processes
E Even-Dar, S Mannor, Y Mansour
International Conference on Computational Learning Theory, 255-270, 2002
4222002
A construction of a cipher from a single pseudorandom permutation
S Even, Y Mansour
Journal of cryptology 10 (3), 151-161, 1997
409*1997
Nash Convergence of Gradient Dynamics in General-Sum Games.
S Singh, MJ Kearns, Y Mansour
UAI, 541-548, 2000
3522000
An Ω(D\log(N/D)) lower bound for broadcast in radio networks
E Kushilevitz, Y Mansour
SIAM journal on Computing 27 (3), 702-712, 1998
337*1998
On the learnability of discrete distributions
M Kearns, Y Mansour, D Ron, R Rubinfeld, RE Schapire, L Sellie
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
3211994
On the boosting ability of top–down decision tree learning algorithms
M Kearns, Y Mansour
Journal of Computer and System Sciences 58 (1), 109-128, 1999
3091999
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
A Blum, M Furst, J Jackson, M Kearns, Y Mansour, S Rudich
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
3001994
Agnostically learning halfspaces
AT Kalai, AR Klivans, Y Mansour, RA Servedio
SIAM Journal on Computing 37 (6), 1777-1805, 2008
2992008
Learning bounds for importance weighting
C Cortes, Y Mansour, M Mohri
Advances in neural information processing systems 23, 2010
2982010
An experimental and theoretical comparison of model selection methods
M Kearns, Y Mansour, AY Ng, D Ron
Machine Learning 27 (1), 7-50, 1997
2741997
An information-theoretic analysis of hard and soft assignment methods for clustering
M Kearns, Y Mansour, AY Ng
Learning in graphical models, 495-520, 1998
2731998
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20