On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets

2000 ◽  
Vol 12 (12) ◽  
pp. 2965-2989 ◽  
Author(s):  
Jiří Šíma ◽  
Pekka Orponen ◽  
Teemu Antti-Poika

We investigate the computational properties of finite binary- and analog-state discrete-time symmetric Hopfield nets. For binary networks, we obtain a simulation of convergent asymmetric networks by symmetric networks with only a linear increase in network size and computation time. Then we analyze the convergence time of Hopfield nets in terms of the length of their bit representations. Here we construct an analog symmetric network whose convergence time exceeds the convergence time of any binary Hopfield net with the same representation length. Further, we prove that the MIN ENERGY problem for analog Hopfield nets is NP-hard and provide a polynomial time approximation algorithm for this problem in the case of binary nets. Finally, we show that symmetric analog nets with an external clock are computationally Turing universal.

1994 ◽  
Vol 05 (03) ◽  
pp. 195-205
Author(s):  
YOUNG-KEUN PARK ◽  
VLADIMIR CHERKASSKY

Rapid evolution in the field of communication networks requires high speed switching technologies. This involves a high degree of parallelism in switching control and routing performed at the hardware level. The multistage crossbar networks have always been attractive to switch designers. In this paper a neural network approach to controlling a three-stage Clos network in real time is proposed. This controller provides optimal routing of communication traffic requests on a call-by-call basis by rearranging existing connections, with a minimum length of rearrangement sequence so that a new blocked call request can be accommodated. The proposed neural network controller uses Paull’s rearrangement algorithm, along with the special (least used) switch selection rule in order to minimize the length of rearrangement sequences. The functional behavior of our model is verified by simulations and it is shown that the convergence time required for finding an optimal solution is constant, regardless of the switching network size. The performance is evaluated for random traffic with various traffic loads. Simulation results show that applying the least used switch selection rule increases the efficiency in switch rearrangements, reducing the network convergence time. The implementation aspects are also discussed to show the feasibility of the proposed approach.


Author(s):  
Mehmet Hakan Satman

<p>In this paper, a new algorithm is devised for calculating the Least Trimmed of Squares (LTS) estimator. The algorithm consists of two steps. In the first step, the non-dominated sorting algorithm is applied on the design matrix of regression data for selecting a clean subset of observations. In the second step, C-steps are iterated to adjust the LTS estimators. The algorithm is fast and precise for small sample sizes, however, the sorting algorithm is computationally inefficient in large datasets. A fast update mechanism can be used in online data with a linear increase in computation time. Some properties of the sorting algorithm are also investigated under some transformations. Results of applying the algorithm on some well-known datasets and Monte Carlo simulations show that the proposed algorithm is suitable to use in many cases when the computation time is the major objective and a moderate level of precision is enough.</p>


Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1341 ◽  
Author(s):  
R. Aguilar-Sánchez ◽  
I. F. Herrera-González ◽  
J. A. Méndez-Bermúdez ◽  
José M. Sigarreta

We perform a detailed (computational) scaling study of well-known general indices (the first and second variable Zagreb indices, M1α(G) and M2α(G), and the general sum-connectivity index, χα(G)) as well as of general versions of indices of interest: the general inverse sum indeg index ISIα(G) and the general first geometric-arithmetic index GAα(G) (with α∈R). We apply these indices on two models of random networks: Erdös–Rényi (ER) random networks GER(nER,p) and random geometric (RG) graphs GRG(nRG,r). The ER random networks are formed by nER vertices connected independently with probability p∈[0,1]; while the RG graphs consist of nRG vertices uniformly and independently distributed on the unit square, where two vertices are connected by an edge if their Euclidean distance is less or equal than the connection radius r∈[0,2]. Within a statistical random matrix theory approach, we show that the average values of the indices normalized to the network size scale with the average degree k of the corresponding random network models, where kER=(nER−1)p and kRG=(nRG−1)(πr2−8r3/3+r4/2). That is, X(GER)/nER≈X(GRG)/nRG if kER=kRG, with X representing any of the general indices listed above. With this work, we give a step forward in the scaling of topological indices since we have found a scaling law that covers different network models. Moreover, taking into account the symmetries of the topological indices we study here, we propose to establish their statistical analysis as a generic tool for studying average properties of random networks. In addition, we discuss the application of specific topological indices as complexity measures for random networks.


