Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

12233546 · May 202619922001200920172026
48 results for negational symmetry

QNNs can't distinguish binary signals from their negations, revealing a new symmetry.

problem Understanding the behavior of QNNs in binary pattern classification.
method Presented and analyzed a new form of invariance (negational symmetry) in QNNs.
result QNNs cannot differentiate a quantum binary signal and its negational counterpart in binary classification tasks.

Improved negation detection in Dutch clinical texts using machine learning.

problem Extracting negation from clinical text for better model development.
method Comparison of rule-based and machine learning methods (biLSTM, RoBERTa).
result BiLSTM and RoBERTa models outperform rule-based method in F1 score, precision, and recall.

This paper describes the resource- and system-building efforts of an eight-week Johns Hopkins University Human Language Technology Center of Excellence Summer Camp for Applied Language Exploration (SCALE-2009) on Semantically-Informed Machine Translation (SIMT). We describe a new modality/negation (MN) annotation schem…

2015-02-05abs ↗pdf ↗

Antithetic noise improves diffusion models' uncertainty quantification.

problem Improving uncertainty quantification in diffusion models.
method Pairing each noise sample with its negation, leading to strong negative correlation.
result Substantially more reliable uncertainty quantification with up to 90% narrower confidence intervals.

Sign equivariant networks improve model expressiveness for spectral geometric learning.

problem Limited expressiveness of sign invariant models for tasks like graph link prediction.
method Developed sign equivariant neural network architectures based on new analytic sign equivariant polynomials.
result Sign equivariant models achieve theoretical benefits in spectral geometric learning tasks.

Unified framework evaluates different nearest neighbor classification methods.

problem Evaluating and comparing classical, fuzzy, and fuzzy rough nearest neighbor classification methods.
method Standardized nearest neighbor weighting with kernel functions applied to distance and/or rank values of nearest neighbors.
result NN, FNN, and FRNN perform best with Boscovich distance, and NN and FRNN perform best with specific combinations of weights and scaling measures.

Convolutional neural network improves assertion detection in multi-label clinical text.

problem Detecting assertions in multi-label clinical text with rich descriptions.
method Developed a CNN architecture for multi-label scope detection.
result At least 12% improvement over state-of-the-art on multi-label clinical text.

Early detection of preventable diseases is important for better disease management, improved inter-ventions, and more efficient health-care resource allocation. Various machine learning approacheshave been developed to utilize information in Electronic Health Record (EHR) for this task. Majorityof previous attempts, ho…

2018-08-15abs ↗pdf ↗

This study analyzes how RNNs process context in sentiment analysis.

problem Understanding how recurrent neural networks process context in sentiment analysis.
method Developed methods to reverse engineer RNNs, identifying contextual effects and quantifying their strength and timescale.
result Identified inputs that induce contextual effects and quantified their properties.

It is a conjecture that the signature of a positive link is bounded below by an increasing function of its negated Euler characteristic. In relation to this conjecture, we apply the generator description for canonical genus to show that the boundedness of the genera of positive knots with given signature can be algorit…

2009-07-06abs ↗pdf ↗

Study how predictions affect the data they're based on, improving generalization guarantees.

problem How well do models generalize when predictions influence the data they're trained on?
method Embed performative predictions into statistical learning theory and prove generalization bounds.
result There's a fundamental trade-off between affecting data and learning from it.

Convolutional neural networks have been successfully applied to various NLP tasks. However, it is not obvious whether they model different linguistic patterns such as negation, intensification, and clause compositionality to help the decision-making process. In this paper, we apply visualization techniques to observe h…

2018-10-18abs ↗pdf ↗

Efficient oblique RSF method improves prediction and interpretability.

problem Limited computational efficiency and difficulty in interpreting oblique RSF ensembles.
method Newton-Raphson scoring for computational efficiency and negation importance for variable importance estimation.
result The method reduces computational overhead by 450 times and improves prediction accuracy.

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

We propose a new batch mode active learning algorithm designed for neural networks and large query batch sizes. The method, Discriminative Active Learning (DAL), poses active learning as a binary classification task, attempting to choose examples to label in such a way as to make the labeled set and the unlabeled pool …

2019-07-15abs ↗pdf ↗

One of the most pressing questions in climate science is that of the effect of anthropogenic aerosol on the Earth's energy balance. Aerosols provide the `seeds' on which cloud droplets form, and changes in the amount of aerosol available to a cloud can change its brightness and other physical properties such as optical…

2019-11-29abs ↗pdf ↗

Sensor fusion is a key technology that integrates various sensory inputs to allow for robust decision making in many applications such as autonomous driving and robot control. Deep neural networks have been adopted for sensor fusion in a body of recent studies. Among these, the so-called netgated architecture was propo…

2018-10-08abs ↗pdf ↗

Word vectors are at the core of many natural language processing tasks. Recently, there has been interest in post-processing word vectors to enrich their semantic information. In this paper, we introduce a novel word vector post-processing technique based on matrix conceptors (Jaeger2014), a family of regularized ident…

