Rishabh Upadhyay

Rishabh Upadhyay

Auto-generated profile, based on publicly available information

Rishabh Upadhyay

University of Milano-Bicocca

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 July 2022 in Multimedia Tools and Applications
Verified
Journal Article
Open access
PDF file
RURishabh Upadhyay
Rishabh Upadhyay
Gabriella PasiGabriella Pasi
Gabriella Pasi
Marco VivianiMarco Viviani
Marco Viviani
Research aimed at finding solutions to the problem of the diffusion of distinct forms of non-genuine information online across multiple domains has attracted growing interest in recent years, from opinion spam to fake news detection. Currently, partly due to the COVID-19 virus outbreak and the subsequent proliferation of unfounded claims and highly biased content, attention has focused on developing solutions that can automatically assess the genuineness of health information. Most of these approaches, applied both to Web pages and social media content, rely primarily on the use of handcrafted features in conjunction with Machine Learning. In this article, instead, we propose a health misinformation detection model that exploits as features the embedded representations of some structural and content characteristics of Web pages, which are obtained using an embedding model pre-trained on medical data. Such features are employed within a deep learning classification model, which categorizes genuine health information versus health misinformation. The purpose of this article is therefore to evaluate the effectiveness of the proposed model, namely Vec4Cred, with respect to the problem considered. This model represents an evolution of a previous one, with respect to which new features and architectural choices have been considered and illustrated in this work.





6 November 2026
Verified
Conference Paper
Open access
ARAnup Roy
Anup Roy
RURishabh Gyanendra Upadhyay
Rishabh Gyanendra Upadhyay
AMAidan Philip Millar
Aidan Philip Millar
LMLarry Murray
Larry Murray
RMRobin Mills
Robin Mills
Long-running LLM agents are increasingly considered for regulated, high-consequence domains such as finance, compliance, and audit, where memory must be accurate, traceable, replayable, and inspectable after a decision. Existing agent-memory systems often invoke an LLM during maintenance operations such as fact extraction, consolidation, updating, summarization, and forgetting. Although effective, this design makes it harder to reconstruct why a memory existed, changed, or was removed at a particular point in time. We present PyRAMIND (Pyramidal Retention with Arithmetic Memory for Inference-time Determinism), an auditable memory architecture in which write consolidation, reinforcement, forgetting, tier promotion, and retrieval scoring are closed-form arithmetic over cached embeddings. Only optional entity tagging at ingest and answer generation at query time call an external LLM. Given fixed embeddings, cached boundary-model outputs, parameters, and software, each maintenance transition is replayable from ordered inputs. PyRAMIND stores memories in a four-tier Pyramid (raw →facts →themes→worldview) and ranks them with a max-ensemble retention score modulated by local semantic density. Under a matched harness, PyRAMIND achieves competitive accuracy on long-horizon memory tasks (0.93 on LongMemEval-S) despite eliminating LLM calls from the memory-maintenance path, while reducing memory-lifecycle token expenditure to 1.4k LLM tokens per turn versus 3.1k for reproduced Mem0 OSS and 4.2k for Zep v3. Performance is weaker on temporal and multi-hop reasoning tasks (0.62 on LoCoMo), highlighting the continued value of richer relational memory structures for compositional reasoning. These results suggest that strong long-term memory performance is possible without LLM-mediated maintenance, and motivate future replayable memory systems that add temporal and relational structure while preserving auditable deterministic maintenance.