Michael Schmitt

Affiliations:
  • Ruhr University Bochum, Germany
  • Graz University of Technology, Austria (former)
  • University of Ulm, Germany (PhD 1994)


According to our database1, Michael Schmitt authored at least 36 papers between 1994 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2006
On the Complexity of Learning Lexicographic Strategies.
J. Mach. Learn. Res., 2006

2005
On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach.
Neural Comput., 2005

Inner Product Spaces for Bayesian Networks.
J. Mach. Learn. Res., 2005

On the power of Boolean computations in generalized RBF neural networks.
Neurocomputing, 2005

On the Accuracy of Bounded Rationality: How Far from Optimal Is Fast and Frugal?.
Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

2004
On the sample complexity of learning for networks of spiking neurons with nonlinear synaptic interactions.
IEEE Trans. Neural Networks, 2004

New Designs for the Descartes Rule of Signs.
Am. Math. Mon., 2004

Some dichotomy theorems for neural learning problems
Electron. Colloquium Comput. Complex., 2004

An Improved VC Dimension Bound for Sparse Polynomials.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

Bayesian Networks and Inner Product Spaces.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2002
Descartes' Rule of Signs for Radial Basis Function Neural Networks.
Neural Comput., 2002

RBF Neural Networks and Descartes' Rule of Signs.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001
On using the Poincaré polynomial for calculating the VC dimension of neural networks.
Neural Networks, 2001

Neural Networks with Local Receptive Fields and Superlinear VC Dimension
Electron. Colloquium Comput. Complex., 2001

Product Unit Neural Networks with Constant Depth and Superlinear VC Dimension.
Proceedings of the Artificial Neural Networks, 2001

Complexity of Learning for Networks of Spiking Neurons with Nonlinear Synaptic Interactions.
Proceedings of the Artificial Neural Networks, 2001

Radial Basis Function Neural Networks Have Superlinear VC Dimension.
Proceedings of the Computational Learning Theory, 2001

2000
On the Complexity of Computing and Learning with Multiplicative Neural Networks
Electron. Colloquium Comput. Complex., 2000

Lower Bounds on the Complexity of Approximating Continuous Functions by Sigmoidal Neural Networks
Electron. Colloquium Comput. Complex., 2000

VC Dimension Bounds for Product Unit Networks.
Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, 2000

1999
On the Sample Complexity for Nonoverlapping Neural Networks.
Mach. Learn., 1999

Simplicity and Robustness of Fast and Frugal Heuristics.
Minds Mach., 1999

VC dimension bounds for networks of spiking neurons.
Proceedings of the 7th European Symposium on Artificial Neural Networks, 1999

1998
Self-organization of spiking neurons using action potential timing.
IEEE Trans. Neural Networks, 1998

Identification Criteria and Lower Bounds for Perceptron-LikeLearning Rules.
Neural Comput., 1998

On Computing Boolean Functions by a Spiking Neuron.
Ann. Math. Artif. Intell., 1998

On the Sample Complexity for Neural Trees.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Learning Temporally Encoded Patterns in Networks of Spiking Neurons.
Neural Process. Lett., 1997

Proving Hardness of Neural Network Training Problems.
Neural Networks, 1997

On the Complexity of Learning for Spiking Neurons with Temporal Coding
Electron. Colloquium Comput. Complex., 1997

Hebbian Learning in Networks of Spiking Neurons Using Temporal Coding.
Proceedings of the Biological and Artificial Computation: From Neuroscience to Technology, 1997

Unsupervised Learning in Networks of Spiking Neurons Using Temporal Coding.
Proceedings of the Artificial Neural Networks, 1997

On the Complexity of Learning for a Spiking Neuron (Extended Abstract).
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996
Erratum: Exact VC-Dimension of Boolean Monomials.
Inf. Process. Lett., 1996

Exact VC-Dimension of Boolean Monomials.
Inf. Process. Lett., 1996

1994
Komplexität neuronaler Lernprobleme.
PhD thesis, 1994


  Loading...