12,249 research outputs found
Learning a local-variable model of aromatic and conjugated systems
A collection of new
approaches to building and training neural
networks, collectively referred to as deep learning, are attracting
attention in theoretical chemistry. Several groups aim to replace
computationally expensive <i>ab initio</i> quantum mechanics
calculations with learned estimators. This raises questions about
the representability of complex quantum chemical systems with neural
networks. Can local-variable models efficiently approximate nonlocal
quantum chemical features? Here, we find that convolutional architectures,
those that only aggregate information locally, cannot efficiently
represent aromaticity and conjugation in large systems. They cannot
represent long-range nonlocality known to be important in quantum
chemistry. This study uses aromatic and conjugated systems computed
from molecule graphs, though reproducing quantum simulations is the
ultimate goal. This task, by definition, is both computable and known
to be important to chemistry. The failure of convolutional architectures
on this focused task calls into question their use in modeling quantum
mechanics. To remedy this heretofore unrecognized deficiency, we introduce
a new architecture that propagates information back and forth in waves
of nonlinear computation. This architecture is still a local-variable
model, and it is both computationally and representationally efficient,
processing molecules in sublinear time with far fewer parameters than
convolutional networks. Wave-like propagation models aromatic and
conjugated systems with high accuracy, and even models the impact
of small structural changes on large molecules. This new architecture
demonstrates that some nonlocal features of quantum chemistry can
be efficiently represented in local variable models
Metaheuristic design of feedforward neural networks: a review of two decades of research
Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era
- …