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

54109163217 · Jun 202019922001200920172026
48 results for Noisy Embedding

Compressed LLM embeddings improve noisy regression tasks without overfitting.

problem Noisy regression tasks with high signal-to-noise ratios.
method Comparison of embedding compression techniques using autoencoder hidden representations.
result Compression improves performance on noisy tasks like financial return prediction.

Kernel-spectral embedding learns low-dim. structures from noisy data.

problem Learning low-dimensional nonlinear structures from high-dimensional noisy data.
method Adaptive bandwidth spectral embedding using integral operators.
result Convergence to noiseless embeddings and eigenfunctions of integral operators.

Kernel method embeds noisy datasets, capturing shared structures.

problem Limited power in capturing nonlinear structures, noisiness, high-dimensionality, and interpretability issues.
method Kernel spectral joint embeddings using duo-landmark integral operators.
result Consistent recovery of low-dimensional noiseless signals and convergence to eigenfunctions of integral operators.

This work proposes a hybrid method for error detection in noisy Knowledge Graphs.

problem Error detection in noisy Knowledge Graphs.
method Hybrid and modular approach combining path ranking and representation learning.
result Hybrid method outperforms individual methods on benchmarks and real-world dataset.

Develops a method to estimate treatment effects using noisy proxies over time.

problem Estimating individualized treatment effects from noisy proxies of confounders.
method Deconfounding Temporal Autoencoder (DTA) combining autoencoder and causal regularization.
result Improves treatment effect estimates by leveraging noisy proxies and learning hidden confounders.

This research tackles unsupervised topic extraction in noisy social media data.

problem Capturing customer insights from social media data is challenging due to noise and heterogeneity.
method The research presents three nonparametric approaches based on the Variational Autoencoder framework: Embedded Dirichlet Process, Embedded Hierarchical Dirichlet Process, and time-aware Dynamic Embedded Dirichlet Process.
result The models achieve equal to better performance than state-of-the-art methods in topic extraction from noisy social media data.

A novel method extracts topological features from word embeddings for text classification.

problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.

We propose ββ-graph embedding for robustly learning feature vectors from data vectors and noisy link weights. A newly introduced empirical moment ββ-score reduces the influence of contamination and robustly measures the difference between the underlying correct expected weights of links and the specified generative m…

2019-02-22abs ↗pdf ↗

Paper proposes a matrix optimization model for reliable Euclidean embedding from noisy data.

problem Challenges in Euclidean embedding from noisy observations containing outliers.
method Matrix optimization based embedding model to detect and remove outliers.
result The model provides high accuracy estimators and successfully identifies outliers.

Improves scalability and robustness of dynamic graph clustering.

problem Scalability and robustness issues in matrix factorization methods for dynamic graphs.
method Temporal separated matrix factorization, bi-clustering regularization, selective embedding updating.
result Demonstrated scalability, robustness, and effectiveness on synthetic and real-world benchmarks.

We present a novel view of nonlinear manifold learning using derivative-free optimization techniques. Specifically, we propose an extension of the classical multi-dimensional scaling (MDS) method, where instead of performing gradient descent, we sample and evaluate possible "moves" in a sphere of fixed radius for each …

2018-06-01abs ↗pdf ↗

To investigate objects without a describable notion of distance, one can gather ordinal information by asking triplet comparisons of the form "Is object xx closer to yy or is xx closer to zz?" In order to learn from such data, the objects are typically embedded in a Euclidean space while satisfying as many triplet …

2019-06-27abs ↗pdf ↗

(Bolukbasi et al., 2016) demonstrated that pretrained word embeddings can inherit gender bias from the data they were trained on. We investigate how this bias affects downstream classification tasks, using the case study of occupation classification (De-Arteaga et al.,2019). We show that traditional techniques for debi…

2019-08-07abs ↗pdf ↗

We find the minimax rate of convergence in Hausdorff distance for estimating a manifold M of dimension d embedded in R^D given a noisy sample from the manifold. We assume that the manifold satisfies a smoothness condition and that the noise distribution has compact support. We show that the optimal rate of convergence …

2010-07-04abs ↗pdf ↗

Low dimensional embeddings that capture the main variations of interest in collections of data are important for many applications. One way to construct these embeddings is to acquire estimates of similarity from the crowd. However, similarity is a multi-dimensional concept that varies from individual to individual. Ex…

2017-09-22abs ↗pdf ↗

SymNoise improves language model fine-tuning by 6.7% over NEFTune, using symmetric noise.

problem Improving performance of language models through noise-based fine-tuning.
method Introducing SymNoise, a new fine-tuning method using symmetric noise in embeddings.
result SymNoise increases model performance by 69.04% on AlpacaEval compared to NEFTune's 64.69%.

Improved far-field speaker verification for short utterances in noisy conditions.

