e-ISSN: Pending

Browse the failure-mode index

744 real negative results, null findings, and replication failures in Computer Science. Search the index →

WASTE indexes published research — it does not host or republish full papers. Each entry is a metadata record compiled from open scholarly databases; the abstract is shown in full only where the paper is openly licensed, otherwise a short excerpt under fair use. Classifications are automated and approximate.

Negative / Null Result ReportOpen accessComputer Science

Hyperparameters in Continual Learning: A Reality Check

Sungmin Cha, Kyunghyun Cho · 2024 · arXiv

Continual learning (CL) aims to train a model on a sequence of tasks (i.e., a CL scenario) while balancing the trade-off between plasticity (learning new tasks) and stability (retaining prior knowledge). The dominantly adopted conventional evaluation protocol for CL algorithms selects the best hyperparameters (e.g., learning rate, mini-batch size, regularization strengths, etc.) within a given scenario and then evaluates the algorithms using these hyperparameters in the same scenario. However, this protocol has significant shortcomings: it overestimates the CL capacity of algorithms and relies

View details →
Null DatasetOpen accessComputer Science

Data Transmissions in Blockchain enabled AGVs

Junhan Liu, Shile Liu, Chenming Xu et al. · 2023 · arXiv

Automated Guided Vehicles (AGVs) operate in synergy to execute specific tasks. These vehicles exchange information to ensure seamless collaboration, prevent collisions, and eliminate task redundancy. The advent of blockchain technology offers a promising avenue for establishing a secure and dependable communication infrastructure for AGVs. Nonetheless, it becomes imperative for AGVs to adopt efficient data transmission methodologies, especially when interacting with the dynamic nature of blockchain infrastructure where data undergoes frequent modifications. In the present study, we introduce a

View details →
Negative / Null Result ReportOpen accessComputer Science

Towards reproducible machine learning-based process monitoring and quality prediction research for additive manufacturing

Jiarui Xie, Mutahar Safdar, Andrei Mircea et al. · 2024 · arXiv

Machine learning (ML)-based cyber-physical systems (CPSs) have been extensively developed to improve the print quality of additive manufacturing (AM). However, the reproducibility of these systems, as presented in published research, has not been thoroughly investigated due to a lack of formal evaluation methods. Reproducibility, a critical component of trustworthy artificial intelligence, is achieved when an independent team can replicate the findings or artifacts of a study using a different experimental setup and achieve comparable performance. In many publications, critical information nec

View details →
Negative / Null Result ReportOpen accessComputer Science

Dissecting Role Cognition in Medical LLMs via Neuronal Ablation

Xun Liang, Huayi Lai, Hanyu Wang et al. · 2025 · arXiv

Large language models (LLMs) have gained significant traction in medical decision support systems, particularly in the context of medical question answering and role-playing simulations. A common practice, Prompt-Based Role Playing (PBRP), instructs models to adopt different clinical roles (e.g., medical students, residents, attending physicians) to simulate varied professional behaviors. However, the impact of such role prompts on model reasoning capabilities remains unclear. This study introduces the RP-Neuron-Activated Evaluation Framework(RPNA) to evaluate whether role prompts induce disti

View details →
Negative / Null Result ReportOpen accessComputer Science

Human Preferences in Large Language Model Latent Space: A Technical Analysis on the Reliability of Synthetic Data in Voting Outcome Prediction

Sarah Ball, Simeon Allmendinger, Frauke Kreuter et al. · 2025 · arXiv

Generative AI (GenAI) is increasingly used in survey contexts to simulate human preferences. While many research endeavors evaluate the quality of synthetic GenAI data by comparing model-generated responses to gold-standard survey results, fundamental questions about the validity and reliability of using LLMs as substitutes for human respondents remain. Our study provides a technical analysis of how demographic attributes and prompt variations influence latent opinion mappings in large language models (LLMs) and evaluates their suitability for survey-based predictions. Using 14 different model

View details →
Negative / Null Result ReportOpen accessComputer Science

An Eye on Clinical BERT: Investigating Language Model Generalization for Diabetic Eye Disease Phenotyping

Keith Harrigian, Tina Tang, Anthony Gonzales et al. · 2023 · arXiv

