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

8152330 · Jun 201919922001200920172026
48 results for Radical Content

Detects radical content on Twitter using textual, psychological, and behavioral signals.

problem Limit the spread of extremist narratives on social media.
method Analyzed extremist material, created contextual text-based model, inferred psychological properties, evaluated on Twitter.
result Radical users exhibit distinguishable textual, psychological, and behavioral properties.

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.

Consider a smooth manifold with a smooth metric which changes bilinear type from Riemann to Lorentz on a hypersurface ΣΣ with radical tangent to ΣΣ. Two natural bilinear symmetric forms appear there, and we use it to analyze the geometry of ΣΣ. We show the way in which these forms control the smooth extensibility ov…

2003-06-10abs ↗pdf ↗

We prove that every Kaehler solvmanifold has a finite covering whose holomorphic reduction is a principal bundle. An example is given that illustrates the necessity, in general, of passing to a proper covering. We also answer a stronger version of a question posed by Akhiezer for homogeneous spaces of nonsolvable algeb…

2007-01-31abs ↗pdf ↗

In this paper we study curvature properties of semi-symmetric type of totally umbilical radical transversal lightlike hypersurfaces (M,g)(M,g) and (M,g~)(M,\widetilde g) of a Kähler-Norden manifold (M,J,g,g~)(\overline M,\overline J,\overline g,\overline {\widetilde g}) of constant totally real sectional curvatures ν\overline ν and …

2014-07-25abs ↗pdf ↗

Paper introduces a new symbol map for differential symmetry breaking operators.

problem Generalizing the symbol map to non-abelian settings.
method Introduces and studies the truncated symbol map Symb0(D)\mathrm{Symb}_0(\mathbb{D}).
result Classified and constructed differential intertwining operators and homomorphisms.

Let MM be a simply connected pseudo-Riemannian homogeneous space of finite volume with isometry group GG. We show that MM is compact and that the solvable radical of GG is abelian and the Levi factor is a compact semisimple Lie group acting transitively on MM. For metric index less than three, we find that the iso…

2018-07-06abs ↗pdf ↗

On a Riemannian or a semi-Riemannian manifold, the metric determines invariants like the Levi-Civita connection and the Riemann curvature. If the metric becomes degenerate (as in singular semi-Riemannian geometry), these constructions no longer work, because they are based on the inverse of the metric, and on related o…

2011-05-01abs ↗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.

This paper shows the reduced characteristic group of Lie LCP manifolds is simply connected.

problem Understanding the structure of Lie LCP manifolds and their characteristic groups.
method Restricting the action of the fundamental group to the non-flat factor of the universal cover and taking the connected component of the identity in the closure of this restriction.
result The reduced characteristic group of any Lie LCP manifold is simply connected.

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.

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.

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 ↗

Study explores solvable Lie groups' actions on closed Lorentzian manifolds.

problem Understanding conformal actions of solvable Lie groups on closed Lorentzian manifolds.
method Analyzes the identity component of the conformal group and uses algebraic hypotheses.
result Establishes conditions for conformal flatness and local embeddings.

A new approach uses deep learning to manage vehicular content efficiently.

problem Managing content replication and caching in vehicular networks efficiently.
method Data-driven, centralized approach using a Convolutional Neural Network (CNN).
result Effective strategies derived to modulate FC operation in space and adapt to mobility changes.

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.

The paper deals with regression problems, in which the nonsmooth target is assumed to switch between different operating modes. Specifically, piecewise smooth (PWS) regression considers target functions switching deterministically via a partition of the input space, while switching regression considers arbitrary switch…

2017-07-25abs ↗pdf ↗

This work improves disentanglement by preventing style variables from encoding content-related features.

problem Disentanglement of content and style in data representations using Variational Autoencoders.
method Adversarial training with mutual information minimization to prevent content information leakage in style representations.
result The method efficiently separates content and style related attributes and generalizes to unseen data.

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.

Local norms of Fourier multipliers bounded on discrete subgroups of Lie groups.

problem Bounding LpL_p norms of Fourier multipliers on discrete subgroups of Lie groups.
method Developed tools to find explicit bounds on c(A)c(A), reducing the problem to representations of semisimple and radical parts of Lie algebras.
result Explicit bounds on c(A)c(A) for unimodular connected solvable Lie groups, showing c(G)=1c(G) = 1.

In this paper we generalize harmonic maps and morphisms to the \emph{degenerate semi-Riemannian category}, in the case when the manifolds MM and NN are \emph{stationary} and the map φ:MNφ:M\to N is \emph{radical-preserving}. We characterize geometrically the notion of \emph{(generalized) horizontal (weak) conformality}…

2003-03-21abs ↗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.