Filter your results
- 4
- 3
- 4
- 2
- 1
- 4
- 4
- 2
- 1
- 1
- 3
- 7
- 7
- 2
- 2
- 7
- 6
- 3
- 2
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Contribution à des problèmes statistiques d'ordonnancement et d'apprentissage par renforcement avec aversion au risqueMachine Learning [stat.ML]. Institut Polytechnique de Paris, 2020. English. ⟨NNT : 2020IPPAT020⟩
Theses
tel-03043749v1
|
||
Dimensionality Reduction and (Bucket) Ranking: a Mass Transportation Approach.Algorithmic Learning Theory, Mar 2019, Chicago, United States
Conference papers
hal-02288552v1
|
|||
Continuous Ranking trough Oriented Recursive PartitionsNIPS, Dec 2017, Longbeach, United States
Conference papers
hal-02287581v1
|
|||
|
Profitable BanditsProceedings of Machine Learning Research, 2018, 95, pp.694-709
Journal articles
hal-02023057v1
|
||
|
Weighted Empirical Risk Minimization: Transfer Learning based on Importance Sampling28th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning ( ESANN 2020), 2020, Bruges (on line), Belgium
Conference papers
hal-03559387v1
|
||
Max K-Armed Bandit: On the ExtremeHunter Algorithm and BeyondMachine Learning and Knowledge Discovery in Databases ECML PKDD 2017, 2017, pp.389-404
Journal articles
hal-02023085v1
|
|||
Max K-armed Bandits: On EstremeHunter and an Alternative ApproachECML, Sep 2017, Skopje, Macedonia
Conference papers
hal-02287481v1
|