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
Cheng Tang, Andrew Arnold · 2020 · arXiv
Recently, Nogueira et al. [2019] proposed a new approach to document expansion based on a neural Seq2Seq model, showing significant improvement on short text retrieval task. However, this approach needs a large amount of in-domain training data. In this paper, we show that this neural document expansion approach can be effectively adapted to standard IR tasks, where labels are scarce and many long documents are present.
View details →Negative / Null Result ReportOpen accessComputer Science
Mohan Raj Chanthran, Lay-Ki Soon, Huey Fang Ong et al. · 2024 · arXiv
Malaysian English is a low resource creole language, where it carries the elements of Malay, Chinese, and Tamil languages, in addition to Standard English. Named Entity Recognition (NER) models underperform when capturing entities from Malaysian English text due to its distinctive morphosyntactic adaptations, semantic features and code-switching (mixing English and Malay). Considering these gaps, we introduce MENmBERT and MENBERT, a pre-trained language model with contextual understanding, specifically tailored for Malaysian English. We have fine-tuned MENmBERT and MENBERT using manually annot
View details →Negative / Null Result ReportOpen accessComputer Science
Michael Wrana, Uzma Maroof, Diogo Barradas · 2025 · arXiv
Website fingerprinting (WF) is a technique that allows an eavesdropper to determine the website a target user is accessing by inspecting the metadata associated with the packets she exchanges via some encrypted tunnel, e.g., Tor. Recent WF attacks built using machine learning (and deep learning) process and summarize trace metadata during their feature extraction phases. This methodology leads to predictions that lack information about the instant at which a given website is detected within a (potentially large) network trace comprised of multiple sequential website accesses -- a setting known
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
Nima Akhlaghi, Ananya Dhawan, Amir A. Khan et al. · 2018 · arXiv
Objective: The objectives of this paper are to determine the optimal location for ultrasound transducer placement on the anterior forearm for imaging maximum muscle deformations during different hand motions and to investigate the effect of using a sparse set of ultrasound scanlines for motion classification for ultrasound-based muscle computer interfaces (MCIs). Methods: The optimal placement of the ultrasound transducer along the forearm is identified using freehand 3D reconstructions of the muscle thickness during rest and motion completion. From the ultrasound images acquired from the opti
View details →Negative / Null Result ReportOpen accessComputer Science
Adam Brandenburger, Pierfrancesco La Mura · 2025 · arXiv
Any quasi-probability representation of a no-signaling system -- including quantum systems -- can be simulated via a purely classical scheme by allowing signed events and a cancellation procedure. This raises a fundamental question: What properties of the non-classical system does such a classical simulation fail to replicate? We answer by using large deviation theory to show that the probability of a large fluctuation under the classical simulation can be strictly greater than under the actual non-classical system. The key finding driving our result is that negativity in probability relaxes t
View details →Negative / Null Result ReportOpen accessComputer Science
Mirac Suzgun, Nathan Scales, Nathanael Schärli et al. · 2022 · arXiv
BIG-Bench (Srivastava et al., 2022) is a diverse evaluation suite that focuses on tasks believed to be beyond the capabilities of current language models. Language models have already made good progress on this benchmark, with the best model in the BIG-Bench paper outperforming average reported human-rater results on 65% of the BIG-Bench tasks via few-shot prompting. But on what tasks do language models fall short of average human-rater performance, and are those tasks actually unsolvable by current language models? In this work, we focus on a suite of 23 challenging BIG-Bench tasks which we c
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
M. C. Gonzalez-Garcia, S. F. Novaes · 1996 · arXiv
We investigate the effects induced by excited leptons at the one-loop level in the observables measured on the $Z$ peak at LEP. Using a general effective Lagrangian approach to describe the couplings of the excited leptons, we compute their contributions to both oblique parameters and $Z$ partial widths. Our results show that the new effects are comparable to the present experimental sensitivity, but they do not lead to a significant improvement on the available constraints on the couplings and masses of these states.
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
Ni Yang, Rui He, Philipp Homan et al. · 2026 · arXiv
Large language models (LLMs) reliably predict neural activity during language comprehension and transformer depth has been interpreted as mirroring hierarchical cortical organization. However, it remains unclear whether such alignment extends to subcortical regions, overlaps spatially across languages, and what the computational roots of such alignment are. Here, we used a multilingual, whole-brain encoding framework to examine brain-LLM alignment across three typologically distinct languages: Mandarin, English, and French during naturalistic story listening. Our results show that across langu
View details →Negative / Null Result ReportOpen accessComputer Science
Zhiqiang Shen, Zechun Liu, Jie Qin et al. · 2021 · arXiv
Previous studies dominantly target at self-supervised learning on real-valued networks and have achieved many promising results. However, on the more challenging binary neural networks (BNNs), this task has not yet been fully explored in the community. In this paper, we focus on this more difficult scenario: learning networks where both weights and activations are binary, meanwhile, without any human annotated labels. We observe that the commonly used contrastive objective is not satisfying on BNNs for competitive accuracy, since the backbone network contains relatively limited capacity and re
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
T. Gent, S. Huber, K. Mimasu et al. · 2025 · arXiv
We perform a detailed investigation of the viable baryogenesis parameter space of a non-minimal Higgs sector consisting of two Higgs doublets and a singlet pseudoscalar (2HDM$+a$). In such a model, an early Universe period of transient CP violation may occur, driven by a nonvanishing vacuum expectation value of the CP-odd scalar $a$. This naturally avoids the stringent electric dipole moment experimental constraints on beyond-the-Standard-Model sources of CP violation. We provide a state-of-art computation of the baryon asymmetry, providing several important improvements over existing baryogen
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
Nandakishore Santhi, Alexander Vardy · 2006 · arXiv
We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information theory problems. In general, the exact Bayes risk can be difficult to obtain. Many upper and lower bounds are known in literature. One such upper bound is the equivocation bound due to Rényi which is of great philosophical interest because it connects the Bayes risk to conditional entropy. Here we give a simple derivation for an improved equivocation bound. We
View details →Negative / Null Result ReportOpen accessComputer Science
I. Sahin · 2008 · arXiv
We investigate the potential of $γγ$ collisions to probe scalar unparticle couplings via top-antitop quark pair production. We find 95% confidence level limits on the unparticle couplings with an integrated luminosity of $500 fb^{-1}$ and $\sqrt{s}=1$ TeV energy. We investigate the effect of top quark spin polarization on the unparticle couplings. It is shown that spin polarization of the top quark leads to a significant improvement in the sensitivity limits.
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
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
Shibdas Roy, Ian R. Petersen, Elanor H. Huntington · 2014 · arXiv
We consider a coherent-classical estimation scheme for a class of linear quantum systems. It comprises an estimator that is a mixed quantum-classical system without involving coherent feedback. The estimator yields a classical estimate of a variable for the quantum plant. We demonstrate that for a passive plant that can be characterized by annihilation operators only, such coherent-classical estimation provides no improvement over purely-classical estimation. An example is also given which shows that if the plant is not assumed to be an annihilation operator only quantum system, it is possible
View details →Negative / Null Result ReportOpen accessComputer Science
Mateusz Praski, Jakub Adamczyk, Wojciech Czech · 2025 · arXiv
Pretrained neural networks have attracted significant interest in chemistry and small molecule drug design. Embeddings from these models are widely used for molecular property prediction, virtual screening, and small data learning in molecular chemistry. This study presents the most extensive comparison of such models to date, evaluating 25 models across 25 datasets. Under a fair comparison framework, we assess models spanning various modalities, architectures, and pretraining strategies. Using a dedicated hierarchical Bayesian statistical testing model, we arrive at a surprising result: nearl
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
Zijian Li, Luzhen Tang, Mengyu Xia et al. · 2025 · arXiv
With generative artificial intelligence driving the growth of dialogic data in education, automated coding is a promising direction for learning analytics to improve efficiency. This surge highlights the need to understand the nuances of student-AI interactions, especially those rare yet crucial. However, automated coding may struggle to capture these rare codes due to imbalanced data, while human coding remains time-consuming and labour-intensive. The current study examined the potential of large language models (LLMs) to approximate or replace humans in deductive, theory-driven coding, while
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 →Negative / Null Result ReportOpen accessComputer Science
Victor Lagerkvist, Johanna Groven, Leif Eriksson · 2026 · arXiv
The region connection calculus ($RCC$) and Allen's interval algebra ($IA$) are two well-known NP-hard spatial-temporal qualitative reasoning problems. They are solvable in $2^{O(n \log n)}$ time, where $n$ is the number of variables, and $IA$ is additionally known to be solvable in $o(n)^n$ time. However, no improvement over exhaustive search is known for $RCC$, and if they are also solvable in single exponential time $2^{O(n)}$ is unknown. We investigate multiple avenues towards reaching such bounds. First, we show that branching is insufficient since there are too many non-redundant constrai
View details →Negative / Null Result ReportOpen accessComputer Science
Kunal Ghosh, Milica Todorović, Aki Vehtari et al. · 2024 · arXiv
Active learning (AL) has shown promise for being a particularly data-efficient machine learning approach. Yet, its performance depends on the application and it is not clear when AL practitioners can expect computational savings. Here, we carry out a systematic AL performance assessment for three diverse molecular datasets and two common scientific tasks: compiling compact, informative datasets and targeted molecular searches. We implemented AL with Gaussian processes (GP) and used the many-body tensor as molecular representation. For the first task, we tested different data acquisition strate
View details →