# EPSGO

0th

Percentile

##### Fits SVM mit variable selection using penalties.

Fits SVM with feature selection using penalties SCAD and 1 norm.

Keywords
multivariate, models, graphs, iteration , optimize
##### Usage
EPSGO(Q.func, bounds,	parms.coding="none", fminlower=0, flag.find.one.min =FALSE,
show=c("none", "final", "all"), N= NULL, maxevals = 500,
pdf.name=NULL,  pdf.width=12,  pdf.height=12,   my.mfrow=c(1,1),
verbose=TRUE, seed=123,  ...  )
##### Arguments
Q.func

name of the function to be minimized.

bounds

bounds for parameters, see examples

parms.coding

parmeters coding: none or log2, default: none.

fminlower

minimal value for the function Q.func, default is 0.

flag.find.one.min

do you want to find one min value and stop? Default: FALSE

show

show plots of DIRECT algorithm: none, final iteration, all iterations. Default: none

N

define the number of start points, see details.

maxevals

the maximum number of DIRECT function evaluations, default: 500.

pdf.name

pdf name

pdf.width

default 12

pdf.height

default 12

my.mfrow

default c(1,1)

verbose

verbose? default TRUE.

seed

seed

##### Details

if the number of start points (N) is not defined by the user, it will be defined dependent on the dimensionality of the parameter space. N=10D+1, where D is the number of parameters, but for high dimensional parameter space with more than 6 dimensions, the initial set is restricted to 65. However for one-dimensional parameter space the N is set to 21 due to stability reasons.

The idea of EPSGO (Efficient Parameter Selection via Global Optimization): Beginning from an intial Latin hypercube sampling containing N starting points we train an Online GP, look for the point with the maximal expected improvement, sample there and update the Gaussian Process(GP). Thereby it is not so important that GP really correctly models the error surface of the SVM in parameter space, but that it can give a us information about potentially interesting points in parameter space where we should sample next. We continue with sampling points until some convergence criterion is met.

DIRECT is a sampling algorithm which requires no knowledge of the objective function gradient. Instead, the algorithm samples points in the domain, and uses the information it has obtained to decide where to search next. The DIRECT algorithm will globally converge to the maximal value of the objective function. The name DIRECT comes from the shortening of the phrase 'DIviding RECTangles', which describes the way the algorithm moves towards the optimum.

The code source was adopted from MATLAB originals, special thanks to Holger Froehlich.

##### Value

fmin

minimal value of Q.func on the interval defined by bounds.

xmin

coreesponding parameters for the minimum

iter

number of iterations

neval

number of visited points

maxevals

the maximum number of DIRECT function evaluations

seed

seed

bounds

bounds for parameters

Q.func

name of the function to be minimized.

points.fmin

the set of points with the same fmin

Xtrain

visited points

Ytrain

the output of Q.func at visited points Xtrain

gp.seed

seed for Gaussian Process

model.list

detailed information of the search process

##### References

Froehlich, H. and Zell, A. (2005) "Effcient parameter selection for support vector machines in classification and regression via model-based global optimization" In Proc. Int. Joint Conf. Neural Networks, 1431-1438 .

svmfs

##### Aliases
• EPSGO
• Direct
• ExpImprovement
##### Examples
# NOT RUN {

# }
# NOT RUN {
seed <- 123

train<-sim.data(n = 200, ng = 100, nsg = 10, corr=FALSE, seed=seed )
print(str(train))

bounds=t(data.frame(log2lambda1=c(-10, 10)))
colnames(bounds)<-c("lower", "upper")

print("start interval search")
# computation intensive;
# for demostration reasons only for the first 100 features
# and only for 10 iterations maxIter=10, default maxIter=700
system.time(fit<-EPSGO(Q.func, bounds=bounds, parms.coding="log2", fminlower=0,
show='none', N=21,  maxevals=500,
pdf.name=NULL,  seed=seed,
verbose=FALSE,
# Q.func specific parameters:
x.svm=t(train$x)[,1:100], y.svm=train$y,
inner.val.method="cv",
cross.inner=5, maxIter=10 ))

print(paste("minimal 5-fold cv error:", fit$fmin, "by log2(lambda1)=", fit$xmin))

print(" all lambdas with the same minimum? ")
print(fit$points.fmin) print(paste(fit$neval, "visited points"))

print(" overview: over all visitied points in tuning parameter space
with corresponding cv errors")
print(data.frame(Xtrain=fit$Xtrain, cv.error=fit$Ytrain))

# create  3 plots om one screen:
# 1st plot: distribution of initial points in tuning parameter space
# 2nd plot: visited lambda points vs. cv errors
# 3rd plot: the same as the 2nd plot, Ytrain.exclude points are excluded.
#    The value cv.error = 10^16 stays for the cv error for an empty model !
.plot.EPSGO.parms (fit$Xtrain, fit$Ytrain,bound=bounds,
Ytrain.exclude=10^16, plot.name=NULL )

# }
# NOT RUN {
# end of \donttest

# }

Documentation reproduced from package penalizedSVM, version 1.1.2, License: GPL (>= 2)

### Community examples

Looks like there are no examples yet.