2020 ◽  
Author(s):  
Christoph Hoeppke ◽  
Benno I. Simmons

AbstractNestedness is a widespread pattern in mutualistic networks that has high ecological and evolutionary importance due to its role in enhancing species persistence and community stability. Nestedness measures tend to be correlated with fundamental properties of networks, such as size and connectance, and so nestedness values must be normalised to enable fair comparisons between different ecological communities. Current approaches, such as using null-corrected nestedness values and z-scores, suffer from extensive statistical issues. Thus a new approach called NODFc was recently proposed, where nestedness is expressed relative to network size, connectance and the maximum nestedness that could be achieved in a particular network. While this approach is demonstrably effective in overcoming the issues of collinearity with basic network properties, it is computationally intensive to calculate, and current approaches are too slow to be practical for many types of analysis, or for analysing large networks.We developed three highly-optimised algorithms, based on greedy, hillclimbing and simulated annealing approaches, for calculation of NODFc, spread along a speed-quality continuum. Users thus have the choice between a fast algorithm with a less accurate estimate, a slower algorithm with a more accurate estimate, and an intermediate option.We outline the package, and its implementation, as well as provide comparative performance benchmarking and two example analyses. We show that maxnodf enables speed increases of hundreds of times faster than existing approaches, with large networks seeing the biggest improvements. For example, for a large network with 3000 links, computation time was reduced from 50 minutes using the fastest existing algorithm to 11 seconds using maxnodf.maxnodf makes correctly-normalised nestedness measures feasible for complex analyses of even large networks. Analyses that would previously take weeks to complete can now be finished in hours or even seconds. Given evidence that correctly normalising nestedness values can significantly change the conclusions of ecological studies, we believe this package will usher in necessary widespread use of appropriate comparative nestedness statistics.


2005 ◽  
Vol 13 (3) ◽  
pp. 353-385 ◽  
Author(s):  
Laura A. McLay ◽  
David E. Goldberg

In many applications of genetic algorithms, there is a tradeoff between speed and accuracy in fitness evaluations when evaluations use numerical methods with varying discretization. In these types of applications, the cost and accuracy vary from discretization errors when implicit or explicit quadrature is used to estimate the function evaluations. This paper examines discretization scheduling, or how to vary the discretization within the genetic algorithm in order to use the least amount of computation time for a solution of a desired quality. The effectiveness of discretization scheduling can be determined by comparing its computation time to the computation time of a GA using a constant discretization. There are three ingredients for the discretization scheduling: population sizing, estimated time for each function evaluation and predicted convergence time analysis. Idealized one- and two-dimensional experiments and an inverse groundwater application illustrate the computational savings to be achieved from using discretization scheduling.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-16 ◽  
Author(s):  
Zongning Wu ◽  
Zengru Di ◽  
Ying Fan

Network embedding is a frontier topic in current network science. The scale-free property of complex networks can emerge as a consequence of the exponential expansion of hyperbolic space. Some embedding models have recently been developed to explore hyperbolic geometric properties of complex networks—in particular, symmetric networks. Here, we propose a model for embedding directed networks into hyperbolic space. In accordance with the bipartite structure of directed networks and multiplex node information, the method replays the generation law of asymmetric networks in hyperbolic space, estimating the hyperbolic coordinates of each node in a directed network by the asymmetric popularity-similarity optimization method in the model. Additionally, the experiments in several real networks show that our embedding algorithm has stability and that the model enlarges the application scope of existing methods.


Author(s):  
Chantana Chantrapornchai ◽  
Samrid Duangkaew

