search for: deoptim

Dear R users, During the the running of DEoptim function which belongs to "DEoptim" package it automatically gives the output like the following: Iteration: 1 bestvalit: 181.379847 bestmemit: 0.226499 1.395852 Iteration: 2 bestvalit: 14.062649 bestmemit: 2.290357 5.597838 Iteration: 3 bestvalit: 14.062649 bestmemit: 2.2...

Function DEoptim in package DEoptim for differential evolution defines an optional parameter fnMap: fnMap "an optional function that will be run after each population is created, but before the population is passed to the objective function. This allows the user to impose integer/cardinality constriants.&quo...

Dear All, We are happy to announce the release of the new version of DEoptim (version 2.0-0) which is now available from CRAN. The DEoptim package [3] performs Differential Evolution (DE) minimization, a genetic algorithm-based optimization technique [2,3]. This allows robust minimization over a continuous (bounded or not) domain. The new DEoptim function calls a C imp...

Dear All, We are happy to announce the release of the new version of DEoptim (version 2.0-0) which is now available from CRAN. The DEoptim package [3] performs Differential Evolution (DE) minimization, a genetic algorithm-based optimization technique [2,3]. This allows robust minimization over a continuous (bounded or not) domain. The new DEoptim function calls a C imp...

Dear R Community, I am trying to optimize a water quality model that I am using. Based on conversations with others more familiar with what I am doing I plan to implement DEOptim to do this. The water quality model is interfaced through a GUI. I have the input file necessary to alter parameters and run the model as a text file. To do the optimization I have figured out the general procedure but I need some help on the specific methods and commands that may be helpful....

...r() { call @foo() [ "deopt"(XXX) ] } def @baz() { call @bar() [ "deopt"(YYY) ] } ``` Right now according to the semantics of "deopt" operand bundles as in the LangRef, every call site above is readonly. However, it is possible for @baz() to write to memory if @bar is deoptimized at the call site with the call to @foo. You could say that it isn't legal to mark @foo as readonly, since the action of deoptimizing one's caller is not a readonly operation. But that doesn't work in cases like this: ``` global *ptr declare @foo() readwrite def @bar() { call @foo...

I am trying to figure out how parameters are defined in a function that is used by DEOptim. That is, when I set upper and lower bounds for DEOptim how does it know which element of the function to apply those bounds to? For example, in DEOptim call below, when DEOptim goes into "optimfxn" how does it know what element of "optimfxn" to apply the upper and lower bounds...

(the same mail was sent to the author) When I called the function DEoptim with control=list(strategy=1) or control=list(strategy=2) I got the error: Error in mui[rtd + 1, i] : incorrect number of dimensions Analysis of the source code of the DEoptim reveals the following fragment if (con$strategy > 5) st <- con$strategy - 5 ## binomial crossover e...

Hi R-Core, i am using nnet and DEoptim, Xcc=matrix(rnorm(100,0.5,0.08),50,2) Ycr=matrix(rnorm(50,0.2,0.05),50,1) pred_regm1 <- function(A) { A1=A[1] A2=A[2] A3=A[3] regm1 <- nnet(Xcc,Ycr,entropy=T,size=A1,decay=A2,maxit=2000,trace=F,Hess=T,rang=A3,skip=T) dif=sum((predict(regm1,Xcc)-Ycr)^2) return(dif) } somar=DEop...

...nly further convinces me > that Michael's proposed intrinsics are the best way to go. I'm still not convinced, but am not going to actively oppose it either. I'm leery of designing a solution with major assumptions we don't have data to backup. I worry your assumptions about deoptimization are potentially unsound. But I don't have data to actually show this (yet). > > On April 29, 2014 at 10:09:49 AM, Philip Reames > (listmail at philipreames.com <mailto:listmail at philipreames.com>) wrote: > >> As the discussion has progressed and I've spe...

...#39;s proposed intrinsics are the best way to go. >> I'm still not convinced, but am not going to actively oppose it >> either. I'm leery of designing a solution with major assumptions we >> don't have data to backup. >> >> I worry your assumptions about deoptimization are potentially >> unsound. But I don't have data to actually show this (yet). > > I *think* I may have been unclear about my assumptions; in particular, > my claims with respect to deoptimization are probably more subtle than > they appeared. WebKit can use LLVM a...

...ive up using it. Here is an alternative approach to representation of guards that resolves some of fundamental flaws that the current guards have. Basically, this intrinsic was introduced to model the following situation: we want to check that some condition is true, and if it's not, we should deoptimize at this point and quit execution of the compiled code. According to http://llvm.org/docs/LangRef.html#llvm-experimental-guard-intrinsic, the guard looks like this: define void @llvm.experimental.guard(i1 %pred, <args...>) { %realPred = and i1 %pred, undef br i1 %realPred, label %conti...

...ay to go. >>>> I'm still not convinced, but am not going to actively oppose it >>>> either. I'm leery of designing a solution with major assumptions >>>> we don't have data to backup. >>>> >>>> I worry your assumptions about deoptimization are potentially >>>> unsound. But I don't have data to actually show this (yet). >>> >>> I *think* I may have been unclear about my assumptions; in >>> particular, my claims with respect to deoptimization are probably >>> more subtle tha...

...gt; Michael's proposed intrinsics are the best way to go.  >  > I'm still not convinced, but am not going to actively oppose it either. I'm  > leery of designing a solution with major assumptions we don't have data to  > backup.  >  > I worry your assumptions about deoptimization are potentially unsound. But  > I don't have data to actually show this (yet).  >  > I *think* I may have been unclear about my assumptions; in particular, my  > claims with respect to deoptimization are probably more subtle than they  > appeared. WebKit can use LLVM and i...

...o you think it would be a good change to push upstream given we might not be able to do it in all cases (say, always fall back to rsp-based if the frame is aligned)? >>> Can I ask what you're using the deopt information for? Do you have a >>> language runtime which supports deoptimization? Or are you using it >>> for something different? If so, what? I'm curious to know how others >>> are using the infrastructure. >> >> Sure. >> I am working on LLV8, which is an attempt to use LLVM MCJIT as a >> backend >> for Google V8. S...

...at apple.com> wrote: > This clearly doesn't need operand bundles, but using an intrinsic > would permit special code motion semantics. It could be hoisted and > merged with other traps, but the condition could never be widened > beyond the union of the original conditions. Unlike deoptimizing > guards, it would need to be sequenced with memory barriers, but could By memory barrier, do you mean things like fences? > otherwise be hoisted as readnone. Can you clarify this a little bit? Are you talking about things like: *ptr = 42 @trap_if(%foo) => @trap_if(%foo)...

...d it be hard to make the statepoint intrinsic produce frame pointer based offset (instead of sp-based) if "no-frame-pointer-elim"="true" attribute is specified? > Can I ask what you're using the deopt information for? Do you have a > language runtime which supports deoptimization? Or are you using it > for something different? If so, what? I'm curious to know how others > are using the infrastructure. Sure. I am working on LLV8, which is an attempt to use LLVM MCJIT as a backend for Google V8. So yes, we have a language runtime which supports deoptimi...

...re is an alternative approach to representation of guards that resolves some of fundamental flaws that the current guards have. > > > > Basically, this intrinsic was introduced to model the following situation: we want to check that some condition is true, and if it's not, we should deoptimize at this point and quit execution of the compiled code. According to http://llvm.org/docs/LangRef.html#llvm-experimental-guard-intrinsic, the guard looks like this: > > > > define void @llvm.experimental.guard(i1 %pred, <args...>) { > > %realPred = and i1 %pred, undef &g...

...opose a scheme to attach "operand bundles" to call and invoke instructions. This is based on the offline discussion mentioned in http://lists.cs.uiuc.edu/pipermail/llvmdev/2015-July/088748.html. # Motivation & Definition Our motivation behind this is to track the state required for deoptimization (described briefly later) through the LLVM pipeline as a first-class IR citizen. We want to do this is a way that is generally useful. An "operand bundle" is a set of SSA values (called "bundle operands") tagged with a string (called the "bundle tag"). One or...

Hi everyone, we started a new open source project Sulong: https://github.com/graalvm/sulong. Sulong is a LLVM IR interpreter with JIT compilation running on top of the JVM. By using the Truffle framework, it implements speculative optimizations such as inlining of function pointer calls through AST rewriting. One area of our research is to provide alternative ways of executing LLVM bitcode that