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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Representation Quality

Extracts high-quality monolingual datasets from web crawl data.

problem Improving text representation quality through larger corpora.
method Automated pipeline using deduplication and language identification, augmented with filtering for high-quality documents.
result Extracted massive high-quality monolingual datasets from Common Crawl.

ProductNet curates high-quality product datasets for better product understanding.

problem Lack of high-quality product datasets for product representation learning.
method Curated high-quality product datasets with a multi-modal deep neural network and active learning.
result Master model yields high categorization accuracy (94.7% top-1 accuracy for 1240 classes).

ProSMIN improves representation quality through probabilistic self-supervised learning.

problem Improving representation quality in self-supervised learning.
method ProSMIN uses two neural networks, online and target, to learn diverse representations through knowledge distillation and a modified scoring rule loss function.
result ProSMIN achieves superior accuracy and calibration on various downstream tasks.

Study evaluates margin parameter effects on knowledge embedding quality.

problem Understanding margin parameter's impact on embedding quality.
method Examined margin parameter values for multi-relational categorized data.
result Lower margin values are insufficient, while larger values cause noise.

CDSSL improves representation quality by integrating linear and nonlinear dependencies.

problem Scarcity of labeled data and neglect of nonlinear dependencies in SSL.
method CDSSL combines linear correlations and nonlinear dependencies using HSIC in RKHS.
result CDSSL enhances representation quality on diverse benchmarks.

BigBiGAN improves unsupervised representation learning using image generation quality.

problem Improving unsupervised representation learning methods.
method Extending BigGAN to include an encoder and modifying the discriminator for representation learning.
result BigBiGAN models achieve state-of-the-art performance in unsupervised representation learning and unconditional image generation.

The paper uses thermodynamics to improve machine learning representation quality.

problem Improving the quality of learned representations for transfer learning.
method Formal connection with thermodynamics, iso-classification process, traversing the equilibrium surface.
result Demonstrates how to transfer representations while keeping classification loss constant.

New autoencoder learns structured representations without regularization.

problem Learning structured representations without relying on regularization.
method Proposes a novel autoencoder architecture that learns a hierarchy of latent variables.
result Improves results in generation, disentanglement, and extrapolation tasks.

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

Learning the right graph representation from noisy, multisource data has garnered significant interest in recent years. A central tenet of this problem is relational learning. Here the objective is to incorporate the partial information each data source gives us in a way that captures the true underlying relationships.…

2014-01-14abs ↗pdf ↗

This work improves disentanglement in latent space models without sacrificing generation quality.

problem Trade-off between disentanglement and generation quality in latent space models.
method Manifold optimization with a sum of autoencoder and PCA reconstruction errors, on the Stiefel manifold.
result Improves disentanglement without sacrificing generation quality.

Contrastive learning struggles with class collapse and feature suppression, revealing bias towards simpler solutions.

problem Contrastive learning struggles with class collapse and feature suppression, especially in supervised and unsupervised settings.
method Unified theoretical framework to determine which features are learnt by CL, revealing bias towards simpler solutions.
result Bias towards simpler solutions is a key factor in class collapse and feature suppression.

Enhances DIM to match learned representations to a specific distribution.

problem Learning representations conforming to a specific distribution.
method Injecting noise into normalized outputs of the encoder while keeping the InfoMax training objective.
result Learning uniformly and normally distributed representations, as well as representations of other absolutely continuous distributions.

Improved texture synthesis using wavelet-based statistics with rectifier non-linearity.

problem Improving texture synthesis quality using wavelet representations.
method Proposes a family of statistics based on non-linear wavelet representations with a generalized rectifier non-linearity.
result Significantly improves visual quality of texture synthesis compared to classical wavelet-based models.

NeuCrowd creates high-quality samples from crowdsourced labels to improve representation learning.

problem Limited and inconsistent crowdsourced labels for representation learning.
method Unified framework that generates high-quality n-tuplet samples and learns a neural sampling network.
result NeuCrowd outperforms state-of-the-art baselines in prediction accuracy and AUC.

New method learns high-quality Laplacian representations for reinforcement learning.

problem Lack of accurate Laplacian representations in large or continuous state spaces.
method Reformulated spectral graph drawing objective to have eigenvectors as unique global minimizer.
result Learned Laplacian representations more faithfully approximate the ground truth.

GGAN improves audio representation learning with fewer labels.

