1,213 research outputs found
Working with OpenCL to Speed Up a Genetic Programming Financial Forecasting Algorithm: Initial Results
The genetic programming tool EDDIE has been shown to be a successful financial forecasting tool, however it has suffered from an increase in execution time as new features have been added. Speed is an important aspect in financial problems, especially in the field of algorithmic trading, where a delay in taking a decision could cost millions. To offset this performance loss, EDDIE has been modified to take advantage of multi-core CPUs and dedicated GPUs. This has been achieved by modifying the candidate solution evaluation to use an OpenCL kernel, allowing the parallel evaluation of solutions. Our computational results have shown improvements in the running time of EDDIE when the evaluation was delegated to the OpenCL kernel running on a multi-core CPU, with speed ups up to 21 times faster than the original EDDIE algorithm. While most previous works in the literature reported significantly improvements in performance when running an OpenCL kernel on a GPU device, we did not observe this in our results. Further investigation revealed that memory copying overheads and branching code in the kernel are potentially causes of the (under-)performance of the OpenCL kernel when running on the GPU device
Fractal dimension of transport coefficients in a deterministic dynamical system
In many low-dimensional dynamical systems transport coefficients are very
irregular, perhaps even fractal functions of control parameters. To analyse
this phenomenon we study a dynamical system defined by a piece-wise linear map
and investigate the dependence of transport coefficients on the slope of the
map. We present analytical arguments, supported by numerical calculations,
showing that both the Minkowski-Bouligand and Hausdorff fractal dimension of
the graphs of these functions is 1 with a logarithmic correction, and find that
the exponent controlling this correction is bounded from above by 1 or
2, depending on some detailed properties of the system. Using numerical
techniques we show local self-similarity of the graphs. The local
self-similarity scaling transformations turn out to depend (irregularly) on the
values of the system control parameters.Comment: 17 pages, 6 figures; ver.2: 18 pages, 7 figures (added section 5.2,
corrected typos, etc.
How Noisy Data Affects Geometric Semantic Genetic Programming
Noise is a consequence of acquiring and pre-processing data from the
environment, and shows fluctuations from different sources---e.g., from
sensors, signal processing technology or even human error. As a machine
learning technique, Genetic Programming (GP) is not immune to this problem,
which the field has frequently addressed. Recently, Geometric Semantic Genetic
Programming (GSGP), a semantic-aware branch of GP, has shown robustness and
high generalization capability. Researchers believe these characteristics may
be associated with a lower sensibility to noisy data. However, there is no
systematic study on this matter. This paper performs a deep analysis of the
GSGP performance over the presence of noise. Using 15 synthetic datasets where
noise can be controlled, we added different ratios of noise to the data and
compared the results obtained with those of a canonical GP. The results show
that, as we increase the percentage of noisy instances, the generalization
performance degradation is more pronounced in GSGP than GP. However, in
general, GSGP is more robust to noise than GP in the presence of up to 10% of
noise, and presents no statistical difference for values higher than that in
the test bed.Comment: 8 pages, In proceedings of Genetic and Evolutionary Computation
Conference (GECCO 2017), Berlin, German
Flexible Probabilistic Modeling for Search Based Test Data Generation
While Search-Based Software Testing (SBST) has improved significantly in the last decade we propose that more flexible, probabilistic models can be leveraged to improve it further. Rather than searching for an individual, or even sets of, test case(s) or datum(s) that fulfil specific needs the goal can be to learn a generative model tuned to output a useful family of values. Such generative models can naturally be decomposed into a structured generator and a probabilistic model that determines how to make non-deterministic choices during generation. While the former constrains the generation process to produce valid values the latter allows learning and tuning to specific goals. SBST techniques differ in their level of integration of the two but, regardless of how close it is, we argue that the flexibility and power of the probabilistic model will be a main determinant of success. In this short paper, we present how some existing SBST techniques can be viewed from this perspective and then propose additional techniques for flexible generative modelling the community should consider. In particular, Probabilistic Programming languages (PPLs) and Genetic Programming (GP) should be investigated since they allow for very flexible probabilistic modelling. Benefits could range from utilising the multiple program executions that SBST techniques typically require to allowing the encoding of high-level test strategies
Evolving text classification rules with genetic programming
We describe a novel method for using genetic programming to create compact classification rules using combinations of N-grams (character strings). Genetic programs acquire fitness by producing rules that are effective classifiers in terms of precision and recall when evaluated against a set of training documents. We describe a set of functions and terminals and provide results from a classification task using the Reuters 21578 dataset. We also suggest that the rules may have a number of other uses beyond classification and provide a basis for text mining applications
Travelling Salesman Problem with a Center
We study a travelling salesman problem where the path is optimized with a
cost function that includes its length as well as a certain measure of
its distance from the geometrical center of the graph. Using simulated
annealing (SA) we show that such a problem has a transition point that
separates two phases differing in the scaling behaviour of and , in
efficiency of SA, and in the shape of minimal paths.Comment: 4 pages, minor changes, accepted in Phys.Rev.
Monolithic InP-Based Grating Spectrometer for Wavelength-Division Multiplexed Systems at 1.5 ÎŒm
A monolithic InP-based grating spectrometer for use in wavelength-division multiplexed systems at 1.5 ÎŒm is reported.
The spectrometer uses a single etched reflective focusing diffraction grating and resolves >50 channels at 1 nm spacing with a ~0.3nm channel width and at least 19dB channel isolation. Operation is essentially of the state of the input polarisation
- âŠ