Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Efficient learning of smooth probability functions from Bernoulli tests with guarantees.
 
conference paper

Efficient learning of smooth probability functions from Bernoulli tests with guarantees.

Rolland, Paul Thierry Yves  
•
Kavis, Ali  
•
Immer, Alex
Show more
2019
Proceedings of the International Conference on Machine Learning - ICML 2019
36th International Conference on Machine Learning (ICML 2019)

We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this problem with rigorous guarantees. In particular, we prove the convergence rate of our posterior update rule to the true probability function in L2-norm. Moreover, we allow the Bernoulli tests to depend on contextual features, and provide a modified inference engine with provable guarantees for this novel setting. Numerical results show that the empirical convergence rates match the theory, and illustrate the superiority of our approach in handling contextual features over the state-of-the-art.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Main paper.pdf

Type

Publisher's Version

Version

Published version

Access type

openaccess

Size

766.54 KB

Format

Adobe PDF

Checksum (MD5)

2c21ba26a52168a165570a4fb28deff8

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés