论文检索
输入标题、作者或关键词，从 954 篇学术成果中精准定位
Generative Recommendation (GR) has become a promising end-to-end approach with high FLOPS utilization for resource-efficient recommendation. Despite the effectiveness, we show that current GR models suffer from a critical bias amplification issue, where token-level bias escalates as token generation progresses, ultimately limiting the recommendation diversity and hurting the user experience. By comparing against the key factor behind the success of traditional multi-stage pipelines, we reveal two limitations in GR that can amplify the bias: homogeneous reliance on the encoded history, and fixed computational budgets that prevent deeper user preference understanding. To combat the bias amplification issue, it is crucial for GR to 1) incorporate more heterogeneous information, and 2) allocate greater computational resources at each token generation step. To this end, we propose CARE, a simple yet effective cascaded reasoning framework for debiased GR. To incorporate heterogeneous information, we introduce a progressive history encoding mechanism, which progressively incorporates increasingly fine-grained history information as the generation process advances. To allocate more computations, we propose a query-anchored reasoning mechanism, which seeks to perform a deeper understanding of historical information through parallel reasoning steps. We instantiate CARE on three GR backbones. Empirical results on four datasets show the superiority of CARE in recommendation accuracy, diversity, efficiency, and promising scalability.
Understanding experienced segregation in urban daily life is crucial for addressing societal inequalities and fostering inclusivity. The abundance of user-generated reviews on social media encapsulates nuanced perceptions and feelings associated with different places, offering rich insights into segregation. However, leveraging this data poses significant challenges due to its vast volume, ambiguity, and confluence of diverse perspectives. To tackle these challenges, we propose a novel Large Language Model (LLM) Agent to automate online review mining for segregation prediction. Specifically, we propose a reflective LLM coder to digest social media content into insights consistent with real-world feedback, and eventually produce a codebook capturing key dimensions that signal segregation experience, such as cultural resonance and appeal, accessibility and convenience, and community engagement and local involvement. Guided by the codebook, LLMs can generate both informative review summaries and ratings for segregation prediction. Moreover, we design a REasoning-and-EMbedding (RE'EM) framework, which combines the reasoning and embedding capabilities of language models to integrate multi-channel features for segregation prediction. Experiments on real-world data demonstrate that our agent substantially improves prediction accuracy, with a 22.79% elevation in R2 and a 9.33% reduction in MSE. The derived codebook is generalizable across three different cities, consistently improving prediction accuracy. Moreover, our user study confirms that the codebook-guided summaries provide cognitive gains for human participants in perceiving places of interest(POIs)' social inclusiveness. Our study marks an important step toward understanding implicit social barriers and inequalities, demonstrating the great potential of promoting social inclusiveness with Web technology.
Dengue, a mosquito-borne disease, continues to pose a persistent public health challenge in urban areas, particularly in tropical regions such as Singapore. Effective and affordable control requires anticipating where transmission risks are likely to emerge so that interventions can be deployed proactively rather than reactively. This study introduces a novel framework that uncovers and exploits latent transmission links between urban regions, mined directly from publicly available dengue case data. Instead of treating cases as isolated reports, we model how hotspot formation in one area is influenced by epidemic dynamics in neighboring regions. While mosquito movement is highly localized, long-distance transmission is often driven by human mobility, and in our case study, the learned network aligns closely with commuting flows, providing an interpretable explanation for citywide spread. These hidden links are optimized through gradient descent and used not only to forecast hotspot status but also to verify the consistency of spreading patterns, by examining the stability of the inferred network across consecutive weeks. Case studies on Singapore during 2013–2018 and 2020 show that four weeks of hotspot history are sufficient to achieve an average F-score of 0.79. Even under the COVID-19 ''circuit breaker,'' when mobility patterns were severely disrupted, the model remained robust with an F-score of 0.83. Importantly, the learned transmission links align with commuting flows, highlighting the interpretable interplay between hidden epidemic spread and human mobility. By shifting from simply reporting dengue cases to mining and validating hidden spreading dynamics, this work transforms open web-based case data into a predictive and explanatory resource. The proposed framework advances epidemic modeling while providing a scalable, low-cost tool for public health planning, early intervention, and urban resilience.
Live streaming platforms require real-time monitoring and reaction to social signals, utilizing partial and asynchronous evidence from video, text, and audio. We propose StreamSense, a streaming detector that couples a lightweight streaming encoder with selective routing to a Vision–Language Model (VLM) expert. StreamSense handles most timestamps with the lightweight streaming encoder, escalates hard/ambiguous cases to the VLM, and defers decisions when context is insufficient. The encoder is trained using (i) a cross-modal contrastive term to align visual/audio cues with textual signals, and (ii) an IoU-weighted loss that down-weights poorly overlapping target segments, mitigating label interference across segment boundaries. We evaluate StreamSense on multiple social streaming detection tasks (e.g., sentiment classification and hate content moderation), and the results show that StreamSense achieves higher accuracy than VLM-only streaming while only occasionally invoking the VLM, thereby reducing average latency and compute. Our results indicate that selective escalation and deferral are effective primitives for understanding streaming social tasks. Code is publicly available on GitHub.
Community-based fact-checking systems, such as Community Notes on X (formerly Twitter), aim to mitigate online misinformation by surfacing annotations judged helpful by contributors with diverse viewpoints. While prior work has shown that the platform's bridging-based algorithm effectively selects helpful notes at the time of display, little is known about how evaluations change after notes become visible. Using a large-scale dataset of 437,396 community notes and 35 million ratings from over 580,000 contributors, we examine the stability of helpful notes and the rating dynamics that follow their initial display. We find that 30.2% of displayed notes later lose their helpful status and disappear. Using interrupted time series models, we further show that note display triggers a sharp increase in rating volume and a significant shift in rating leaning, but these effects differ across rater groups. Contributors with viewpoints similar to note authors tend to increase supportive ratings, while dissimilar contributors increase negative ratings, producing systematic post-display polarization. Counterfactual analyses suggest that this post-display polarization, particularly from dissimilar raters, plays a substantial role in note disappearance. These findings highlight the vulnerability of consensus-based fact-checking systems to polarized rating behavior and suggest pathways for improving their resilience.
As Large Language Models (LLMs) increasingly shape online content, how to remove targeted information from well-trained LLMs (also known as LLM unlearning) has become increasingly critical for web governance. A key challenge in LLM unlearning lies in the sample-wise imbalance within the forget set: different samples exhibit widely varying unlearning difficulty, leading to asynchronous forgetting speeds where some knowledge remains insufficiently erased while others become over-forgotten. To address this challenge, we propose BalDRO, a novel and efficient framework for balanced LLM unlearning. BalDRO formulates unlearning as a min–sup process, where the inner process identifies a worst-case data distribution that adaptively emphasizes hard-to-unlearn samples, while the outer process updates model parameters based on the worst-case data distribution. We instantiate this formulation through two efficient variants: BalDRO-G, a discrete GroupDRO-based approximation that focuses on high-loss subsets, and BalDRO-DV, a continuous Donsker–Varadhan dual method that enables smooth, adaptive weighting within standard LLM training pipelines. Extensive experiments on the TOFU and MUSE benchmarks demonstrate the effectiveness of our proposed BalDRO, yielding significant improvements in both forgetting quality and model utility over existing methods. For reproducibility, we have released the code for BalDRO. https://github.com/nxZhai/BalDRO.
What if accessing the web did not require a screen, a stable desk, or even free hands? For people navigating crowded cities, living with low vision, or experiencing cognitive overload, smart glasses coupled with AI agents could turn the web into an always-on assistive layer over daily life. We present Egocentric Co-Pilot, a web-native neuro-symbolic framework that runs on smart glasses and uses a Large Language Model (LLM) to orchestrate a toolbox of perception, reasoning, and web tools. An egocentric reasoning core combines Temporal Chain-of-Thought with Hierarchical Context Compression to support long-horizon question answering and decision support over continuous first-person video, far beyond a single model's context window. On top of this, a lightweight multimodal intent layer turns noisy speech and gaze into structured, tool-ready commands without relying on a single monolithic model. We further implement and evaluate a cloud-native WebRTC pipeline based on LiveKit, integrating streaming speech, video, and control messages into a single web-standard channel that serves both smart-glasses clients and browser-based playgrounds. In parallel, we deploy an on-premise WebSocket baseline, exposing concrete trade-offs between local inference and cloud offloading in terms of latency, mobility, and resource use. Experiments on Egolife and HD-EPIC demonstrate competitive or state-of-the-art egocentric QA performance, and a human-in-the-loop study on smart glasses shows higher task completion and user satisfaction than leading commercial baselines. Taken together, these results indicate that web-connected egocentric co-pilots can be a practical path toward more accessible, context-aware assistance in everyday life. By grounding operation in web-native communication primitives and modular, auditable tool use, Egocentric Co-Pilot offers a concrete blueprint for assistive, always-on web agents that support education, accessibility, and social inclusion for people who may benefit most from contextual, egocentric AI. Our code, fine-tuned models are available at https://github.com/YoungSeng/Egocentric-Co-Pilot.
State-of-the-art single-agent claim verification methods struggle with complex claims that require nuanced analysis of multifaceted evidence. Inspired by real-world professional fact-checkers, we propose DebateCV, the first debate-driven claim verification framework powered by multiple LLM agents. In DebateCV, two Debaters argue opposing stances to surface subtle errors in single-agent assessments. A decisive Moderator is then required to weigh the evidential strength of conflicting arguments to deliver an accurate verdict. Yet, zero-shot Moderators are biased toward neutral judgments, and no datasets exist for training them. To bridge this gap, we propose Debate-SFT, a post-training framework that leverages synthetic data to enhance agents' ability to effectively adjudicate debates for claim verification. Results show that our methods surpass state-of-the-art non-debate approaches in both accuracy (across various evidence conditions) and justification quality.
Accurate rainfall forecasting is essential for climate and disaster management, but precipitation exhibits extreme zero inflation that modern time-series Foundation Models (TSFMs) fundamentally cannot represent due to their continuous regression outputs. This structural mismatch causes pervasive drizzle-like false alarms, miscalibrated nonzero intensities, and severely underdetected extremes, while retraining large TSFMs is computationally prohibitive and environmentally unsustainable for most regions. We present a training-free wrapper that corrects zero inflation for frozen TSFMs without updating any parameters. Our method restores discrete zero mass using empirical occurrence statistics, aligns positive-value distributions via probability-integral transforms, and applies Generalized Pareto tail mapping for extreme-value consistency. Experiments on South Australian rainfall show substantial gains with negligible overhead (<5,ms per forecast, compared to hundreds of GPU-hours for retraining). The proposed wrapper enables carbon-neutral, globally deployable climate services and directly advances the goals of UN SDG~13 (Climate Action).
Accurate enterprise power consumption forecasting is not only a core component of optimized green energy management but also a key support for promoting the coordinated development of a sustainable society and the digital economy. The temporal fluctuations in power consumption reflect an enterprise's production activity and operational resilience, while credit assessment combined with Web data reveals a two-way coupling relationship between it and energy use: credit changes influence financing and power consumption strategies, while energy anomalies may become early signals of credit risk. However, existing methods still have shortcomings in modeling the co-evolution of Web data and power data. Most models only focus on static or unidirectional correlations, making it difficult to capture the dynamic feedback between credit risk and power consumption; traditional multi-task learning frameworks often rely on parameter sharing or simple attention mechanisms, lacking consistency constraints across time scales and network structures. To address this, this paper proposes CPDGL, a credit-electricity co-evolution framework based on dynamic graph learning, which simultaneously performs power forecasting and credit risk assessment within a unified multi-task system. Its co-evolution path interaction module explicitly models the feedback loop between credit dynamics and power behavior, learning bidirectional causal relationships through an adaptive influence matrix; the semantic path aggregation module integrates static and dynamic features, strengthening cross-modal expression and global reasoning capabilities. Large-scale experiments conducted in a real-world enterprise environment of one of the world's largest power suppliers demonstrate that CPDGL achieves state-of-the-art performance in both power forecasting and credit assessment tasks. The results validate its broad applicability in multi-source Web data fusion scenarios, significantly improving forecasting accuracy and dispatch efficiency in clean energy management, and showcasing practical value and social impact in smart cities and sustainable development.
For web platforms facing regulatory scrutiny---from content moderation to ad delivery and recommendations---fairness audits routinely disagree due to metric choice, subgroup granularity, sampling variance, and dataset shift. Point estimates yield brittle pass/fail narratives that are hard to defend in governance contexts. We propose a Bayesian audit-of-audits that pools heterogeneous audits---count-based and metric-only---into interval-valued fairness claims with explicit uncertainty and policy-risk tables aligned to practitioner thresholds. The framework unifies classification and exposure metrics, enforces consistency across coarse and intersectional group definitions via soft coherence constraints, and quantifies the Value-of-Information of prospective audits. We also provide heterogeneity diagnostics and leave-one-audit-out sensitivities. Across a synthetic Audit Zoo, a content-moderation case study on CivilComments--WILDS, and an ad-delivery simulation, our meta-evaluator attains near-nominal coverage with narrower intervals and fewer decision flips than per-audit baselines, while integrating partial-information audits.
Online advertising platforms serve as a critical bridge between advertisers and media, requiring precise prediction of user behaviors. Systematic underestimation or overestimation in these predictions can undermine the interests of both parties. Existing calibration methods fall short in addressing two key challenges. First, significant differences in CVR distributions across various targets lead to biased calibration when using global posterior statistics, causing some sample groups to be overestimated while others are underestimated. Second, current field-aware approaches are typically limited to single-field calibration and fail to account for field sensitivity. To overcome these limitations, we propose a Pareto Frontier-based Multi-field Personalized Calibration (PF-MPC) method which formulates multi-field calibration as a multi-objective optimization problem. PF-MPC identifies the optimal Pareto-efficient weight combinations to balance the conflicting calibration errors across different fields. We evaluate PF-MPC on both public calibration benchmark and a large-scale industrial dataset. Experimental results demonstrate that our method achieves significant improvements in calibration performance compared to existing approaches.
In this work, we present a new random sampling method for data streams where the probability of an element's inclusion in the sample is proportional to a weight associated with that element. Our method is based on sampling with replacement, although most of the literature on this topic has focused on sampling without replacement. Our algorithm generates a weighted random sample in one pass over a population of unknown size. At any point in time, the sample is representative of the population seen so far and can be directly used by other modules without requiring any post-processing. We formally prove the correctness and efficiency of our method. An experimental analysis shows the performance of our method in practice when compared to state-of-the-art methods.
Graph anomaly detection (GAD), which aims to identify abnormal nodes that deviate from the majority, has become increasingly important in high-stakes Web domains. However, existing GAD methods follow a ''one model per dataset'' paradigm, leading to high computational costs, substantial data demands, and poor generalization when transferred to new datasets. This calls for a foundation model that enables a ''one-for-all'' GAD solution capable of detecting anomalies across diverse graphs without retraining. Yet, achieving this is challenging due to the large structural and feature heterogeneity across domains. In this paper, we propose TFM4GAD, a simple yet effective framework that adapts tabular foundation models (TFMs) for graph anomaly detection. Our key insight is that the core challenges of foundation GAD, handling heterogeneous features, generalizing across domains, and operating with scarce labels, are the exact problems that modern TFMs are designed to solve via synthetic pre-training and powerful in-context learning. The primary challenge thus becomes structural: TFMs are agnostic to graph topology. TFM4GAD bridges this gap by ''flattening'' the graph, constructing an augmented feature table that enriches raw node features with Laplacian embeddings, local and global structural characteristics, and anomaly-sensitive neighborhood aggregations. This augmented table is processed by a TFM in a fully in-context regime. Extensive experiments on multiple datasets with various TFM backbones reveal that TFM4GAD surprisingly achieves significant performance gains over specialized GAD models trained from scratch. Our work offers a new perspective and a practical paradigm for leveraging TFMs as powerful, generalist graph anomaly detectors.
User behavior on social media---from scrolling and viewing to liking, reposting, and posting---yet most research relies on self-reports that obscure fine-grained usage patterns. We analyze high-resolution activity logs from 209 U.S. X (Twitter) users tracked over four weeks to identify distinct behavioral profiles based on session-level features. Latent profile analysis reveals three groups---interactors (32.52%), lurkers (60.45%), and creators (7.03%) that differ in engagement intensity, demographics, and content exposure. Interactors and lurkers skew younger and Democratic, whereas creators skew older and more Republican, consuming more ideological and low-credibility content. These results link behavioral heterogeneity to systematically different information environments and suggest that platform interventions may operate unevenly across user types. Our findings demonstrate the value of log-based behavioral segmentation for understanding online participation and motivate profile-aware platform governance and content moderation strategies.
Recent advances in clinical prediction leverage large language models (LLMs) to extract semantic information from Electronic Health Records (EHRs). However, LLMs could produce biased or hallucinated responses camouflaged by their fluency and realistic appearance, which is unacceptable in diagnosis prediction. Uncertainty estimation (UE) has emerged as an effective approach to address this challenge by quantifying hallucination levels and prediction confidence in LLM outputs. Yet, directly determining diagnosis predictions based on UE remains insufficient, as diagnoses with high uncertainty may still correspond to correct outcomes. To this end, we propose ULoR, an uncertainty-aware leave-one-out refinement framework for reliable diagnosis prediction. Specifically, we first compute the UE scores by integrating statistical information from multiple samples of the model's diagnosis ranking distributions and leverage these scores for initial predictions. Then, guided by the leave-one-out strategy, we construct multiple-choice tasks for high-uncertainty diagnoses using external syndrome knowledge and fine-tune the refinement component to resolve them, thereby confirming or replacing uncertain predictions. Extensive experiments on two real-world EHR datasets demonstrate that ULoR consistently outperforms state-of-the-art baselines, showcasing its practical utility in real-world clinical settings.