e-ISSN: Pending

Browse the failure-mode index

20,240 real negative results, null findings, and replication failures · Negative / Null Result Report. 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

Addressing Climate Action Misperceptions with Generative AI

Miriam Remshard, Yara Kyrychenko, Sander van der Linden et al. · 2026 · arXiv

Mitigating climate change requires behaviour change. However, even climate-concerned individuals often hold misperceptions about which actions most reduce carbon emissions. We recruited 1201 climate-concerned individuals to examine whether discussing climate actions with a large language model (LLM) equipped with climate knowledge and prompted to provide personalised responses would foster more accurate perceptions of the impacts of climate actions and increase willingness to adopt feasible, high-impact behaviours. We compared this to having participants run a web search, have a conversation w

View details →
Negative / Null Result ReportOpen accessEngineering

3D deformable registration of longitudinal abdominopelvic CT images using unsupervised deep learning

Maureen van Eijnatten, Leonardo Rundo, K. Joost Batenburg et al. · 2020 · arXiv

This study investigates the use of the unsupervised deep learning framework VoxelMorph for deformable registration of longitudinal abdominopelvic CT images acquired in patients with bone metastases from breast cancer. The CT images were refined prior to registration by automatically removing the CT table and all other extra-corporeal components. To improve the learning capabilities of VoxelMorph when only a limited amount of training data is available, a novel incremental training strategy is proposed based on simulated deformations of consecutive CT images. In a 4-fold cross-validation scheme

View details →
Negative / Null Result ReportOpen accessAgricultural and Biological Sciences

Feature interpretability in BCIs: exploring the role of network lateralization

Juliana Gonzalez-Astudillo, Fabrizio De Vico Fallani · 2024 · arXiv

Brain-computer interfaces (BCIs) enable users to interact with the external world using brain activity. Despite their potential in neuroscience and industry, BCI performance remains inconsistent in noninvasive applications, often prioritizing algorithms that achieve high classification accuracies while masking the neural mechanisms driving that performance. In this study, we investigated the interpretability of features derived from brain network lateralization, benchmarking against widely used techniques like power spectrum density (PSD), common spatial pattern (CSP), and Riemannian geometry.

View details →
Negative / Null Result ReportOpen accessComputer Science

Algorithmic Tradeoffs, Applied NLP, and the State-of-the-Art Fallacy

AJ Alvero, Ruohong Dong, Klint Kanopka et al. · 2025 · arXiv

Computational sociology is growing in popularity, yet the analytic tools employed differ widely in power, transparency, and interpretability. In computer science, methods gain popularity after surpassing benchmarks of predictive accuracy, becoming the "state of the art." Computer scientists favor novelty and innovation for different reasons, but prioritizing technical prestige over methodological fit could unintentionally limit the scope of sociological inquiry. To illustrate, we focus on computational text analysis and revisit a prior study of college admissions essays, comparing analyses wit

View details →
Negative / Null Result ReportOpen accessEconomics, Econometrics and Finance

Informer in Algorithmic Investment Strategies on High Frequency Bitcoin Data

Filip Stefaniuk, Robert Ślepaczuk · 2025 · arXiv

The article investigates the usage of Informer architecture for building automated trading strategies for high frequency Bitcoin data. Three strategies using Informer model with different loss functions: Root Mean Squared Error (RMSE), Generalized Mean Absolute Directional Loss (GMADL) and Quantile loss, are proposed and evaluated against the Buy and Hold benchmark and two benchmark strategies based on technical indicators. The evaluation is conducted using data of various frequencies: 5 minute, 15 minute, and 30 minute intervals, over the 6 different periods. Although the Informer-based model

View details →
Negative / Null Result ReportOpen accessComputer Science

Active Learning of Molecular Data for Task-Specific Objectives

Kunal Ghosh, Milica Todorović, Aki Vehtari et al. · 2024 · arXiv

