OCP: Orthogonal Constrained Projection for Sparse Scaling in Industrial Commodity Recommendation

• URL: http://arxiv.org/abs/2603.18697v1
• Date: Thu, 19 Mar 2026 09:57:26 GMT
• Title: OCP: Orthogonal Constrained Projection for Sparse Scaling in Industrial Commodity Recommendation
• Abstract summary: A key challenge is that Item-Id vocabularies suffer from low-frequency information interference when subjected to sparse scaling.<n>We propose an Orthogonal Constrained Projection method to optimize embedding representation.
• Score: 9.265389086960656
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In industrial commodity recommendation systems, the representation quality of Item-Id vocabularies directly impacts the scalability and generalization ability of recommendation models. A key challenge is that traditional Item-Id vocabularies, when subjected to sparse scaling, suffer from low-frequency information interference, which restricts their expressive power for massive item sets and leads to representation collapse. To address this issue, we propose an Orthogonal Constrained Projection method to optimize embedding representation. By enforcing orthogonality, the projection constrains the backpropagation manifold, aligning the singular value spectrum of the learned embeddings with the orthogonal basis. This alignment ensures high singular entropy, thereby preserving isotropic generalized features while suppressing spurious correlations and overfitting to rare items. Empirical results demonstrate that OCP accelerates loss convergence and enhances the model's scalability; notably, it enables consistent performance gains when scaling up dense layers. Large-scale industrial deployment on JD.com further confirms its efficacy, yielding a 12.97% increase in UCXR and an 8.9% uplift in GMV, highlighting its robust utility for scaling up both sparse vocabularies and dense architectures.

Related papers

• The Pitfall of Scaling Up: Uncovering and Mitigating Popularity Bias Amplification in Scaling Transformer-based Recommenders [26.25851138178879]
  We identify a critical pitfall in scaling transformer-based sequential recommenders.<n>While increasing model size improves recommendation accuracy, it simultaneously amplifies popularity bias.<n>This bias drives systems to over-recommend popular items at the expense of niche ones.
  arXiv  Detail & Related papers  (2026-06-20T07:13:49Z)
• LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models [12.483003654711203]
  Vision-language models (VLMs) deliver strong multimodal reasoning capabilities, but their large computational cost and high parameter counts make deployment challenging on resource-constrained devices.<n>We proposetextitER (textbfLoss-textbfLASAware textbfSingular-value dtextbfEcomposition and textbfRank allocation), a low-rank compression framework for efficient low-precision VLM inference.
  arXiv  Detail & Related papers  (2026-05-30T06:53:23Z)
• Hyperbolic Enhanced Representation Learning for Incomplete Multi-view Clustering [57.38215918201251]
  We propose HERL, a Hyperbolic Enhanced Representation Learning framework for Incomplete Multi-View Clustering.<n> operating within the Poincaré ball, HERL constructs a structure-aware latent space to enhance representation learning.<n>We show that HERL consistently outperforms state-of-the-art approaches.
  arXiv  Detail & Related papers  (2026-04-18T10:50:46Z)
• ARGENT: Adaptive Hierarchical Image-Text Representations [12.724220731465392]
  We introduce a stronger hyperbolic VLM baseline ARGENT, Adaptive hieRarchical imaGe-tExt represeNTation.<n>This paper introduces a stronger hyperbolic VLM baseline ARGENT, Adaptive hieRarchical imaGe-tExt represeNTation.
  arXiv  Detail & Related papers  (2026-03-24T15:14:12Z)
• Sparsity Induction for Accurate Post-Training Pruning of Large Language Models [23.002927923453118]
  Post-training sparsity (PTS) reduces model cost by removing weights from dense networks.<n>But native dense matrices lack high sparsity, making existing approaches that directly remove weights disrupt model states.<n>We propose Sparsity Induction, which promotes models toward higher sparsity at both distribution and feature levels before pruning.
  arXiv  Detail & Related papers  (2026-02-25T07:25:01Z)
• Efficient Learning of Sparse Representations from Interactions [9.381985901356922]
  We propose a training strategy for learning high-dimensional sparse embedding layers in place of conventional dense ones.<n>We modified the production-grade collaborative filtering autoencoder ELSA, achieving up to 10x reduction in embedding size with no loss of recommendation accuracy.
  arXiv  Detail & Related papers  (2026-02-10T16:09:58Z)
• SAGE: Sequence-level Adaptive Gradient Evolution for Generative Recommendation [8.54123828673921]
  We propose a unified optimization framework tailored for list-wise generative recommendation.<n>Sequence-level Signal Decoupling: By combining a geometric mean importance ratio with decoupled multi-objective advantages, we eliminate token-level variance.<n>Asymmetric Adaptive Dynamics: We construct a dynamic gradient manifold that applies a "Boost Factor" to high-potential cold start items to achieve super-linear updates.
  arXiv  Detail & Related papers  (2026-01-29T09:30:13Z)
• Milestones over Outcome: Unlocking Geometric Reasoning with Sub-Goal Verifiable Reward [67.00373428443879]
  We introduce a paradigm shift towards subgoal-level evaluation and learning.<n>We first construct GeoGoal, a benchmark synthesized via a rigorous formal verification data engine.<n>We propose the Sub-Goal Verifiable Reward (SGVR) framework, which replaces sparse signals with dense rewards based on the Skeleton Rate.
  arXiv  Detail & Related papers  (2026-01-08T16:17:56Z)
• Reinforcing Video Reasoning Segmentation to Think Before It Segments [67.5703457389657]
  We introduce Veason-R1, a specialized LVLM for video reasoning segmentation.<n>Veason-R1 is trained through Group Relative Policy Optimization (O) augmented with Chain-of-Thought trajectories.<n>We incorporate a holistic reward mechanism that enhances spatial alignment and temporal consistency.<n>Veason-R1 achieves state-of-the-art performance on multiple benchmarks, surpassing prior art by significant margins.
  arXiv  Detail & Related papers  (2025-08-15T15:34:56Z)
• Optimizing Singular Spectrum for Large Language Model Compression [95.7621116637755]
  We introduce SoCo, a novel compression framework that learns to rescale the decomposed components of SVD in a data-driven manner.<n>Thanks to the learnable singular spectrum, SoCo adaptively prunes components according to the sparsified importance scores.<n> Experimental evaluations across multiple LLMs and benchmarks demonstrate that SoCo surpasses the state-of-the-art methods in model compression.
  arXiv  Detail & Related papers  (2025-02-20T23:18:39Z)
• LOBG:Less Overfitting for Better Generalization in Vision-Language Model [19.890629892640206]
  We propose a framework named LOBG for vision-language models. We use CLIP to filter out fine-grained foreground information that might cause overfitting, thereby guiding prompts with basic visual concepts. Our method significantly improves generalization capability and alleviates overfitting compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-10-14T08:06:21Z)
• Source-Free Domain Adaptive Object Detection with Semantics Compensation [54.00183496587841]
  We introduce Weak-to-strong Semantics Compensation (WSCo) for strong data augmentation.<n>WSCo compensates for the class-relevant semantics that may be lost during strong augmentation on the fly.<n>WSCo can be implemented as a generic plug-in, easily integrable with any existing SFOD pipelines.
  arXiv  Detail & Related papers  (2024-10-07T23:32:06Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.