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

10202939 · May 201919922001200920172026
48 results for harmful content

Paper introduces Latent-CLIP for efficient text-image comparison in latent space.

problem Efficiently compare text and images in latent space without costly decoding.
method Trains CLIP model in latent space, uses Latent-CLIP rewards for noise optimization, and guides generation away from harmful content.
result Latent-CLIP matches CLIP performance on text-image classification and harmful content detection.

Proposes a new method to measure and avoid harm in machine learning decisions.

problem Measuring and avoiding harm in machine learning algorithms.
method Formal definition of harm and benefit using causal models, counterfactual objective functions.
result Demonstrates that standard machine learning methods can lead to harmful policies under distributional shifts.

Contrastive learning harms minority group representations, affecting downstream tasks.

problem Representation harm in contrastive learning, especially affecting minority groups.
method Causal mediation analysis and stochastic block model explanation.
result Representation harm in contrastive learning is partly responsible for allocation harm in downstream tasks.

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.

Prediction models can harm patients even when accurate, leading to self-fulfilling prophecies.

problem Prediction models can lead to harmful decisions that worsen patient outcomes.
method Formal characterization of harmful prediction models and analysis of their impact.
result Well-calibrated models are ineffective for decision-making as they do not change the data distribution.

The paper proves neural networks are almost always surjective, impacting model safety.

problem Ensuring neural networks can generate any output, including harmful content.
method Analyzing fundamental neural architectures and generative models.
result Many neural architectures are almost always surjective, allowing for arbitrary outputs.

The paper investigates ethical issues in large image datasets, focusing on pornographic content.

problem Ethical issues in large-scale computer vision datasets, particularly concerning pornographic content.
method Cross-sectional model-based quantitative census covering various factors in the ImageNet-ILSVRC-2012 dataset.
result The dataset contains verifiably pornographic images, including non-consensual and voyeuristic content.

Theorem. Let M be a compact, connected, oriented smooth Riemannian n-manifold with non-empty boundary. Then the cohomology of the complex (Harm*(M),d) of harmonic forms on M is given by the direct sum H^p(Harm*(M),d) = H^p(M;R) + H^(p-1)(M;R) for p=0,1,...,n. When M is a closed manifold, a form is harmonic if and only …

2005-08-19abs ↗pdf ↗

Common fairness definitions in machine learning focus on balancing notions of disparity and utility. In this work, we study fairness in the context of risk disparity among sub-populations. We are interested in learning models that minimize performance discrepancies across sensitive groups without causing unnecessary ha…

2019-11-16abs ↗pdf ↗

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.

The study finds that memorization is necessary or harmful depending on the prior distribution and noise level.

problem The impact of memorization on generalization in overparameterized models.
method An overparameterized linear model with general priors in a Bayesian setup.
result Explicit conditions for optimal generalization based on the prior distribution and noise level.

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.

Study characterizes harmful low-fidelity data sources for surrogate models.

problem Identifying which low-fidelity data sources to use in constructing surrogate models.
method Employed benchmark filtering techniques to assess harmful sources using limited data.
result Provided guidelines for using low-fidelity sources in an industrial setting.

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.

Islamophobic hate speech on social media inflicts considerable harm on both targeted individuals and wider society, and also risks reputational damage for the host platforms. Accordingly, there is a pressing need for robust tools to detect and classify Islamophobic hate speech at scale. Previous research has largely ap…

2018-12-12abs ↗pdf ↗

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 ↗

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.

Neural Networks are being integrated into safety critical systems, e.g., perception systems for autonomous vehicles, which require trained networks to perform safely in novel scenarios. It is challenging to verify neural networks because their decisions are not explainable, they cannot be exhaustively tested, and finit…

2019-12-20abs ↗pdf ↗

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.

Introduces MPR to measure and optimize representation across intersectional groups in retrieval.

problem Harmful stereotypes, cultural erasure, and social disparities in image search and retrieval.
method Develops MPR metric, practical estimation methods, theoretical guarantees, and optimization algorithms.
result Optimizing MPR yields more proportional representation across multiple intersectional groups, often with minimal retrieval accuracy compromise.

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.