Negative / Null Result ReportOpen accessPhysics
Philip Rosenfield, Paola Marigo, Leo Girardi et al. · 2014 · arXiv
The evolution and lifetimes of thermally pulsating asymptotic giant branch (TP-AGB) stars suffer from significant uncertainties. In this work, we analyze the numbers and luminosity functions of TP-AGB stars in six quiescent, low metallicity ([Fe/H] $\lesssim -0.86$) galaxies taken from the ANGST sample, using HST photometry in both optical and near-infrared filters. The galaxies contain over 1000 TP-AGB stars (at least 60 per field). We compare the observed TP-AGB luminosity functions and relative numbers of TP-AGB and RGB stars, to models generated from different suites of TP-AGB evolutionary
View details →Negative / Null Result ReportOpen accessComputer Science
Kerem Cankocak, Aytekin Aydemir, Ramazan Sever · 2004 · arXiv
We compute the rates for pp annihilation into chargino-pairs via Drell-Yan process taking into account the effects of supersymmetric soft phases, at proton-proton collider. In particular, the phase of the mu parameter gains direct accessibility via the production of dissimilar charginos. The phases of the trilinear soft masses do not have a significant effect on the cross sections.
View details →Negative / Null Result ReportOpen accessComputer Science
Song Tae-Eun · 2026 · arXiv
Cross-Context Review (CCR) improves LLM verification by separating production and review into independent sessions. A natural extension is multi-turn review: letting the reviewer ask follow-up questions, receive author responses, and review again. We call this Dynamic Cross-Context Review (D-CCR). In a controlled experiment with 30 artifacts and 150 injected errors, we tested four D-CCR variants against the single-pass CCR baseline. Single-pass CCR (F1 = 0.376) significantly outperformed all multi-turn variants, including D-CCR-2b with question-and-answer exchange (F1 = 0.303, $p < 0.001$, $d
View details →Negative / Null Result ReportOpen accessComputer Science
Marco Cognetta, Tatsuya Hiraoka, Naoaki Okazaki et al. · 2024 · arXiv
We explore threshold vocabulary trimming in Byte-Pair Encoding subword tokenization, a postprocessing step that replaces rare subwords with their component subwords. The technique is available in popular tokenization libraries but has not been subjected to rigorous scientific scrutiny. While the removal of rare subwords is suggested as best practice in machine translation implementations, both as a means to reduce model size and for improving model performance through robustness, our experiments indicate that, across a large space of hyperparameter settings, vocabulary trimming fails to improv
View details →Failed Experiment ReportOpen accessComputer Science
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
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 →Negative / Null Result ReportOpen accessComputer Science
Janarthanan Rajendran, Jonathan K. Kummerfeld, Satinder Singh · 2021 · arXiv
For each goal-oriented dialog task of interest, large amounts of data need to be collected for end-to-end learning of a neural dialog system. Collecting that data is a costly and time-consuming process. Instead, we show that we can use only a small amount of data, supplemented with data from a related dialog task. Naively learning from related data fails to improve performance as the related data can be inconsistent with the target task. We describe a meta-learning based method that selectively learns from the related dialog task data. Our approach leads to significant accuracy improvements in
View details →Negative / Null Result ReportOpen accessComputer Science
Dhruvi Khandelwal, Anurag Basistha, Ayushi Jolotia et al. · 2026 · arXiv
Deep learning proxies for Alternating Current Optimal Power Flow (ACOPF) lack systematic methods for determining architectural size. This paper conducts a constructive thought experiment to answer a fundamental inquiry: how wide must a neural network be to almost accurately approximate the ACOPF manifold? We introduce a Loss-Guided Neural Densification (LG-ND) algorithm that incrementally discovers necessary capacity by expanding only when the current deep neural network topology fails to improve further. Empirical results across various IEEE systems show that LG-ND achieves performance parity
View details →Negative / Null Result ReportOpen accessComputer Science
Runzhe Zhan, Xuebo Liu, Derek F. Wong et al. · 2021 · arXiv
Meta-learning has been sufficiently validated to be beneficial for low-resource neural machine translation (NMT). However, we find that meta-trained NMT fails to improve the translation performance of the domain unseen at the meta-training stage. In this paper, we aim to alleviate this issue by proposing a novel meta-curriculum learning for domain adaptation in NMT. During meta-training, the NMT first learns the similar curricula from each domain to avoid falling into a bad local optimum early, and finally learns the curricula of individualities to improve the model robustness for learning dom
View details →Negative / Null Result ReportOpen accessComputer Science
Arijit Sehanobish, Charles Lovering · 2026 · arXiv
We study the \textit{parameter placement problem}: given a fixed budget of $k$ trainable entries within the B matrix of a LoRA adapter (A frozen), does the choice of which $k$ matter? Under supervised fine-tuning, random and informed subsets achieve comparable performance. Under GRPO on base models, random placement fails to improve over the base model, while gradient-informed placement recovers standard LoRA accuracy. This regime dependence traces to gradient structure: SFT gradients are low-rank and directionally stable, so any subset accumulates coherent updates; GRPO gradients are high-ran
View details →Failed Experiment ReportOpen accessComputer Science
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 →Negative / Null Result ReportOpen accessComputer Science
Can Cui, Imran Ahamad Sheikh, Mostafa Sadeghi et al. · 2024 · arXiv
Distant-microphone meeting transcription is a challenging task. State-of-the-art end-to-end speaker-attributed automatic speech recognition (SA-ASR) architectures lack a multichannel noise and reverberation reduction front-end, which limits their performance. In this paper, we introduce a joint beamforming and SA-ASR approach for real meeting transcription. We first describe a data alignment and augmentation method to pretrain a neural beamformer on real meeting data. We then compare fixed, hybrid, and fully neural beamformers as front-ends to the SA-ASR model. Finally, we jointly optimize the
View details →Negative / Null Result ReportOpen accessComputer Science
Zelu Deng, Yujie Zhong, Sheng Guo et al. · 2021 · arXiv
This work aims at improving instance retrieval with self-supervision. We find that fine-tuning using the recently developed self-supervised (SSL) learning methods, such as SimCLR and MoCo, fails to improve the performance of instance retrieval. In this work, we identify that the learnt representations for instance retrieval should be invariant to large variations in viewpoint and background etc., whereas self-augmented positives applied by the current SSL methods can not provide strong enough signals for learning robust instance-level representations. To overcome this problem, we propose InsCL
View details →Negative / Null Result ReportOpen accessComputer Science
Shayne Longpre, Yi Lu, Christopher DuBois · 2020 · arXiv
Recent work (Feng et al., 2018) establishes the presence of short, uninterpretable input fragments that yield high confidence and accuracy in neural models. We refer to these as Minimal Prediction Preserving Inputs (MPPIs). In the context of question answering, we investigate competing hypotheses for the existence of MPPIs, including poor posterior calibration of neural models, lack of pretraining, and "dataset bias" (where a model learns to attend to spurious, non-generalizable cues in the training data). We discover a perplexing invariance of MPPIs to random training seed, model architecture
View details →Negative / Null Result ReportOpen accessMathematics
Oliver J. Hines, Christian L. Hines · 2026 · arXiv
Gradient boosted decision trees require a stopping rule to avoid overfitting. The standard rule monitors a validation loss and stops if the loss fails to improve for a fixed patience period. However, the patience parameter has no interpretable scale and validation losses can be noisy or implicitly defined by a user-specified gradient. We propose ScoreStop, a gradient-based early-stopping rule that casts the stopping decision at each iteration as a test of the null hypothesis that the current predictor is the population risk minimizer. We use a functional score test, computed on validation data
View details →Negative / Null Result ReportOpen accessComputer Science
Hanbing Liu, Haoyang Li, Xiaokang Zhang et al. · 2025 · arXiv
Direct Preference Optimization (DPO) has proven effective in complex reasoning tasks like math word problems and code generation. However, when applied to Text-to-SQL datasets, it often fails to improve performance and can even degrade it. Our investigation reveals the root cause: unlike math and code tasks, which naturally integrate Chain-of-Thought (CoT) reasoning with DPO, Text-to-SQL datasets typically include only final answers (gold SQL queries) without detailed CoT solutions. By augmenting Text-to-SQL datasets with synthetic CoT solutions, we achieve, for the first time, consistent and
View details →Negative / Null Result ReportOpen accessComputer Science
Àlex Miranda-Pascual, Javier Parra-Arnau, Thorsten Strufe · 2026 · arXiv
Sampling is renowned for its privacy amplification in differential privacy (DP), and is often assumed to improve the utility of a DP mechanism by allowing a noise reduction. In this paper, we further show that this last assumption is flawed: When measuring utility at equal privacy levels, sampling as preprocessing consistently yields penalties due to utility loss from omitting records over all canonical DP mechanisms -- Laplace, Gaussian, exponential, and report noisy max -- , as well as recent applications of sampling, such as clustering. Extending this analysis, we investigate suppression as
View details →Negative / Null Result ReportOpen accessEngineering
Haoyang Li, Yuchen Hu, Chen Chen et al. · 2024 · arXiv
Deep neural network (DNN)-based speech enhancement (SE) usually uses conventional activation functions, which lack the expressiveness to capture complex multiscale structures needed for high-fidelity SE. Group-Rational KAN (GR-KAN), a variant of Kolmogorov-Arnold Networks (KAN), retains KAN's expressiveness while improving scalability on complex tasks. We adapt GR-KAN to existing DNN-based SE by replacing dense layers with GR-KAN layers in the time-frequency (T-F) domain MP-SENet and adapting GR-KAN's activations into the 1D CNN layers in the time-domain Demucs. Results on Voicebank-DEMAND sho
View details →Negative / Null Result ReportMedicine
Duman Aydin, Küçükosman, Mohamed et al. · 2026 · BMC medical education
Although oxygen therapy (OT) is a fundamental and life-saving intervention in the management of hypoxemia, it may lead to serious complications when applied incorrectly or in an uncontrolled manner. The aim of this study is to evaluate the…
View details →Failed Experiment ReportOpen accessComputer Science
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 →Negative / Null Result ReportOpen accessComputer Science
Piyawat Lertvittayakumjorn, David Kinney, Vinodkumar Prabhakaran et al. · 2025 · arXiv
Generative large language models (LLMs) have demonstrated gaps in diverse cultural awareness across the globe. We investigate the effect of retrieval augmented generation and search-grounding techniques on LLMs' ability to display familiarity with various national cultures. Specifically, we compare the performance of standard LLMs, LLMs augmented with retrievals from a bespoke knowledge base (i.e., KB grounding), and LLMs augmented with retrievals from a web search (i.e., search grounding) on multiple cultural awareness benchmarks. We find that search grounding significantly improves the LLM p
View details →Negative / Null Result ReportOpen accessEconomics, Econometrics and Finance
Francis X. Diebold, Maximilian Goebel, Philippe Goulet Coulombe · 2022 · arXiv
We use "glide charts" (plots of sequences of root mean squared forecast errors as the target date is approached) to evaluate and compare fixed-target forecasts of Arctic sea ice. We first use them to evaluate the simple feature-engineered linear regression (FELR) forecasts of Diebold and Goebel (2021), and to compare FELR forecasts to naive pure-trend benchmark forecasts. Then we introduce a much more sophisticated feature-engineered machine learning (FEML) model, and we use glide charts to evaluate FEML forecasts and compare them to a FELR benchmark. Our substantive results include the freque
View details →Negative / Null Result ReportOpen accessComputer Science
Fırat Öncel, Matthias Bethge, Beyza Ermis et al. · 2024 · arXiv
In the last decade, the generalization and adaptation abilities of deep learning models were typically evaluated on fixed training and test distributions. Contrary to traditional deep learning, large language models (LLMs) are (i) even more overparameterized, (ii) trained on unlabeled text corpora curated from the Internet with minimal human intervention, and (iii) trained in an online fashion. These stark contrasts prevent researchers from transferring lessons learned on model generalization and adaptation in deep learning contexts to LLMs. To this end, our short paper introduces empirical ob
View details →Negative / Null Result ReportOpen accessComputer Science
Adam Byerly, Daniel Khashabi · 2024 · arXiv
Self-consistency (SC) improves the performance of large language models (LLMs) across various tasks and domains that involve short content. However, does this support its effectiveness for long-context problems? We challenge the assumption that SC's benefits generalize to long-context settings, where LLMs often struggle with position bias, the systematic over-reliance on specific context regions-which hinders their ability to utilize information effectively from all parts of their context. Through comprehensive experimentation with varying state-of-the-art models, tasks, and SC formulations, w
View details →Negative / Null Result ReportOpen accessComputer Science
Chunliang Li, Tianze Cao, Sanyuan Zhao · 2026 · arXiv
Visual Autoregressive (VAR) modeling inefficiently applies a fixed computational depth to each position when generating high-resolution images. While existing methods accelerate inference by pruning tokens using frequency maps, their binary hard-pruning approach is fundamentally limited and fails to improve quality even with better frequency estimation. Observing that VAR models possess significant depth redundancy, we propose a paradigm shift from pruning entire tokens to adaptively allocating per-token computational depth. To this end, we introduce DepthVAR, a training-free framework that dy
View details →Negative / Null Result ReportOpen accessComputer Science
Chiara Lanza, Roberto Pereira, Marco Miozzo et al. · 2026 · arXiv
Centralized training is the standard paradigm in deep learning, enabling models to learn from a unified dataset in a single location. In such setup, isotropic feature distributions naturally arise as a mean to support well-structured and generalizable representations. In contrast, continual learning operates on streaming and non-stationary data, and trains models incrementally, inherently facing the well-known plasticity-stability dilemma. In such settings, learning dynamics tends to yield increasingly anisotropic feature space. This arises a fundamental question: should isotropy be enforced t
View details →Negative / Null Result ReportMedicine
Zhou, Cao, You et al. · 2026 · BMC oral health
Photogrammetry technique may provide a promising approach compared to conventional techniques for multiple implants. However, the accuracy of photogrammetric technique for implant-supported fixed complete dentures in clinical scenarios…
View details →Negative / Null Result ReportOpen accessComputer Science
Amanpreet Singh, Mike D'Arcy, Arman Cohan et al. · 2022 · arXiv
Learned representations of scientific documents can serve as valuable input features for downstream tasks without further fine-tuning. However, existing benchmarks for evaluating these representations fail to capture the diversity of relevant tasks. In response, we introduce SciRepEval, the first comprehensive benchmark for training and evaluating scientific document representations. It includes 24 challenging and realistic tasks, 8 of which are new, across four formats: classification, regression, ranking and search. We then use this benchmark to study and improve the generalization ability o
View details →Negative / Null Result ReportOpen accessComputer Science
Hanlin Xiao, Rainer Breitling, Eriko Takano et al. · 2026 · arXiv
Recent advances in general-purpose foundation models have stimulated the development of large biological sequence models. While natural language shows symbolic granularity (characters, words, sentences), biological sequences exhibit hierarchical granularity whose levels (nucleotides, amino acids, protein domains, genes) further encode biologically functional information. In this paper, we investigate the integration of cross-granularity knowledge from models through a case study of BiGCARP, a Pfam domain-level model for biosynthetic gene clusters, and ESM, an amino acid-level protein language
View details →Negative / Null Result ReportOpen accessComputer Science
Ruth Cohen, Lu Feng, Ayala Bloch et al. · 2026 · arXiv
While natural-language explanations from large language models (LLMs) are widely adopted to improve transparency and trust, their impact on objective human-AI team performance remains poorly understood. We identify a Persuasion Paradox: fluent explanations systematically increase user confidence and reliance on AI without reliably improving, and in some cases undermining, task accuracy. Across three controlled human-subject studies spanning abstract visual reasoning (RAVEN matrices) and deductive logical reasoning (LSAT problems), we disentangle the effects of AI predictions and explanations u
View details →