Several kinds of pretrained convolutional neural networks (CNN) exist nowadays. Utilizing these networks with the new classification task requires the retraining with new data sets. With the small embedded device, large network cannot be implemented. The authors study the use of pretrained models and customizing them towards accuracy and size against face recognition tasks. The results show 1) the performance of existing pretrained networks (e.g., AlexNet, GoogLeNet, CaffeNet, SqueezeNet), as well as size, and 2) demonstrate the layers customization towards the model size and accuracy. The studied results show that among the various networks with different data sets, SqueezeNet can achieve the same accuracy (0.99) as others with small size (up to 25 times smaller). Secondly, the two customizations with layer skipping are presented. The experiments show the example of SqueezeNet layer customizing, reducing the network size while keeping the accuracy (i.e., reducing the size by 7% with the slower convergence time). The experiments are measured based on Caffe 0.15.14.


2020 ◽  
Vol 32 (9) ◽  
pp. 1733-1773
Author(s):  
Yuko Kuroki ◽  
Liyuan Xu ◽  
Atsushi Miyauchi ◽  
Junya Honda ◽  
Masashi Sugiyama

We study the problem of stochastic multiple-arm identification, where an agent sequentially explores a size-[Formula: see text] subset of arms (also known as a super arm) from given [Formula: see text] arms and tries to identify the best super arm. Most work so far has considered the semi-bandit setting, where the agent can observe the reward of each pulled arm or assumed each arm can be queried at each round. However, in real-world applications, it is costly or sometimes impossible to observe a reward of individual arms. In this study, we tackle the full-bandit setting, where only a noisy observation of the total sum of a super arm is given at each pull. Although our problem can be regarded as an instance of the best arm identification in linear bandits, a naive approach based on linear bandits is computationally infeasible since the number of super arms [Formula: see text] is exponential. To cope with this problem, we first design a polynomial-time approximation algorithm for a 0-1 quadratic programming problem arising in confidence ellipsoid maximization. Based on our approximation algorithm, we propose a bandit algorithm whose computation time is [Formula: see text](log [Formula: see text]), thereby achieving an exponential speedup over linear bandit algorithms. We provide a sample complexity upper bound that is still worst-case optimal. Finally, we conduct experiments on large-scale data sets with more than 10[Formula: see text] super arms, demonstrating the superiority of our algorithms in terms of both the computation time and the sample complexity.


2005 ◽  
Vol 12 (03) ◽  
pp. 273-288
Author(s):  
Ian H. Dinwoodie ◽  
Emily Gamundi ◽  
Ed Mosteig

Polynomial systems for blocking probabilities on networks with dynamic routing are formulated. Two parameters in the coefficient field representing link capacity are varied. A region of parameter values is identified on which the system has two solutions with a probabilistic interpretation. The region is bounded by contours of the constant term coefficients in the characteristic polynomials of certain traceform matrices. This generalizes earlier work on multiple blocking probabilities in symmetric networks.


2000 ◽  
Vol 14 (1) ◽  
pp. 24-28 ◽  
Author(s):  
F. Hucklebridge ◽  
A. Clow ◽  
H. Rahman ◽  
P. Evans

Abstract Free cortisol as measured in saliva increases markedly following awakening. It is not clear, however, whether this is truly a stress-neuroendocrine response to awakening or a manifestation of the hypothalamic-pituitary-adrenal (HPA) circadian cycle. We investigated whether the awakening cortisol response can be generated in the middle of nocturnal sleep, when secretory activity in the HPA axis is low. In a within subject design, salivary cortisol response was measured under three different awakening conditions: (1) awakening at the normal morning awakening time; (2) awakening four hours prior to normal awakening time, and (3) awakening the following morning after interrupted sleep. The overall main effect was a linear increase in free cortisol following awakening with no significant interaction with awakening condition. Cortisol levels, as determined by area under the cortisol curve calculated with reference to zero, did differ by awakening condition. The two morning awakening conditions were comparable but values were lower for night awakening. Area under the curve change (calculated with reference to the first awakening cortisol base value), however, did not distinguish the three awakening conditions. We conclude from these data that there is a clear free cortisol response to awakening for both nocturnal and morning awakening although the absolute levels produced are lower for nocturnal awakening when basal cortisol is low. Nocturnal interruption of sleep did not affect the subsequent morning response.


Sign in / Sign up

Export Citation Format

Share Document