Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Learning linear structural equation models in polynomial time and sample complexity
by
Ghoshal, Asish
, Honorio, Jean
in
Algorithms
/ Complexity
/ Computational efficiency
/ Computing time
/ Learning
/ Mathematical models
/ Noise
/ Polynomials
/ Population (statistical)
/ Random noise
/ Statistical analysis
/ Statistical inference
2017
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?
Learning linear structural equation models in polynomial time and sample complexity
by
Ghoshal, Asish
, Honorio, Jean
in
Algorithms
/ Complexity
/ Computational efficiency
/ Computing time
/ Learning
/ Mathematical models
/ Noise
/ Polynomials
/ Population (statistical)
/ Random noise
/ Statistical analysis
/ Statistical inference
2017
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 linear structural equation models in polynomial time and sample complexity
by
Ghoshal, Asish
, Honorio, Jean
in
Algorithms
/ Complexity
/ Computational efficiency
/ Computing time
/ Learning
/ Mathematical models
/ Noise
/ Polynomials
/ Population (statistical)
/ Random noise
/ Statistical analysis
/ Statistical inference
2017
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.
Learning linear structural equation models in polynomial time and sample complexity
Paper
Learning linear structural equation models in polynomial time and sample complexity
2017
Request Book From Autostore
and Choose the Collection Method
Overview
The problem of learning structural equation models (SEMs) from data is a fundamental problem in causal inference. We develop a new algorithm --- which is computationally and statistically efficient and works in the high-dimensional regime --- for learning linear SEMs from purely observational data with arbitrary noise distribution. We consider three aspects of the problem: identifiability, computational efficiency, and statistical efficiency. We show that when data is generated from a linear SEM over \\(p\\) nodes and maximum degree \\(d\\), our algorithm recovers the directed acyclic graph (DAG) structure of the SEM under an identifiability condition that is more general than those considered in the literature, and without faithfulness assumptions. In the population setting, our algorithm recovers the DAG structure in \\(\\mathcal{O}(p(d^2 + \\log p))\\) operations. In the finite sample setting, if the estimated precision matrix is sparse, our algorithm has a smoothed complexity of \\(\\widetilde{\\mathcal{O}}(p^3 + pd^7)\\), while if the estimated precision matrix is dense, our algorithm has a smoothed complexity of \\(\\widetilde{\\mathcal{O}}(p^5)\\). For sub-Gaussian noise, we show that our algorithm has a sample complexity of \\(\\mathcal{O}(\\frac{d^8}{\\varepsilon^2} \\log (\\frac{p}{\\sqrt{\\delta}}))\\) to achieve \\(\\varepsilon\\) element-wise additive error with respect to the true autoregression matrix with probability at most \\(1 - \\delta\\), while for noise with bounded \\((4m)\\)-th moment, with \\(m\\) being a positive integer, our algorithm has a sample complexity of \\(\\mathcal{O}(\\frac{d^8}{\\varepsilon^2} (\\frac{p^2}{\\delta})^{1/m})\\).
Publisher
Cornell University Library, arXiv.org
This website uses cookies to ensure you get the best experience on our website.