207,808 research outputs found
Studying the capacity of cellular encoding to generate feedforward neural network topologies
Proceeding of: IEEE International Joint Conference on Neural Networks, IJCNN 2004, Budapest, 25-29 July 2004Many methods to codify artificial neural networks have been developed to avoid the disadvantages of direct encoding schema, improving the search into the solution's space. A method to analyse how the search space is covered and how are the movements along search process applying genetic operators is needed in order to evaluate the different encoding strategies for multilayer perceptrons (MLP). In this paper, the generative capacity, this is how the search space is covered for a indirect scheme based on cellular systems, is studied. The capacity of the methods to cover the search space (topologies of MLP space) is compared with the direct encoding scheme.Publicad
Grammars and cellular automata for evolving neural networks architectures
IEEE International Conference on Systems, Man, and Cybernetics. Nashville, TN, 8-11 October 2000The class of feedforward neural networks trained with back-propagation admits a large variety of specific architectures applicable to approximation pattern tasks. Unfortunately, the architecture design is still a human expert job. In recent years, the interest to develop automatic methods to determine the architecture of the feedforward neural network has increased, most of them based on the evolutionary computation paradigm. From this approach, some perspectives can be considered: at one extreme, every connection and node of architecture can be specified in the chromosome representation using binary bits. This kind of representation scheme is called the direct encoding scheme. In order to reduce the length of the genotype and the search space, and to make the problem more scalable, indirect encoding schemes have been introduced. An indirect scheme under a constructive algorithm, on the other hand, starts with a minimal architecture and new levels, neurons and connections are added, step by step, via some sets of rules. The rules and/or some initial conditions are codified into a chromosome of a genetic algorithm. In this work, two indirect constructive encoding schemes based on grammars and cellular automata, respectively, are proposed to find the optimal architecture of a feedforward neural network
Regularized Evolutionary Algorithm for Dynamic Neural Topology Search
Designing neural networks for object recognition requires considerable
architecture engineering. As a remedy, neuro-evolutionary network architecture
search, which automatically searches for optimal network architectures using
evolutionary algorithms, has recently become very popular. Although very
effective, evolutionary algorithms rely heavily on having a large population of
individuals (i.e., network architectures) and is therefore memory expensive. In
this work, we propose a Regularized Evolutionary Algorithm with low memory
footprint to evolve a dynamic image classifier. In details, we introduce novel
custom operators that regularize the evolutionary process of a micro-population
of 10 individuals. We conduct experiments on three different digits datasets
(MNIST, USPS, SVHN) and show that our evolutionary method obtains competitive
results with the current state-of-the-art
Privacy in Index Coding: Improved Bounds and Coding Schemes
It was recently observed in [1], that in index coding, learning the coding
matrix used by the server can pose privacy concerns: curious clients can
extract information about the requests and side information of other clients.
One approach to mitigate such concerns is the use of -limited-access schemes
[1], that restrict each client to learn only part of the index coding matrix,
and in particular, at most rows. These schemes transform a linear index
coding matrix of rank to an alternate one, such that each client needs to
learn at most of the coding matrix rows to decode its requested message.
This paper analyzes -limited-access schemes. First, a worst-case scenario,
where the total number of clients is is studied. For this case, a
novel construction of the coding matrix is provided and shown to be
order-optimal in the number of transmissions. Then, the case of a general
is considered and two different schemes are designed and analytically and
numerically assessed in their performance. It is shown that these schemes
perform better than the one designed for the case
Cooperative Precoding with Limited Feedback for MIMO Interference Channels
Multi-antenna precoding effectively mitigates the interference in wireless
networks. However, the resultant performance gains can be significantly
compromised in practice if the precoder design fails to account for the
inaccuracy in the channel state information (CSI) feedback. This paper
addresses this issue by considering finite-rate CSI feedback from receivers to
their interfering transmitters in the two-user multiple-input-multiple-output
(MIMO) interference channel, called cooperative feedback, and proposing a
systematic method for designing transceivers comprising linear precoders and
equalizers. Specifically, each precoder/equalizer is decomposed into inner and
outer components for nulling the cross-link interference and achieving array
gain, respectively. The inner precoders/equalizers are further optimized to
suppress the residual interference resulting from finite-rate cooperative
feedback. Further- more, the residual interference is regulated by additional
scalar cooperative feedback signals that are designed to control transmission
power using different criteria including fixed interference margin and maximum
sum throughput. Finally, the required number of cooperative precoder feedback
bits is derived for limiting the throughput loss due to precoder quantization.Comment: 23 pages; 5 figures; this work was presented in part at Asilomar 2011
and will appear in IEEE Trans. on Wireless Com
- …