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. 2306.00742
  4. Cited By
The Galerkin method beats Graph-Based Approaches for Spectral Algorithms

The Galerkin method beats Graph-Based Approaches for Spectral Algorithms

1 June 2023
Vivien A. Cabannes
Francis R. Bach
ArXivPDFHTML

Papers citing "The Galerkin method beats Graph-Based Approaches for Spectral Algorithms"

4 / 4 papers shown
Title
Laplace Transform Based Low-Complexity Learning of Continuous Markov
  Semigroups
Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroups
Vladimir Kostic
Karim Lounici
Helene Halconruy
Timothée Devergne
P. Novelli
Massimiliano Pontil
43
0
0
18 Oct 2024
From Biased to Unbiased Dynamics: An Infinitesimal Generator Approach
From Biased to Unbiased Dynamics: An Infinitesimal Generator Approach
Timothée Devergne
Vladimir Kostic
Michele Parrinello
Massimiliano Pontil
34
3
0
13 Jun 2024
Learning the Infinitesimal Generator of Stochastic Diffusion Processes
Learning the Infinitesimal Generator of Stochastic Diffusion Processes
Vladimir Kostic
Karim Lounici
Helene Halconruy
Timothée Devergne
Massimiliano Pontil
DiffM
45
4
0
21 May 2024
Neural Eigenfunctions Are Structured Representation Learners
Neural Eigenfunctions Are Structured Representation Learners
Zhijie Deng
Jiaxin Shi
Hao Zhang
Peng Cui
Cewu Lu
Jun Zhu
58
14
0
23 Oct 2022
1