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
Hayato Arai, Yuuya Yoshida, Masahito Hayashi · 2019 · arXiv
We address perfect discrimination of two separable states. When available states are restricted to separable states, we can theoretically consider a larger class of measurements than the class of measurements allowed in quantum theory. The framework composed of the class of separable states and the above extended class of measurements is a typical example of general probabilistic theories. In this framework, we give a necessary and sufficient condition to discriminate two separable pure states perfectly. In particular, we derive measurements explicitly to discriminate two separable pure states
View details →Negative / Null Result ReportOpen accessComputer Science
Felix Leditzky, Debbie Leung, Graeme Smith · 2017 · arXiv
We determine both the quantum and the private capacities of low-noise quantum channels to leading orders in the channel's distance to the perfect channel. It has been an open problem for more than 20 years to determine the capacities of some of these low-noise channels such as the depolarizing channel. We also show that both capacities are equal to the single-letter coherent information of the channel, again to leading orders. We thus find that, in the low noise regime, super-additivity and degenerate codes have negligible benefit for the quantum capacity, and shielding does not improve the pr
View details →Negative / Null Result ReportOpen accessComputer Science
A. Hietanen, K. Kajantie, M. Laine et al. · 2008 · arXiv
We update Monte Carlo simulations of the three-dimensional SU(3) + adjoint Higgs theory, by extrapolating carefully to the infinite volume and continuum limits, in order to estimate the contribution of the infrared modes to the pressure of hot QCD. The sum of infrared contributions beyond the known 4-loop order turns out to be a smooth function, of a reasonable magnitude and specific sign. Unfortunately, adding this function to the known 4-loop terms does not improve the match to four-dimensional lattice data, in spite of the fact that other quantities, such as correlation lengths, spatial str
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
Maximilian Spliethöver, Jonas Klaff, Hendrik Heuer · 2019 · arXiv
Attention mechanisms have seen some success for natural language processing downstream tasks in recent years and generated new State-of-the-Art results. A thorough evaluation of the attention mechanism for the task of Argumentation Mining is missing, though. With this paper, we report a comparative evaluation of attention layers in combination with a bidirectional long short-term memory network, which is the current state-of-the-art approach to the unit segmentation task. We also compare sentence-level contextualized word embeddings to pre-generated ones. Our findings suggest that for this tas
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 →Methods Dead-EndOpen accessComputer Science
Pierre Boullier · 1996 · arXiv
In this paper we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining grammars. For a LIG $L$ and an input string $x$ of length $n$, we build a non ambiguous context-free grammar whose sentences are all (and exclusively) valid derivation sequences in $L$ which lead to $x$. We show that this grammar can be built in ${\cal O}(n^6)$ time and that individual parses can be extracted in linear time with the size of the extracted parse tree. Though this ${\cal O}(n^6)$ upper bound does not impro
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
A. Donini, E. Fernandez-Martinez, S. Rigolin · 2004 · arXiv
In this letter we present the study of the eightfold degeneracy in the $(θ_{13},δ)$ measurement including both appearance and disappearance channels. We analyse, for definiteness, the case of a standard low-$γ$ $β$-Beam and a 4 MWatt SPL Super-Beam facility, both aiming at a UNO-like Mton water Cerenkov detector located at the Frejus laboratory, $L = 130$ km. In the $β$-Beam case, the \nue disappearance channel does not improve the $(θ_{13},δ)$ measurement when a realistic (i.e. $\ge$ 2%) systematic error is included. In the Super-Beam case, the \numu disappearance channel could, instead, be q
View details →Negative / Null Result ReportOpen accessComputer Science
Chen Cai, Yusu Wang · 2020 · arXiv
Graph Neural Networks (GNNs) have achieved a lot of success on graph-structured data. However, it is observed that the performance of graph neural networks does not improve as the number of layers increases. This effect, known as over-smoothing, has been analyzed mostly in linear cases. In this paper, we build upon previous results \cite{oono2019graph} to further analyze the over-smoothing effect in the general graph neural network architecture. We show when the weight matrix satisfies the conditions determined by the spectrum of augmented normalized Laplacian, the Dirichlet energy of embeddin
View details →Negative / Null Result ReportOpen accessComputer Science
Ngoc Minh Lai · 2022 · arXiv
Processing complex and ambiguous named entities is a challenging research problem, but it has not received sufficient attention from the natural language processing community. In this short paper, we present our participation in the English track of SemEval-2022 Task 11: Multilingual Complex Named Entity Recognition. Inspired by the recent advances in pretrained Transformer language models, we propose a simple yet effective Transformer-based baseline for the task. Despite its simplicity, our proposed approach shows competitive results in the leaderboard as we ranked 12 over 30 teams. Our syste
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
Mingjian He, Robert Malaney · 2022 · arXiv
Hybrid entanglement between discrete-variable (DV) and continuous-variable (CV) quantum systems is an essential resource for heterogeneous quantum networks. Our previous work showed that in lossy channels the teleportation of DV qubits, via CV-entangled states, can be significantly improved by a new protocol defined by a modified Bell state measurement at the sender. This work explores whether a new, similarly modified, CV-based teleportation protocol can lead to improvement in the transfer of hybrid entangled states. To set the scene, we first determine the performance of such a modified prot
View details →Negative / Null Result ReportOpen accessComputer Science
Joshua Frankie Rayo, Vena Pearl Boñgolan · 2020 · arXiv
The Advanced Circulation (ADCIRC) and Simulating Nearshore Waves (SWAN) coupled model is modified to include a stochastic term in the shallow water equations that represents random external forces from debris carried by surge and short-term local scale atmospheric fluctuations. We added $α$-stable noise, uncorrelated in space and time, in the forcing terms of the coupled model. Inputs to the model are unstructured computational mesh derived from topography and bathymetry, land cover classification, tidal potential constituents and atmospheric forcing. The model simulated surge height of around
View details →Negative / Null Result ReportOpen accessComputer Science
Roy Abel, Idan Benami, Yoram Louzoun · 2019 · arXiv
In colored graphs, node classes are often associated with either their neighbors class or with information not incorporated in the graph associated with each node. We here propose that node classes are also associated with topological features of the nodes. We use this association to improve Graph machine learning in general and specifically, Graph Convolutional Networks (GCN). First, we show that even in the absence of any external information on nodes, a good accuracy can be obtained on the prediction of the node class using either topological features, or using the neighbors class as an inp
View details →Negative / Null Result ReportOpen accessComputer Science
Wu Ji · 2026 · arXiv
System prompts for AI coding agents increasingly employ motivational framing -- from neutral task descriptions to fear-driven threats -- yet no controlled study has examined whether such framing affects agent behavior. We present two studies investigating how trust-based versus fear-based motivation framing in system prompts influences AI agent debugging performance. In Study 1, we conducted a controlled manual experiment comparing a trust-framed methodology (NoPUA) against an unframed baseline across 9 debugging scenarios using Claude Sonnet 4. Trust-framed agents found 59% more hidden issues
View details →Negative / Null Result ReportOpen accessComputer Science
Richard A. Formato · 2010 · arXiv
Central Force Optimization is a global search and optimization algorithm that searches a decision space by flying "probes" whose trajectories are deterministically computed using two equations of motion. Because it is possible for a probe to fly outside the domain of feasible solutions, a simple errant probe retrieval method has been used previously that does not include the directional information contained in a probe's acceleration vector. This note investigates the effect of adding directionality to the "repositioning factor" approach. As a general proposition, it appears that doing so does
View details →Negative / Null Result ReportOpen accessComputer Science
Aloïs Rautureau, Éric Piette · 2025 · arXiv
While AI systems have equaled or surpassed human performance in a wide variety of games such as Chess, Go, or Dota 2, describing these systems as truly "human-like" remains far-fetched. Despite their success, they fail to replicate the pattern-based, intuitive decision-making processes observed in human cognition. This paper presents an overview of findings from cognitive psychology and previous efforts to model human-like behavior in artificial agents, discusses their applicability to General Game Playing (GGP) and introduces our work-in-progress model based on these observations: CogniPlay.
View details →Negative / Null Result ReportOpen accessComputer Science
Ehsan Asadi Kangarshahi, Albert Guillén i Fàbregas · 2020 · arXiv
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error on the translated channel implies a mismatched-decoding error in the original channel. In particular, a strong converse is shown to hold for this upper-bound: if the rate exceeds the upper-bound, the probability of error tends to 1 exponentially when the block-length tends to infinity. We also show that the underlying optimization problem is a convex-concave
View details →Negative / Null Result ReportOpen accessComputer Science
Zhijian Luo, Zihan Huang, Jiahui Tang et al. · 2022 · arXiv
At the age of big data, recommender systems have shown remarkable success as a key means of information filtering in our daily life. Recent years have witnessed the technical development of recommender systems, from perception learning to cognition reasoning which intuitively build the task of recommendation as the procedure of logical reasoning and have achieve significant improvement. However, the logical statement in reasoning implicitly admits irrelevance of ordering, even does not consider time information which plays an important role in many recommendation tasks. Furthermore, recommenda
View details →Negative / Null Result ReportOpen accessComputer Science
Niladri S. Chatterji, Philip M. Long · 2022 · arXiv
We bound the excess risk of interpolating deep linear networks trained using gradient flow. In a setting previously used to establish risk bounds for the minimum $\ell_2$-norm interpolant, we show that randomly initialized deep linear networks can closely approximate or even match known bounds for the minimum $\ell_2$-norm interpolant. Our analysis also reveals that interpolating deep linear models have exactly the same conditional variance as the minimum $\ell_2$-norm solution. Since the noise affects the excess risk only through the conditional variance, this implies that depth does not impr
View details →Negative / Null Result ReportOpen accessComputer Science
Antonious M. Girgis, Deepesh Data, Suhas Diggavi · 2021 · arXiv
We study privacy in a distributed learning framework, where clients collaboratively build a learning model iteratively through interactions with a server from whom we need privacy. Motivated by stochastic optimization and the federated learning (FL) paradigm, we focus on the case where a small fraction of data samples are randomly sub-sampled in each round to participate in the learning process, which also enables privacy amplification. To obtain even stronger local privacy guarantees, we study this in the shuffle privacy model, where each client randomizes its response using a local different
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
J. Rehacek, Z. Hradil, M. Dusek et al. · 1999 · arXiv
An experimental comparison of several operational phase concepts is presented. In particular, it is shown that statistically motivated evaluation of experimental data may lead to a significant improvement in phase fitting upon the conventional Noh, Fouge'res and Mandel procedure. The analysis is extended to the asymptotic limit of large intensities, where a strong evidence in favor of multi--dimensional estimation procedures has been found.
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
Dawar Jyoti Deka, Amit Sethi, Syed Mohammad Ali · 2026 · arXiv
Vision-language models enable open-vocabulary object grounding through natural language queries, under the implicit assumption that semantically equivalent descriptions yield consistent outputs. We examine this assumption using a controlled pipeline combining DETR for object proposals with CLIP for language-conditioned selection on 263 COCO val2017 images. We find that overlapping prompts such as "a person," "a human," and "a pedestrian" frequently select different instances, with mean instability of 2.11 distinct selections across six prompts. PCA analysis shows this variability is structured
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
Dou Liu, Ying Long, Sophia Zuoqiu et al. · 2025 · arXiv
Creating high-quality clinical Chains-of-Thought (CoTs) is crucial for explainable medical Artificial Intelligence (AI) while constrained by data scarcity. Although Large Language Models (LLMs) can synthesize medical data, their clinical reliability remains unverified. This study evaluates the reliability of LLM-generated CoTs and investigates prompting strategies to enhance their quality. In a blinded comparative study, senior clinicians in Assisted Reproductive Technology (ART) evaluated CoTs generated via three distinct strategies: Zero-shot, Random Few-shot (using shallow examples), and Se
View details →Negative / Null Result ReportOpen accessComputer Science
Antoni Ramos-Buades, Patricia Schmidt, Geraint Pratten et al. · 2020 · arXiv
The current paradigm for constructing waveforms from precessing compact binaries is to first construct a waveform in a non-inertial, co-precessing binary source frame followed by a time-dependent rotation to map back to the physical, inertial frame. A key insight in the construction of these models is that the co-precessing waveform can be effectively mapped to some equivalent aligned spin waveform. Secondly, the time-dependent rotation implicitly introduces $m$-mode mixing, necessitating an accurate description of higher-order modes in the co-precessing frame. We assess the efficacy of this m
View details →