Top new questions this week:
|
I’m kind of new to computer vision, and wondering whether this is any existing researches / solutions to following scenarios. Suppose I have a dataset, each data point contains a few images (< 20 …
|
Deep learning book chapter 6: In 6.2.1.2 last paragraph: Unfortunately, mean squared error and mean absolute error often lead to poor results when used with gradient-based optimization. Some output …
|
When i read some notes about RL i encounterd following equation and try to prove it: $$ V^{\pi^*}(s) = \max_{a \in A}Q^{\pi^*}(s, a),\forall s \in S $$ Here is my attemption: Firstly, i only need to …
|
Generative AI is being used to create amazing art; first through paid services like Midjourney and now also with free, open source alternatives like Stable Diffusion. Now you can even generate art in …
|
Some possible ways deep learning could be used to improve our understanding of dark matter and dark energy are by using it to study the universe’s large-scale structure or to develop new methods for …
|
Greatest hits from previous weeks:
|
I’ve got an array of integers ranging from -3 to +3. Example: [1, 3, -2, 0, 0, 1] The array has no obvious pattern since it represents bipolar disorder mood swings. What is the most suitable approach …
|
Frameworks like PyTorch and TensorFlow through TensorFlow Fold support Dynamic Computational Graphs and are receiving attention from data scientists. However, there seems to be a lack of resource to …
|
I think that the advantage of using Leaky ReLU instead of ReLU is that in this way we cannot have vanishing gradient. Parametric ReLU has the same advantage with the only difference that the slope of …
|
Local search algorithms are useful for solving pure optimization problems, in which the aim is to find the best state according to an objective function. My question is what is the objective function?
|
It is said that activation functions in neural networks help introduce non-linearity. What does this mean? What does non-linearity mean in this context? How does the introduction of this non-…
|
The iterative deepening A* search is an algorithm that can find the shortest path between a designated start node and any member of a set of goals. The A* algorithm evaluates nodes by combining the …
|
In the blog post Building powerful image classification models using very little data, bottleneck features are mentioned. What are the bottleneck features? Do they change with the architecture that is …
|