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
Felix Krejca, Tobias Kietreiber, Alexander Buchelt et al. · 2025 · arXiv
The increasing volume of online discussions requires advanced automatic content moderation to maintain responsible discourse. While hate speech detection on social media is well-studied, research on German-language newspaper forums remains limited. Existing studies often neglect platform-specific context, such as user history and article themes. This paper addresses this gap by developing and evaluating binary classification models for automatic content moderation in German newspaper forums, incorporating contextual information. Using LSTM, CNN, and ChatGPT-3.5 Turbo, and leveraging the One Mi
View details →Negative / Null Result ReportOpen accessComputer Science
Syed Assad, Mark Bradshaw, Ping Koy Lam · 2016 · arXiv
Amplification of quantum states is inevitably accompanied with the introduction of noise at the output. For protocols that are probabilistic with heralded success, noiseless linear amplification in theory may still possible. When the protocol is successful, it can lead to an output that is a noiselessly amplified copy of the input. When the protocol is unsuccessful, the output state is degraded and is usually discarded. Probabilistic protocols may improve the performance of some quantum information protocols, but not for metrology if the whole statistics is taken into consideration. We calcula
View details →Negative / Null Result ReportOpen accessComputer Science
Peratham Wiriyathammabhum · 2023 · arXiv
In this report, we describe our Transformers for euphemism detection baseline (TEDB) submissions to a shared task on euphemism detection 2022. We cast the task of predicting euphemism as text classification. We considered Transformer-based models which are the current state-of-the-art methods for text classification. We explored different training schemes, pretrained models, and model architectures. Our best result of 0.816 F1-score (0.818 precision and 0.814 recall) consists of a euphemism-detection-finetuned TweetEval/TimeLMs-pretrained RoBERTa model as a feature extractor frontend with a Ki
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
Andrea Gallo Rosso, Francesco Vissani, Maria Cristina Volpe · 2017 · arXiv
We investigate the precision with which a neutron star gravitational binding energy can be measured through the supernova neutrino signal, without assuming any prior such as the energy equipartition hypothesis, mean energies hierarchy or constraints on the pinching parameters that characterize the neutrino spectra. We consider water Cherenkov detectors and prove that combining inverse beta decay with elastic scattering on electrons is sufficient to reach $11\%$ precision on the neutron star gravitational binding energy already with Super-Kamiokande. The inclusion of neutral current events on o
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
Yunah Jang, Megha Sundriyal, Kyomin Jung et al. · 2026 · arXiv
Adaptive Retrieval-Augmented Generation (RAG) promises accuracy and efficiency by dynamically triggering retrieval only when needed and is widely used in practice. However, real-world queries vary in surface form even with the same intent, and their impact on Adaptive RAG remains under-explored. We introduce the first large-scale benchmark of diverse yet semantically identical query variations, combining human-written and model-generated rewrites. Our benchmark facilitates a systematic evaluation of Adaptive RAG robustness by examining its key components across three dimensions: answer quality
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
Chengbin Pang, Ruotong Yu, Dongpeng Xu et al. · 2021 · arXiv
Function entry detection is critical for security of binary code. Conventional methods heavily rely on patterns, inevitably missing true functions and introducing errors. Recently, call frames have been used in exception-handling for function start detection. However, existing methods have two problems. First, they combine call frames with heuristic-based approaches, which often brings error and uncertain benefits. Second, they trust the fidelity of call frames, without handling the errors that are introduced by call frames. In this paper, we first study the coverage and accuracy of existing a
View details →Negative / Null Result ReportOpen accessComputer Science
Callum Sharrock, Lukas Petersson, Hanna Petersson et al. · 2025 · arXiv
We present Butter-Bench, a benchmark evaluating large language model (LLM) controlled robots for practical intelligence, defined as the ability to navigate the messiness of the physical world. Current state-of-the-art robotic systems use a hierarchical architecture with LLMs in charge of high-level reasoning, and a Vision Language Action (VLA) model for low-level control. Butter-Bench evaluates the LLM part in isolation from the VLA. Although LLMs have repeatedly surpassed humans in evaluations requiring analytical intelligence, we find humans still outperform LLMs on Butter-Bench. The best LL
View details →Negative / Null Result ReportOpen accessComputer Science
Tomoya Kurosawa, Hitomi Yanaka · 2023 · arXiv
Even in the era of massive language models, it has been suggested that character-level representations improve the performance of neural models. The state-of-the-art neural semantic parser for Discourse Representation Structures uses character-level representations, improving performance in the four languages (i.e., English, German, Dutch, and Italian) in the Parallel Meaning Bank dataset. However, how and why character-level information improves the parser's performance remains unclear. This study provides an in-depth analysis of performance changes by order of character sequences. In the exp
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
Guanzi Chen, Jiying Zhang, Xi Xiao et al. · 2022 · arXiv
In recent years, hypergraph learning has attracted great attention due to its capacity in representing complex and high-order relationships. However, current neural network approaches designed for hypergraphs are mostly shallow, thus limiting their ability to extract information from high-order neighbors. In this paper, we show both theoretically and empirically, that the performance of hypergraph neural networks does not improve as the number of layers increases, which is known as the over-smoothing problem. To avoid this issue, we develop a new deep hypergraph convolutional network called De
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 →Negative / Null Result ReportOpen accessComputer Science
M. M. Sargsian, S. Simula, M. I. Strikman · 2002 · arXiv
A detailed study of inclusive deep inelastic scattering from mirror A = 3 nuclei at large values of Bjorken-x is presented. The main purpose is to estimate the theoretical uncertainties on the extraction of F2n from such measurements. Within the convolution approach we confirm the cancellation of nuclear effects at the level of ~1 % for x < 0.75 in overall agreement with previous findings. However, within models in which modifications of the bound nucleon structure functions are accounted for to describe the EMC effect in nuclei, we find that the nuclear effects may be canceled at a level of ~
View details →Negative / Null Result ReportOpen accessComputer Science
Matthew Rueben, Frank J. Bernieri, Cindy M. Grimm et al. · 2019 · arXiv
Privacy-sensitive robotics is an emerging area of HRI research. Judgments about privacy would seem to be context-dependent, but none of the promising work on contextual "frames" has focused on privacy concerns. This work studies the impact of contextual "frames" on local users' privacy judgments in a home telepresence setting. Our methodology consists of using an online questionnaire to collect responses to animated videos of a telepresence robot after framing people with an introductory paragraph. The results of four studies indicate a large effect of manipulating the robot operator's identit
View details →Negative / Null Result ReportOpen accessComputer Science
Syomantak Chaudhuri, Thomas A. Courtade · 2023 · arXiv
Differential Privacy (DP) is a well-established framework to quantify privacy loss incurred by any algorithm. Traditional DP formulations impose a uniform privacy requirement for all users, which is often inconsistent with real-world scenarios in which users dictate their privacy preferences individually. This work considers the problem of mean estimation under heterogeneous DP constraints, where each user can impose their own distinct privacy level. The algorithm we propose is shown to be minimax optimal when there are two groups of users with distinct privacy levels. Our results elicit an in
View details →Negative / Null Result ReportOpen accessComputer Science
Runtian Zhai, Chen Dan, Zico Kolter et al. · 2022 · arXiv
Empirical risk minimization (ERM) is known in practice to be non-robust to distributional shift where the training and the test distributions are different. A suite of approaches, such as importance weighting, and variants of distributionally robust optimization (DRO), have been proposed to solve this problem. But a line of recent work has empirically shown that these approaches do not significantly improve over ERM in real applications with distribution shift. The goal of this work is to obtain a comprehensive theoretical understanding of this intriguing phenomenon. We first posit the class o
View details →Negative / Null Result ReportOpen accessComputer Science
Seyed Arash Ghoreishi, Nidhin Sudarsanan Ragini, Sk Sazim et al. · 2024 · arXiv
Quantum labeling tasks ask one to recover the missing associations between classical outcome labels and the effects forming the POVM. We study labeling in the multiple-shot regime, allowing a finite number of uses of the device and the most general tester-based strategies, including adaptivity. For binary observables, we show that if perfect labeling is impossible in a single shot, then it remains impossible with any finite number of shots. In particular, we derive the formula for minimum-error performance and highlight its ``even-odd" behavior. For non-binary observables, we derive the optima
View details →Negative / Null Result ReportOpen accessComputer Science
Alex Ayoub, Samuel Robertson, Dawen Liang et al. · 2025 · arXiv
Matrix factorization is a widely used approach for top-N recommendation and collaborative filtering. When implemented on implicit feedback data (such as clicks), a common heuristic is to upweight the observed interactions. This strategy has been shown to improve performance for certain algorithms. In this paper, we conduct a systematic study of various weighting schemes and matrix factorization algorithms. Somewhat surprisingly, we find that training with unweighted data can perform comparably to, and sometimes outperform, training with weighted data, especially for large models. This observat
View details →Negative / Null Result ReportOpen accessComputer Science
Marc-Antoine Allard, Matin Ansaripour, Maria Yuffa et al. · 2024 · arXiv
Large Language Models (LLMs) often struggle with tasks requiring mathematical reasoning, particularly multiple-choice questions (MCQs). To address this issue, we developed LLaMa-SciQ, an educational chatbot designed to assist college students in solving and understanding MCQs in STEM fields. We begin by fine-tuning and aligning the models to human preferences. After comparing the performance of Mistral-7B and LLaMa-8B, we selected the latter as the base model due to its higher evaluation accuracy. To further enhance accuracy, we implement Retrieval-Augmented Generation (RAG) and apply quantiza
View details →Negative / Null Result ReportOpen accessComputer Science
Paul K. Mandal · 2025 · arXiv
In this paper, I investigate the effectiveness of dataset cartography for extractive question answering on the SQuAD dataset. I begin by analyzing annotation artifacts in SQuAD and evaluate the impact of two adversarial datasets, AddSent and AddOneSent, on an ELECTRA-small model. Using training dynamics, I partition SQuAD into easy-to-learn, ambiguous, and hard-to-learn subsets. I then compare the performance of models trained on these subsets to those trained on randomly selected samples of equal size. Results show that training on cartography-based subsets does not improve generalization to
View details →Negative / Null Result ReportOpen accessComputer Science
Yuto Nishida, Makoto Morishita, Hiroyuki Deguchi et al. · 2025 · arXiv
The $k$-nearest-neighbor language model ($k$NN-LM), one of the retrieval-augmented language models, improves the perplexity for given text by directly accessing a large datastore built from any text data during inference. A widely held hypothesis for the success of $k$NN-LM is that its explicit memory, i.e., the datastore, enhances predictions for long-tail phenomena. However, prior works have primarily shown its ability to retrieve long-tail contexts, leaving the model's performance remain underexplored in estimating the probabilities of long-tail target tokens during inference. In this paper
View details →Negative / Null Result ReportOpen accessComputer Science
Hassan Bassereh, Vahid Salari, Farhad Shahbazi et al. · 2015 · arXiv
We consider quantum excitation energy transport (EET) in a network of two-state nodes in the Markovian approximation by employing the Lindblad formulation. We find that EET from an initial site, where the excitation is inserted to the sink, is generally inefficient due to the inhibition of transport by localization of the excitation wave packet in a symmetric, fully-connected network. We demonstrate that the EET efficiency can be significantly increased up to %100 by perturbing hopping transport between the initial node and the one connected directly to the sink, while the rate of energy trans
View details →Negative / Null Result ReportOpen accessComputer Science
Hugo Meric, Jose Miguel Piquer · 2013 · arXiv
We study the design of a DVB-S2 system in order to maximise spectrum efficiency. This task is usually challenging due to channel variability. Modern satellite communications systems such as DVB-SH and DVB-S2 rely mainly on a time sharing strategy to optimise the spectrum efficiency. Recently, we showed that combining time sharing with hierarchical modulation can provide significant gains (in terms of spectrum efficiency) compared to the best time sharing strategy. However, our previous design does not improve the DVB-S2 performance when all the receivers experience low or large signal-to-noise
View details →Negative / Null Result ReportOpen accessComputer Science
Ab Mosca, Alvitta Ottley, Remco Chang · 2021 · arXiv
Interaction enables users to navigate large amounts of data effectively, supports cognitive processing, and increases data representation methods. However, there have been few attempts to empirically demonstrate whether adding interaction to a static visualization improves its function beyond popular beliefs. In this paper, we address this gap. We use a classic Bayesian reasoning task as a testbed for evaluating whether allowing users to interact with a static visualization can improve their reasoning. Through two crowdsourced studies, we show that adding interaction to a static Bayesian reaso
View details →Negative / Null Result ReportOpen accessComputer Science
Richard G. Clegg · 2006 · arXiv
The aim of this paper is to use a very simple queuing model to compare a number of models from the literature which have been used to replicate the statistical nature of internet traffic and, in particular, the long-range dependence of this traffic. The four models all have the form of discrete time Markov-modulated processes (two other models are introduced for comparison purposes). While it is often stated that long-range dependence has a critical effect on queuing performance, it appears that the models used here do not well replicated the queuing performance of real internet traffic. In pa
View details →