• Aucun résultat trouvé

personal information

N/A
N/A
Protected

Academic year: 2022

Partager "personal information"

Copied!
3
0
0

Texte intégral

(1)

P E G A H A L I Z A D E H

personal information

Ahvaz, Iran. 21 September 1983

email

pegah.alizadeh@lipn.univ-paris13.fr

website

https://pegahalizadeh.wordpress.com/about/

address

11 rue F´enelon, 75010 Paris

phone

(+ 33 ) 0678277542

research interests

ReinforcementLearning, MarkovDecisionProcesses, Preference Machine Learning

Learning, InverseReinforcementLearning

QualitativeDecisionMaking, Elicitation, RecommenderSystems, Decision Theory

PreferenceElicitation

LinearProgramming, IntegerLinearProgramming Optimization

work experience

2015–2016

Institute Galil´ee, University of Paris 13

ATER (Temporal

contract of research

and teaching) Databases (Oracle), ´El´ement Informatique (C), Advanced Databases (Oracle), Introduction to Graphic Interfaces (C), Programmation imp´erative (C), System Administration (Marionnet), Unix

2013 2015

IUT of Paris 13 University

Human Machine Interface(Java), Databases(Postgresql), Algorithms and Data Teacher Assistant

Structures, Introcution to C++ Programming

Feb-May2012

Free University of Bolzano.Bozen, Italy

Main activities and responsibilities: Data Analysis, Software Engineering, ISO.

Research

Internship Supervisor: Assoc. Prof. Alberto Sillitti

2010 2011

Azad University, Karaj, Iran

List of taught courses: Precalculus, Calculus I, Calculus II, Discrete Teacher

Mathematics

2009 2010

Payam Nour University, Karaj, Iran

List of taught courses: Ordinary Differential Equations, Math for Statistics, Teacher

Linear Algebra

Apr-Oct2009

Soroush Ray Pardazan Company, Karaj, Iran

Responsibilities: Design and develop windows based softwares with C#.net Computer

Programmer and Database design with SQLServer

education

2012–2016

University of Paris 13 - LIPN

Thesis:Elicitation and Planning in Markov Decision Processes with Unknown PHD in Computer

Science

(2)

Rewards.

Advisor: Prof. Yann Chevaleyre

PHD School:

• ´Ecole de Printemps sur l’Apprentissage Artificiel, Carry-le-Rouet (France), June 2014

2006 2008

Imam Khomeini Intentional University

GPA: 16.56/20 · Qazvin, Iran Master of

Mathematics Thesis:Algebraic Characterizations of Measured Algebra Advisor: Assoc. Prof. Azizolah Azizi

2001 2005

Shahid Beheshti University

GPA: 15.55/20 · Tehran, Iran Bachelor of

Mathematics

publications

International

Publications P. Alizadeh, Y. Chevaleyre, and F. L´evy. Solving MDPs with Unknown Rewards Using Nondominated Vector-Valued Functions. In ECAI Symposium Starting Artificial Intelligence Research (STAIRS), The Hague, Netherlands, August 2016

P. Alizadeh, Y. Chevaleyre, and F. L´evy. Advantage Based Value Iteration for Markov Decision Processes with Unknown Rewards. International Joint Conference on Neural Networks (IJCNN), Vancouver, July 2016

P. Alizadeh, Y. Chevaleyre, and J. D. Zucker. Approximate regret based elicitation in Markov Decision Process. International Conference on Computing and Communication Technologies (IEEE-RIVF), Vietnam, January 2015

P. Alizadeh, Y. Chevaleyre, and F. L´evy. It´eration de la Valeur bas´ee sur des Francophone

Publications Avantages pour des MDPs avec r´ecompenses Inconnues. La conf´erence internationale francophone (AAFD-SFC), Marrakech, May 2016.

P. Alizadeh. Solving MDPs with Unknown Rewards Using Nondominated Vector-Valued Functions. In Journ´ees Francophones sur la Planification, la D´ecision et l’Apprentissage pour la conduite de systemes (JFPDA), Grenoble, France, July2016

presentations and posters

Approximate Regret Based Elicitation in Markov Decision Processes. Group Presentations

Seminar (A3). LIPN. University of Paris 13. February 2015

An Introduction to Reinforcement Learning and Preference Learning. Junior Seminar of LIPN. University of Paris 13. December 2014

Policy Computation in ordered reward MDPs using random selected points.

Pre-defense. University of Paris 13. LIPN. June 2014

Eliciting Vectorial Reward Functions for Unknown Rewards in Markov Posters

Decision Process, ´Ecole de Printemps sur l’Apprentissage Artificiel, Carry-le-rouet, France, June 2014

Eliciting Vectorial Reward Functions for Unknown Rewards in Markov Decision Process. journ´ee de l’´ecole doctorale. University of Paris 13. June 2014

computer skills

MachineLearning, Optimization Technical

Python, C, Java, R, Sage Coding

Windows, Linux,mac Operating Systems

2

(3)

Oracle, Postgresql, SQL Server Databases

Numpy, Scipy, IBM CPLEX, LATEX Other

professional activities and external service

Paper Reviews

Thirteen AAAI Conference on Artificial Intelligence 2016 European Conference on Artificial Intelligence (ECAI) 2016

2014–2016

LIPN, University of Paris13

Responsibilities: Organize monthly seminar for Internship and PHD students Seminar

Organizer (Junior Seminars)

references

Yann Chevaleyre

Professor- GroupA3,

LIPN, UMR CNRS 7030, InstitutGalil´ee yann.chevaleyre@lipn.univ-paris13.fr (33)0149402826

Bruno Zanuttini

Assistant professor- GroupMAD GREYC,University ofCaenNormandie bruno.zanuttini@unicaen.fr

(33)0231567484 Henry Soldano

AssistantProfessor- GroupA3

LIPN, UMR CNRS 7030, InstitutGalil´ee henry.soldano@lipn.univ-paris13.fr (33)0149403612

other information

Persian · Mother tongue Languages

English · Advanced French · Intermediate

Photography · Swimming · Cycling · Drawing Interests

December 31, 2016

3

Références

Documents relatifs

[r]

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

There are two reasons for this difference in computation times. With the classical methods, the number of updated states is bigger than the number obtained with the GBMDP

We prove that the number of queries needed before finding an optimal policy is upper- bounded by a polynomial in the size of the problem, and we present experimental results

intention to complete a specific subtask: Having no shared plan, the robot will not be able to know for sure what sub- task the human has chosen, the only information that will help

Since the propagation-search value iteration method has a time consuming and some- times complex pre-processing part on MDPs, in this section we present a new algorithm,

Unknown Area Exploration with an Autonomous Robot using Markov Decision Processes.. Simon Le Gloannec, Laurent Jeanpierre,

If it is the case, we will fail to compare he behaviour of subjects facing different timing of resolution of uncertainty and consequently to test the dynamic consistency and