Lower Bounds on the VC Dimension of Smoothly Parameterized Function Classes | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Lower Bounds on the VC Dimension of Smoothly Parameterized Function Classes

Neural Computation (1995) 7 (5): 1040–1053.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Adapt and explore: Multimodal mixup for representation learning

Ronghao Lin
Haifeng Hu

Information Fusion (2024) 105: 102216.

Hybrid manifold smoothing and label propagation technique for Kannada handwritten character recognition

G. Ramesh
J. Shreyas
J. Manoj Balaji
Ganesh N. Sharma
H. L. Gururaj
N. N. Srinidhi
S. S. Askar
Mohamed Abouhawwash

Frontiers in Neuroscience (2024) 18

Mixing Activations and Labels in Distributed Training for Split Learning

Danyang Xiao
Chengang Yang
Weigang Wu

IEEE Transactions on Parallel and Distributed Systems 1.

Graph-Based Embedding Smoothing Network for Few-Shot Scene Classification of Remote Sensing Images

Zhengwu Yuan
Wendong Huang
Chan Tang
Aixia Yang
Xiaobo Luo

Remote Sensing (2022) 14 (5): 1161.

Towards Fair Knowledge Transfer for Imbalanced Domain Adaptation

Taotao Jing
Bingrong Xu
Zhengming Ding

IEEE Transactions on Image Processing (2021) 30: 8200.

On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach

Michael Schmitt

Neural Computation (2005) 17 (3): 715.

Neural Networks with Local Receptive Fields and Superlinear VC Dimension

Michael Schmitt

Neural Computation (2002) 14 (4): 919.

Quantitative analysis of generalization ability of neural network with prior-knowledge

Jie Sun
Tie-Jun Wu

IFAC Proceedings Volumes (1999) 32 (2): 5328.

Lower Bound on VC-Dimension by Local Shattering

Yossi Erlich
Dan Chazan
Scott Petrack
Avraham Levy

Neural Computation (1997) 9 (4): 771.