Challenge: Mixed Boolean-Arithmetic (MBA) obfuscation protects intellectual property by converting programs into complex forms that are difficult to analyze.
Approach: They propose a mixed-boolean-arithmetic (MBA) obfuscation framework that transforms a Transformer-based neural encoder-decoder into a truth table that is an automatically constructed semantic representation of an expression's behavior.
Outcome: The proposed framework improves performance and highlights the importance of internal semantic expressions in recovering obfuscated code to its original form.

Similar Papers

Don’t Judge a Book by its Cover: Testing LLMs’ Robustness Under Logical Obfuscation (2026.eacl-long)

Copied to clipboard

Challenge: obfuscated questions pose significant challenges for large language models . current models parse questions without deep understanding, MIT researchers say .
Approach: They propose a structure-preserving framework for logical obfuscation to test models . they use a logically equivalent framework to obliviate questions to logical equivalents .
Outcome: The proposed framework is a first-of-its-kind diagnostic benchmark with 1,108 questions . obfuscation severely degrades zero-shot performance, the authors show .
Domain-Agnostic Adapter Architecture for Deception Detection: Extensive Evaluations with the DIFrauD Benchmark (2024.lrec-main)

Copied to clipboard

Challenge: Existing research focuses predominantly on specific fields, which results in the need for clarity on linguistic markers associated with deception.
Approach: They propose a domain-independent fraud detection benchmark with 100,000 honest and misleading statements in seven domains and a parameter-efficient finetuning adapter to improve tuning methods.
Outcome: The proposed adapter outperforms all competition on the DIFrauD benchmark and is able to predict the performance of the proposed model.
Self-Distilled Quantization: Achieving High Compression Rates in Transformer-Based Language Models (2023.acl-short)

Copied to clipboard

Challenge: Existing methods for quantization-aware training and quantization for learning have limitations in dealing with accumulative quantization errors.
Approach: They propose a method that minimizes accumulative quantization errors and outperforms baselines by distilling knowledge from a fine-tuned teacher network.
Outcome: The proposed method minimizes accumulative quantization errors and outperforms baselines on the XGLUE benchmark.
HyperMixer: An MLP-based Low Cost Alternative to Transformers (2023.acl-long)

Copied to clipboard

Challenge: Existing MLP-based architectures that combine multiple features are expensive and require a lot of training data.
Approach: They propose a simple MLP-based model which allows token mixing by dynamically applying hypernetworks to each feature independently.
Outcome: The proposed model performs better than Transformers and lowers costs in terms of processing time, training data, and hyperparameter tuning.
GMSA: Enhancing Context Compression via Group Merging and Layer Semantic Alignment (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have achieved remarkable performance across NLP tasks . however, in long-context scenarios, they face high computational cost and information redundancy.
Approach: They propose an encoder-decoder context compression framework that generates a compact sequence of soft tokens for downstream tasks.
Outcome: Experiments show that GMSA outperforms baselines on multiple long-context question answering and summarization benchmarks while maintaining low end-to-end latency.
Mixup-Transformer: Dynamic Data Augmentation for NLP Tasks (2020.coling-main)

Copied to clipboard

Challenge: Recent work on data augmentation techniques that interpolate inputs and labels shows strong effectiveness in image classification.
Approach: They propose to integrate mixup to transformer-based pre-trained architecture for NLP tasks while keeping the whole end-to-end training system.
Outcome: The proposed framework improves on GLUEbenchmark and transformer-based learning models while keeping the whole end-to-end training system.
DecIF: Improving Instruction-Following through Decomposition (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to obtain high-quality instruction-following data rely heavily on existing documents and existing methods.
Approach: They propose a data synthesis framework, DecIF, which automatically generates accurate and diverse instruction-following data from scratch for supervised fine-tuning and reinforcement learning.
Outcome: Extensive experiments show that the proposed framework can synthesize accurate instruction-following data for both SFT and RL paradigms compared to baselines.
Logical Transformers: Infusing Logical Structures into Pre-Trained Language Models (2023.findings-acl)

Copied to clipboard

Challenge: Existing pre-trained language models that ignore the logical structures underlying natural language text often lack the ability to capture and encode key logical information in the input sequences.
Approach: They propose to construct logic-aware input embeddings for transformer language models through logic detection, logic mapping and hierarchical logical projections and then develop a new modeling paradigm that can upgrade existing transformer language model into logical transformers to boost their performance.
Outcome: The proposed model can achieve superior performance on four important and challenging tasks.
Penetrating Linguistic Disguises: A Slang-aware Label-Aligned Framework for Fine-Grained Toxicity Extraction in Chinese Hate Speech Detection (2026.findings-acl)

Copied to clipboard

Challenge: Flexible word boundaries and linguistic obfuscation, particularly slang, challenge precise span-level hate speech detection in Chinese.
Approach: They propose a Slang-aware Label-Aligned Framework that maps slang to explicit hate semantics and uses task-specific branches to mitigate feature interference.
Outcome: The proposed framework reduces ambiguity by mapping obscure slang to explicit hate semantics.
On the Way to Lossless Compression of Language Transformers: Exploring Cross-Domain Properties of Quantization (2024.lrec-main)

Copied to clipboard

Challenge: Modern Natural Language Processing models have a huge capacity, but this makes it difficult to employ.
Approach: They propose a method to quantize at least 95% of Transformer weights without access to task-specific data so the drop in performance does not exceed 0.02%.
Outcome: The proposed method quantizes 95% of Transformer weights and corresponding activations to INT8 without access to task-specific data so the drop in performance does not exceed 0.02%.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations