Perceptrons of large weight

DOI10.1134/S0032946009010062zbMATH Open1171.68585OpenAlexW1988425761MaRDI QIDQ734289FDOQ734289

Authors: Vladimir V. Podolskii 

Publication date: 20 October 2009

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946009010062

Recommendations

• Perceptrons of Large Weight
• A Uniform Lower Bound on Weights of Perceptrons
• Lower bound on weights of large degree threshold functions
• Lower bound on weights of large degree threshold functions
• On the Size of Weights for Threshold Gates

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorics in computer science (68R05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Size of Weights for Threshold Gates
• Perceptrons, PP, and the polynomial hierarchy

Cited In (18)

• Approximate degree and the complexity of depth three circuits
• Patience of matrix games
• Learning Permutations with Exponential Weights
• The connections of large perceptrons
• Title not available (Why is that?)
• Perceptrons of Large Weight
• Lower bound on weights of large degree threshold functions
• The large-error approximate degree of \(\mathrm{AC}^0\)
• A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
• A Uniform Lower Bound on Weights of Perceptrons
• Lower bound on weights of large degree threshold functions
• Degree-uniform lower bound on the weights of polynomials with given sign function
• Approximate Degree in Classical and Quantum Computing
• A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
• Weights of exact threshold functions
• The communication complexity of addition
• Polynomial threshold functions, hyperplane arrangements, and random tensors
• Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits

This page was built for publication: Perceptrons of large weight

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