CrossLift: Lifting in SPL, Networks & Mesh Processing

• CrossLift is a term encompassing diverse lifting-based methods that transfer local representations into richer, domain-specific analyses across software, neural networks, and geometry processing.
• It employs shallow and deep lifting in functional program analysis, contrastive objectives in lifted network training, and multi-view directional cues to guide 3D mesh cross field computation.
• Empirical evaluations demonstrate regime-dependent performance improvements, with benefits in scalability, nonlinearity recovery, and semantic alignment across the examined applications.

Searching arXiv for papers explicitly associated with “CrossLift” and closely related usages. {"^^^^^^^^7query7 arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^^^^^", "^^^^^^^^7max_results7 ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7^^^^} Searching more narrowly for the specific CrossLift-related papers. {"^^^^^^^^7query7 OR \7^^^^^^^^"Look Both Ways Before You Cross\"^^^^^^^^7 OR \7^^^^^^^^"Automatic and Efficient Variability-Aware Lifting of Functional Programs\"^^^^^^^^7 OR \7^^^^^^^^"Contrastive Learning for Lifted Networks\"", "^^^^^^^^7max_results7 ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7^^^^} CrossLift is a name used in arXiv literature for several distinct lifting-based methods rather than a single canonical technique. The term denotes, in one line of work, a framework for transforming conventional functional program analyses into variability-aware analyses for software product lines; in another, a contrastive training formulation for lifted neural networks; and, in a third, a method for lifting directional cues from ^^^^7max_results7^^^^D visual priors into ^^^^7query7^^^^D surface cross fields on meshes (&&&^^^^7query7^^^^&&&, &&&^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^&&&, &&&^^^^7max_results7^^^^&&&). The shared lexical motif is “lifting,” but the underlying objects, objectives, and evaluation criteria differ substantially across these domains.

^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^. Terminological scope

The principal published uses of the name are summarized below.

Research area	What “CrossLift” denotes	Core mechanism
Software product lines	A framework for variability-aware lifting of functional program analyses	Shallow wrapping or deep rewriting of PCF+-based analyses
Lifted neural networks	A contrastive objective for lifted-network training	Difference between clamped and free energies
Geometry processing	A method for computing mesh cross fields from ^^^^7max_results7^^^^D visual priors	Multi-view image synthesis, back-projection, and two-stage interpolation

A common misconception is that CrossLift refers to a single software system or a single algorithmic family. In the literature represented here, that is not the case. The name is reused for formally different contributions, each centered on transferring structure from one representational regime to another: from single-product analysis to SPL-wide analysis, from clamped energy minimization to contrastive learning in lifted networks, and from ^^^^7max_results7^^^^D image-space directional evidence to ^^^^7query7^^^^D surface-aligned cross fields.

^^^^7max_results7^^^^. CrossLift in variability-aware functional program analysis

In software product-line analysis, CrossLift is a framework for automatically turning a conventional functional program analysis into a variability-aware one, so that the analysis can operate over an entire software product line without enumerating every product variant separately (&&&^^^^7query7^^^^&&&). The motivating problem is the combinatorial explosion induced by feature combinations in annotative SPLs. The paper models an SPL as

PRESERVED_PLACEHOLDER_^^^^7query7^^^^

where PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^ is the feature set, PRESERVED_PLACEHOLDER_^^^^7max_results7^^^^ is the feature model, PRESERVED_PLACEHOLDER_^^^^7query7^^^^ is the domain model, and PRESERVED_PLACEHOLDER_^^^^7ti:CrossLift OR \7^^^^ maps each element to its presence condition.

The central semantic device is the lifted value: instead of a single atomic value, a value of type PRESERVED_PLACEHOLDER_^^^^7 OR \7^^^^ is represented as a set of atomic values paired with presence conditions,

PRESERVED_PLACEHOLDER_^^^^7 OR \7^^^^

subject to disjointness and full coverage. Disjointness requires that no two atomic values overlap on the same configuration, and full coverage requires that the lifted value cover all valid configurations. This lets a lifted value behave as a total mapping from configurations to ordinary values.

The framework distinguishes two lifting strategies. Shallow lifting wraps the original analysis as a black box. It converts inputs and outputs into variability-aware values and uses lifted application to enumerate compatible combinations:

$apply\ f\ x = \{(f'(x'),\ fpc \wedge xpc)\mid (f',fpc)\in f,\ (x',xpc)\in x,\ \sat(fpc \wedge xpc)\}.$

This is lightweight and semantically straightforward, but it cannot share internal subcomputations across variants. Deep lifting, by contrast, rewrites the program itself: conditionals, pattern matches, lists, pairs, and user-defined calls are translated into variability-aware counterparts. That exposes internal structure and enables sharing.

