Distance-based classification with Lipschitz functions
From MaRDI portal
Recommendations
Cited in
(52)- Large width nearest prototype classification on general distance spaces
- Distance-based double-quantitative rough fuzzy sets with logic operations
- An axiomatic approach to intrinsic dimension of a dataset
- On the empirical estimation of integral probability metrics
- Properly-weighted graph Laplacian for semi-supervised learning
- McShane-Whitney extensions for fuzzy Lipschitz maps
- The universal approximation property. Characterization, construction, representation, and existence
- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
- Landscape and training regimes in deep learning
- Theoretical investigation of generalization bounds for adversarial learning of deep neural networks
- Isomorphisms between spaces of Lipschitz functions
- Complexity of pattern classes and the Lipschitz property
- Consistency of spectral clustering
- The graph matching problem
- Maximal margin classification for metric spaces
- Generalized semi-inner products with applications to regularized learning
- Nearest neighbor representations of Boolean functions
- Extension procedures for lattice Lipschitz operators on Euclidean spaces
- Learning half-spaces on general infinite spaces equipped with a distance function
- Active nearest-neighbor learning in metric spaces
- The game theoretic p-Laplacian and semi-supervised learning with few labels
- Learning Theory
- Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data
- scientific article; zbMATH DE number 7625167 (Why is no real title available?)
- Locality defeats the curse of dimensionality in convolutional teacher–student scenarios*
- Relative stability toward diffeomorphisms indicates performance in deep nets*
- Distance-based classification with Lipschitz functions.
- Nearly optimal classification for semimetrics
- Asymptotic learning curves of kernel methods: empirical data versus teacher–student paradigm
- Adaptive metric dimensionality reduction
- Stable parameterization of continuous and piecewise-linear functions
- A mathematical perspective of machine learning
- Extension of semi-Lipschitz maps on non-subadditive quasi-metric spaces: new tools for Artificial Intelligence
- Sharp convergence rates for empirical optimal transport with smooth costs
- Private measures, random walks, and synthetic data
- Learning CHARME models with neural networks
- Empirical optimal transport between different measures adapts to lower complexity
- Learning sparse features can lead to overfitting in neural networks
- On concentration of the empirical measure for radial transport costs
- Enhanced feature learning via regularisation: integrating neural networks and kernel methods
- Regularized learning in Banach spaces as an optimization problem: representer theorems
- Lattice Lipschitz operators on C(K)-spaces
- Hypergraph p-Laplacian regularization on point clouds for data interpolation
- Differentially private low-dimensional synthetic data from high-dimensional datasets
- Lattice Lipschitz superposition operators on Banach function spaces
- Probing the latent hierarchical structure of data via diffusion models
- Extensions of lattice Lipschitz operators on Riesz spaces
- Curse of dimensionality in neural network optimization
- Abstract Lipschitz continuity. Combining semantic and quantitative approximations
- Covering number of real algebraic varieties and beyond: improved bounds and applications
- The guaranteed estimation of the Lipschitz classifier accuracy: confidence set approach
This page was built for publication: Distance-based classification with Lipschitz functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093199)
