e-ISSN: Pending
WASTE Journal

Browse the failure-mode index

750 real negative results, null findings, and replication failures · Failed Experiment 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.

Failed Experiment ReportOpen accessMathematics

Error Preserving Correction for CPD and Bounded-Norm CPD

Anh-Huy Phan, Petr Tichavský, Andrzej Cichocki · 2017 · arXiv

In CANDECOMP/PARAFAC tensor decomposition, degeneracy often occurs in some difficult scenarios, e.g., when the rank exceeds the tensor dimension, or when the loading components are highly collinear in several or all modes, or when CPD does not have an optimal solution. In such the cases, norms of some rank-1 terms become significantly large and cancel each other. This makes algorithms getting stuck in local minima while running a huge number of iterations does not improve the decomposition. In this paper, we propose an error preservation correction method to deal with such problem. Our aim is

View details →
Failed Experiment ReportOpen accessMathematics

Covariance estimation with nonnegative partial correlations

Jake A. Soloff, Adityanand Guntuboyina, Michael I. Jordan · 2020 · arXiv

We study the problem of high-dimensional covariance estimation under the constraint that the partial correlations are nonnegative. The sign constraints dramatically simplify estimation: the Gaussian maximum likelihood estimator is well defined with only two observations regardless of the number of variables. We analyze its performance in the setting where the dimension may be much larger than the sample size. We establish that the estimator is both high-dimensionally consistent and minimax optimal in the symmetrized Stein loss. We also prove a negative result which shows that the sign-constrai

View details →
Failed Experiment ReportOpen accessComputer Science

A Coding-Theoretic Application of Baranyai's Theorem

Liang Feng Zhang · 2013 · arXiv

Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\choose u-1}$ sub-families such that each sub-family form a partition of the $n$-element set, where $n$ is divisible by $u$. In this paper, we present a coding-theoretic application of Baranyai's theorem (or equivalently, the corollary). More precisely, we propose the first purely combinatorial construction of locally decodable codes. Locally decodable codes are error-correcting codes that allow the recove

View details →
Failed Experiment ReportOpen accessComputer Science

Generalized positivity bounds on chiral perturbation theory

Yu-Jia Wang, Feng-Kun Guo, Cen Zhang et al. · 2020 · arXiv

Recently, a new set of positivity bounds with $t$ derivatives have been discovered. We explore the generic features of these generalized positivity bounds with loop amplitudes and apply these bounds to constrain the parameters in chiral perturbation theory up to the next-to-next-to-leading order. We show that the generalized positivity bounds give rise to stronger constraints on the $\bar l_i$ constants, compared to the existing axiomatic bounds. The parameter space of the $b_i$ constants is constrained by the generalized positivity bounds to be a convex region that is enclosed for many sectio

View details →
Failed Experiment ReportOpen accessPhysics

Device-scale modeling of valley photovoltaics

Daixi Xia, Hassan Allami, Jacob J. Krich · 2025 · arXiv

We present a Poisson/drift-diffusion model that includes valley scattering effects for simulating valley photovoltaic devices. The valley photovoltaic concept is a novel implementation of a hot-carrier solar cell and leverages the valley scattering effect under large electric field to potentially achieve high voltage and high efficiency. Fabricated devices have shown S-shaped current-voltage curves, low fill factor, and thus low efficiency. We hence develop the first device model for valley photovoltaics. Our model includes electric-field-dependent valley scattering rates extracted from previo

View details →
Failed Experiment ReportOpen accessMathematics

A Non-Existence Result for Hamiltonian Integrators

P. F. Tupper · 2006 · arXiv

We consider the numerical simulation of Hamiltonian systems of ordinary differential equations. Two features of Hamiltonian systems are that energy is conserved along trajectories and phase space volume is preserved by the flow. We want to determine if there are integration schemes that preserve these two properties for all Hamiltonian systems, or at least for all systems in a wide class. This paper provides provides a negative result in the case of two dimensional (one degree of freedom) Hamiltonian systems, for which phase space volume is identical to area. Our main theorem shows that there

View details →
Failed Experiment ReportOpen accessComputer Science

An approach to optimize inference of the DIART speaker diarization pipeline

Roman Aperdannier, Sigurd Schacht, Alexander Piazza · 2024 · arXiv

Speaker diarization answers the question "who spoke when" for an audio file. In some diarization scenarios, low latency is required for transcription. Speaker diarization with low latency is referred to as online speaker diarization. The DIART pipeline is an online speaker diarization system. It consists of a segmentation and an embedding model. The embedding model has the largest share of the overall latency. The aim of this paper is to optimize the inference latency of the DIART pipeline. Different inference optimization methods such as knowledge distilation, pruning, quantization and layer

View details →
Failed Experiment ReportOpen accessPhysics

An Analysis of the Mapping Approach to Surface Hopping

Jan Vavřín · 2025 · arXiv

