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

Trend · papers per month

63126188251 · Jun 202019922001200920172026
48 results for noise contrastive

New findings show optimal noise in contrastive learning is not the same as data distribution.

problem The optimal noise distribution in contrastive learning is not the same as the data distribution.
method Empirical and theoretical analysis of contrastive learning methods.
result Deviation from the assumption of equal noise and data distribution leads to better statistical estimators.

PCA++ improves robustness to background noise in contrastive learning.

problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.

DACL tackles domain-specific contrastive learning by using Mixup noise.

problem Domain-specific contrastive learning methods rely on data augmentation techniques that require domain knowledge.
method DACL uses Mixup noise to create similar and dissimilar examples without domain-specific data augmentation.
result DACL outperforms other domain-agnostic noising methods and combines well with domain-specific methods.

Contrastive learning performance doesn't degrade with more negative samples.

problem Theoretical and empirical evidence of negative samples hurting performance in contrastive learning.
method Simple theoretical setting and empirical support on CIFAR-10 and CIFAR-100 datasets.
result Contrastive learning performance does not degrade with the number of negative samples.

New insights into noise distribution for self-supervised learning.

problem Challenges the assumption that optimal noise should match data distribution.
method Turns to Noise-Contrastive Estimation (NCE) to define optimality of noise distribution.
result Optimal noise distribution is different from data distribution, challenging GANs assumption.

Noise-Contrastive Estimation improves efficiency for estimating log-likelihood of complex point processes.

problem Estimating log-likelihood of complex multivariate point processes is computationally expensive.
method Noise-Contrastive Estimation adapted for multivariate point processes, with provable guarantees.
result Our method achieves similar log-likelihood with fewer evaluations and less time.

Many parametric statistical models are not properly normalised and only specified up to an intractable partition function, which renders parameter estimation difficult. Examples of unnormalised models are Gibbs distributions, Markov random fields, and neural network models in unsupervised deep learning. In previous wor…

2018-06-10abs ↗pdf ↗

Meta-learning for estimating complex conditional distributions.

problem Estimating conditional densities in multimodal distributions.
method Noise contrastive estimation with kernel mean embeddings.
result Meta-learning can share representations across tasks for conditional density estimation.

PiNGDA learns beneficial noise for graph augmentation stability.

problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.

Quantum algorithm reduces CVA risk-neutral expectation estimation costs.

problem Reducing Monte Carlo sampling cost for CVA on real quantum hardware.
method Noise-aware quantum workflow combining market calibration, discretisation, and oracle construction.
result CABIQAE achieves lower classical post-processing runtime and more effective error exploitation.

Paper tackles online control of linear systems with unbounded noise.

problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and established O(mpoly(logT)) O({ m poly} (\log T)) regret bound for strongly convex costs and sub-Gaussian noise.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and O(mpoly(logT)) O({ m poly} (\log T)) regret bound for specific noise and cost conditions.

This paper broadens contrastive learning for disentangled representations without strict data distribution assumptions.

problem Learning disentangled representations from data with specific assumptions.
method Extends theoretical guarantees for disentanglement to a broader family of contrastive methods, relaxing data distribution assumptions.
result Identifiability of true latents for four contrastive losses proved without common independence assumptions.

Paper proposes a new loss function for conditional models using soft targets.

problem Improving generalization performance of deep neural networks on supervised classification tasks.
method Introduces a new loss function compatible with soft targets, based on noise contrastive estimation.
result Soft target InfoNCE loss performs on par with cross-entropy baselines and outperforms other losses.

SuNCEt accelerates contrastive learning with minimal labeled data.

problem Efficiently learning visual representations with limited labeled data.
method Noise-contrastive estimation and neighbourhood component analysis-based semi-supervised loss.
result SuNCEt achieves semi-supervised learning accuracy with less than half the labeled data.

Optimizer memory affects learning rate sensitivity in shuffle order, impacting fine-tuning noise.