Diabetic eye disease is a major cause of blindness worldwide. The ability to monitor relevant clinical trajectories and detect lapses in care is critical to managing the disease and preventing blindness. Alas, much of the information necessary to support these goals is found only in the free text of the electronic medical record. To fill this information gap, we introduce a system for extracting evidence from clinical text of 19 clinical concepts related to diabetic eye disease and inferring relevant attributes for each. In developing this ophthalmology phenotyping system, we are also afforded

View details →
Negative / Null Result ReportOpen accessComputer Science

RILe: Reinforced Imitation Learning

Mert Albaba, Sammy Christen, Thomas Langarek et al. · 2024 · arXiv

Acquiring complex behaviors is essential for artificially intelligent agents, yet learning these behaviors in high-dimensional settings poses a significant challenge due to the vast search space. Traditional reinforcement learning (RL) requires extensive manual effort for reward function engineering. Inverse reinforcement learning (IRL) uncovers reward functions from expert demonstrations but relies on an iterative process that is often computationally expensive. Imitation learning (IL) provides a more efficient alternative by directly comparing an agent's actions to expert demonstrations; how

View details →
Failed Experiment ReportOpen accessComputer Science

How to Improve Top Tagging

Tilman Plehn, Michael Spannowsky, Michihisa Takeuchi · 2011 · arXiv

In time for the first tests on LHC data we introduce a set of improvements and tests of purely kinematic top tagging algorithms. First, we show how different jet algorithms can be used for different transverse momentum regimes. Combining pruning and filtering in the reconstruction can enhance the signal over background ratio significantly, while larger jet radii only give minor improvements. Finally, bottom tagging can be added to the top tagger, but at least for the HEPTopTagger does not improve the kinematic selection algorithm.

View details →
Methods Dead-EndOpen accessComputer Science

LuMon: A Comprehensive Benchmark and Development Suite with Novel Datasets for Lunar Monocular Depth Estimation

Aytaç Sekmen, Fatih Emre Gunes, Furkan Horoz et al. · 2026 · arXiv

Monocular Depth Estimation (MDE) is crucial for autonomous lunar rover navigation using electro-optical cameras. However, deploying terrestrial MDE networks to the Moon brings a severe domain gap due to harsh shadows, textureless regolith, and zero atmospheric scattering. Existing evaluations rely on analogs that fail to replicate these conditions and lack actual metric ground truth. To address this, we present LuMon, a comprehensive benchmarking framework to evaluate MDE methods for lunar exploration. We introduce novel datasets featuring high-quality stereo ground truth depth from the real C

View details →
Negative / Null Result ReportOpen accessComputer Science

Turning Waste into Wealth: Leveraging Low-Quality Samples for Enhancing Continuous Conditional Generative Adversarial Networks

Xin Ding, Yongwei Wang, Zuheng Xu · 2023 · arXiv

Continuous Conditional Generative Adversarial Networks (CcGANs) enable generative modeling conditional on continuous scalar variables (termed regression labels). However, they can produce subpar fake images due to limited training data. Although Negative Data Augmentation (NDA) effectively enhances unconditional and class-conditional GANs by introducing anomalies into real training images, guiding the GANs away from low-quality outputs, its impact on CcGANs is limited, as it fails to replicate negative samples that may occur during the CcGAN sampling. We present a novel NDA approach called Dua

View details →
Negative / Null Result ReportOpen accessComputer Science

A Replicability Study of XTR

Rohan Jha, Reno Kriz, Benjamin Van Durme · 2026 · arXiv

The XTR (conteXtual Token Retrieval) algorithm is a modification to ColBERT retrieval that avoids the costly step of fully gathering and reranking the candidates' embeddings by imputing their missing similarity scores from the initial token retrieval step. The original work proposes a modified training objective as necessary for effective XTR retrieval, arguing that standard ColBERT token scoring is unsuitable for imputation. In this paper, we replicate both the XTR retrieval algorithm and its modified training objective, and extend the evaluation to knowledge-distillation (KD) training and ef

View details →
Negative / Null Result ReportOpen accessComputer Science

A Personalized Data-Driven Generative Model of Human Repetitive Motion

Angelo Di Porzio, Marco Coraggio · 2025 · arXiv