Recently, the mapping approach to surface hopping (MASH) was proposed as a method to simulate the non-adiabatic dynamics of two-level systems. It was shown that the method possesses many desirable qualities, both theoretically and through numerical simulations. We explain this success by proving that, out of similar mapping methods, MASH dynamics is unique in guaranteeing correct thermalisation, but that many different "estimators" can be used on top of it. We also show that MASH can successfully calculate multi-time correlation functions, which can be used for the simulation of 2D spectra. We

View details →
Failed Experiment ReportOpen accessComputer Science

Error Exponents for Randomised List Decoding

Henrique K. Miyamoto, Sheng Yang · 2026 · arXiv

This paper studies random-coding error exponents of randomised list decoding, in which the decoder randomly selects $L$ messages with probabilities proportional to the decoding metric of the codewords. The exponents (or bounds) are given for mismatched, and then particularised to matched and universal decoding metrics. Two regimes are studied: for fixed list size, we derive an ensemble-tight random-coding error exponent, and show that, for the matched metric, it does not improve the error exponent of ordinary decoding. For list sizes growing exponentially with the block-length, we provide a no

View details →
Failed Experiment ReportOpen accessComputer Science

Problems for Supersymmetry Breaking by the Dilaton in Strings from Charge and Color Breaking

J. A. Casas, A. Lleyda, C. Muñoz · 1996 · arXiv

The general constraints on the parameter space of soft-breaking terms, in order to avoid dangerous charge and color breaking minima, are applied to the four-dimensional string scenario where the dilaton is the source of supersymmetry breaking (dilaton-dominated limit). The results indicate that the whole parameter space is excluded on these grounds after imposing the present experimental data on the top mass. The inclusion of a non-vanishing cosmological constant does not improve essentially the prospects. Possible way-outs to this situation are briefly discussed.

View details →
Failed Experiment ReportOpen accessComputer Science

On bound entanglement assisted distillation

V. Vedral · 1999 · arXiv

We investigate asymptotic distillation of entanglement in the presence of an unlimited amount of bound entanglement for bi-partite systems. We show that the distillability is still bounded by the relative entropy of entanglement. This offers a strong support to the fact that bound entanglement does not improve distillation of entanglement.

View details →
Failed Experiment ReportOpen accessPhysics

Optimization of STIRAP-based state transfer under dissipation

Ying-Dan Wang, Xiao-Bo Yan, Stefano Chesi · 2016 · arXiv

Using a perturbative treatment, we quantify the influence of non-adiabatic leakage and system dissipation on the transfer fidelity of a stimulated Raman adiabatic passage (STIRAP) process. We find that, optimizing transfer time rather than coupling profiles, leads to a significant improvement of the transfer fidelity. The upper bound of the fidelity has been found as a simple analytical function of system cooperativities. We also provide a systematic approach to reach this upper bound efficiently.

View details →
Failed Experiment ReportOpen accessComputer Science

Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces

Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen · 2018 · arXiv

The Planar Steiner Tree problem is one of the most fundamental NP-complete problems as it models many network design problems. Recall that an instance of this problem consists of a graph with edge weights, and a subset of vertices (often called terminals); the goal is to find a subtree of the graph of minimum total weight that connects all terminals. A seminal paper by Erickson et al. [Math. Oper. Res., 1987] considers instances where the underlying graph is planar and all terminals can be covered by the boundary of $k$ faces. Erickson et al. show that the problem can be solved by an algorithm

View details →
Failed Experiment ReportOpen accessComputer Science

When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise

Carmine Abate, Arthur Azevedo de Amorim, Roberto Blanco et al. · 2018 · arXiv

We propose a new formal criterion for evaluating secure compilation schemes for unsafe languages, expressing end-to-end security guarantees for software components that may become compromised after encountering undefined behavior---for example, by accessing an array out of bounds. Our criterion is the first to model dynamic compromise in a system of mutually distrustful components with clearly specified privileges. It articulates how each component should be protected from all the others---in particular, from components that have encountered undefined behavior and become compromised. Each comp

View details →
Failed Experiment ReportOpen accessComputer Science

Granularity Noise Limit in Atomic-Ensemble-Based Metrology

Chen-Rong Liu, Chuang Li, Runxia Tao et al. · 2026 · arXiv

Conventional noise analysis in atomic-ensemble sensing assumes a continuous-medium approximation, thereby treating the atomic system as a deterministic dielectric. Here, we demonstrate that this assumption breaks down due to the discrete, particulate nature of the ensemble, giving rise to an intrinsic "atomic granularity noise" (AGN) that fundamentally competes with the optical measurement noise (OMN, typically photon shot noise). By introducing a discrete-atom statistical framework, we derive a unified noise-scaling law governed by a single dimensionless resource ratio, $\mathcal{R} = \bar{N}

View details →
Failed Experiment ReportOpen accessComputer Science

How to Fine-Tune a Reasoning Model? A Teacher-Student Cooperation Framework to Synthesize Student-Consistent SFT Data

Zixian Huang, Kaichen Yang, Xu Huang et al. · 2026 · arXiv

