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

Trend · papers per month

74148221295 · Jun 202019922001200920172026
48 results for Content loss

Zero-shot contrastive loss improves text-guided image style transfer without extra training.

problem Stochastic nature of diffusion models leads to trade-offs between style transformation and content preservation.
method Proposes a zero-shot contrastive loss for diffusion models that doesn't require additional fine-tuning or auxiliary networks.
result Method outperforms existing methods while preserving content and requiring no additional training.

We consider visual domains in which a class label specifies the content of an image, and class-irrelevant properties that differentiate instances constitute the style. We present a domain-independent method that permits the open-ended recombination of style of one image with the content of another. Open ended simply me…

2018-09-28abs ↗pdf ↗

A new method for image translation using disentangled style and content preservation.

problem Difficulty in maintaining original content during reverse diffusion in diffusion-based image translation.
method Disentangled style and content representation using intermediate keys from ViT model, CLIP loss, semantic divergence loss, and resampling strategy.
result Outperforms state-of-the-art models in text-guided and image-guided translation tasks.

Linear NDCG is used for measuring the performance of the Web content quality assessment in ECML/PKDD Discovery Challenge 2010. In this paper, we will prove that the DCG error equals a new pair-wise loss.

2013-03-11abs ↗pdf ↗

In this work, we address the problem of modifying textual attributes of sentences. Given an input sentence and a set of attribute labels, we attempt to generate sentences that are compatible with the conditioning information. To ensure that the model generates content compatible sentences, we introduce a reconstruction…

2018-11-03abs ↗pdf ↗

DAM with MRL improves relational reasoning in MANNs.

problem Limited performance of associative memory networks on complex relational reasoning tasks.
method Distributed Associative Memory architecture with Memory Refreshing Loss.
result Enhanced relation reasoning performance of MANNs on long temporal sequence data.

SLUG method detects bias and out-of-distribution content in generative models.

problem Generative models can underrepresent certain groups and fail on out-of-distribution data.
method SLUG: A new uncertainty quantification method for VAEs combining Laplace approximations and stochastic trace estimators.
result SLUG's UQ score correlates with bias and out-of-distribution content.

FairNN learns fair representations and decisions by optimizing a multi-objective loss function.

problem Fairness in machine learning models for decision-making.
method Joint feature representation and classification with multi-objective loss function.
result Joint approach outperforms separate treatment of fairness in representation learning or supervised learning.

In this work we propose an adversarial learning approach to generate high resolution MRI scans from low resolution images. The architecture, based on the SRGAN model, adopts 3D convolutions to exploit volumetric information. For the discriminator, the adversarial loss uses least squares in order to stabilize the traini…

2018-12-29abs ↗pdf ↗

Investor emotions predict earnings announcements, but excitement lowers returns.

problem The impact of investor emotions on earnings announcements and their returns.
method Social media data analysis over a decade to test the relationship between investor emotions and earnings announcements.
result Excitement about earnings announcements is associated with lower announcement returns.

Study shows online learning algorithms incentivize low-quality content, proposing new algorithms to improve quality.

problem Online learning algorithms in content recommender systems incentivize producers to create low-quality content.
method Analyzed the game between producers and content quality, designed new learning algorithms to incentivize high effort and quality.
result New algorithms incentivize producers to invest high effort and achieve high user welfare, improving content quality.

Proposes a VAE variant for ordinal content factors.

problem Isolating ordinal-valued content factors in deep latent variable models.
method Introduces a partially ordered set (poset) structure and a conditional Gaussian spacing prior model.
result Significant improvements in content-style separation over previous non-ordinal approaches.

We propose a novel autoencoding model called Pairwise Augmented GANs. We train a generator and an encoder jointly and in an adversarial manner. The generator network learns to sample realistic objects. In turn, the encoder network at the same time is trained to map the true data distribution to the prior in latent spac…

2018-10-11abs ↗pdf ↗

Many businesses are using recommender systems for marketing outreach. Recommendation algorithms can be either based on content or driven by collaborative filtering. We study different ways to incorporate content information directly into the matrix factorization approach of collaborative filtering. These content-booste…

2012-10-20abs ↗pdf ↗

A new model considers fatigue in online content recommendation systems.

problem Fatigue in users due to overexposure and boredom from similar recommendations.
method Proposed a fatigue-aware Dependent Click Model (DCM) and two learning algorithms.
result Developed algorithms with regret bounds for learning content relevance and fatigue effects.

