Negative / Null Result ReportOpen accessComputer Science
Ruhollah Majdoddin · 2014 · arXiv
AFP Algorithm is a learning algorithm for Horn formulas. We show that it does not improve the complexity of AFP Algorithm, if after each negative counterexample more that just one refinements are performed. Moreover, a canonical normal form for Horn formulas is presented, and it is proved that the output formula of AFP Algorithm is in this normal form.
View details →Negative / Null Result ReportOpen accessComputer Science
Ushak Rahaman, Soebur Razzaque · 2021 · arXiv
The $ν_μ\to ν_e$ oscillation probability over short baseline ($\lesssim 1$~km) would be negligible in case the mixing matrix for three active neutrinos is unitary. However, in case of non-unitary mixing of three neutrinos, this probability would be non-negligible due to the so-called "zero distance" effect. Hence, the near detector of the accelerator experiments such as NO$ν$A can provide strong constraints on the parameters of the non-unitary mixing with very large statistics. By analyzing the NO$ν$A near detector data we find that the non-unitary mixing does not improve fits to the $ν_e$ or
View details →Negative / Null Result ReportOpen accessComputer Science
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
Yulin Chen, He He, Chen Zhao · 2026 · arXiv
Reinforcement Learning with Verifiable Reward (RLVR) has proven effective in improving Large Language Model's (LLM) reasoning ability. However, the learning dynamics of RLVR remain underexplored. In this paper, we reveal a counterintuitive phenomenon: among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present. To understand the phenomenon, we first demonstrate that existing optimization and sampling techniques fail to resolve unlearnability. With cross-example gradient analysis, we show that unlearnable examples
View details →Negative / Null Result ReportOpen accessComputer Science
Hyeong Kyu Choi, Xiaojin Zhu, Sharon Li · 2025 · arXiv
Multi-Agent Debate~(MAD) has emerged as a promising paradigm for improving the performance of large language models through collaborative reasoning. Despite recent advances, the key factors driving MAD's effectiveness remain unclear. In this work, we disentangle MAD into two key components--Majority Voting and inter-agent Debate--and assess their respective contributions. Through extensive experiments across seven NLP benchmarks, we find that Majority Voting alone accounts for most of the performance gains typically attributed to MAD. To explain this, we propose a theoretical framework that mo
View details →Negative / Null Result ReportOpen accessComputer Science
Mitchell A. Gordon, Kevin Duh, Nicholas Andrews · 2020 · arXiv
Pre-trained universal feature extractors, such as BERT for natural language processing and VGG for computer vision, have become effective methods for improving deep learning models without requiring more labeled data. While effective, feature extractors like BERT may be prohibitively large for some deployment scenarios. We explore weight pruning for BERT and ask: how does compression during pre-training affect transfer learning? We find that pruning affects transfer learning in three broad regimes. Low levels of pruning (30-40%) do not affect pre-training loss or transfer to downstream tasks a
View details →Negative / Null Result ReportOpen accessComputer Science
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
C. Fernandez-Ramirez, A. M. Bernstein · 2012 · arXiv
With the availability of the new neutral pion photoproduction from the proton data from the A2 and CB-TAPS Collaborations at Mainz it is mandatory to revisit Heavy Baryon Chiral Perturbation Theory (HBChPT) and address the extraction of the partial waves as well as other issues such as the value of the low-energy constants, the energy range where the calculation provides a good agreement with the data and the impact of unitarity. We find that, within the current experimental status, HBChPT with the fitted LECs gives a good agreement with the existing neutral pion photoproduction data up to $\s
View details →Negative / Null Result ReportOpen accessComputer Science
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
Lawrence Clegg, John Cartlidge · 2025 · arXiv
Intransitive player dominance, where player A beats B, B beats C, but C beats A, is common in competitive tennis. Yet, there are few known attempts to incorporate it within forecasting methods. We address this problem with a graph neural network approach that explicitly models these intransitive relationships through temporal directed graphs, with players as nodes and their historical match outcomes as directed edges. Our model (65.7% accuracy, 0.214 Brier score) forecasts competitively with established rating systems such as Weighted Elo. Although it does not improve on the baseline in uncond
View details →Negative / Null Result ReportOpen accessComputer Science
Lennart Luettgau, Vanessa Cheung, Magda Dubois et al. · 2025 · arXiv
People increasingly seek personal advice from large language models (LLMs), yet whether humans follow their advice, and its consequences for their well-being, remains unknown. In a longitudinal randomised controlled trial with a representative UK sample (N = 6,474), we found that up to 79% of participants who had a 20-minute discussion with one of three AI chatbots (GPT-4o, LLama-3.3-70B, Gemini 3 Pro) about health, careers or relationships subsequently reported following its advice. Advice-following remained above 60% even for high-stakes recommendations, suggesting that users only weakly cal
View details →Negative / Null Result ReportOpen accessComputer Science
Wataru Masaka, Mitsuki Sakamoto, Kenshi Abe et al. · 2025 · arXiv
We investigate how perturbation does and does not improve the Follow-the-Regularized-Leader (FTRL) algorithm in solving imperfect-information extensive-form games under sampling, where payoffs are estimated from sampled trajectories. While optimistic algorithms are effective under full feedback, they often become unstable in the presence of sampling noise. Payoff perturbation offers a promising alternative for stabilizing learning and achieving \textit{last-iterate convergence}. We present a unified framework for \textit{Perturbed FTRL} algorithms and study two variants: PFTRL-KL (standard KL
View details →Negative / Null Result ReportOpen accessComputer Science
Hamed R. Tavakoli, Rakshith Shetty, Ali Borji et al. · 2017 · arXiv
To bridge the gap between humans and machines in image understanding and describing, we need further insight into how people describe a perceived scene. In this paper, we study the agreement between bottom-up saliency-based visual attention and object referrals in scene description constructs. We investigate the properties of human-written descriptions and machine-generated ones. We then propose a saliency-boosted image captioning model in order to investigate benefits from low-level cues in language models. We learn that (1) humans mention more salient objects earlier than less salient ones i
View details →Negative / Null Result ReportOpen accessComputer Science
Arpit Agarwal · 2021 · arXiv
Predicting the outcome of liquid droplet collisions is an extensively studied phenomenon but the current physics based models for predicting the outcomes are poor (accuracy $\approx 43\%$). The key weakness of these models is their limited complexity. They only account for 3 features while there are many more relevant features that go unaccounted for. This limitation of traditional models can be easily overcome through machine learning modeling of the problem. In an ML setting this problem directly translates to a classification problem with 4 classes. Here we compile a large labelled dataset
View details →Negative / Null Result ReportOpen accessComputer Science
Aaron B. Wagner, Nirmal V. Shende, Yücel Altuğ · 2019 · arXiv
We introduce a novel mechanism, called timid/bold coding, by which feedback can be used to improve coding performance. For a certain class of DMCs, called compound-dispersion channels, we show that timid/bold coding allows for an improved second-order coding rate compared with coding without feedback. For DMCs that are not compound dispersion, we show that feedback does not improve the second-order coding rate. Thus we completely determine the class of DMCs for which feedback improves the second-order coding rate. An upper bound on the second-order coding rate is provided for compound-dispersi
View details →Negative / Null Result ReportOpen accessComputer Science
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
Saikat Mondal, Chanchal K. Roy · 2025 · arXiv
High-quality answers in technical Q&A platforms like Stack Overflow (SO) are crucial as they directly influence software development practices. Poor-quality answers can introduce inefficiencies, bugs, and security vulnerabilities, and thus increase maintenance costs and technical debt in production software. To improve content quality, SO allows collaborative editing, where users revise answers to enhance clarity, correctness, and formatting. Several studies have examined rejected edits and identified the causes of rejection. However, prior research has not systematically assessed whether acce
View details →Negative / Null Result ReportOpen accessComputer Science
Hongyu Zhou, Yinan Zhang, Aixin Sun et al. · 2025 · arXiv
Multimodal recommendation systems are increasingly popular for their potential to improve performance by integrating diverse data types. However, the actual benefits of this integration remain unclear, raising questions about when and how it truly enhances recommendations. In this paper, we propose a structured evaluation framework to systematically assess multimodal recommendations across four dimensions: Comparative Efficiency, Recommendation Tasks, Recommendation Stages, and Multimodal Data Integration. We benchmark a set of reproducible multimodal models against strong traditional baseline
View details →Negative / Null Result ReportOpen accessComputer Science
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
Mark A. Rubin, Sumanth Kaushik · 2006 · arXiv
The signal-to-noise ratio for heterodyne laser radar with a coherent target-return beam and a squeezed local-oscillator beam is lower than that obtained using a coherent local oscillator, regardless of the method employed to combine the beams at the detector.
View details →Negative / Null Result ReportOpen accessComputer Science
Paul Schneider, Amalie Schramm · 2025 · arXiv
Structured deliberation has been found to improve the performance of human forecasters. This study investigates whether a similar intervention, i.e. allowing LLMs to review each other's forecasts before updating, can improve accuracy in large language models (GPT-5, Claude Sonnet 4.5, Gemini Pro 2.5). Using 202 resolved binary questions from the Metaculus Q2 2025 AI Forecasting Tournament, accuracy was assessed across four scenarios: (1) diverse models with distributed information, (2) diverse models with shared information, (3) homogeneous models with distributed information, and (4) homogene
View details →Negative / Null Result ReportOpen accessComputer Science
Masahito Hayashi · 2025 · arXiv
We consider estimation of unknown unitary operation when the set of possible unitary operations is given by a projective unitary representation of a compact group. We show that neither indefinite causal order strategy nor adaptive strategy improves the performance of this estimation when error function satisfies group covariance. That is, the optimal parallel strategy gives the optimal performance even under indefinite causal order strategy and adaptive strategy. To study this problem, we newly introduce the concept of generalized positive operator valued measure (GPOVM), and its convariance c
View details →Negative / Null Result ReportOpen accessComputer Science
Xirui Li, Ming Li, Tianyi Zhou · 2026 · arXiv
Reinforcement learning (RL) with verifiable rewards has become a standard post-training stage for boosting visual reasoning in vision-language models, yet it remains unclear what capabilities RL actually improves compared with supervised fine-tuning as cold-start initialization (IN). End-to-end benchmark gains conflate multiple factors, making it difficult to attribute improvements to specific skills. To bridge the gap, we propose a Frankenstein-style analysis framework including: (i) functional localization via causal probing; (ii) update characterization via parameter comparison; and (iii) t
View details →Negative / Null Result ReportOpen accessComputer Science
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
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
Roland S. Zimmermann, Thomas Klein, Wieland Brendel · 2023 · arXiv
In light of the recent widespread adoption of AI systems, understanding the internal information processing of neural networks has become increasingly critical. Most recently, machine vision has seen remarkable progress by scaling neural networks to unprecedented levels in dataset and model size. We here ask whether this extraordinary increase in scale also positively impacts the field of mechanistic interpretability. In other words, has our understanding of the inner workings of scaled neural networks improved as well? We use a psychophysical paradigm to quantify one form of mechanistic inter
View details →Negative / Null Result ReportOpen accessComputer Science
Thomas Vogel, Chinh Tran, Lars Grunske · 2019 · arXiv
In search-based software engineering we often use popular heuristics with default configurations, which typically lead to suboptimal results, or we perform experiments to identify configurations on a trial-and-error basis, which may lead to better results for a specific problem. To obtain better results while avoiding trial-and-error experiments, a fitness landscape analysis is helpful in understanding the search problem, and making an informed decision about the heuristics. In this paper, we investigate the search problem of test suite generation for mobile applications (apps) using SAPIENZ w
View details →Negative / Null Result ReportOpen accessComputer Science
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
Shufan Wang, Yixiao Song, Andrew Drozdov et al. · 2023 · arXiv
In this paper, we study the generation quality of interpolation-based retrieval-augmented language models (LMs). These methods, best exemplified by the KNN-LM, interpolate the LM's predicted distribution of the next word with a distribution formed from the most relevant retrievals for a given prefix. While the KNN-LM and related methods yield impressive decreases in perplexity, we discover that they do not exhibit corresponding improvements in open-ended generation quality, as measured by both automatic evaluation metrics (e.g., MAUVE) and human evaluations. Digging deeper, we find that interp
View details →Negative / Null Result ReportOpen accessComputer Science
Niek Beckers, Edwin van Asseldonk, Herman van der Kooij · 2020 · arXiv
Haptic interaction between two humans, for example, a physiotherapist assisting a patient regaining the ability to grasp a cup, likely facilitates motor skill acquisition. Haptic human-human interaction has been shown to enhance individual performance improvement in a tracking task with a visuomotor rotation perturbation. These results are remarkable given that haptically assisting or guiding an individual rarely benefits their individual improvement when the assistance is removed. We, therefore, replicated a study that reported that haptic interaction between humans was beneficial for individ
View details →