problem Optimizer memory affects the learning rate sensitivity in shuffle order, leading to fine-tuning noise.
method Isolated the mechanism of fixed-clock optimizer memory affecting the learning rate sensitivity in shuffle order, deriving a fit-free way to size the noise.
result Fixed-clock optimizers like AdamW produce a larger first-order noise channel compared to memoryless optimizers, affecting fine-tuning comparisons.

Replicated Softmax model, a well-known undirected topic model, is powerful in extracting semantic representations of documents. Traditional learning strategies such as Contrastive Divergence are very inefficient. This paper provides a novel estimator to speed up the learning based on Noise Contrastive Estimate, extende…

2015-06-24abs ↗pdf ↗

New attacks prevent both supervised and contrastive learning from private data.

problem Preventing unauthorized use of private data and commercial datasets.
method Contrastive-like data augmentations in supervised error minimization or maximization frameworks.
result Achieve state-of-the-art worst-case unlearnability across SL and CL algorithms.

Letter analyzes training dynamics of a nonlinear contrastive learning model in high dimensions.

problem Understanding training dynamics of nonlinear contrastive learning models in high-dimensional settings.
method High-dimensional analysis using McKean-Vlasov PDEs and low-dimensional ODEs.
result The model's performance evolves according to specific ODEs, revealing features like feature learnability and noise effects.

Study bounds noise level in linear regression with dependent data.

problem Analyzing noise level in linear regression with dependent data.
method Derive upper bounds for random design linear regression with ββ-mixing data, without realizability assumptions.
result Correctly recovers the noise level of the problem, exhibiting graceful degradation with misspecification.

Neural networks can detect weak patterns hidden in noise.

problem Detecting weak patterns in noisy data.
method Developed a three-layer Sejnowski machine with redundant representation, showing patterns can be stored and retrieved efficiently.
result Neural networks can retrieve information with intensity O(1) even in the presence of noise O(\sqrt{N}) in the large N limit.

Gradient descent with noise converges to a unique optimum in nonconvex matrix factorization.

problem Gradient descent with noise converges to a unique optimum in nonconvex matrix factorization.
method A perturbed form of gradient descent with arbitrary initialization.
result Gradient descent with noise converges to a unique optimum.

Because large, human-annotated datasets suffer from labeling errors, it is crucial to be able to train deep neural networks in the presence of label noise. While training image classification models with label noise have received much attention, training text classification models have not. In this paper, we propose an…

2019-03-18abs ↗pdf ↗

New methods improve Monte Carlo estimation of partition functions.

problem Estimating the normalization constant of complex distributions.
method Annealing through paths of distributions to estimate partition functions.
result Optimal path for estimation is arithmetic, improving efficiency.

Label smoothing improves model performance even with noisy labels.

problem Mitigating label noise in deep learning models.
method Examined label smoothing as a technique to cope with label noise and compared it to loss-correction methods.
result Label smoothing is competitive with loss-correction techniques under label noise and beneficial for distillation from noisy data.

Paper improves video feature learning for better downstream tasks.

problem Improving video feature learning for better performance on downstream tasks.
method Self-supervised learning approach using contrastive bidirectional transformer, extending BERT for real-valued feature vectors.
result Significantly improved performance on video classification, captioning, and segmentation tasks.

Obtaining reliable uncertainty estimates of neural network predictions is a long standing challenge. Bayesian neural networks have been proposed as a solution, but it remains open how to specify their prior. In particular, the common practice of an independent normal prior in weight space imposes relatively weak constr…

2018-07-24abs ↗pdf ↗

MCD reformulates conditional density estimation into binary classification.

problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.

Graph contrastive learning reveals unique inductive biases.

problem Understanding and optimizing graph contrastive learning methods.
method Systematic study of various GCL methods and their properties.
result GCL methods can work without positive or negative samples, and data augmentations have less impact.

Unnormalised latent variable models are a broad and flexible class of statistical models. However, learning their parameters from data is intractable, and few estimation techniques are currently available for such models. To increase the number of techniques in our arsenal, we propose variational noise-contrastive esti…

2018-10-18abs ↗pdf ↗