Search papers, labs, and topics across Lattice.
LTCI Télécom Paris
3
0
4
Targeted sampling of informative pairs can slash computational costs in pairwise loss estimation while maintaining performance on par with full evaluations.
Link prediction models amplify structural biases beyond immediate connections, but a new $k$-hop fairness approach can mitigate these disparities with favorable performance trade-offs.
Algorithmic recommendations subtly warp network evolution, and this new measure reveals how link prediction strategies amplify existing biases in dynamic graphs.