paper-with-me

홈 › Papers

Local Compositional Complexity: How to Detect a Human-readable Messsage

2025-01-07 · Louis Mahon

Data complexity is an important concept in the natural sciences and related areas, but lacks a rigorous and computable definition. In this paper, we focus on a particular sense of complexity that is high if the data is structured in a way that could serve to communicate a message. In this sense, human speech, written language, drawings, diagrams and photographs are high complexity, whereas data that is close to uniform throughout or populated by random values is low complexity. We describe a general framework for measuring data complexity based on dividing the shortest description of the data into a structured and an unstructured portion, and taking the size of the former as the complexity score. We outline an application of this framework in statistical mechanics that may allow a more objective characterisation of the macrostate and entropy of a physical system. Then, we derive a more precise and computable definition geared towards human communication, by proposing local compositionality as an appropriate specific structure. We demonstrate experimentally that this method can distinguish meaningful signals from noise or repetitive signals in auditory, visual and text domains, and could potentially help determine whether an extra-terrestrial signal contained a message.

📄 PDF Abstract BibTeX arXiv:2501.03664

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

SLogic: Subgraph-Informed Logical Rule Learning for Knowledge Graph Completion

2025-09-30 · Trung Hoang Le, Tran Cao Son, Huiping Cao arxiv

Logical rule-based methods offer an interpretable approach to knowledge graph completion (KGC) by capturing compositional relationships in the form of human-readable inference rules. While existing logical rule-based met…

Knowledge Graph Completion

Eclectic Rule Extraction for Explainability of Deep Neural Network based Intrusion Detection Systems

2024-01-18 · Jesse Ables, Nathaniel Childers, William Anderson, Sudip Mittal 외

This paper addresses trust issues created from the ubiquity of black box algorithms and surrogate explainers in Explainable Intrusion Detection Systems (X-IDS). While Explainable Artificial Intelligence (XAI) aims to enh…

Explainable artificial intelligenceExplainable Artificial Intelligence (XAI)Explanation GenerationIntrusion Detection

Compositional Structure Learning for Action Understanding

2014-10-21 · Ran Xu, Gang Chen, Caiming Xiong, Wei Chen 외

The focus of the action understanding literature has predominately been classification, how- ever, there are many applications demanding richer action understanding such as mobile robotics and video search, with solution…

Action DetectionAction UnderstandingGeneral Classification

Human-Readable Adversarial Prompts: An Investigation into LLM Vulnerabilities Using Situational Context

2024-12-20 · Nilanjana Das, Edward Raff, Manas Gaur

Previous research on LLM vulnerabilities often relied on nonsensical adversarial prompts, which were easily detectable by automated methods. We address this gap by focusing on human-readable adversarial prompts, a more r…

Compositional Convolutional Neural Networks: A Robust and Interpretable Model for Object Recognition under Occlusion

2020-06-28 · Adam Kortylewski, Qing Liu, Angtian Wang, Yihong Sun 외

Computer vision systems in real-world applications need to be robust to partial occlusion while also being explainable. In this work, we show that black-box deep convolutional neural networks (DCNNs) have only limited ro…

image-classificationImage Classificationobject-detectionObject Detection+1