The source language is PCF+, an extended PCF with lambda abstraction and application, recursion via fix, naturals and booleans, arithmetic operators, conditionals, pairs and lists, and pattern matching via case. The paper emphasizes that PCF+ is Turing-complete and expressive enough to model many analyses, which distinguishes the approach from Datalog-only techniques.

Correctness is defined by commuting with configuration indexing: running the lifted analysis and then selecting the result for a configuration must equal running the original analysis on that configuration’s derived product. The paper gives proof sketches that apply preserves disjointness, full coverage, and semantic correctness, making lifted application the semantic foundation of the framework.

The implementation is in Haskell. Lifted values are represented as PRESERVED_PLACEHOLDER_^^^^7query7 OR \7^^^^ with PresenceCondition implemented using BDDs via CUDD, and the deep rewriter implemented as a source-to-source transformer over a Haskell AST using haskell-tools. Because Haskell’s non-strict evaluation differs from the idealized call-by-name semantics, the implementation adds explicit context passing to lifted conditionals and pattern matches.

The evaluation uses ^^^^7 OR \7query7ti:CrossLift OR \7^^^^ BusyBox C source files and six analyses: Case Termination, Dangling Switch, Function Return Checker, Return Density, Goto Density, and Call Density. The main empirical pattern is nuanced rather than universal. For very small numbers of effective combinations, brute-force enumeration often wins because variability-aware bookkeeping dominates. Shallow lifting then surpasses brute force as combinations grow, and deep lifting becomes best when the number of effective combinations is large enough to amortize presence-condition overhead and exploit sharing. In Goto Density and Dangling Switch, deep lifting overtakes the alternatives beyond about ^^^^7 OR \7query7^^^^ effective combinations; in Case Termination, around ^^^^7query7query7query7^^^^; and at around ^^^^7 OR \7ti:CrossLift OR \7query7^^^^ combinations, deep lifting is about ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^ order of magnitude faster than shallow lifting and ^^^^7max_results7^^^^ orders faster than brute force in those benchmarks. The later-emerging advantage in Function Return Checker, Return Density, and Call Density shows that deep lifting is not a universal constant-factor improvement, but a regime-dependent one.

^^^^7query7^^^^. CrossLift in contrastive training for lifted networks

In the lifted-network literature, CrossLift denotes a contrastive-training view of lifted networks that replaces the standard loss-augmented clamped-only objective with a contrastive objective comparing a clamped energy against a free energy (&&&^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^&&&). The motivation is that earlier lifted-network training procedures had significant limitations: training and inference were mismatched, and the resulting networks tended to behave almost linearly.

The lifted network introduces explicit activation variables $z_k$ and defines inference as minimization of a convex energy over activations subject to convex constraints encoding nonlinearities. The standard training formulation minimizes the clamped energy only. The paper’s criticism is precise: at a minimum, the weight optimality condition pushes the layer relation toward

$W_k \hat z_k = \hat z_{k+1},$

which encourages linear consistency. Empirically, the paper reports that standard lifted training leaves about PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7^^^^ of activations in the linear regime on the evaluated benchmarks.

CrossLift replaces that objective with

PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^

where PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7max_results7^^^^ is the label-clamped energy and PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7^^^^ is the free energy. The method therefore compares two equilibria: a clamped phase, in which the output is fixed to the label, and a free phase, in which no label clamp is imposed. The loss is nonnegative because the clamped optimization has the additional output constraint.

This contrastive formulation has three roles in the paper. First, it closes the gap between training and inference by explicitly contrasting the free and clamped equilibria rather than optimizing only the clamped state. Second, it admits a dual interpretation via Fenchel/Lagrange duality. Third, and most prominently, it approximates back-propagation in the weak-feedback regime. For small PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7ti:CrossLift OR \7^^^^, the inferred activations approach ordinary feed-forward activations, and the contrastive gradient recovers the back-propagation form up to the scalar factor PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7 OR \7^^^^ and the inferred-versus-forward activation distinction.

The optimization protocol is explicit. Activation inference is performed by coordinate descent on the convex quadratic program, with each activation updated ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7 OR \7^^^^ times. The weak-feedback setting uses PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7 OR \7^^^^. Initialization comes from a standard forward pass. Weight updates are then performed by SGD with mini-batches of size ^^^^7 OR \7query7^^^^, and learning rates are scaled so that contrastive and back-propagation updates are matched up to the PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields77^^^^ factor.

