Strictly proper scoring rules for node selection tasks on graphs
cs.LG, cs.SI, stat.ML
Submitted: 2026-11-02
Updated: 2026-11-02
Code: https://github.com/lo-hfk/proper-graph-scoring-rules
Terminology
Sources
- Fast Node Vector Distance Computations using Laplacian Solvers
- An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
- Robust and Practical Solution of Laplacian Equations by Approximate Elimination
- No Cost Likelihood Manipulation at Test Time for Making Better Mistakes in Deep Networks
- Score matching estimators for directional distributions
- Graph Neural Networks for Source Detection: A Review and Benchmark Study
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis