EDBT 2026 Demo / reviewers in the wild / expert
Dawson Thomas
dblp:322/1131
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 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 · 91% Deep learning architectures and training · 9% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
diffusion maps |
0.6 | 1 | 2022 | Diffusion Curvature for Estimating Local Curvature in High Dimensional Data · NeurIPS 2022 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning |
0.6 | 1 | 2022 | Diffusion Curvature for Estimating Local Curvature in High Dimensional Data · NeurIPS 2022 |
Machine learning › Deep learning architectures and training
loss landscape |
0.2 | 1 | 2022 | Diffusion Curvature for Estimating Local Curvature in High Dimensional Data · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
riemannian geometry · 0.6neural network estimation · 0.6diffusion maps · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Diffusion Curvature for Estimating Local Curvature in High Dimensional DataabstractWe introduce a new intrinsic measure of local curvature on point-cloud data called diffusion curvature. Our measure uses the framework of diffusion maps, including the data diffusion operator, to structure point cloud data and define local curvature based on the laziness of a random walk starting at a point or region of the data. We show that this laziness directly relates to volume comparison results from Riemannian geometry. We then extend this scalar curvature notion to an entire quadratic form using neural network estimations based on the diffusion map of point-cloud data. We show applications of both estimations on toy data, single-cell data, and on estimating local Hessian matrices of neural network loss landscapes. Dhananjay Bhaskar, Kincaid MacDonald, Oluwadamilola Fasina, Dawson Thomas, Bastian Rieck, Ian Adelstein, Smita Krishnaswamy |
NeurIPS | 4 |