VLDB 2026 Research / reviewers in the wild / expert
Xiongtao Dai
dblp:369/8082
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—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.
| Theoretical computer science
1 paper |
Mathematical optimization · 87% Computational geometry · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › optimization for machine learning
metric learning |
0.7 | 1 | 2023 | Estimating Riemannian Metric with Noise-Contaminated Intrinsic Distance · NeurIPS 2023 |
Mathematical optimization
statistical learning theory |
0.7 | 1 | 2023 | Estimating Riemannian Metric with Noise-Contaminated Intrinsic Distance · NeurIPS 2023 |
Computational geometry › geometric shortest paths
geodesic distance |
0.2 | 1 | 2023 | Estimating Riemannian Metric with Noise-Contaminated Intrinsic Distance · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
taylor expansion · 0.7local regression · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Estimating Riemannian Metric with Noise-Contaminated Intrinsic DistanceabstractWe extend metric learning by studying the Riemannian manifold structure of the underlying data space induced by similarity measures between data points. The key quantity of interest here is the Riemannian metric, which characterizes the Riemannian geometry and defines straight lines and derivatives on the manifold. Being able to estimate the Riemannian metric allows us to gain insights into the underlying manifold and compute geometric features such as the geodesic curves. We model the observed similarity measures as noisy responses generated from a function of the intrinsic geodesic distance between data points. A new local regression approach is proposed to learn the Riemannian metric tensor and its derivatives based on a Taylor expansion for the squared geodesic distances, accommodating different types of data such as continuous, binary, or comparative responses. We develop theoretical foundation for our method by deriving the rates of convergence for the asymptotic bias and variance of the estimated metric tensor. The proposed method is shown to be versatile in simulation studies and real data applications involving taxi trip time in New York City and MNIST digits. Jiaming Qiu, Xiongtao Dai |
NeurIPS | 2 |