The deployment of autonomous virtual avatars (in extended reality) and robots in human group activities -- such as rehabilitation therapy, sports, and manufacturing -- is expected to increase as these technologies become more pervasive. Designing cognitive architectures and control strategies to drive these agents requires realistic models of human motion. Furthermore, recent research has shown that each person exhibits a unique velocity signature, highlighting how individual motor behaviors are both rich in variability and internally consistent. However, existing models only provide simplifie

View details →
Negative / Null Result ReportOpen accessComputer Science

The Devil is in Fine-tuning and Long-tailed Problems:A New Benchmark for Scene Text Detection

Tianjiao Cao, Jiahao Lyu, Weichao Zeng et al. · 2025 · arXiv

Scene text detection has seen the emergence of high-performing methods that excel on academic benchmarks. However, these detectors often fail to replicate such success in real-world scenarios. We uncover two key factors contributing to this discrepancy through extensive experiments. First, a \textit{Fine-tuning Gap}, where models leverage \textit{Dataset-Specific Optimization} (DSO) paradigm for one domain at the cost of reduced effectiveness in others, leads to inflated performances on academic benchmarks. Second, the suboptimal performance in practical settings is primarily attributed to the

View details →
Negative / Null Result ReportOpen accessComputer Science

Nuclear Data Adjustment for Nonlinear Applications in the OECD/NEA WPNCS SG14 Benchmark -- A Bayesian Inverse UQ-based Approach for Data Assimilation

Christopher Brady, Xu Wu · 2025 · arXiv

The Organization for Economic Cooperation and Development (OECD) Working Party on Nuclear Criticality Safety (WPNCS) proposed a benchmark exercise to assess the performance of current nuclear data adjustment techniques applied to nonlinear applications and experiments with low correlation to applications. This work introduces Bayesian Inverse Uncertainty Quantification (IUQ) as a method for nuclear data adjustments in this benchmark, and compares IUQ to the more traditional methods of Generalized Linear Least Squares (GLLS) and Monte Carlo Bayes (MOCABA). Posterior predictions from IUQ showed

View details →
Negative / Null Result ReportOpen accessComputer Science

Beyond Temperature: Hyperfitting as a Late-Stage Geometric Expansion

Meimingwei Li, Yuanhao Ding, Esteban Garces Arias et al. · 2026 · arXiv

Recent work has identified a counterintuitive phenomenon termed "Hyperfitting", where fine-tuning Large Language Models (LLMs) to near-zero training loss on small datasets surprisingly enhances open-ended generation quality and mitigates repetition in greedy decoding. While effective, the underlying mechanism remains poorly understood, with the extremely low-entropy output distributions suggesting a potential equivalence to simple temperature scaling. In this work, we demonstrate that this phenomenon is fundamentally distinct from distribution sharpening; entropy-matched control experiments re

View details →
Negative / Null Result ReportOpen accessComputer Science

Beyond Geometry: Artistic Disparity Synthesis for Immersive 2D-to-3D

Ping Chen, Zezhou Chen, Xingpeng Zhang et al. · 2026 · arXiv

Current 2D-to-3D conversion methods achieve geometric accuracy but are artistically deficient, failing to replicate the immersive and emotionally resonant experience of professional 3D cinema. This is because geometric reconstruction paradigms mistake deliberate artistic intent, such as strategic zero-plane shifts for pop-out effects and local depth sculpting, for data noise or ambiguity. This paper argues for a new paradigm: Artistic Disparity Synthesis, shifting the goal from physically accurate disparity estimation to artistically coherent disparity synthesis. We propose Art3D, a preliminar

View details →
Negative / Null Result ReportOpen accessComputer Science

PUB: An LLM-Enhanced Personality-Driven User Behaviour Simulator for Recommender System Evaluation

Chenglong Ma, Ziqi Xu, Yongli Ren et al. · 2025 · arXiv

Traditional offline evaluation methods for recommender systems struggle to capture the complexity of modern platforms due to sparse behavioural signals, noisy data, and limited modelling of user personality traits. While simulation frameworks can generate synthetic data to address these gaps, existing methods fail to replicate behavioural diversity, limiting their effectiveness. To overcome these challenges, we propose the Personality-driven User Behaviour Simulator (PUB), an LLM-based simulation framework that integrates the Big Five personality traits to model personalised user behaviour. PU

View details →
Negative / Null Result ReportOpen accessComputer Science

Disturbance-Injected Robust Imitation Learning with Task Achievement