Recently, deep learning models play more and more important roles in contents recommender systems. However, although the performance of recommendations is greatly improved, the "Matthew effect" becomes increasingly evident. While the head contents get more and more popular, many competitive long-tail contents are diffi…

2019-06-12abs ↗pdf ↗

New PCGML approach generates novel game content across multiple platformer domains.

problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.

A variety of approaches have been proposed to automatically infer the profiles of users from their digital footprint in social media. Most of the proposed approaches focus on mining a single type of information, while ignoring other sources of available user-generated content (UGC). In this paper, we propose a mechanis…

2020-01-05abs ↗pdf ↗

New study shows personalized content recommendations can lead to polarization of user preferences.

problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.

Text style transfer aims to modify the style of a sentence while keeping its content unchanged. Recent style transfer systems often fail to faithfully preserve the content after changing the style. This paper proposes a structured content preserving model that leverages linguistic information in the structured fine-gra…

2018-10-15abs ↗pdf ↗

Study on heat content for submanifolds in sub-Riemannian geometry.

problem Understanding heat content for submanifolds in sub-Riemannian geometry.
method Existence of smooth tubular neighborhood, definition of relative heat content, approximation via smooth neighborhoods, asymptotic expansion analysis.
result Approximation of relative heat content fails to recover the exact expansion.

This paper formalizes AI safety using hypothesis testing in GenAI.

problem Ensuring safety of generative AI tools that create realistic content.
method Formalization of computational safety through hypothesis testing and signal processing.
result Demonstrates how AI safety can be assessed quantitatively using mathematical frameworks.

A wide variety of deep neural applications increasingly rely on the cloud to perform their compute-heavy inference. This common practice requires sending private and privileged data over the network to remote servers, exposing it to the service provider and potentially compromising its privacy. Even if the provider is …

2019-05-26abs ↗pdf ↗

Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…

2015-05-25abs ↗pdf ↗

Transforms web content for better visibility in AI-driven search engines.

problem Disruption of traditional SEO by generative AI search engines.
method Fine-tunes a BART-base transformer on synthetically generated training data.
result Significant improvements in ROUGE-L and BLEU scores, and substantial visibility gains in generative search responses.

Improves content allocation in educational platforms with sparse data.

problem Imbalanced content allocation and delayed convergence in adaptive strategies.
method Introduces WAPTS, an algorithm that refines Thompson Sampling for data-sparse environments.
result Demonstrates earlier and more reliable identification of promising treatments.

We propose a new approach to the problem of optimizing autoencoders for lossy image compression. New media formats, changing hardware technology, as well as diverse requirements and content types create a need for compression algorithms which are more flexible than existing codecs. Autoencoders have the potential to ad…

2017-03-01abs ↗pdf ↗

Modeling incentives for content creators on algorithm-curated platforms.

problem Maximizing exposure for content creators on algorithmic platforms.
method Formalized exposure game model, proving effects of algorithmic choices on equilibria, proposing tools for finding equilibria.
result Algorithmic choices significantly affect content exposure and creator behavior.

Study on heat content for domains with fractal boundaries.

problem Analyzing short-time asymptotics of heat content for domains with fractal boundaries.
method Developing mathematical analysis on de Gennes' hypothesis and exploring fractal curvatures.
result Fractal curvatures and their scaling exponents may emerge in the short-time heat content asymptotics of domains with fractal boundaries.

IGSD separates task-specific content channels in transformer components by comparing activation replacement with zero ablation.

problem Mechanistic interpretability of transformer components
method IGSD: paired-intervention framework for comparing activation replacement with zero ablation
result IGSD identifies an early-layer content channel in transformer components that standard importance methods underestimate.

Study shows label noise impacts neural representations' information content, revealing double descent behavior.

problem Impact of label noise on neural network hidden representations.
method Information Imbalance proxy of conditional mutual information to compare hidden representations.
result Representations learned with noisy labels are more informative than those with clean labels in the underparameterized regime, and equally informative in the overparameterized regime.

Improved DPO framework penalizes preference uncertainty to avoid overoptimization.

problem Aligning LLMs to human preferences is challenging due to varied, context-dependent, and ambiguous preferences.
method Developed a pessimistic framework for DPO by introducing preference uncertainty penalization schemes.
result Improved overall performance and better completions on high-uncertainty responses compared to vanilla DPO.

Proposes a new model to measure trade impact and information content in fluctuating markets.

problem Measuring price impact and information content of trades in a time-varying market setting.
method Non-linear observation-driven model for dynamically estimating market impact and information content.
result Market impact shows intraday patterns with large fluctuations, some of which are exogenous.