Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Learning Continuous Exponential Families Beyond Gaussian
by
Lokhov, Andrey Y
, Vuffray, Marc
, Ren, Christopher X
, Misra, Sidhant
in
Algorithms
/ Covariance
/ Machine learning
2022
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Learning Continuous Exponential Families Beyond Gaussian
by
Lokhov, Andrey Y
, Vuffray, Marc
, Ren, Christopher X
, Misra, Sidhant
in
Algorithms
/ Covariance
/ Machine learning
2022
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Learning Continuous Exponential Families Beyond Gaussian
2022
Request Book From Autostore
and Choose the Collection Method
Overview
We address the problem of learning of continuous exponential family distributions with unbounded support. While a lot of progress has been made on learning of Gaussian graphical models, we still lack scalable algorithms for reconstructing general continuous exponential families modeling higher-order moments of the data beyond the mean and the covariance. Here, we introduce a computationally efficient method for learning continuous graphical models based on the Interaction Screening approach. Through a series of numerical experiments, we show that our estimator maintains similar requirements in terms of accuracy and sample complexity scalings compared to alternative approaches such as maximization of conditional likelihood, while considerably improving upon the algorithm's run-time.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.