Hirotaka Tahara, Hikaru Sasaki, Hanbit Oh et al. · 2022 · arXiv

Robust imitation learning using disturbance injections overcomes issues of limited variation in demonstrations. However, these methods assume demonstrations are optimal, and that policy stabilization can be learned via simple augmentations. In real-world scenarios, demonstrations are often of diverse-quality, and disturbance injection instead learns sub-optimal policies that fail to replicate desired behavior. To address this issue, this paper proposes a novel imitation learning framework that combines both policy robustification and optimal demonstration learning. Specifically, this combinato

View details →
Negative / Null Result ReportOpen accessComputer Science

Neutral evolution and turnover over centuries of English word popularity

Damian Ruck, R. Alexander Bentley, Alberto Acerbi et al. · 2017 · arXiv

Here we test Neutral models against the evolution of English word frequency and vocabulary at the population scale, as recorded in annual word frequencies from three centuries of English language books. Against these data, we test both static and dynamic predictions of two neutral models, including the relation between corpus size and vocabulary size, frequency distributions, and turnover within those frequency distributions. Although a commonly used Neutral model fails to replicate all these emergent properties at once, we find that modified two-stage Neutral model does replicate the static a

View details →
Negative / Null Result ReportOpen accessComputer Science

Interview-Informed Generative Agents for Product Discovery: A Validation Study

Zichao Wang, Alexa Siu · 2026 · arXiv

Large language models (LLMs) have shown strong performance on standardized social science instruments, but their value for product discovery remains unclear. We investigate whether interview-informed generative agents can simulate user responses in concept testing scenarios. Using in-depth workflow interviews with knowledge workers, we created personalized agents and compared their evaluations of novel AI concepts against the same participants' responses. Our results show that agents are distribution-calibrated but identity-imprecise: they fail to replicate the specific individual they are gro

View details →
Negative / Null Result ReportOpen accessComputer Science

Somatic in the East, Psychological in the West?: Investigating Clinically-Grounded Cross-Cultural Depression Symptom Expression in LLMs

Shintaro Sakai, Jisun An, Migyeong Kang et al. · 2025 · arXiv

Prior clinical psychology research shows that Western individuals with depression tend to report psychological symptoms, while Eastern individuals report somatic ones. We test whether Large Language Models (LLMs), which are increasingly used in mental health, reproduce these cultural patterns by prompting them with Western or Eastern personas. Results show that LLMs largely fail to replicate the patterns when prompted in English, though prompting in major Eastern languages (i.e., Chinese, Japanese, and Hindi) improves alignment in several configurations. Our analysis pinpoints two key reasons

View details →
Negative / Null Result ReportOpen accessComputer Science

Framing Effects on Privacy Concerns about a Home Telepresence Robot

Matthew Rueben, Frank J. Bernieri, Cindy M. Grimm et al. · 2019 · arXiv

Privacy-sensitive robotics is an emerging area of HRI research. Judgments about privacy would seem to be context-dependent, but none of the promising work on contextual "frames" has focused on privacy concerns. This work studies the impact of contextual "frames" on local users' privacy judgments in a home telepresence setting. Our methodology consists of using an online questionnaire to collect responses to animated videos of a telepresence robot after framing people with an introductory paragraph. The results of four studies indicate a large effect of manipulating the robot operator's identit

View details →
Negative / Null Result ReportOpen accessComputer Science

Markov-modulated on/off processes for long-range dependent internet traffic

Richard G. Clegg · 2006 · arXiv

The aim of this paper is to use a very simple queuing model to compare a number of models from the literature which have been used to replicate the statistical nature of internet traffic and, in particular, the long-range dependence of this traffic. The four models all have the form of discrete time Markov-modulated processes (two other models are introduced for comparison purposes). While it is often stated that long-range dependence has a critical effect on queuing performance, it appears that the models used here do not well replicated the queuing performance of real internet traffic. In pa

View details →
Negative / Null Result ReportOpen accessComputer Science

Area is all you need: repeatable elements make stronger adversarial attacks

Dillon Niederhut · 2023 · arXiv

Over the last decade, deep neural networks have achieved state of the art in computer vision tasks. These models, however, are susceptible to unusual inputs, known as adversarial examples, that cause them to misclassify or otherwise fail to detect objects. Here, we provide evidence that the increasing success of adversarial attacks is primarily due to increasing their size. We then demonstrate a method for generating the largest possible adversarial patch by building a adversarial pattern out of repeatable elements. This approach achieves a new state of the art in evading detection by YOLOv2 a