The experiments compare Back-propagation, Standard lifted training, Contrastive lifted training, and Linear regression. On MNIST with architecture 78^^^^7ti:CrossLift OR \7^^^^-^^^^7 OR \7ti:CrossLift OR \7^^^^-^^^^7 OR \7ti:CrossLift OR \7^^^^-^^^^7 OR \7ti:CrossLift OR \7^^^^-^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7^^^^, the reported test accuracies are approximately 97.7% for ReLU back-prop, 8^^^^7 OR \7^^^^.^^^^7query7^^^^% for ReLU lifted, and 97.^^^^7 OR \7^^^^% for ReLU contrastive. Similar trends hold on Fashion-MNIST and grayscale CIFAR-^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7^^^^. The key point is not merely that contrastive lifted training improves accuracy, but that it avoids the linearity bias of the standard lifted objective and restores substantial nonlinear activity. In that sense, CrossLift serves as a bridge between energy-based lifted formulations and gradient-based discriminative training.

^^^^7ti:CrossLift OR \7^^^^. CrossLift in geometry processing and quad meshing

In geometry processing, CrossLift is a method for computing surface cross fields on triangle meshes by lifting alignment cues from ^^^^7max_results7^^^^D synthesized images back onto the ^^^^7query7^^^^D surface (&&&^^^^7max_results7^^^^&&&). The motivating claim is that feature alignment is semantic, but most existing quad-meshing methods treat it as purely geometric. CrossLift therefore uses ^^^^7max_results7^^^^D visual priors, including text-to-image priors, to obtain semantically meaningful directional supervision.

The pipeline has six stages. The input mesh is rendered from ^^^^7 OR \7^^^^ views—left, right, front, back, top, and bottom—to obtain depth maps. A depth-conditioned text-to-image prior, implemented with ControlNet in the main setup, generates images with a wireframe quad-mesh appearance. The paper notes that the main results use Flux, but the pipeline is modular and also works with Gemini ^^^^7query7^^^^, ChatGPT ^^^^7 OR \7^^^^.^^^^7max_results7^^^^, hand-drawn ^^^^7max_results7^^^^D alignment lines, and texture-based renders. Importantly, the prior is not used to directly generate the ^^^^7query7^^^^D mesh; it provides visual evidence about plausible edge-flow directions.

The method extracts per-pixel directions from synthesized images using a Scharr kernel:

PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^8

With PRESERVED_PLACEHOLDER_^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^9 the generated image, the image derivatives are

PRESERVED_PLACEHOLDER_^^^^7max_results7query7^^^^

and the complex-valued gradient is PRESERVED_PLACEHOLDER_^^^^7max_results7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^. The gradient is rotated by PRESERVED_PLACEHOLDER_^^^^7max_results7max_results7^^^^ so that the vectors align with grid lines rather than with the orthogonal edge normal. Only gradients above ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7max_results7^^^^% of the per-image maximum are retained. A coherence filter based on a structure tensor with an PRESERVED_PLACEHOLDER_^^^^7max_results7query7^^^^ Gaussian blur discards gradients whose coherence is below ^^^^7query7^^^^.^^^^7 OR \7^^^^.

These image-space directions are then back-projected to tangent-space directions on mesh faces. For a face PRESERVED_PLACEHOLDER_^^^^7max_results7ti:CrossLift OR \7^^^^ with tangent basis PRESERVED_PLACEHOLDER_^^^^7max_results7 OR \7^^^^, and a pixel corresponding to world-space point PRESERVED_PLACEHOLDER_^^^^7max_results7 OR \7^^^^, the camera projection Jacobian is

PRESERVED_PLACEHOLDER_^^^^7max_results77^^^^

If PRESERVED_PLACEHOLDER_^^^^7max_results7^^^^8 is the image-space gradient, the tangent-space gradient satisfies

PRESERVED_PLACEHOLDER_^^^^7max_results7^^^^9

and the method solves

PRESERVED_PLACEHOLDER_^^^^7query7query7^^^^

Only after this surface lifting does the method convert directions to the ^^^^7ti:CrossLift OR \7^^^^-RoSy power-field representation PRESERVED_PLACEHOLDER_^^^^7query7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^, because orthogonality in image space does not necessarily correspond to orthogonality on the surface.

The core technical contribution is a two-stage interpolation scheme. Both stages solve

PRESERVED_PLACEHOLDER_^^^^7query7max_results7^^^^

with a smoothness term over mesh edges and an alignment term over directional constraints. Stage ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^ performs interpolation within each view, using Gaussian weights based on distance from the sampled point to the face centroid and excluding non-visible faces from the smoothness term. Stage ^^^^7max_results7^^^^ merges the per-view fields across views. It introduces a view-direction confidence

PRESERVED_PLACEHOLDER_^^^^7query7query7^^^^

and a multi-view coherence confidence

PRESERVED_PLACEHOLDER_^^^^7query7ti:CrossLift OR \7^^^^

with final weight

PRESERVED_PLACEHOLDER_^^^^7query7 OR \7^^^^

This resolves sparsity, view imbalance, projection artifacts, cross-view conflicts, and occlusions.

