Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Teo Deveney

dblp:249/9231 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 54% Generative modeling · 46%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › numerical analysis
adaptive mesh refinement
0.912025
G-Adaptivity: optimised graph-based mesh relocation for finite element methods · ICML 2025
Computational science and engineering
finite element analysis
0.912025
G-Adaptivity: optimised graph-based mesh relocation for finite element methods · ICML 2025
Machine learning › Generative modeling
diffusion model
0.812024
Diffusion Models Encode the Intrinsic Dimension of Data Manifolds · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › intrinsic dimension
intrinsic dimension estimation
0.812024
Diffusion Models Encode the Intrinsic Dimension of Data Manifolds · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.812024
Diffusion Models Encode the Intrinsic Dimension of Data Manifolds · ICML 2024
Machine learning › Generative modeling › diffusion model
score-based generative model
0.812024
Diffusion Models Encode the Intrinsic Dimension of Data Manifolds · ICML 2024
Machine learning › Representation and self-supervised learning
data manifold
0.212024
Diffusion Models Encode the Intrinsic Dimension of Data Manifolds · ICML 2024

Methods — techniques the papers use, named apart from their topics

r-adaptivity · 0.9graph neural network · 0.9score matching · 0.8
YearPublicationVenuePosition
2025 G-Adaptivity: optimised graph-based mesh relocation for finite element methods
abstract
We present a novel, and effective, approach to achieve optimal mesh relocation in finite element methods (FEMs). The cost and accuracy of FEMs is critically dependent on the choice of mesh points. Mesh relocation (r-adaptivity) seeks to optimise the mesh geometry to obtain the best solution accuracy at given computational budget. Classical r-adaptivity relies on the solution of a separate nonlinear “meshing” PDE to determine mesh point locations. This incurs significant cost at remeshing, and relies on estimates that relate interpolation- and FEM-error. Recent machine learning approaches have focused on the construction of fast surrogates for such classical methods. Instead, our new approach trains a graph neural network (GNN) to determine mesh point locations by directly minimising the FE solution error from the PDE system Firedrake to achieve higher solution accuracy. Our GNN architecture closely aligns the mesh solution space to that of classical meshing methodologies, thus replacing classical estimates for optimality with a learnable strategy. This allows for rapid and robust training and results in an extremely efficient and effective GNN approach to online r-adaptivity. Our method outperforms both classical, and prior ML, approaches to r-adaptive meshing. In particular, it achieves lower FE solution error, whilst retaining the significant speed-up over classical methods observed in prior ML work.
James Rowbottom, Georg Maierhofer, Teo Deveney, Eike Hermann Müller, Alberto Paganini, Katharina Schratz, Pietro Liò, Carola-Bibiane Schönlieb, Chris J. Budd
ICML3
2024 Diffusion Models Encode the Intrinsic Dimension of Data Manifolds
abstract
In this work, we provide a mathematical proof that diffusion models encode data manifolds by approximating their normal bundles. Based on this observation we propose a novel method for extracting the intrinsic dimension of the data manifold from a trained diffusion model. Our insights are based on the fact that a diffusion model approximates the score function i.e. the gradient of the log density of a noise-corrupted version of the target distribution for varying levels of corruption. We prove that as the level of corruption decreases, the score function points towards the manifold, as this direction becomes the direction of maximal likelihood increase. Therefore, at low noise levels, the diffusion model provides us with an approximation of the manifold’s normal bundle, allowing for an estimation of the manifold’s intrinsic dimension. To the best of our knowledge our method is the first estimator of intrinsic dimension based on diffusion models and it outperforms well established estimators in controlled experiments on both Euclidean and image data.
Jan Stanczuk, Georgios Batzolis, Teo Deveney, Carola-Bibiane Schönlieb
ICML3