problem Challenges in speaker verification on short utterances in uncontrolled noisy environments.
method Used deep neural network architectures (TDNN and ResNet) and experimented with various embedding extractors and training procedures.
result ResNet architectures outperform x-vector approach in speaker verification quality for both long and short utterances.

Paper introduces a novel reward function for noisy financial markets using imitation learning.

problem Noisy reward function in financial markets hinders RL agent performance.
method Integrates imitation learning feedback with reinforcement learning to improve reward function design.
result Improves financial performance metrics compared to traditional benchmarks and RL agents.

Existing dimensionality reduction methods are adept at revealing hidden underlying manifolds arising from high-dimensional data and thereby producing a low-dimensional representation. However, the smoothness of the manifolds produced by classic techniques over sparse and noisy data is not guaranteed. In fact, the embed…

2017-07-21abs ↗pdf ↗

In this work we approach the task of learning multilingual word representations in an offline manner by fitting a generative latent variable model to a multilingual dictionary. We model equivalent words in different languages as different views of the same word generated by a common latent variable representing their l…

2019-05-14abs ↗pdf ↗

A new method improves generative models by learning lower-dimensional representations.

problem Normalizing flows cannot learn lower-dimensional representations of data.
method Noisy injective flows (NIF) that map latent space to a learnable manifold in high-dimensional data space using injective transformations and an additive noise model.
result Simple application of NIF to existing flow architectures significantly improves sample quality and yields separable data embeddings.

Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.

problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.

Improves domain adaptation by aligning source and target distributions and mitigating noisy labels.

problem Improving performance on target images with different acquisition conditions.
method Combines optimal transport, MixUp regularization, and robust loss for noisy labels.
result Improves domain adaptation performance on various benchmarks and real-world problems.

A new algorithm optimizes unknown functions with noisy data and unmatched features.

problem Sequentially maximizing a function with unknown and noisy data and features not under control.
method Bayesian conditional mean embedding and Gaussian process for uncertainty.
result Empirically outperforms state-of-the-art algorithms.

Entity linking is the task of mapping potentially ambiguous terms in text to their constituent entities in a knowledge base like Wikipedia. This is useful for organizing content, extracting structured data from textual documents, and in machine learning relevance applications like semantic search, knowledge graph const…

2018-07-16abs ↗pdf ↗

Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional spaces. The modelling of these underlying structures is also beneficial for the creat…

2019-09-27abs ↗pdf ↗

Learning workable representations of dynamical systems is becoming an increasingly important problem in a number of application areas. By leveraging recent work connecting deep neural networks to systems of differential equations, we propose \emph{variational integrator networks}, a class of neural network architecture…

2019-10-21abs ↗pdf ↗

MPVAE learns latent embeddings and label correlations for multi-label classification.

problem Challenging task of predicting multiple targets with label correlations.
method Proposes MPVAE, a novel framework that learns latent embedding spaces and label correlations using a Multivariate Probit model.
result MPVAE outperforms state-of-the-art methods on various application domains and is robust under noisy settings.

We consider the problem of learning the nearest neighbor graph of a dataset of n items. The metric is unknown, but we can query an oracle to obtain a noisy estimate of the distance between any pair of items. This framework applies to problem domains where one wants to learn people's preferences from responses commonly …

2019-05-30abs ↗pdf ↗

A new topology design improves zero-shot classification performance in contrastive learning.

problem Improving zero-shot classification performance in contrastive visual-textual alignment.
method Proposed an alternative topology design using multiple class tokens and an oblique manifold with negative inner product.
result Improves zero-shot classification performance by an average of 6.1%.

Study methods to recover unknown processes in PDEs from data.

problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.

Manifold learning and dimensionality reduction techniques are ubiquitous in science and engineering, but can be computationally expensive procedures when applied to large data sets or when similarities are expensive to compute. To date, little work has been done to investigate the tradeoff between computational resourc…

2016-03-12abs ↗pdf ↗

Recent research on network embedding in hyperbolic space have proven successful in several applications. However, nodes in real world networks tend to interact through several distinct channels. Simple aggregation or ignorance of this multiplexity will lead to misleading results. On the other hand, there exists redunda…

2019-11-23abs ↗pdf ↗

Develops statistical confidence sets for multidimensional scaling.

problem Statistical uncertainty in multidimensional scaling of noisy data.
method Formal statistical framework, distributional convergence results, uniform confidence sets, bootstrap procedures.
result Construction of reliable confidence sets for latent configurations in multidimensional scaling.

We consider the problem of finding a target object tt using pairwise comparisons, by asking an oracle questions of the form \emph{"Which object from the pair (i,j)(i,j) is more similar to tt?"}. Objects live in a space of latent features, from which the oracle generates noisy answers. First, we consider the {\em non-bli…

2019-05-13abs ↗pdf ↗