Active learning (AL) has shown promise for being a particularly data-efficient machine learning approach. Yet, its performance depends on the application and it is not clear when AL practitioners can expect computational savings. Here, we carry out a systematic AL performance assessment for three diverse molecular datasets and two common scientific tasks: compiling compact, informative datasets and targeted molecular searches. We implemented AL with Gaussian processes (GP) and used the many-body tensor as molecular representation. For the first task, we tested different data acquisition strate

View details →
Negative / Null Result ReportOpen accessComputer Science

When LLMs fall short in Deductive Coding: Model Comparison and Human AI Collaboration Workflow Design

Zijian Li, Luzhen Tang, Mengyu Xia et al. · 2025 · arXiv

With generative artificial intelligence driving the growth of dialogic data in education, automated coding is a promising direction for learning analytics to improve efficiency. This surge highlights the need to understand the nuances of student-AI interactions, especially those rare yet crucial. However, automated coding may struggle to capture these rare codes due to imbalanced data, while human coding remains time-consuming and labour-intensive. The current study examined the potential of large language models (LLMs) to approximate or replace humans in deductive, theory-driven coding, while

View details →
Negative / Null Result ReportOpen accessComputer Science

Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks

Konstantinos Voudouris, Andrew Barron, Marta Halina et al. · 2025 · arXiv

Transitional accounts of evolution emphasise a few changes that shape what is evolvable, with dramatic consequences for derived lineages. More recently it has been proposed that cognition might also have evolved via a series of major transitions that manipulate the structure of biological neural networks, fundamentally changing the flow of information. We used idealised models of information flow, artificial neural networks (ANNs), to evaluate whether changes in information flow in a network can yield a transitional change in cognitive performance. We compared networks with feed-forward, recur

View details →
Negative / Null Result ReportOpen accessComputer Science

Improve SAT-solving with Machine Learning

Haoze Wu · 2017 · arXiv

In this project, we aimed to improve the runtime of Minisat, a Conflict-Driven Clause Learning (CDCL) solver that solves the Propositional Boolean Satisfiability (SAT) problem. We first used a logistic regression model to predict the satisfiability of propositional boolean formulae after fixing the values of a certain fraction of the variables in each formula. We then applied the logistic model and added a preprocessing period to Minisat to determine the preferable initial value (either true or false) of each boolean variable using a Monte-Carlo approach. Concretely, for each Monte-Carlo trial

View details →
Negative / Null Result ReportOpen accessComputer Science

Cross-lingual robustness of LLM-brain alignment and its computational roots

Ni Yang, Rui He, Philipp Homan et al. · 2026 · arXiv

Large language models (LLMs) reliably predict neural activity during language comprehension and transformer depth has been interpreted as mirroring hierarchical cortical organization. However, it remains unclear whether such alignment extends to subcortical regions, overlaps spatially across languages, and what the computational roots of such alignment are. Here, we used a multilingual, whole-brain encoding framework to examine brain-LLM alignment across three typologically distinct languages: Mandarin, English, and French during naturalistic story listening. Our results show that across langu

View details →
Negative / Null Result ReportOpen accessEngineering

On The Synergy Between Nonconvex Extensions of The Tensor Nuclear Norm for Tensor Recovery

Kaito Hosono, Shunsuke Ono, Takamichi Miyata · 2020 · arXiv

Low-rank tensor recovery has attracted much attention among various tensor recovery approaches. A tensor rank has several definitions, unlike the matrix rank--e.g. the CP rank and the Tucker rank. Many low-rank tensor recovery methods are focused on the Tucker rank. Since the Tucker rank is nonconvex and discontinuous, many relaxations of the Tucker rank have been proposed, e.g., the tensor nuclear norm, weighted tensor nuclear norm, and weighted tensor Schatten-$p$ norm. In particular, the weighted tensor Schatten-p norm has two parameters, the weight and $p$, and the tensor nuclear norm and