A widely adopted strategy for model enhancement is to use synthetic data generated by a stronger model for supervised fine-tuning (SFT). However, for emerging reasoning models like Qwen3-8B, this approach often fails to improve reasoning capabilities and can even lead to a substantial drop in performance. In this work, we identify substantial stylistic divergence between teacher generated data and the distribution of student as a major factor impacting SFT. To bridge this gap, we propose a Teacher-Student Cooperation Data Synthesis framework (TESSY), which interleaves teacher and student model

View details →
Failed Experiment ReportOpen accessComputer Science

Token-Efficient RL for LLM Reasoning

Alan Lee, Harry Tong · 2025 · arXiv

We propose reinforcement learning (RL) strategies tailored for reasoning in large language models (LLMs) under strict memory and compute limits, with a particular focus on compatibility with LoRA fine-tuning. Building on early policy gradient methods with baseline subtraction, we design critic-free methods that operate on a small, informative subset of output tokens to reduce memory usage and stabilize training. We introduce S-GRPO, a stochastic variant of Group Relative Policy Optimization, and T-SPMO, a token-level prefix matching approach for fine-grained credit assignment. Applied to Qwen2

View details →
Failed Experiment ReportOpen accessComputer Science

Significant improvement of lossy compression rate and speed of HPC data using perceptron parallelized compression

Xinzhe Chen, Jianjiang Li · 2023 · arXiv

The escalating surge in data generation presents formidable challenges to information technology, necessitating advancements in storage, retrieval, and utilization. With the proliferation of artificial intelligence and big data, the "Data Age 2025" report forecasts an exponential increase in global data production. The escalating data volumes raise concerns about efficient data processing. The paper addresses the predicament of achieving a lower compression ratio while maintaining or surpassing the compression performance of state-of-the-art techniques. This paper introduces a lossy compressio

View details →
Failed Experiment ReportOpen accessComputer Science

When Do LLM Agents Treat Surface Noise Differently from Semantic Noise? A 68-Cell Measurement Study with a Held-Out Trace-Level Validation

Liyun Zhang, Jiayi Guo · 2026 · arXiv

We document an empirical phenomenon in chain-of-thought and ReAct agents driven by ten large language models from seven architecture families: meaning-bearing perturbations (e.g., paraphrase, synonym) alter final answers more often than presentation perturbations (e.g., formatting, reordering) of comparable severity. Across 68 cells spanning GSM8K, MATH, and HotpotQA (1,530 originals and $\sim$11,150 variants), the inconsistency gap averages +19.69 pp after severity matching (paired $t=9.58$, $p<0.0001$), with 64/68 cells positive. The gap survives four severity-proxy audits and remains signif

View details →
Failed Experiment ReportOpen accessPhysics

Self-interaction correction schemes for non-collinear spin-density-functional theory

Nicolas Tancogne-Dejean, Martin Lüders, Carsten A. Ullrich · 2023 · arXiv

We extend some of the well established self-interaction correction (SIC) schemes of density-functional theory to the case of systems with noncollinear magnetism. Our proposed SIC schemes are tested on a set of molecules and metallic clusters in combination with the widely used local spin-density approximation. As expected from the collinear SIC, we show that the averaged-density SIC works well for improving ionization energies but fails to improve more subtle quantities like the dipole moments of polar molecules. We investigate the exchange-correlation magnetic field produced by our extension

View details →
Failed Experiment ReportOpen accessComputer Science

Evaluation and Improvement of Laruelle-Widgrén Inverse Banzhaf Approximation

Frits de Nijs, Daan Wilmer · 2012 · arXiv

The goal of this paper is to critically evaluate a heuristic algorithm for the Inverse Banzhaf Index problem by Laruelle and Widgrén. Few qualitative results are known about the approximation quality of the heuristics for this problem. The intuition behind the operation of this approximation algorithm is analysed and evaluated. We found that the algorithm can not handle general inputs well, and often fails to improve inputs. It is also shown to diverge after only tens of iterations. We present three alternative extensions of the algorithm that do not alter the complexity but can result in up t

View details →
Failed Experiment ReportOpen accessPhysics

On the possibility of complete revivals after quantum quenches to a critical point

Khadijeh Najafi, M. A. Rajabpour · 2017 · arXiv

In a recent letter, J. Cardy, Phys. Rev. Lett. \textbf{112}, 220401 (2014), the author made a very interesting observation that complete revivals of quantum states after quantum quench can happen in a period which is a fraction of the system size. This is possible for critical systems that can be described by minimal conformal field theories (CFT) with central charge $c<1$. In this article, we show that these complete revivals are impossible in microscopic realizations of those minimal models. We will prove the absence of the mentioned complete revivals for the critical transverse field Ising

View details →
Failed Experiment Report

Sainsbury’s Egyptian misadventure

· 2015 · Strategic Direction

Purpose – This paper aims to review the latest management developments across the globe and pinpoint practical implications from cutting-edge research and case studies. Design/methodology/approach – This briefing is prepared by an…

View details →