Fan-out entropy heuristics for MAD

[s104...@stud.sbg.ac.at]

Hello,

in the papers from 2008 and 2009, entropy heuristics for determining random walk probabilities is presented. I have several questions concerning Junto:

• Why are the heuristics implemented for Scala, but not for the Java?
• Can we apply the same heuristics to MAD?
• If a µ grid search for MAD would be too expensive, wouldn't it be better to use Adsorption in combination with heuristics to calculate rw probabilities?

Best regards
Stefan

[Partha Talukdar]

On Tue, Oct 17, 2017 at 9:02 PM, <s104...@stud.sbg.ac.at> wrote:

• Why are the heuristics implemented for Scala, but not for the Java?

• Can we apply the same heuristics to MAD?

Which Java implementation are you referring to? Junto is primarily scala-based now. Previous java implementations implemented the same heuristics. 

• If a µ grid search for MAD would be too expensive, wouldn't it be better to use Adsorption in combination with heuristics to calculate rw probabilities?

Expensive depends on how large your dev data is etc. Since you are in the SSL setting, I am assuming you the dev will not be too big. In general, we have found the methods to not be so sensitive to hyperparameters, so the search need not be very fine grained.

Partha