View details →
Negative / Null Result ReportOpen accessComputer Science

Reducing Biases towards Minoritized Populations in Medical Curricular Content via Artificial Intelligence for Fairer Health Outcomes

Chiman Salavati, Shannon Song, Willmar Sosa Diaz et al. · 2024 · arXiv

Biased information (recently termed bisinformation) continues to be taught in medical curricula, often long after having been debunked. In this paper, we introduce BRICC, a firstin-class initiative that seeks to mitigate medical bisinformation using machine learning to systematically identify and flag text with potential biases, for subsequent review in an expert-in-the-loop fashion, thus greatly accelerating an otherwise labor-intensive process. A gold-standard BRICC dataset was developed throughout several years, and contains over 12K pages of instructional materials. Medical experts meticul

View details →
Negative / Null Result ReportOpen accessComputer Science

Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them

Mirac Suzgun, Nathan Scales, Nathanael Schärli et al. · 2022 · arXiv

BIG-Bench (Srivastava et al., 2022) is a diverse evaluation suite that focuses on tasks believed to be beyond the capabilities of current language models. Language models have already made good progress on this benchmark, with the best model in the BIG-Bench paper outperforming average reported human-rater results on 65% of the BIG-Bench tasks via few-shot prompting. But on what tasks do language models fall short of average human-rater performance, and are those tasks actually unsolvable by current language models? In this work, we focus on a suite of 23 challenging BIG-Bench tasks which we c

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

Exploring the limits of Hierarchical World Models in Reinforcement Learning

Robin Schiewer, Anand Subramoney, Laurenz Wiskott · 2024 · arXiv

Hierarchical model-based reinforcement learning (HMBRL) aims to combine the benefits of better sample efficiency of model based reinforcement learning (MBRL) with the abstraction capability of hierarchical reinforcement learning (HRL) to solve complex tasks efficiently. While HMBRL has great potential, it still lacks wide adoption. In this work we describe a novel HMBRL framework and evaluate it thoroughly. To complement the multi-layered decision making idiom characteristic for HRL, we construct hierarchical world models that simulate environment dynamics at various levels of temporal abstrac

View details →
Negative / Null Result ReportOpen accessComputer Science

TSA-WF: Exploring the Effectiveness of Time Series Analysis for Website Fingerprinting

Michael Wrana, Uzma Maroof, Diogo Barradas · 2025 · arXiv

Website fingerprinting (WF) is a technique that allows an eavesdropper to determine the website a target user is accessing by inspecting the metadata associated with the packets she exchanges via some encrypted tunnel, e.g., Tor. Recent WF attacks built using machine learning (and deep learning) process and summarize trace metadata during their feature extraction phases. This methodology leads to predictions that lack information about the instant at which a given website is detected within a (potentially large) network trace comprised of multiple sequential website accesses -- a setting known

View details →
Negative / Null Result ReportOpen accessComputer Science

Min-p, Max Exaggeration: A Critical Analysis of Min-p Sampling in Language Models

Rylan Schaeffer, Joshua Kazdan, Yegor Denisov-Blanch · 2025 · arXiv

Sampling from language models impacts the quality and diversity of outputs, affecting both research and real-world applications. Recently, Nguyen et al. 2024's "Turning Up the Heat: Min-p Sampling for Creative and Coherent LLM Outputs" introduced a new sampler called min-p, claiming it achieves superior quality and diversity over established samplers such as basic, top-k, and top-p sampling. The significance of these claims was underscored by the paper's recognition as the 18th highest-scoring submission to ICLR 2025 and selection for an Oral presentation. This paper conducts a comprehensive r

View details →
Negative / Null Result ReportOpen accessComputer Science

Effect of Static vs. Conversational AI-Generated Messages on Colorectal Cancer Screening Intent: a Randomized Controlled Trial

Neil K. R. Sehgal, Manuel Tonneau, Andy Tan et al. · 2025 · arXiv