The method is evaluated against QuadriFlow, QuadWild, and NeurCross on both organic and mechanical shapes. On the QuadWild^^^^7query7query7query7^^^^ dataset, the reported mean scaled Jacobian values are ^^^^7query7^^^^.9^^^^7 OR \77ti:CrossLift OR \7^^^^ for QuadriFlow, ^^^^7query7^^^^.9^^^^7query7 OR \7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^ for QuadWild, ^^^^7query7^^^^.97^^^^7query77 for NeurCross, and ^^^^7query7^^^^.9797 for CrossLift; the reported irregular vertex percentage values are ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^.^^^^7ti:CrossLift OR \777^^^^9, ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^.^^^^7ti:CrossLift OR \7max_results7query77^^^^, ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^.^^^^7 OR \7ti:CrossLift OR \77query7^^^^, and ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^.^^^^7ti:CrossLift OR \7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7query7^^^^, respectively. The paper attributes the improvement to stronger semantic alignment as well as smoother edge flow and fewer singularities. Additional applications include texture-aligned quad meshing, interactive cross-field design using coarse user-drawn lines, and optional sharp-edge constraints.

^^^^7 OR \7^^^^. Shared motifs and major divergences

A plausible commonality across these works is that “lifting” always denotes a transfer from a local or lower-level representation to a richer collective one: from per-configuration execution to SPL-wide variability-aware execution, from a single clamped equilibrium to a clamped-versus-free contrastive objective, or from ^^^^7max_results7^^^^D image-space directional evidence to ^^^^7query7^^^^D surface-aligned cross fields (&&&^^^^7query7^^^^&&&, &&&^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^&&&, &&&^^^^7max_results7^^^^&&&). This suggests a family resemblance in methodology even though the mathematical objects are unrelated.

The differences are sharper than the commonalities. In the SPL setting, the lifted objects are program values annotated with presence conditions, and correctness is semantic preservation across configurations. In lifted-network training, the lifted objects are explicit activations in an energy model, and the main question is whether the learning signal avoids the degeneracies of clamped-only training while approximating back-propagation. In geometry processing, the lifted objects are directional constraints inferred from images, and the quality criteria are field smoothness, semantic alignment, scaled Jacobian, and irregular vertex percentage. Accordingly, “CrossLift” does not designate a transferable algorithmic recipe across these domains; it designates different lifting operations adapted to different representational and optimization problems.

A second misconception is that all three variants are “fully automatic” in the same sense. The SPL framework depends on the analysis being expressible in the supported PCF+ subset and currently rejects unsupported syntax. The lifted-network formulation still requires iterative activation inference and weight optimization. The geometry-processing method depends on multi-view rendering, image synthesis, gradient extraction, and interpolation, and its outputs remain conditioned by the chosen ^^^^7max_results7^^^^D prior. The implementations are therefore automated, but not uniform in assumptions or guarantees.

^^^^7 OR \7^^^^. Adjacent usage and terminological boundaries

In adjacent applied literature, the term also appears descriptively rather than as the name of the contribution. A ^^^^7max_results7query7max_results7 OR \7^^^^ paper on construction-site crane safety presents a learning-based crane lifting safety monitoring system for tower crane operations with emphasis on modular integrated construction (MiC) lifting, and describes its relevance “for a CrossLift-style automated crane safety monitoring system” (Chen et al., 25 Jun 2025). The named system in that paper is a camera–LiDAR sensor-fusion pipeline rather than a method called CrossLift.

That pipeline combines ^^^^7max_results7^^^^D object detection from cameras with ^^^^7query7^^^^D depth information from LiDAR to localize MiC modules and nearby humans in ^^^^7query7^^^^D, determine whether a person has entered a predefined danger region, and automatically trigger warnings. The workflow consists of synchronized image–point-cloud acquisition, ^^^^7max_results7^^^^D detection of MiCs, humans, hooks, and MiC frames, depth conversion, fusion via clustering, world-coordinate recovery, danger-zone checking, and alarm triggering. The dataset contains ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7query7query77^^^^ image–point cloud pairs from ^^^^7query77^^^^ MiC liftings at ^^^^7max_results7^^^^ real construction sites in Hong Kong. The reported mean distance errors are ^^^^7CrossLift arXiv CrossLift lifted networks variability-aware lifting cross fields7^^^^.^^^^7 OR \7 OR \7ti:CrossLift OR \7query7^^^^ m for MiC localization and ^^^^7query7^^^^.78^^^^7max_results7ti:CrossLift OR \7^^^^ m for human localization.

Its relevance here is terminological. The paper does not establish a new CrossLift method, but it shows that the name can be used informally to denote automated crane-lifting safety systems. This reinforces the broader point that CrossLift is not a standardized label across research domains. Depending on context, it may refer to a formal lifting framework in SPL analysis, a contrastive objective in lifted neural networks, a visually guided surface-field construction technique, or, more loosely, an automated lifting-monitoring concept in construction robotics.