problem Learning representations for specific tasks from unlabelled data.
method Guided Generative Adversarial Neural Network (GGAN).
result GGAN learns better representations with fewer labelled data.

The Soft Nearest Neighbor Loss improves representation quality and generalization.

problem Improving the quality of representations in machine learning models.
method Explored and expanded the Soft Nearest Neighbor Loss to measure class entanglement.
result Maximizing the entanglement of different class representations leads to better generalization and uncertainty estimation.

Proposes GM Score to evaluate GANs considering diversity, disentanglement, and discriminability.

problem Evaluation of GANs for sample quality and diversity.
method Integrates various factors including intra-class and inter-class diversity, disentanglement, and discriminability metrics.
result Demonstrates improved evaluation of GANs on MNIST dataset.

The paper examines the reliability of limit order book representations in the face of data perturbation.

problem The reliability of limit order book representations under data perturbation.
method Experimental analysis of existing representations and guidelines for future research.
result Existing representations of limit order book data are vulnerable to data perturbation.

In many situations, we need to build and deploy separate models in related environments with different data qualities. For example, an environment with strong observation equipments (e.g., intensive care units) often provides high-quality multi-modal data, which are acquired from multiple sensory devices and have rich-…

2018-09-06abs ↗pdf ↗

Improves shared encoder representations for better multi-task learning performance.

problem Improving quality of shared encoder representations in multi-task learning.
method Dummy Gradient norm Regularization (DGR) to decrease gradient norm of dummy task-specific predictors.
result DGR improves multi-task prediction performances and superior performance compared to existing methods.

We explore the question of whether the representations learned by classifiers can be used to enhance the quality of generative models. Our conjecture is that labels correspond to characteristics of natural data which are most salient to humans: identity in faces, objects in images, and utterances in speech. We propose …

2016-02-09abs ↗pdf ↗

A fair clustering method for multiple sensitive attributes is proposed.

problem Ensuring fair representation of sensitive attributes in clustering.
method FairKM (Fair K-Means) method inspired by K-Means, using fairness and coherence objectives.
result FairKM clusters significantly better on both quality and fair representation of sensitive attribute groups.

Improves model classification accuracy in black-box settings.

problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.

Air quality forecasting has been regarded as the key problem of air pollution early warning and control management. In this paper, we propose a novel deep learning model for air quality (mainly PM2.5) forecasting, which learns the spatial-temporal correlation features and interdependence of multivariate air quality rel…

2018-12-12abs ↗pdf ↗

Conditional GANs are at the forefront of natural image synthesis. The main drawback of such models is the necessity for labeled data. In this work we exploit two popular unsupervised learning techniques, adversarial training and self-supervision, and take a step towards bridging the gap between conditional and uncondit…

2018-11-27abs ↗pdf ↗

This paper tackles disentanglement in image editing and reconstruction.

problem Learning disentangled image representations and balancing disentanglement strength and reconstruction quality.
method Distance covariance based decorrelation regularization for disentanglement, soft target representation for reconstruction, and collapsing AE decoder and GAN generator.
result The proposed model improves the disentanglement strength and perceptual quality of generated images.

Improves disentangled representation learning with multi-stage modeling.

problem Trade-off between disentanglement and reconstruction quality in autoencoders.
method Penalty-based disentanglement learning followed by detail information modeling.
result Higher reconstruction quality than state-of-the-art methods with equivalent disentanglement.

SoftCLT improves time series representation learning by soft contrastive loss.

problem Ignoring inherent correlations in time series leads to poor representation quality.
method SoftCLT introduces instance-wise and temporal contrastive loss with soft assignments.
result SoftCLT consistently improves various downstream tasks in time series learning.

New methods improve feature extraction and representation quality in supervised and unsupervised DR.

problem Statistical dependence, data diversity, contrast, and interpretability in conventional DR methods.
method Combines linear and nonlinear formulations for three new independence criteria.
result Significant improvements in contrast, accuracy, and interpretability over baselines.

DDMI generates high-quality INRs by adapting positional embeddings.

problem Existing INR generative models fail to produce high-quality representations.
method DDMI uses adaptive positional embeddings and a D2C-VAE to enhance expressive power.
result DDMI outperforms existing models across multiple modalities and datasets.

In this paper, we build an organization of high-dimensional datasets that cannot be cleanly embedded into a low-dimensional representation due to missing entries and a subset of the features being irrelevant to modeling functions of interest. Our algorithm begins by defining coarse neighborhoods of the points and defin…

2015-07-01abs ↗pdf ↗