arXiv AI By Sheng'en Li, Dongmian Zou

COPF: An Online Framework for Deployment-Stable Counterfactual Fairness in Evolving Graphs

Read the original on arXiv AI →

arXiv:2606. 00700v1 Announce Type: cross Abstract: Online link recommendation on evolving graphs is performative: by choosing which candidate links to show users, the system changes which links form and what feedback it later observes.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Sep 22

Counterfactual Tool Ranking under Utility, Cost, and Privilege Constraints

The paper introduces a counterfactual tool ranking framework that accounts for authority, historical support, and estimation nuances. Using eleven enterprise-inspired tools, synthetic and real-world experiments on the Berkeley Function Calling Leaderboard, the study compares direct regression and doubly robust (DR) methods, finding that DR performs better in shifted environments while direct regression excels in linear settings. The authors also evaluate Qwen2.5 models on held-out tasks, analyze policy differences under missing support, and present a falsifiable evaluation method with publicly available evidence.

By Jiapeng Li
arXiv AI
Jun 10

Is Fairness Truly Fair? Towards Reliable Lipschitz Fairness in Multi-Task Learning via Fixed-\texorpdfstring{$\delta$}{delta} Alignment

arXiv:2606. 10632v1 Announce Type: cross Abstract: Lipschitz-style individual fairness formalizes the idea that semantically similar examples should receive similar predictions, but its evaluation in multi-task learning (MTL) can be confounded by method-induced representation scales.

By Junbo Ding, Xin Zang, Chenchen Pan, Donghao Song, Jiaxin Zhu, Danhuai Guo
arXiv Machine Learning
Aug 28

When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects

The paper introduces a controlled contrast framework for estimating peer effects when interaction graphs evolve, indexing potential outcomes by own treatment, temporally aggregated peer exposure, and a post‑assignment evolution summary. It proposes the Dynamic Network Doubly Robust estimator (DynaNet‑DR), which uses a temporally factorized propensity and normalized augmentation to achieve consistency under standard causal assumptions. Semi‑synthetic benchmarks on real temporal graph sequences demonstrate that DynaNet‑DR achieves favorable estimation accuracy compared to other methods, and an observational study on MathOverflow illustrates its practical application.

By Xiaojing Du