View details →
Negative / Null Result ReportOpen accessComputer Science

Classical Simulation of Non-Classical Systems: A Large Deviation Analysis

Adam Brandenburger, Pierfrancesco La Mura · 2025 · arXiv

Any quasi-probability representation of a no-signaling system -- including quantum systems -- can be simulated via a purely classical scheme by allowing signed events and a cancellation procedure. This raises a fundamental question: What properties of the non-classical system does such a classical simulation fail to replicate? We answer by using large deviation theory to show that the probability of a large fluctuation under the classical simulation can be strictly greater than under the actual non-classical system. The key finding driving our result is that negativity in probability relaxes t

View details →
Negative / Null Result ReportOpen accessComputer Science

CogniPlay: a work-in-progress Human-like model for General Game Playing

Aloïs Rautureau, Éric Piette · 2025 · arXiv

While AI systems have equaled or surpassed human performance in a wide variety of games such as Chess, Go, or Dota 2, describing these systems as truly "human-like" remains far-fetched. Despite their success, they fail to replicate the pattern-based, intuitive decision-making processes observed in human cognition. This paper presents an overview of findings from cognitive psychology and previous efforts to model human-like behavior in artificial agents, discusses their applicability to General Game Playing (GGP) and introduces our work-in-progress model based on these observations: CogniPlay.

View details →
Negative / Null Result ReportOpen accessComputer Science

Renyi Differential Privacy of the Subsampled Shuffle Model in Distributed Learning

Antonious M. Girgis, Deepesh Data, Suhas Diggavi · 2021 · arXiv

We study privacy in a distributed learning framework, where clients collaboratively build a learning model iteratively through interactions with a server from whom we need privacy. Motivated by stochastic optimization and the federated learning (FL) paradigm, we focus on the case where a small fraction of data samples are randomly sub-sampled in each round to participate in the learning process, which also enables privacy amplification. To obtain even stronger local privacy guarantees, we study this in the shuffle privacy model, where each client randomizes its response using a local different

View details →
Negative / Null Result ReportOpen accessComputer Science

Testing operational phase concepts in quantum optics

J. Rehacek, Z. Hradil, M. Dusek et al. · 1999 · arXiv

An experimental comparison of several operational phase concepts is presented. In particular, it is shown that statistically motivated evaluation of experimental data may lead to a significant improvement in phase fitting upon the conventional Noh, Fouge'res and Mandel procedure. The analysis is extended to the asymptotic limit of large intensities, where a strong evidence in favor of multi--dimensional estimation procedures has been found.

View details →
Negative / Null Result ReportOpen accessComputer Science

Reliability of Large Language Model Generated Clinical Reasoning in Assisted Reproductive Technology: Blinded Comparative Evaluation Study

Dou Liu, Ying Long, Sophia Zuoqiu et al. · 2025 · arXiv

Creating high-quality clinical Chains-of-Thought (CoTs) is crucial for explainable medical Artificial Intelligence (AI) while constrained by data scarcity. Although Large Language Models (LLMs) can synthesize medical data, their clinical reliability remains unverified. This study evaluates the reliability of LLM-generated CoTs and investigates prompting strategies to enhance their quality. In a blinded comparative study, senior clinicians in Assisted Reproductive Technology (ART) evaluated CoTs generated via three distinct strategies: Zero-shot, Random Few-shot (using shallow examples), and Se

View details →
Negative / Null Result ReportOpen accessComputer Science

Validity of common modelling approximations for precessing binary black holes with higher-order modes

Antoni Ramos-Buades, Patricia Schmidt, Geraint Pratten et al. · 2020 · arXiv

The current paradigm for constructing waveforms from precessing compact binaries is to first construct a waveform in a non-inertial, co-precessing binary source frame followed by a time-dependent rotation to map back to the physical, inertial frame. A key insight in the construction of these models is that the co-precessing waveform can be effectively mapped to some equivalent aligned spin waveform. Secondly, the time-dependent rotation implicitly introduces $m$-mode mixing, necessitating an accurate description of higher-order modes in the co-precessing frame. We assess the efficacy of this m

View details →