arXiv AI By Kenneth Paulsen, Florian Tambon, Mike Papadakis, Shin Yoo

Synthetic Semantic Supervision for Contrastive Code Representation Learning in Small Transformers: An Empirical Study

Read the original on arXiv AI →

The paper investigates using synthetic natural-language descriptions to contrastively pretrain small transformer encoders for code representation. By pairing generated descriptions with code in a dual-encoder setup during training and discarding them at inference, the authors achieve significant improvements over traditional pretraining baselines on most evaluated tasks. When fine‑tuned, these models match or surpass much larger zero‑shot models and remain competitive with execution‑aware supervision, indicating a scalable alternative for code embeddings.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 18

Invariant Pretraining for Robust Code Representations

arXiv:2608. 15412v1 Announce Type: cross Abstract: Encoder-based code representation models remain widely deployed for discriminative tasks such as clone detection and code classification, where their small size and low inference cost are decisive.

By Yifeng He, Yundi Xu, Christopher Castro Gaw Gonzalo, Zili Wang, Hao Chen
arXiv Machine Learning
Sep 16

Type-IV Code Clone Detection via Layer-Wise Non-Contrastive Representation Learning

The paper introduces LWVIC4Code, a non‑contrastive, layer‑wise representation learning method for detecting Type‑IV code clones—semantically equivalent fragments that differ syntactically. It builds on the VICReg framework, adding cross‑layer consistency regularization and depth‑dependent weighting to refine semantic information across transformer layers. Experiments on Python and multi‑language datasets show that LWVIC4Code matches or outperforms contrastive baselines and zero‑shot large language models, generalizing well to Java and C# without requiring negative samples.

By Luciano Marchezan, Kevin Delcourt, Eugene Syriani, Houari Sahraoui
arXiv Machine Learning
Oct 16

Identifier-Free Code Embedding Models for Scalable Search

The paper introduces Identifier-Free Code Embedding Models designed to improve function association for binary reverse engineering. It formalizes the bidirectional association problem between source code and decompiled, stripped code, and evaluates embedding models on this task. By fine‑tuning a Qwen3‑Embedding model with contrastive learning, the authors achieve significant performance gains over existing baselines and demonstrate generalization to a constant‑algorithm association task.

By Eric Wolos, Michael Doyle