Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:1911.13036

Help | Advanced Search

Computer Science > Machine Learning

arXiv:1911.13036 (cs)
[Submitted on 29 Nov 2019 ]

Title: Deep Networks with Adaptive Nyström Approximation

Title: 深度网络与自适应 Nyström 近似

Authors:Luc Giffon (QARMA, LIS), Stéphane Ayache (QARMA, LIS), Thierry Artières (QARMA, ECM, LIS), Hachem Kadri (QARMA, LIS)
Abstract: Recent work has focused on combining kernel methods and deep learning to exploit the best of the two approaches. Here, we introduce a new architecture of neural networks in which we replace the top dense layers of standard convolutional architectures with an approximation of a kernel function by relying on the Nystr{\"o}m approximation. Our approach is easy and highly flexible. It is compatible with any kernel function and it allows exploiting multiple kernels. We show that our architecture has the same performance than standard architecture on datasets like SVHN and CIFAR100. One benefit of the method lies in its limited number of learnable parameters which makes it particularly suited for small training set sizes, e.g. from 5 to 20 samples per class.
Abstract: 近期的工作集中在结合核方法和深度学习以利用两种方法的优点。 在这里,我们引入了一种新的神经网络架构,在该架构中,我们用基于 Nyström 近似的核函数来替代标准卷积架构的顶层密集层。 我们的方法简单且高度灵活。 它兼容任何核函数,并允许使用多个核。 我们证明了我们的架构在像 SVHN 和 CIFAR100 这样的数据集上与标准架构具有相同的性能。 该方法的一个好处在于其有限的学习参数数量,这使得它特别适合于小训练集大小的情况,例如每类样本从 5 到 20 个样本。
Subjects: Machine Learning (cs.LG) ; Machine Learning (stat.ML)
Cite as: arXiv:1911.13036 [cs.LG]
  (or arXiv:1911.13036v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.1911.13036
arXiv-issued DOI via DataCite
Journal reference: IJCNN 2019 - International Joint Conference on Neural Networks, Jul 2019, Budapest, Hungary

Submission history

From: Luc Giffon [view email]
[v1] Fri, 29 Nov 2019 10:26:59 UTC (319 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2019-11
Change to browse by:
cs
stat
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号