public class SparseAdaGradMinimizer<K,F extends SparseOnlineFunction<K>> extends java.lang.Object implements SparseMinimizer<K,F>
Modifier and Type | Field and Description |
---|---|
protected int |
batchSize |
double |
EPS |
protected double |
eta |
protected double |
lambdaL1 |
protected double |
lambdaL2 |
protected int |
numPasses |
boolean |
quiet |
protected java.util.Random |
randGenerator |
double |
soften |
protected Counter<K> |
sumGradSquare |
protected Counter<K> |
x |
Constructor and Description |
---|
SparseAdaGradMinimizer(int numPasses) |
SparseAdaGradMinimizer(int numPasses,
double eta) |
SparseAdaGradMinimizer(int numPasses,
double eta,
int batchSize,
double lambdaL1,
double lambdaL2) |
Modifier and Type | Method and Description |
---|---|
protected java.lang.String |
getName() |
Counter<K> |
minimize(F function,
Counter<K> initial)
Attempts to find an unconstrained minimum of the objective
function starting at initial , within
functionTolerance . |
Counter<K> |
minimize(F function,
Counter<K> x,
int maxIterations) |
protected void |
sayln(java.lang.String s) |
public boolean quiet
protected int numPasses
protected int batchSize
protected double eta
protected double lambdaL1
protected double lambdaL2
protected java.util.Random randGenerator
public final double EPS
public final double soften
public SparseAdaGradMinimizer(int numPasses)
public SparseAdaGradMinimizer(int numPasses, double eta)
public SparseAdaGradMinimizer(int numPasses, double eta, int batchSize, double lambdaL1, double lambdaL2)
public Counter<K> minimize(F function, Counter<K> initial)
SparseMinimizer
function
starting at initial
, within
functionTolerance
.minimize
in interface SparseMinimizer<K,F extends SparseOnlineFunction<K>>
function
- the objective functioninitial
- a initial feasible pointpublic Counter<K> minimize(F function, Counter<K> x, int maxIterations)
minimize
in interface SparseMinimizer<K,F extends SparseOnlineFunction<K>>
protected java.lang.String getName()
protected void sayln(java.lang.String s)