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,657 papers · 148 categories

Trend · papers per month

2905808691,159 · Jun 202019922001200920172026
48 results for negative data

Novel neural likelihood ratio estimation for negative data in particle physics.

problem Estimating likelihood ratios with negative probability densities and weights.
method Introducing a novel loss function and a new model architecture based on signed mixture models.
result Demonstrated improved estimation on a real-world example from particle physics.

GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.

problem Avoiding obstacles in trajectory planning for real-world systems.
method GP-ND models negative data pairs using Gaussian distributions and maximizes their KL divergence from the GP to avoid them.
result GP-ND outperforms traditional GP learning in obstacle-aware trajectory planning.

When labeled data is scarce for a specific target task, transfer learning often offers an effective solution by utilizing data from a related source task. However, when transferring knowledge from a less related source, it may inversely hurt the target performance, a phenomenon known as negative transfer. Despite its p…

2018-11-24abs ↗pdf ↗

Transformer learns to estimate negative binomial parameters efficiently.

problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.

Proposes a novel method for generating hard negatives near time series data boundaries.

problem Challenges in generating effective negative samples for time series anomaly detection.
method Reconstruction-driven boundary negative generation framework using reinforcement learning.
result Improves anomaly representation learning and achieves competitive detection performance.

Bayesian method mitigates negative transfer in unknown source data.

problem Negative transfer in transfer learning where target performance worsens after source data consideration.
method Proxy-informed robust method for probabilistic transfer learning (PROMPT).
result Negative transfer can be mitigated without prior knowledge of source data.

The study investigates the impact of negative examples in contrastive learning.

problem Understanding how the number of negative examples affects downstream performance in contrastive learning.
method Theoretical analysis and empirical evaluation of NLP and vision tasks.
result The optimal number of negative examples should scale with the number of underlying concepts in the data.

SANS uses graph structure to find meaningful negatives for entity and relation embeddings.

problem Finding hard negatives for entity and relation embeddings in knowledge graphs.
method Structure Aware Negative Sampling (SANS) that selects negatives from a node's k-hop neighborhood.
result SANS finds semantically meaningful negatives and is competitive with state-of-the-art approaches.

Paper tackles entity matching over multi-source data, optimizing alignment and mitigating negative transfer.

problem Learning effective entity matching models over multi-source large-scale data with relaxed assumptions.
method Proposes a Relaxed Multi-source Large-scale Entity-matching (RMLE) problem and Incentive Compatible Pareto Alignment (ICPA) method.
result Optimized cross-source alignments and mitigated negative transfer, improving entity matching accuracy.

Improved estimation for imbalanced data using log odds correction and optimal sampling.

problem Parameter estimation with nonuniform negative sampling for imbalanced data.
method Derive asymptotic distribution of IPW estimator, derive optimal sampling probability, propose likelihood-based estimator.
result Improved estimator has the smallest asymptotic variance.

The paper introduces negative controls to evaluate causal discovery algorithms, improving their reliability.

problem Lack of a general guideline for evaluating causal discovery algorithms.
method Derive exact distributional results under random guessing for evaluation metrics and propose a pipeline for using negative controls.
result Evaluation metrics can achieve very favorable values under random guessing, highlighting the need for negative control results.

Kernel methods identify treatment effects with unobserved confounding using negative controls.

problem Learning causal relationships with unmeasured confounding.
method Kernel ridge regression algorithms for nonparametric treatment effects.
result Uniform consistency and finite sample rates of convergence proved.

We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive component and negative component respectively, while the positive component and nega…

2019-11-17abs ↗pdf ↗

A new model BGAR(1) improves temporal NMF for time series data.

problem Temporal NMF models lack a well-defined stationary distribution.
method Introduced a new Gamma Markov chain model BGAR(1) to overcome the limitation of previous models.
result BGAR(1) model has a well-defined stationary distribution.

Unified framework for non-negative matrices and tensors using Wasserstein loss.

problem Finding low-dimensional representations of high-dimensional datasets with non-negative constraints.
method Unified mathematical framework with a smoothed Wasserstein loss, convex dual formulation for efficient computation.
result Efficient solution for non-negative matrix and tensor factorisations with Wasserstein loss.

Data analysis in high energy physics often deals with data samples consisting of a mixture of signal and background events. The sPlot technique is a common method to subtract the contribution of the background by assigning weights to events. Part of the weights are by design negative. Negative weights lead to the diver…

2019-05-28abs ↗pdf ↗

A common challenge in estimating parameters of probability density functions is the intractability of the normalizing constant. While in such cases maximum likelihood estimation may be implemented using numerical integration, the approach becomes computationally intensive. The score matching method of Hyvärinen [2005] …

2018-12-26abs ↗pdf ↗

Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…

2014-02-13abs ↗pdf ↗

From only positive (P) and unlabeled (U) data, a binary classifier could be trained with PU learning, in which the state of the art is unbiased PU learning. However, if its model is very flexible, empirical risks on training data will go negative, and we will suffer from serious overfitting. In this paper, we propose a…

2017-03-02abs ↗pdf ↗

This paper defines a positive and unlabeled classification problem for standard GANs, which then leads to a novel technique to stabilize the training of the discriminator in GANs. Traditionally, real data are taken as positive while generated data are negative. This positive-negative classification criterion was kept f…

2020-02-04abs ↗pdf ↗

Given a collection of data points, non-negative matrix factorization (NMF) suggests to express them as convex combinations of a small set of `archetypes' with non-negative entries. This decomposition is unique only if the true archetypes are non-negative and sufficiently sparse (or the weights are sufficiently sparse),…

2017-05-08abs ↗pdf ↗

In recent years, the Word2Vec model trained with the Negative Sampling loss function has shown state-of-the-art results in a number of machine learning tasks, including language modeling tasks, such as word analogy and word similarity, and in recommendation tasks, through Prod2Vec, an extension that applies to modeling…

2018-05-22abs ↗pdf ↗

Study proves uniqueness of corrugated negatively curved immersions in differential geometry.

problem Negatively curved immersions in differential geometry.
method Relative entropy method applied to Gauss-Codazzi system.
result Uniqueness of smooth isometric immersions within corrugated class.

Non-negative blind source separation (non-negative BSS), which is also referred to as non-negative matrix factorization (NMF), is a very active field in domains as different as astrophysics, audio processing or biomedical signal processing. In this context, the efficient retrieval of the sources requires the use of sig…

2014-07-29abs ↗pdf ↗

The paper proposes count echo state networks for forecasting graduate student enrollments.

problem Forecasting graduate student enrollments from historical data.
method Developed hierarchical count echo state networks and compared them to Poisson autoregressions and negative binomial models.
result Hierarchical negative binomial based echo state network is the superior model.

Non-negative blind source separation (BSS) has raised interest in various fields of research, as testified by the wide literature on the topic of non-negative matrix factorization (NMF). In this context, it is fundamental that the sources to be estimated present some diversity in order to be efficiently retrieved. Spar…

2013-08-26abs ↗pdf ↗

Modern deep artificial neural networks have achieved great success in the domain of computer vision and beyond. However, their application to many real-world tasks is undermined by certain limitations, such as overconfident uncertainty estimates on out-of-distribution data or performance deterioration under data distri…

2019-10-07abs ↗pdf ↗

Enhances contrastive learning for better representation learning on wild images.

problem Binary partition of views from same and different instances limits CL's performance.
method Doubly Contrastive Learning (CACR) with contrastive attraction and repulsion.
result CACR improves performance and robustness on wild image datasets.