Treadstone: A Social-Media-Inspired Platform for Multi-Agent Collaborative Data Analysis
研究提出Treadstone平台,通过模仿社交媒体的内容时间线,解决人与AI协作分析数据时的共享、冲突和意识问题。
研究提出Treadstone平台,通过模仿社交媒体的内容时间线,解决人与AI协作分析数据时的共享、冲突和意识问题。
EUMU模型通过共享预训练多模态模型和轻量级任务头,联合处理图像标记、开放词汇目标检测和图像描述,以满足资源限制。
本文通过创建SWORD基准,使用Wikidata生成事实错误的语句来评估多语言模型在拒绝事实错误方面的一致性,揭示了模型对不同语言处理能力的不对称性。
本文提出了一种贝叶斯广义网络自回归模型,通过结合结构化收缩和持久性先验来处理多变量时间序列数据,使用吉布斯采样器进行后验推断。
KG-aware recommendation has been widely studied to alleviate data sparsity by using knowledge graphs (KGs), which represent items, entities, and their relations as graphs and provide item-side knowledge. However, existing methods incorporate item knowledge without considering how much each user or item node should rely on it. As a result, they apply KG signals indiscriminately across nodes, even to nodes whose collaborative filtering (CF) signals from the interaction graph (IG) are already reliable. In this paper, we propose AdaKG (Adaptive Node-Aware KG Fusion), a novel KG-aware recommendation method that adaptively adjusts the contribution of auxiliary knowledge for each node. Since user-item interactions and item knowledge provide different types of signals, directly mixing them can distort the CF signals. To avoid this, AdaKG separately encodes the IG and KG with view-specific encoders, allowing each view to capture its own information. It then estimates how strongly each node should rely on item knowledge by measuring the stability of its CF signals under small adversarial perturbations, assigning a larger KG contribution to less stable nodes. Finally, AdaKG adaptively aligns the IG and KG embeddings in a shared space and fuses them according to the estimated node-wise reliance. Through experiments, we show that AdaKG achieves strong performance compared with its baselines and the effectiveness of our adaptive fusion strategy.
研究提出Treadstone平台,通过模仿社交媒体的内容时间线,解决人与AI协作分析数据时的共享、冲突和意识问题。
EUMU模型通过共享预训练多模态模型和轻量级任务头,联合处理图像标记、开放词汇目标检测和图像描述,以满足资源限制。
本文通过创建SWORD基准,使用Wikidata生成事实错误的语句来评估多语言模型在拒绝事实错误方面的一致性,揭示了模型对不同语言处理能力的不对称性。
本文提出了一种贝叶斯广义网络自回归模型,通过结合结构化收缩和持久性先验来处理多变量时间序列数据,使用吉布斯采样器进行后验推断。
KG-aware recommendation has been widely studied to alleviate data sparsity by using knowledge graphs (KGs), which represent items, entities, and their relations as graphs and provide item-side knowledge. However, existing methods incorporate item knowledge without considering how much each user or item node should rely on it. As a result, they apply KG signals indiscriminately across nodes, even to nodes whose collaborative filtering (CF) signals from the interaction graph (IG) are already reliable. In this paper, we propose AdaKG (Adaptive Node-Aware KG Fusion), a novel KG-aware recommendation method that adaptively adjusts the contribution of auxiliary knowledge for each node. Since user-item interactions and item knowledge provide different types of signals, directly mixing them can distort the CF signals. To avoid this, AdaKG separately encodes the IG and KG with view-specific encoders, allowing each view to capture its own information. It then estimates how strongly each node should rely on item knowledge by measuring the stability of its CF signals under small adversarial perturbations, assigning a larger KG contribution to less stable nodes. Finally, AdaKG adaptively aligns the IG and KG embeddings in a shared space and fuses them according to the estimated node-wise reliance. Through experiments, we show that AdaKG achieves strong performance compared with its baselines and the effectiveness of our adaptive fusion strategy.