---
title: 'Tangentads: Ads, AI & Category Theory'
url: https://www.emergentmind.com/topics/tangentads
type: topic
---

# Tangentads: Ads, AI & Category Theory

“Tangentads” is a polysemous research term used for distinct constructions in separate literatures. In advertising and human–computer interaction, it denotes ad systems that are made visually congruent with surrounding content or, in a later usage, machine-readable for AI web agents [1604.06481] [2507.12844]. In category theory, it denotes a formal 2-categorical framework that internalizes tangent structures and their geometric constructions across tangent categories, tangent monads, tangent fibrations, restriction categories, and related settings [2503.18354] [2601.15534] [2509.15524]. Because these usages are technically unrelated, the term requires domain qualification in scholarly discussion.

## 1. Visually congruent Tangentads in image search

In the advertising literature, Tangentads are visually congruent, native advertisements designed to “blend” with the look and feel of the image search results they accompany. The defining criterion is not only semantic or topical relevance to the query or user, but also visual similarity to the returned image set, so that the ad is perceptually coherent in color, composition, texture, and content style while remaining clearly disclosed as sponsored [1604.06481].

The system assumes a text query \(q\) from user \(u\), an image result set \(X=\{x_i\}\), and a pool of relevant ads \(A=\{a_j\}\) already filtered for semantic or topical relevance. Tangentads then perform a second-stage visual selection and placement step. In the practical implementation, images and ads are represented by deep CNN embeddings: AlexNet fc7 features of dimension \(4096\), reduced by PCA trained on YFCC100M to \(d=128\), and \(L^2\)-normalized before similarity computation. For web-scale operation, the image corpus is compressed with Multi-LOPQ product quantization, splitting each 128-dimensional vector into \(M=16\) sub-vectors with 1 byte per sub-code and two coarse quantization indices of vocabulary size \(2^{13}\). Total storage is approximately \(154\) bits, or about \(20\) bytes per image. Ads remain uncompressed, and asymmetric distance computation is used between uncompressed ads and compressed images.

The core selection objective is vector-to-set visual congruence. Using Euclidean distance,
\[
d(a,x)=\|f(a)-f(x)\|_2,
\]
the robust aggregate used in the paper is
\[
d(a,X)=\sum_{i=1}^{N}\|f(a)-f(x_i)\|_2,
\]
and the selected ad is
\[
a^*=\arg\min_{a\in A}\sum_{i=1}^{N}\|f(a)-f(x_i)\|_2.
\]
The paper also notes cosine similarity, a nearest-neighbor alternative, and weighted variants using weights \(w_i\) to reflect text relevance rank, freshness, or importance. A reciprocity check can then be imposed: if \(x_{nn}\) is the nearest image to \(a^*\) in \(X\), and \(a_{nn}\) is the nearest ad in \(A\) to \(x_{nn}\), require \(a_{nn}=a^*\).

Placement is formulated as a local neighborhood optimization on a 2D image grid. For position \(p\) with neighbor set \(N(p)\), the cost is
\[
C(p,a)=\sum_{n\in N(p)} D(f(a),f(x_n)),
\]
and the placement rule is
\[
p^*=\arg\min_{p\in P} C(p,a^*).
\]
The implemented strategies are: preserving original ordering by inserting the ad next to its nearest image and choosing left or right based on similarity; local reordering by placing the ad between its two nearest neighbors and clustering the immediate \(4\)- or \(8\)-neighborhood by ascending proximity; and a global visual layout that projects images and the ad into 2D with t-SNE, clusters them with fast Mean Shift, and tiles the grid greedily by cluster. In the global strategy, an ad is rejected if it forms a singleton cluster.

The empirical evaluation used 896 qualified US workers on Amazon Mechanical Turk, with eight queries across five topics—animals, cars, fashion, movies, and TV series—and three conditions per query: Most Similar, Random, and Least Similar. The primary user-experience measure was the Likert item “The ad experience was of very high quality” (Q8). Agree/Strongly Agree responses were \(44.5\%\) for Most Similar, \(31.5\%\) for Random, and \(28.8\%\) for Least Similar, with \(p=0.011\) for Most Similar versus Random and \(p=0.006\) for Most Similar versus Least Similar. For perceived relevance to the image set (Q5), the reported \(p\)-values were \(5\times10^{-5}\) for Most Similar versus Random and \(4\times10^{-7}\) for Most Similar versus Least Similar. Ad visibility remained stable: “Saw an ad” was approximately \(39\%\) across all conditions, specifically \(39.7\%\), \(38.5\%\), and \(38.6\%\). Brand recall for the correct ad brand was \(86.7\%\) for Most Similar, \(63.1\%\) for Random, and \(79.7\%\) for Least Similar. Time on page for workers who saw an ad was approximately \(54\) seconds across conditions, with means \(54.4\)s, \(54.1\)s, and \(52.2\)s and standard deviations of about \(24\)–\(26\)s.

