question-mark
Stuck on an issue?

Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.

And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.

Is it a problem when two edges of this node have the same j?

See original GitHub issue

https://github.com/D-X-Y/AutoDL-Projects/blob/befa6bcb00e0a8fcfba447d2a1348202759f58c9/lib/models/cell_infers/cells.py#L94

If I understand it correctly, in this snippet, when all the in_node in node point from the same node j, they will share the same node_str. When forward it will repeat the same operation and sum the results. It can be a problem.

      for in_node in node:
        name, j = in_node[0], in_node[1]
        node_str = '{:}<-{:}'.format(i+2, j)
        op = self.edges[ node_str ]
        clist.append( op(states[j]) )

Issue Analytics

  • State:closed
  • Created 3 years ago
  • Comments:6 (4 by maintainers)

github_iconTop GitHub Comments

2reactions
D-X-Ycommented, Oct 22, 2020

That is a very good point, and I agree with that. The genotype function follows the original DARTS implementation. I will add a NOTE at here to clarify the mismatch between search and re-train.

1reaction
D-X-Ycommented, Mar 17, 2021

@pomonam I feel it is case-by-case and should be determined by yourself. Both are fine and can be supported by some reasons.

Read more comments on GitHub >

github_iconTop Results From Across the Web

Edge between two edges (or node and edge), edges ... - GitHub
I`m working on project (https://github.com/Konard/LinksPlatform) that uses associative model of data. For example this platform (as ...
Read more >
6.1 definition of terms and notation
An edge is incident on the two nodes it connects. Any two nodes connected by an edge or any two edges connected by...
Read more >
Graphs - cs.wisc.edu
Graphs are a generalization of trees. Like trees, graphs have nodes and edges. (The nodes are sometimes called vertices, and the edges are...
Read more >
Chapter 3 - Graphs
(ii) An edge of G joins two nodes of the same layer, and G contains an odd-length cycle (and hence is not bipartite)....
Read more >
1 Notation - CMU School of Computer Science
We also allow E to be a multiset of edges: the graph can have multiple edges connecting the same two nodes. These are...
Read more >

github_iconTop Related Medium Post

No results found

github_iconTop Related StackOverflow Question

No results found

github_iconTroubleshoot Live Code

Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free

github_iconTop Related Reddit Thread

No results found

github_iconTop Related Hackernoon Post

No results found

github_iconTop Related Tweet

No results found

github_iconTop Related Dev.to Post

No results found

github_iconTop Related Hashnode Post

No results found