Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
75 views

Unable to understand Figure 3.13 Artificial Intelligence: a Modern Approach

I'm currently studying the functionality of BFS and the AIMA book shows . I am unable to replicate them using some trivial calculations. For example, if the BFS generates $10^6$ nodes per second and I ...
GABRIEL ÁNGEL CANALS SALLERAS's user avatar
2 votes
0 answers
193 views

How would we get a good estimation of the asymptotic performance of machine learning algorithms?

The following question is from the webbook Neural Networks and Deep Learning by Michael Nielson: How do our machine learning algorithms perform in the limit of very large data sets? For any given ...
FoundABetterName's user avatar
1 vote
1 answer
11k views

What is the computational complexity of the forward pass of a convolutional neural network?

How do I determine the computational complexity (big-O notation) of the forward pass of a convolutional neural network? Let's assume for simplicity that we use zero-padding such that the input size ...
mftgk's user avatar
  • 19
3 votes
2 answers
6k views

Why is the space-complexity of greedy best-first search is $\mathcal{O}(b^m)$?

I am reading through Artificial Intelligence: Modern Approach and it states that the space complexity of the GBFS (tree version) is $\mathcal{O}(b^m)$. While I am reading, at some points, I found ...
iRestMyCaseYourHonor's user avatar