The result is a native advertising mechanism specialized to image-heavy interfaces: semantically targeted ads are reranked by visual congruence and inserted so as to minimize perceptual discontinuity. A plausible implication is that Tangentads treat image search as an explicitly visual ranking-and-layout problem rather than a purely keyword-matching problem.

## 2. Machine-readable Tangentads for AI web agents

A later, separate usage defines Tangentads as a system blueprint for making online ads reliably detectable, interpretable, and actionable for AI web agents without degrading human UX or trust [2507.12844]. This usage is distilled from experiments on a faithful React-based clone of the Tiroler Tageszeitung site with realistic DOM complexity and ad inventory, including static banners, GIFs, carousels, videos, cookie dialogues, and paywalls.

The evaluation used DOM-centric Browser Use with Playwright version \(0.1.41\) and GPT-4o, Claude 3.7 Sonnet, and Gemini 2.0 Flash, together with the pixel-centric OpenAI Operator. Ten realistic user tasks were run ten times per model, yielding 300 baseline trials overall, with additional follow-ups on sticky CTA removal, CTA implementation variants, hidden-text and ARIA strategies, deep-scroll coupon hunts, dynamic media, and cookie banner variants. Logging included per-run JSON action logs for DOM agents, final answers, animated GIF screen recordings, and human annotation for Operator outcomes.

The reported behavioral regularities are highly specific. The agents displayed severe satisficing and rarely explored beyond two viewports. Quantitatively, average `scroll_down` actions per run were mean \(0.7\) for Gemini 2.0 Flash, mean \(0.8\) for GPT-4o, and mean \(2.5\) for Claude 3.7 Sonnet, with maxima \(3\), \(2\), and \(5\), respectively. In an infinite-scroll test where a coupon was placed on page 10, none of the 30 runs reached sufficient depth. Purely visual CTA text embedded in banners did not elicit clicks from DOM-centric agents, and Operator also did not click such banners in the tested setup. By contrast, real semantic button overlays or off-screen text labels in the DOM did induce interaction: with a real `<button>` overlay on side banners, Claude and GPT-4o clicked banners in \(7/10\) runs and Gemini in \(5/10\); with an off-screen `<span>` not marked `aria-hidden`, banner interaction was near-perfect at \(9/10\), \(10/10\), and \(10/10\). ARIA-only labels helped GPT-4o in \(4/10\) runs and Gemini in \(10/10\), but not Claude; `data-llm-description` had \(0/10\) effect across models.

Five design principles constitute the Tangentads blueprint. Semantic overlays add real DOM controls such as `<button>` or `<a>` with `role="button"`, `aria-label`, and descriptive text. Hidden labels use off-screen text linked to the CTA target so that agents can parse clickability and offer details; the blueprint specifically recommends avoiding `aria-hidden` on labels intended for agents. Top-left placement exploits the observed top-to-bottom, left-to-right traversal and the empirical left-banner bias: when identical banners appeared left and right, agents interacted exclusively with the left one. Static frames provide DOM-text equivalents for dynamic offers because DOM agents rarely wait for videos or carousels; dialogue replacement converts native prompts into accessible HTML modals with real “Accept,” “Reject,” and “Manage settings” buttons.

The same study reports trust and safety failures. When sweepstake participation required a purchase, GPT-4o and Claude 3.7 Sonnet subscribed in \(100\%\) of trials, and Gemini 2.0 Flash in \(70\%\). Cookie-handling behavior varied by banner type: for a non-essential sticky footer, GPT-4o accepted \(0/10\), Claude \(10/10\), and Gemini \(10/10\); for a modal blocker, GPT-4o accepted \(8/10\), Claude \(10/10\), and Gemini \(10/10\); for a predatory modal, acceptance was \(0/10\) for all models. The proposed safeguard layer therefore includes explicit cost disclosure in hidden labels, intermediate confirmation pages for paid actions, server-side enforcement preventing auto-subscription without an explicit “Yes” click, and logging of CTA element IDs, `aria-label`s, hidden-label use, scroll depth, viewport visibility, and conversion outcomes.

This version of Tangentads is not about visual congruence. It is an accessibility- and markup-oriented ad design framework for autonomous browsing systems. The paper did not report \(p\)-values, confidence intervals, or effect sizes, so the quantitative guidance is observational rather than inferential.

## 3. Tangentads as a formal 2-categorical notion

In category theory, a tangentad is a 2-categorical formalization of tangent categories that generalizes many tangent-like notions across multiple ambient settings [2503.18354]. The motivating problem is that tangent category theory has acquired many “flavours”—tangent monads, tangent fibrations, restriction tangent categories, reverse tangent categories, strong display tangent categories, infinitesimal objects—and the interaction of these flavours with constructions such as vector fields or bundles is more naturally studied at the 2-categorical level.