2018-11-17abs ↗pdf ↗

Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which…

2017-12-08abs ↗pdf ↗

In this paper we apply a compressibility loss that enables learning highly compressible neural network weights. The loss was previously proposed as a measure of negated sparsity of a signal, yet in this paper we show that minimizing this loss also enforces the non-zero parts of the signal to have very low entropy, thus…

2019-05-03abs ↗pdf ↗

Neuro-symbolic agent learns systematic generalisation from formal instructions.

problem Achieving zero-shot generalisation of formally specified tasks.
method Combines deep reinforcement learning with temporal logic.
result Systematic learning emerges with convolutional layers and abstract operators.

We fully describe the horofunction boundary hL2\partial_h L_2 with the word metric associated with the generating set {t,at}\{t,at\} (i.e the metric arising in the Diestel-Leader graph DL(2,2)\text{DL}(2,2)). The visual boundary L2\partial_\infty L_2 with this metric is a subset of hL2\partial_h L_2. Although $\partial_\infty L_2…

2014-10-31abs ↗pdf ↗

UTE improves reinforcement learning by measuring action uncertainty, enhancing policy learning efficiency.

problem Degrading performance of action repetition in reinforcement learning, especially with sub-optimal actions.
method UTE uses ensemble methods to measure uncertainty during action extension, allowing strategic exploration or certainty.
result UTE outperforms existing action repetition algorithms, significantly enhancing policy learning efficiency.

Active learning can't improve over passive in certain settings.

problem Active learning vs. passive learning in nonparametric settings.
method Analyzing margin conditions and their effects on active learning performance.
result Nuances in margin conditions determine whether active learning can outperform passive learning.

Recently, several methods have been proposed to explain the predictions of recurrent neural networks (RNNs), in particular of LSTMs. The goal of these methods is to understand the network's decisions by assigning to each input variable, e.g., a word, a relevance indicating to which extent it contributed to a particular…

2019-04-26abs ↗pdf ↗

Energy-based models can generate complex images by combining simpler concepts.

problem Generating natural images that satisfy complex logical combinations of concepts.
method Energy-based models combine probability distributions of simpler concepts to generate compositions.
result Energy-based models can generate images that satisfy conjunctions, disjunctions, and negations of concepts.

A Boolean algebra formalizes task composition for reinforcement learning.

problem Formalizing task composition for efficient learning and problem-solving.
method Formalized tasks as a Boolean algebra, learning goal-oriented value functions, and composing them to solve new tasks.
result Agents can solve new tasks without additional learning by composing value functions in specific ways.

The paper analyzes symmetries of Vaidya-Bonner geodesics.

problem Investigating invariance properties of Vaidya-Bonner geodesics.
method Classification of Lie point symmetries and Noether symmetries, determination of optimal system of subalgebras.
result Determination of optimal system of subalgebras for Vaidya-Bonner geodesics.

Method improves deep learning models for datasets with mixed approximate symmetries.

problem Improving deep learning models for datasets with mixed approximate symmetries.
method Regularizer-based approach to build models for datasets with mixed approximate symmetries.
result Our method achieves better accuracy than prior approaches while discovering the approximate symmetry levels correctly.

Statistical model checking for PCTL on MDPs using reinforcement learning.

problem Model checking PCTL specifications on MDPs with statistical methods.
method Reinforcement learning for policy search, statistical model checking with UCB-based Q-learning.
result Provably guaranteed statistical model checking method for PCTL specifications on MDPs.

Symmetry in loss functions constrains model parameters, leading to specific learning outcomes.

problem Understanding and leveraging symmetries in neural networks to improve learning outcomes.
method Analyzing the impact of loss function symmetries on model parameters and learning behavior.
result Mirror-reflection symmetries in loss functions lead to constraints on model parameters, influencing learning outcomes.

Approximate symmetries of geodesic equations on 2-spheres are studied. These are the symmetries of the perturbed geodesic equations which represent approximate path of a particle rather than exact path. After giving the exact symmetries of the geodesic equations, two different approaches to study the approximate symmet…

2010-05-09abs ↗pdf ↗

Let R\R be a real closed field, QR[Y1,...,Y,X1,...,Xk], {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], with $ °_{Y}(Q) \leq 2, °_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and PR[X1,...,Xk] {\mathcal P} \subset \R[X_1,...,X_k] with $°_{X}(P) \leq d, P \in {\mathcal P}, #({\mathcal P})=s$. Let SR+kS \subset \R^{\ell+k} be a semi-alg…

2008-06-24abs ↗pdf ↗

New framework discovers non-affine continuous symmetries in neural networks.

problem Lack of efficient methods for detecting non-affine continuous symmetries in neural networks.
method Computational framework for discovering infinitesimal generators of multi-parameter group actions.
result Framework can discover non-affine continuous symmetries in neural networks.