Evidential Learning-based Certainty Estimation for Robust Dense Feature Matching
No confident code implementation found for this paper. 3 possible matches can be shown below.
No confident code implementation found for this paper. 3 possible matches can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
An Effective Manifold-based Optimization Method for Distributionally Robust Classification
Graph-based Deterministic Policy Gradient for Repetitive Combinatorial Optimization Problems
Norm-based Generalization Bounds for Sparse Neural Networks
Subgoal-based Demonstration Learning for Formal Theorem Proving
Label Distribution Propagation-based Label Completion for Crowdsourcing
ENAHPool: The Edge-Node Attention-based Hierarchical Pooling for Graph Neural Networks
@article{cai2026evidential,
title = {Evidential Learning-based Certainty Estimation for Robust Dense Feature Matching},
author = {Lile Cai and C. Foo and Xun Xu and Zaiwang Gu and Jun Cheng and Xulei Yang},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:2f47492efd5451444f04b23d2f2cacae81bf2197},
journal = {ICLR 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2f47492efd5451444f04b23d2f2cacae81bf2197)