Learning with infinitely many features
From MaRDI portal
Publication:374174
DOI10.1007/S10994-012-5324-5zbMATH Open1273.68304OpenAlexW2052314876MaRDI QIDQ374174FDOQ374174
Authors: Alain Rakotomamonjy, Rémi Flamary, Florian Yger
Publication date: 22 October 2013
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-012-5324-5
Recommendations
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Learning deep architectures for AI
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Learning the kernel matrix with semidefinite programming
- Learning the kernel matrix by maximizing a KFD-based class separability criterion
- Convex multi-task feature learning
- Fast kernel classifiers with online and active learning
- Linear programming boosting via column generation
- Gaussian kernel optimization for pattern classification
- Simplified Gabor wavelets for human face recognition
- Efficient wavelet adaptation for hybrid wavelet -- large margin classifiers
- When is there a representer theorem? Vector versus matrix regularizers
- ℓ1 Regularization in Infinite Dimensional Feature Spaces
- Learning Theory
- Evaluation of the effects of Gabor filter parameters on texture classification
Cited In (3)
This page was built for publication: Learning with infinitely many features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374174)