Large language model (LLM) chatbots show increasing promise in persuasive communication. Yet their real-world utility remains uncertain, particularly in clinical settings where sustained conversations are difficult to scale. In a pre-registered randomized controlled trial, we enrolled 915 U.S. adults (ages 45-75) who had never completed colorectal cancer (CRC) screening. Participants were randomized to: (1) no message control, (2) expert-written patient materials, (3) single AI-generated message, or (4) a motivational interviewing chatbot. All participants were required to remain in their assi

View details →
Negative / Null Result ReportOpen accessPhysics

Binary Classification of Light and Dark Time Traces of a Transition Edge Sensor Using Convolutional Neural Networks

Elmeri Rivasto, Katharina-Sophie Isleif, Friederike Januschek et al. · 2025 · arXiv

The Any Light Particle Search II (ALPS II) is a light shining through a wall experiment probing the existence of axions and axion-like particles using a 1064 nm laser source. While ALPS II is already taking data using a heterodyne based detection scheme, cryogenic transition edge sensor (TES) based single-photon detectors are planned to expand the detection system for cross-checking the potential signals, for which a sensitivity on the order of $10^{-24}$ W is required. In order to reach this goal, we have investigated the use of convolutional neural networks (CNN) as binary classifiers to dis

View details →
Negative / Null Result ReportOpen accessEngineering

The International Workshop on Osteoarthritis Imaging Knee MRI Segmentation Challenge: A Multi-Institute Evaluation and Analysis Framework on a Standardized Dataset

Arjun D. Desai, Francesco Caliva, Claudia Iriondo et al. · 2020 · arXiv

Purpose: To organize a knee MRI segmentation challenge for characterizing the semantic and clinical efficacy of automatic segmentation methods relevant for monitoring osteoarthritis progression. Methods: A dataset partition consisting of 3D knee MRI from 88 subjects at two timepoints with ground-truth articular (femoral, tibial, patellar) cartilage and meniscus segmentations was standardized. Challenge submissions and a majority-vote ensemble were evaluated using Dice score, average symmetric surface distance, volumetric overlap error, and coefficient of variation on a hold-out test set. Simil

View details →
Negative / Null Result ReportOpen accessComputer Science

MedNet-PVS: A MedNeXt-Based Deep Learning Model for Automated Segmentation of Perivascular Spaces

Zhen Xuen Brandon Low, Rory Zhang, Hang Min et al. · 2025 · arXiv

Enlarged perivascular spaces (PVS) are increasingly recognized as biomarkers of cerebral small vessel disease, Alzheimer's disease, stroke, and aging-related neurodegeneration. However, manual segmentation of PVS is time-consuming and subject to moderate inter-rater reliability, while existing automated deep learning models have moderate performance and typically fail to generalize across diverse clinical and research MRI datasets. We adapted MedNeXt-L-k5, a Transformer-inspired 3D encoder-decoder convolutional network, for automated PVS segmentation. Two models were trained: one using a homog

View details →
Negative / Null Result ReportOpen accessComputer Science

S2-BNN: Bridging the Gap Between Self-Supervised Real and 1-bit Neural Networks via Guided Distribution Calibration

Zhiqiang Shen, Zechun Liu, Jie Qin et al. · 2021 · arXiv

Previous studies dominantly target at self-supervised learning on real-valued networks and have achieved many promising results. However, on the more challenging binary neural networks (BNNs), this task has not yet been fully explored in the community. In this paper, we focus on this more difficult scenario: learning networks where both weights and activations are binary, meanwhile, without any human annotated labels. We observe that the commonly used contrastive objective is not satisfying on BNNs for competitive accuracy, since the backbone network contains relatively limited capacity and re

View details →
Negative / Null Result ReportOpen accessComputer Science

Peer Grading in a Course on Algorithms and Data Structures: Machine Learning Algorithms do not Improve over Simple Baselines

