ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2312.14681
  4. Cited By
Engineered Ordinary Differential Equations as Classification Algorithm
  (EODECA): thorough characterization and testing

Engineered Ordinary Differential Equations as Classification Algorithm (EODECA): thorough characterization and testing

22 December 2023
Raffaele Marino
L. Buffoni
Lorenzo Chicchi
Lorenzo Giambagli
Duccio Fanelli
ArXivPDFHTML

Papers citing "Engineered Ordinary Differential Equations as Classification Algorithm (EODECA): thorough characterization and testing"

2 / 2 papers shown
Title
A Short Review on Novel Approaches for Maximum Clique Problem: from
  Classical algorithms to Graph Neural Networks and Quantum algorithms
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino
L. Buffoni
Bogdan Zavalnij
GNN
24
5
0
13 Mar 2024
On Large-Batch Training for Deep Learning: Generalization Gap and Sharp
  Minima
On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima
N. Keskar
Dheevatsa Mudigere
J. Nocedal
M. Smelyanskiy
P. T. P. Tang
ODL
273
2,878
0
15 Sep 2016
1