Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods

DOI10.1162/NECO_A_01329MaRDI QIDQ3386436zbMATH OpenOpenAlexWikidataFDO

Authors Spencer J. Kent, E. Paxon Frady, Friedrich T. Sommer, Bruno A. Olshausen

Publication date 4 January 2021

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco_a_01329

Networks and circuits as models of computation; circuit complexity (68Q06) Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

Resonator networks. I: An efficient solution for factoring high-dimensional, distributed representations of data structures
A Comparison of Factorization-Free Eigensolvers with Application to Cavity Resonators
Network analysis via partial spectral factorization and Gauss quadrature
scientific article; zbMATH DE number 3981088
Maximization of the quality factor of an optical resonator
Parallelization of algorithms for the solution of optimal measurements in view of resonances
Design, performance, and complexity analysis of residual trellis-coded vector quantizers
On the Optimality of Treating Interference as Noise: Compound Interference Networks
Optimization of MIMO systems capacity using large random matrix methods

Cites work

``Neural computation of decisions in optimization problems
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
A Multilinear Singular Value Decomposition
Absolute stability of global pattern formation and parallel memory storage by competitive neural networks
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters
Concentration inequalities. A nonasymptotic theory of independence
Fast projection onto the simplex and the l₁ ball
scientific article; zbMATH DE number 2045481 (Why is no real title available?)
scientific article; zbMATH DE number 1827069 (Why is no real title available?)
Introduction to Stochastic Search and Optimization
Learning to represent spatial transformations with factored higher-order Boltzmann machines
Linear convergence of iterative soft-thresholding
Most tensor problems are NP-hard
Neural network design for efficient information retrieval
Neural networks and physical systems with emergent collective computational abilities
Neurons with graded response have collective computational properties like those of two-state neurons
Non-negative matrix factorization with sparseness constraints
On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
Resonator networks. I: An efficient solution for factoring high-dimensional, distributed representations of data structures
Tensor Decomposition for Signal Processing and Machine Learning
Tensor Decompositions and Applications
Tensor decompositions for learning latent variable models
The multiplicative weights update method: a meta-algorithm and applications
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Validation of subgradient optimization

Cited in

(3)

Resonator networks. I: An efficient solution for factoring high-dimensional, distributed representations of data structures
Statistical mechanics of vector Hopfield network near and above saturation
Configurable hyperdimensional graph representation

This page was built for publication: Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386436)