Mehdi S. M. Sajjadi, Morteza Alamgir, Ulrike von Luxburg · 2015 · arXiv

Peer grading is the process of students reviewing each others' work, such as homework submissions, and has lately become a popular mechanism used in massive open online courses (MOOCs). Intrigued by this idea, we used it in a course on algorithms and data structures at the University of Hamburg. Throughout the whole semester, students repeatedly handed in submissions to exercises, which were then evaluated both by teaching assistants and by a peer grading mechanism, yielding a large dataset of teacher and peer grades. We applied different statistical and machine learning methods to aggregate t

View details →
Negative / Null Result ReportOpen accessComputer Science

Towards precise baryogenesis in the 2HDM$+a$

T. Gent, S. Huber, K. Mimasu et al. · 2025 · arXiv

We perform a detailed investigation of the viable baryogenesis parameter space of a non-minimal Higgs sector consisting of two Higgs doublets and a singlet pseudoscalar (2HDM$+a$). In such a model, an early Universe period of transient CP violation may occur, driven by a nonvanishing vacuum expectation value of the CP-odd scalar $a$. This naturally avoids the stringent electric dipole moment experimental constraints on beyond-the-Standard-Model sources of CP violation. We provide a state-of-art computation of the baryon asymmetry, providing several important improvements over existing baryogen

View details →
Negative / Null Result ReportOpen accessComputer Science

Coding Schemes with Rate-Limited Feedback that Improve over the Nofeedback Capacity for a Large Class of Broadcast Channels

Youlong Wu, Michèle Wigger · 2014 · arXiv

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including the class of \emph{strictly essentially less-noisy BCs} that we introduce in this article. Examples of strictly essentially less-noisy BCs are the binary symmetric BC (BSBC) or the binary erasure BC (BEBC) with unequal cross-over or erasure probabilities at the two receivers. When the feedback rates are sufficiently large, our schemes recover all previously k

View details →
Negative / Null Result ReportOpen accessPhysics

Forecasting Periods of Strong Southward Magnetic Field Following Interplanetary Shocks

T. M. Salman, N. Lugaz, C. J. Farrugia et al. · 2018 · arXiv

Long periods of strong southward magnetic fields are known to be the primary cause of intense geomagnetic storms. The majority of such events are caused by the passage over Earth of a magnetic ejecta. Irrespective of the interplanetary cause, fast-forward shocks often precede such strong southward B$_{z}$ periods. Here, we first look at all long periods of strong southward magnetic fields as well as fast-forward shocks measured by the \textit{Wind} spacecraft in a 22.4-year span. We find that 76{\%} of strong southward B$_{z}$ periods are preceded within 48 hours by at least a fast-forward sho

View details →
Negative / Null Result ReportOpen accessComputer Science

On an Improvement over Rényi's Equivocation Bound

Nandakishore Santhi, Alexander Vardy · 2006 · arXiv

We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information theory problems. In general, the exact Bayes risk can be difficult to obtain. Many upper and lower bounds are known in literature. One such upper bound is the equivocation bound due to Rényi which is of great philosophical interest because it connects the Bayes risk to conditional entropy. Here we give a simple derivation for an improved equivocation bound. We

View details →
Negative / Null Result ReportOpen accessComputer Science

Aligning to Illusions: Choice Blindness in Human and AI Feedback

Wenbin Wu · 2026 · arXiv

Reinforcement Learning from Human Feedback (RLHF) assumes annotator preferences reflect stable internal states. We challenge this through three experiments spanning the preference pipeline. In a human choice blindness study, 91% of surreptitiously swapped preferences go undetected, extending choice blindness to third-person evaluative comparison of unfamiliar text. Testing fifteen LLM judges as potential replacements, we find detection relies on shallow text matching rather than genuine self-monitoring: removing prior reasoning from context causes blindness to surge from near-zero to over 50%,

View details →