object GraphAttention extends Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- GraphAttention
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[S](nodeDim: Int, edgeDim: Int, attentionKeyHiddenDimPerHead: Int, attentionNumHeads: Int, valueDimPerHead: Int, dropout: Double, tOpt: STenOptions, dotProductAttention: Boolean, nonLinearity: Boolean)(implicit arg0: Sc[S]): GraphAttention
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- implicit val load: Load[GraphAttention]
- def multiheadGraphAttention[S](nodeFeatures: Variable, edgeFeatures: Variable, edgeI: STen, edgeJ: STen, wNodeKey1: Variable, wNodeKey2: Variable, wEdgeKey: Variable, wNodeValue: Variable, wAttention: Option[Variable], numHeads: Int)(implicit arg0: Sc[S]): Variable
Graph Attention Network https://arxiv.org/pdf/1710.10903.pdf Non-linearity in eq 4 and dropout is not applied to the final vertex activations
Graph Attention Network https://arxiv.org/pdf/1710.10903.pdf Non-linearity in eq 4 and dropout is not applied to the final vertex activations
Needs self edges to be already present in the graph
- returns
next node representation (without relu, dropout) and a tensor with the original node and edge features ligned up like [N_i, N_j, E_ij]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- implicit val tr: TrainingMode[GraphAttention]
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- case object Weights extends LeafTag with Product with Serializable