Negative / Null Result ReportOpen accessComputer Science
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
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
Yining Lu, Dixuan Wang, Tianjian Li et al. · 2024 · arXiv
As LLMs become increasingly prevalent, it is interesting to consider how ``creative'' these models can be. From cognitive science, creativity consists of at least two key characteristics: \emph{convergent} thinking (purposefulness to achieve a given goal) and \emph{divergent} thinking (adaptability to explore new environments or constraints) \citep{runco2003critical}. In this work, we introduce a framework for quantifying LLM creativity that incorporates the two design ingredients: (1) We introduce DENIAL PROMPTING which pushes LLMs to develop more creative solutions to a given problem by incr
View details →Negative / Null Result ReportOpen accessComputer Science
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
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
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
Osvaldo Simeone, Haim H. Permuter · 2011 · arXiv
For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for more general sources with memory, as demonstrated by a number of works focusing on the special case of (delayed) feedforward. In this paper, a setting is studied in which the encoder is potentially uncertain about the delay with which measurements of the side information are acquired at the decoder. Assuming a hidden Markov model for the sources, at first, a single-letter characterization is given for the set-up where the side information delay is arb
View details →Negative / Null Result ReportOpen accessComputer Science
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
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 accessComputer Science
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
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
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
Tovly Deutsch, Masoud Jasbi, Stuart Shieber · 2020 · arXiv
Readability assessment aims to automatically classify text by the level appropriate for learning readers. Traditional approaches to this task utilize a variety of linguistically motivated features paired with simple machine learning models. More recent methods have improved performance by discarding these features and utilizing deep learning models. However, it is unknown whether augmenting deep learning models with linguistically motivated features would improve performance further. This paper combines these two approaches with the goal of improving overall model performance and addressing th
View details →Negative / Null Result ReportOpen accessComputer Science
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 accessComputer Science
Tristan Piater, Niklas Penzel, Gideon Stein et al. · 2024 · arXiv
A substantial body of research has focused on developing systems that assist medical professionals during labor-intensive early screening processes, many based on convolutional deep-learning architectures. Recently, multiple studies explored the application of so-called self-attention mechanisms in the vision domain. These studies often report empirical improvements over fully convolutional approaches on various datasets and tasks. To evaluate this trend for medical imaging, we extend two widely adopted convolutional architectures with different self-attention variants on two different medical
View details →Negative / Null Result ReportOpen accessComputer Science
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 →Negative / Null Result ReportOpen accessComputer Science
Reza Fotohi, Mehdi Effatparvar, Fateme Sarkohaki et al. · 2019 · arXiv
Multicore is an integrated circuit chip that uses two or more computational engines (cores) places in a single processor. This new approach is used to split the computational work of a threaded application and spread it over multiple execution cores, so that the computer system can benefits from a better performance and better responsiveness of the system. A thread is a unit of execution inside a process that is created and maintained to execute a set of actions/ instructions. Threads can be implemented differently from an operating system to another, but the operating system is in most cases
View details →Negative / Null Result ReportOpen accessComputer Science
Rittick Roy, Urjit A. Yajnik · 2019 · arXiv
Kerr black holes coupled to quantized bosonic fields display a special version of the Hawking effect, governed by the superradiance condition. This leads to rapid growth of boson cloud through spontaneous creation, leading to slowing down of the black hole, and detectable as growth of the black hole shadow. This can be developed into a technique for searching or constraining the existence of ultralight bosons. We study this phenomenon for spin-0 bosons in the shadow of a black hole, with a detailed analysis of Sgr$A^*$, and put estimates on the evolution time scales and subsequent change in th
View details →Negative / Null Result ReportOpen accessComputer Science
Seyed Amir Kasaei, Arash Marioriyad, Mahbod Khaleti et al. · 2026 · arXiv
Large Vision-Language Models (LVLMs) have achieved remarkable proficiency in explicit visual recognition, effectively describing what is directly visible in an image. However, a critical cognitive gap emerges when the visual input serves only as a clue rather than the answer. We identify that current models struggle with the complex, multi-step reasoning required to solve problems where information is not explicitly depicted. Successfully solving a rebus puzzle requires a distinct cognitive workflow: the model must extract visual and textual attributes, retrieve linguistic prior knowledge (suc
View details →Abandoned HypothesisOpen accessComputer Science
Kiarn T. Laverick, Howard M. Wiseman, Hossien T. Dinani et al. · 2017 · arXiv
The problem of measuring a time-varying phase, even when the statistics of the variation is known, is considerably harder than that of measuring a constant phase. In particular, the usual bounds on accuracy - such as the $1/(4\bar{n})$ standard quantum limit with coherent states - do not apply. Here, restricting to coherent states, we are able to analytically obtain the achievable accuracy - the equivalent of the standard quantum limit - for a wide class of phase variation. In particular, we consider the case where the phase has Gaussian statistics and a power-law spectrum equal to $κ^{p-1}/|ω
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
Cid Reyes-Bustos, Masato Wakayama · 2022 · arXiv
The non-commutative harmonic oscillator (NCHO) is a matrix valued differential operator originally introduced as a generalization of the quantum harmonic oscillator having a weaker $\mathfrak{sl}_2(\mathbb{R})$-symmetry. The spectrum of the NCHO has remarkable properties, including the presence of number theoretical structures such as modular forms, elliptic curves and Eichler cohomology observed in the special values of the associated spectral zeta function. In addition, the Heun ODE picture of the eigenvalue problem of the NCHO reveals a connection with the quantum Rabi model (QRM), a fundam
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
Mai Vu · 2011 · arXiv
We establish the optimal input signaling and the capacity of MIMO channels under per-antenna power constraint. While admitting a linear eigenbeam structure, the optimal input is no longer diagonalizable by the channel right singular vectors as with sum power constraint. We formulate the capacity optimization as an SDP problem and solve in closed-form the optimal input covariance as a function of the dual variable. We then design an efficient algorithm to find this optimal input signaling for all channel sizes. The proposed algorithm allows for straightforward implementation in practical system
View details →Negative / Null Result ReportOpen accessComputer Science
Gabriel Grand, Valerio Pepe, Jacob Andreas et al. · 2024 · arXiv
Questions combine our mastery of language with our remarkable facility for reasoning about uncertainty. How do people navigate vast hypothesis spaces to pose informative questions given limited cognitive resources? We study these tradeoffs in a classic grounded question-asking task based on the board game Battleship. Our language-informed program sampling (LIPS) model uses large language models (LLMs) to generate natural language questions, translate them into symbolic programs, and evaluate their expected information gain. We find that with a surprisingly modest resource budget, this simple M
View details →Negative / Null Result ReportOpen accessComputer Science
John T. Holodnak, Allan B. Wollaber · 2021 · arXiv
Multiple techniques for producing calibrated predictive probabilities using deep neural networks in supervised learning settings have emerged that leverage approaches to ensemble diverse solutions discovered during cyclic training or training from multiple random starting points (deep ensembles). However, only a limited amount of work has investigated the utility of exploring the local region around each diverse solution (posterior mode). Using three well-known deep architectures on the CIFAR-10 dataset, we evaluate several simple methods for exploring local regions of the weight space with re
View details →Failed Experiment ReportOpen accessComputer Science
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 →Negative / Null Result ReportOpen accessComputer Science
Lucas Oliveira Souza, Gabriel de Oliveira Ramos, Celia Ghedini Ralha · 2019 · arXiv
The idea of experience sharing between cooperative agents naturally emerges from our understanding of how humans learn. Our evolution as a species is tightly linked to the ability to exchange learned knowledge with one another. It follows that experience sharing (ES) between autonomous and independent agents could become the key to accelerate learning in cooperative multiagent settings. We investigate if randomly selecting experiences to share can increase the performance of deep reinforcement learning agents, and propose three new methods for selecting experiences to accelerate the learning p
View details →Negative / Null Result ReportOpen accessComputer Science
Andreas Noack, Randolf Rotta · 2008 · arXiv
Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large graphs. A simple and effective class of heuristics coarsens the graph by iteratively merging clusters (starting from singletons), and optionally refines the resulting clustering by iteratively moving individual vertices between clusters. Several heuristics of this type have been proposed in the literature, but little is known about their relative performance. This paper experimentally compares existing and new coarsenin
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 →