Demo Data from SIGIR 2026 / reviewers in the wild / expert
Anna Asch
dblp:305/7939
· 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.
| Artificial intelligence
1 paper |
3D vision · 62% Deep learning architectures and training · 38% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training › convolutional neural network
residual network |
0.7 | 1 | 2023 | Riemannian Residual Neural Networks · NeurIPS 2023 |
Computer vision › 3D vision › geometric deep learning
riemannian neural network |
0.7 | 1 | 2023 | Riemannian Residual Neural Networks · NeurIPS 2023 |
Computer vision › 3D vision
geometric deep learning |
0.2 | 1 | 2023 | Riemannian Residual Neural Networks · NeurIPS 2023 |
Computer vision › 3D vision › geometric deep learning
manifold-valued data |
0.2 | 1 | 2023 | Riemannian Residual Neural Networks · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
symmetric positive definite matrices · 0.7residual connections · 0.7hyperbolic space · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Riemannian Residual Neural NetworksabstractRecent methods in geometric deep learning have introduced various neural networks to operate over data that lie on Riemannian manifolds. Such networks are often necessary to learn well over graphs with a hierarchical structure or to learn over manifold-valued data encountered in the natural sciences. These networks are often inspired by and directly generalize standard Euclidean neural networks. However, extending Euclidean networks is difficult and has only been done for a select few manifolds. In this work, we examine the residual neural network (ResNet) and show how to extend this construction to general Riemannian manifolds in a geometrically principled manner. Originally introduced to help solve the vanishing gradient problem, ResNets have become ubiquitous in machine learning due to their beneficial learning properties, excellent empirical results, and easy-to-incorporate nature when building varied neural networks. We find that our Riemannian ResNets mirror these desirable properties: when compared to existing manifold neural networks designed to learn over hyperbolic space and the manifold of symmetric positive definite matrices, we outperform both kinds of networks in terms of relevant testing metrics and training dynamics. Isay Katsman, Eric Ming Chen, Sidhanth Holalkere, Anna Asch, Aaron Lou, Ser-Nam Lim, Christopher De Sa |
NeurIPS | 4 |