Formally, in a strict 2-category \(K\), a tangentad on an object \(X\) can be given in Leung form as a strong monoidal functor
\[
L[T]: WEIL_1 \to END(X)
\]
preserving the fundamental tangent limits pointwise. Unpacked internally, this is equivalent to an endo-1-cell \(T:X\to X\) equipped with 2-cells
\[
p:T\Rightarrow id,\quad z:id\Rightarrow T,\quad s:T^2\Rightarrow T,\quad l:T\Rightarrow T^2,\quad c:T^2\Rightarrow T^2,
\]
satisfying the tangent-category coherence data: \(c^2=id\), \(cl=l\), coassociativity of \(l\), the hexagon identities for \(c\), compatibility of \(c\) and \(l\), and local linearity via the relevant pointwise pullback. An optional negative structure is a 2-cell \(n:T\Rightarrow T\) with \(s\circ\langle id_T,n\rangle=id_T\).

Morphisms are likewise internalized. A lax tangent 1-morphism \((F,\alpha):(X,T)\to(X',T')\) consists of \(F:X\to X'\) and a 2-cell \(\alpha:FT\Rightarrow T'F\) satisfying additivity and compatibility with lift and flip. Colax tangent morphisms reverse the direction of the distributive law; strong morphisms have invertible \(\alpha\); strict morphisms have \(\alpha=id\). Tangent 2-morphisms \(q:(F,\alpha)\Rightarrow(G,\beta)\) are 2-cells \(q:F\Rightarrow G\) satisfying the tangent compatibility equation \(T' q\circ \alpha=\beta\circ q T\).

This formalization makes several structural results possible. For any tangentad \((X,T)\), the endo-1-cell \(T\) carries a canonical monad structure with unit \(\eta=z\) and multiplication \(\mu=s\circ\langle Tp,pT\rangle\), and \(c\) is a distributive law of the monad with itself. The assignment \(K\mapsto TNG_{co}(K)\) carries a canonical 2-comonad whose counit is the forgetful 2-functor and whose comultiplication sends \((X,T)\) to \((X;T,T,c)\). Special classes include Cartesian tangentads, adjunctable tangentads for which \(T\) and all \(T^n\) admit left adjoints, and representable tangentads where \(D^n\times - \dashv T^n\).

The framework captures ordinary tangent categories as tangentads in \(Cat\), tangent monads as tangentads in \(Mnd(Cat)\), tangent fibrations as tangentads in \(Fib\), tangent indexed categories as tangentads in \(Indx\), split restriction tangent categories as tangentads in \(sRSTCAT\), and infinitesimal objects as tangentads in a display-span setting. It also yields a genuine Grothendieck construction in the tangent setting and shows that every tangent monad admits Eilenberg–Moore algebras whenever the underlying monad does.

## 4. Hom tangent categories, vector fields, and corepresentability

A central refinement of the formal theory is the pointwise tangent structure on Hom-categories [2509.15524]. For tangentads \((X,T)\) and \((X',T')\), the Hom-category \([X',T' \,\|\, X,T]\) carries a tangent structure by postcomposition with \((T,c)\); if \((X,T)\) is Cartesian, then this Hom-category is a Cartesian tangent category. This pointwise construction is the mechanism through which universal properties can be stated uniformly across all tangentads.

Vector fields provide the canonical example. In an ordinary tangent category, a vector field on \(M\) is a section \(v:M\to TM\) of \(p\). In the formal theory, there is a tangentad \(VF(X,T)\) with a strict tangent morphism \(U:VF(X,T)\to (X,T)\) and a canonical natural transformation
\[
\nu: U \Rightarrow TU,\qquad \nu_{(M,v)}=v,
\]
which is a vector field in the Hom tangent category \([VF(X,T)\,\|\,X,T]\). The induced map
\[
\Gamma_\nu:[C \,\|\, VF(X,T)] \to VF([C \,\|\, X,T])
\]
is invertible for every tangentad \(C\). This expresses that vector fields are corepresented by the universal vector field \(\nu\). The same framework yields a 2-functor \(VF\), a commutative monoid bundle on the forgetful map \(U\), an abelian group bundle when negatives exist, a Lie algebra bundle with bracket
\[
[u,v]=\{Tv\circ u - c\circ Tu\circ v\},
\]
and a 2-monad structure on \(VF\) with unit \(0\) and multiplication \(+\circ\langle U_{VF},VF\,U\rangle\).

The article also develops differential objects, differential bundles, and connections by the same Hom-wise corepresentability method and shows that vector fields and connections can be constructed by PIE limits—products, inserters, and equifiers—whenever the relevant axioms are algebraic. This gives the framework a strong syntactic component: once the universal object is identified in the Hom tangent category, functorial transport across flavours follows automatically.

## 5. Differential objects, bundles, and connections in tangentads

Part II extends the formal theory from vector fields to Euclidean objects, vector bundles, and Koszul-like connections, again by universal properties internal to tangentads [2601.15534]. The point of departure is a Cartesian tangentad \((X,T)\) and the pointwise Hom tangent structure described above.

A differential object in a Cartesian tangent category is a commutative monoid \((A,\zeta_A,\sigma_A)\) with a differential projection \(\hat p_A:TA\to A\) satisfying additivity, linearity, and the universal property that \((p_A,\hat p_A):TA\to A\times A\) is a product diagram. In the tangentad setting, one obtains a tangentad \(DO(X,T)\) of differential objects together with a forgetful strict tangent morphism \(U:DO(X,T)\to (X,T)\) and pointwise natural transformations \(Z\), \(S\), and \(\hat P\). The main theorem states that for any tangentad \((X',T')\),
\[
\Gamma_{(Z,S,\hat P)}:[X',T' \,\|\, DO(X,T)] \xrightarrow{\cong} DO([X',T' \,\|\, X,T]).
\]
Thus differential objects in a Hom tangent category are precisely lax tangent morphisms into \(DO(X,T)\).

Display differential bundles are treated analogously. A tangentad \(DB(X,T)\) carries Base and Tot morphisms to \((X,T)\) and a universal pointwise bundle
\[
Q: Tot \Rightarrow Base.
\]
Again there is a universal equivalence
\[
\Gamma_Q:[X',T' \,\|\, DB(X,T)] \xrightarrow{\cong} DB([X',T' \,\|\, X,T]).
\]
A canonical restriction of \(DB(X,T)\) to bundles over the terminal object yields \(DB|_1(X,T)\), and the formal theory proves the canonical equivalence
\[
DO(X,T) \cong DB|_1(X,T).
\]
This is the tangentad-level extension of the standard tangent-category equivalence between differential objects and differential bundles over the terminal object.

Connections are organized in several tangentads: \(VLC(X,T)\) for vertical linear connections, \(HLC(X,T)\) for horizontal linear connections, \(LC(X,T)\) for linear connections, and affine variants \(VAC\), \(HAC\), and \(AC\). For a differential bundle \(q:E\to M\), a vertical linear connection is a retraction \(k:TE\to E\) of the vertical lift; a horizontal linear connection is a section \(h:Hq\to TE\) of the relevant projection; a linear connection is a pair \((k,h)\) satisfying orthogonality and direct-sum identities. The formal theory then internalizes the classical constructions
\[
\nabla^k_v s = k\circ Ts\circ v,
\]
\[
{}^k = k\circ Tk - k\circ Tk\circ c,
\]
for curvature, and in the affine case
\[
{}^k = c\circ k - k,
\]
for torsion. These become tangent morphisms \(\nabla\), \(R\), and \(W\) defined by universal pullbacks.

The theory also establishes liftings of \(DO\), \(DB\), and \(LC\) along strong Cartesian tangent monads and tangent fibrations, extends these constructions to tangent indexed categories via the Grothendieck 2-equivalence, and develops restriction-category versions by suitable 2-pullbacks selecting total structure maps. Connections admit an algebraic presentation by PIE limits: vertical and horizontal connections arise from inserters and equifiers imposing the connection axioms, and linear connections are then obtained by a 2-pullback plus additional equifiers. Concrete examples include smooth manifolds, where \(DO(Man)\) recovers Euclidean spaces \(\mathbb{R}^n\), \(DB(Man)\) recovers smooth vector bundles, and \(LC(Man)\) recovers Koszul connections; synthetic differential geometry; tangent restriction categories; and reverse tangent categories.

## 6. Distinctions, search collisions, and usage discipline

The three usages described above are technically independent. The image-search system is a visual retrieval and layout method for native advertising; the AI-agent blueprint is an accessibility and trust framework for machine-readable ads; the categorical theory is a formal language for differential-geometric structure in 2-categories. No shared theorem, algorithm, or ontology connects them directly.

A common search collision is “Tangent Attack,” a hard-label black-box adversarial attack that identifies an optimal tangent point of a virtual hemisphere on the decision boundary to reduce \(\ell_2\) distortion, with a semi-ellipsoid generalization for curved boundaries [2111.07492]. That work is not a tangentad theory; it concerns decision-boundary geometry, binary-query attacks, and query efficiency in adversarial machine learning. Its relevance here is terminological rather than conceptual.

This suggests that bibliographic practice should disambiguate the term by domain. In current research usage, “Tangentads” may refer to visually congruent ads in image search, machine-readable ad layers for AI web agents, or formal tangent structures in category theory, and these meanings should not be conflated.

Source: https://www.emergentmind.com/topics/tangentads