354,772 research outputs found
Fast Algorithms for General Spin Systems on Bipartite Expanders
A spin system is a framework in which the vertices of a graph are assigned
spins from a finite set. The interactions between neighbouring spins give rise
to weights, so a spin assignment can also be viewed as a weighted graph
homomorphism. The problem of approximating the partition function (the
aggregate weight of spin assignments) or of sampling from the resulting
probability distribution is typically intractable for general graphs.
In this work, we consider arbitrary spin systems on bipartite expander
-regular graphs, including the canonical class of bipartite random
-regular graphs. We develop fast approximate sampling and counting
algorithms for general spin systems whenever the degree and the spectral gap of
the graph are sufficiently large. Our approach generalises the techniques of
Jenseen et al. and Chen et al. by showing that typical configurations on
bipartite expanders correspond to "bicliques" of the spin system; then, using
suitable polymer models, we show how to sample such configurations and
approximate the partition function in time, where is the
size of the graph
ARTMAP-IC and Medical Diagnosis: Instance Counting and Inconsistent Cases
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTMAP system. For the ARTMAP match tracking algorithm, which controls search following a predictive error, a new version facilitates prediction with sparse or inconsistent data. Compared to the original match tracking algorithm (MT+), the new algorithm (MT-) better approximates the real-time network differential equations and further compresses memory without loss of performance. Simulations examine predictive accuracy on four medical databases: Pima Indian diabetes, breast cancer, heart disease, and gall bladder removal. ARTMAP-IC results arc equal to or better than those of logistic regression, K nearest neighbor (KNN), the ADAP perceptron, multisurface pattern separation, CLASSIT, instance-based (IBL), and C4. ARTMAP dynamics are fast, stable, and scalable. A voting strategy improves prediction by training the system several times on different orderings of an input set. Voting, instance counting, and distributed representations combine to form confidence estimates for competing predictions.National Science Foundation (IRI 94-01659); Office of Naval Research (N00014-95-J-0409, N00014-95-0657
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
We present a probabilistic Las Vegas algorithm for computing the local zeta
function of a genus- hyperelliptic curve defined over with
explicit real multiplication (RM) by an order in a degree-
totally real number field.
It is based on the approaches by Schoof and Pila in a more favorable case
where we can split the -torsion into kernels of endomorphisms, as
introduced by Gaudry, Kohel, and Smith in genus 2. To deal with these kernels
in any genus, we adapt a technique that the author, Gaudry, and Spaenlehauer
introduced to model the -torsion by structured polynomial systems.
Applying this technique to the kernels, the systems we obtain are much smaller
and so is the complexity of solving them.
Our main result is that there exists a constant such that, for any
fixed , this algorithm has expected time and space complexity as grows and the characteristic is large enough. We prove that
and we also conjecture that the result still holds for .Comment: To appear in Journal of Complexity. arXiv admin note: text overlap
with arXiv:1710.0344
ART and ARTMAP Neural Networks for Applications: Self-Organizing Learning, Recognition, and Prediction
ART and ARTMAP neural networks for adaptive recognition and prediction have been applied to a variety of problems. Applications include parts design retrieval at the Boeing Company, automatic mapping from remote sensing satellite measurements, medical database prediction, and robot vision. This chapter features a self-contained introduction to ART and ARTMAP dynamics and a complete algorithm for applications. Computational properties of these networks are illustrated by means of remote sensing and medical database examples. The basic ART and ARTMAP networks feature winner-take-all (WTA) competitive coding, which groups inputs into discrete recognition categories. WTA coding in these networks enables fast learning, that allows the network to encode important rare cases but that may lead to inefficient category proliferation with noisy training inputs. This problem is partially solved by ART-EMAP, which use WTA coding for learning but distributed category representations for test-set prediction. In medical database prediction problems, which often feature inconsistent training input predictions, the ARTMAP-IC network further improves ARTMAP performance with distributed prediction, category instance counting, and a new search algorithm. A recently developed family of ART models (dART and dARTMAP) retains stable coding, recognition, and prediction, but allows arbitrarily distributed category representation during learning as well as performance.National Science Foundation (IRI 94-01659, SBR 93-00633); Office of Naval Research (N00014-95-1-0409, N00014-95-0657
dARTMAP: A Neural Network for Fast Distributed Supervised Learning
Distributed coding at the hidden layer of a multi-layer perceptron (MLP) endows the network with memory compression and noise tolerance capabilities. However, an MLP typically requires slow off-line learning to avoid catastrophic forgetting in an open input environment. An adaptive resonance theory (ART) model is designed to guarantee stable memories even with fast on-line learning. However, ART stability typically requires winner-take-all coding, which may cause category proliferation in a noisy input environment. Distributed ARTMAP (dARTMAP) seeks to combine the computational advantages of MLP and ART systems in a real-time neural network for supervised learning, An implementation algorithm here describes one class of dARTMAP networks. This system incorporates elements of the unsupervised dART model as well as new features, including a content-addressable memory (CAM) rule for improved contrast control at the coding field. A dARTMAP system reduces to fuzzy ARTMAP when coding is winner-take-all. Simulations show that dARTMAP retains fuzzy ARTMAP accuracy while significantly improving memory compression.National Science Foundation (IRI-94-01659); Office of Naval Research (N00014-95-1-0409, N00014-95-0657
- …