The whole and the parts: the MDL principle and the a-contrario framework

• URL: http://arxiv.org/abs/2112.06853v1
• Date: Mon, 13 Dec 2021 18:07:26 GMT
• Title: The whole and the parts: the MDL principle and the a-contrario framework
• Abstract summary: This work explores the connections between the Minimum Description Length (MDL) principle and the a-contrario framework for structure detection proposed by Desolneux, Moisan and Morel. The MDL principle focuses on the best interpretation for the whole data while the a-contrario approach concentrates on detecting parts of the data with anomalous statistics.
• Score: 4.970364068620608
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This work explores the connections between the Minimum Description Length (MDL) principle as developed by Rissanen, and the a-contrario framework for structure detection proposed by Desolneux, Moisan and Morel. The MDL principle focuses on the best interpretation for the whole data while the a-contrario approach concentrates on detecting parts of the data with anomalous statistics. Although framed in different theoretical formalisms, we show that both methodologies share many common concepts and tools in their machinery and yield very similar formulations in a number of interesting scenarios ranging from simple toy examples to practical applications such as polygonal approximation of curves and line segment detection in images. We also formulate the conditions under which both approaches are formally equivalent.

Related papers

• Multi-Level Contextual Token Relation Modeling for Machine-Generated Text Detection [105.1403233464793]
  Machine-generated texts (MGTs) pose risks such as disinformation and phishing, underscoring the need for reliable detection.<n> Metric-based methods, which extract statistically distinguishable features of MGTs, are often more practical than complex model-based methods.<n>We propose a multi-level contextual token relation modeling framework for MGT detection.
  arXiv  Detail & Related papers  (2026-05-15T15:55:58Z)
• MidSteer: Optimal Affine Framework for Steering Generative Models [53.89402578892719]
  MidSteer is a more general affine framework for concept manipulation that relaxes assumptions and enables directed, minimal-disturbance transformations.<n>We demonstrate that MidSteer performs favorably across a range of tasks, modalities, and architectures.
  arXiv  Detail & Related papers  (2026-04-17T19:23:33Z)
• Hypothesis-Driven Theory-of-Mind Reasoning for Large Language Models [76.6028674686018]
  We introduce thought-tracing, an inference-time reasoning algorithm to trace the mental states of agents. Our algorithm is modeled after the Bayesian theory-of-mind framework. We evaluate thought-tracing on diverse theory-of-mind benchmarks, demonstrating significant performance improvements.
  arXiv  Detail & Related papers  (2025-02-17T15:08:50Z)
• Understanding Multimodal LLMs Under Distribution Shifts: An Information-Theoretic Approach [33.463823493423554]
  Multimodal large language models (MLLMs) have shown promising capabilities but struggle under distribution shifts. We argue that establishing a formal framework that can characterize and quantify the risk of MLLMs is necessary to ensure the safe and reliable application of MLLMs in the real world.
  arXiv  Detail & Related papers  (2025-02-01T22:06:56Z)
• Top-K Pairwise Ranking: Bridging the Gap Among Ranking-Based Measures for Multi-Label Classification [120.37051160567277]
  This paper proposes a novel measure named Top-K Pairwise Ranking (TKPR) A series of analyses show that TKPR is compatible with existing ranking-based measures. On the other hand, we establish a sharp generalization bound for the proposed framework based on a novel technique named data-dependent contraction.
  arXiv  Detail & Related papers  (2024-07-09T09:36:37Z)
• Constrained Reinforcement Learning with Average Reward Objective: Model-Based and Model-Free Algorithms [34.593772931446125]
  monograph focuses on the exploration of various model-based and model-free approaches for Constrained within the context of average reward Markov Decision Processes (MDPs) The primal-dual policy gradient-based algorithm is explored as a solution for constrained MDPs.
  arXiv  Detail & Related papers  (2024-06-17T12:46:02Z)
• A Theory of LLM Sampling: Part Descriptive and Part Prescriptive [53.08398658452411]
  Large Language Models (LLMs) are increasingly utilized in autonomous decision-making. We show that this sampling behavior resembles that of human decision-making. We show that this deviation of a sample from the statistical norm towards a prescriptive component consistently appears in concepts across diverse real-world domains.
  arXiv  Detail & Related papers  (2024-02-16T18:28:43Z)
• Bridging State and History Representations: Understanding Self-Predictive RL [24.772140132462468]
  Representations are at the core of all deep reinforcement learning (RL) methods for Markov decision processes (MDPs) and partially observable Markov decision processes (POMDPs) We show that many of these seemingly distinct methods and frameworks for state and history abstractions are, in fact, based on a common idea of self-predictive abstraction. We provide theoretical insights into the widely adopted objectives and optimization, such as the stop-gradient technique, in learning self-predictive representations.
  arXiv  Detail & Related papers  (2024-01-17T00:47:43Z)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• Targeted Separation and Convergence with Kernel Discrepancies [61.973643031360254]
  kernel-based discrepancy measures are required to (i) separate a target P from other probability measures or (ii) control weak convergence to P. In this article we derive new sufficient and necessary conditions to ensure (i) and (ii) For MMDs on separable metric spaces, we characterize those kernels that separate Bochner embeddable measures and introduce simple conditions for separating all measures with unbounded kernels.
  arXiv  Detail & Related papers  (2022-09-26T16:41:16Z)
• Granular Generalized Variable Precision Rough Sets and Rational Approximations [0.24366811507669117]
  Granular approximations as per the procedures of VPRS are likely to be more rational than those constructed from a classical perspective under certain conditions. meta applications to cluster validation, image segmentation and dynamic sorting are invented.
  arXiv  Detail & Related papers  (2022-05-28T08:08:26Z)
• On the Connections between Counterfactual Explanations and Adversarial Examples [14.494463243702908]
  We make one of the first attempts at formalizing the connections between counterfactual explanations and adversarial examples. Our analysis demonstrates that several popular counterfactual explanation and adversarial example generation methods are equivalent. We empirically validate our theoretical findings using extensive experimentation with synthetic and real world datasets.
  arXiv  Detail & Related papers  (2021-06-18T08:22:24Z)
• General Rough Modeling of Cluster Analysis [0.0]
  The essence of the approach is explained in brief and supported by an example. A new general rough method of analyzing clusterings is invented, and this opens the subject to clearer conceptions and contamination-free proofs.
  arXiv  Detail & Related papers  (2021-06-02T20:54:10Z)
• Learning explanations that are hard to vary [75.30552491694066]
  We show that averaging across examples can favor memorization and patchwork' solutions that sew together different strategies. We then propose and experimentally validate a simple alternative algorithm based on a logical AND.
  arXiv  Detail & Related papers  (2020-09-01T10:17:48Z)
• Invariant Causal Prediction for Block MDPs [106.63346115341862]
  Generalization across environments is critical to the successful application of reinforcement learning algorithms to real-world challenges. We propose a method of invariant prediction to learn model-irrelevance state abstractions (MISA) that generalize to novel observations in the multi-environment setting.
  arXiv  Detail & Related papers  (2020-03-12T21:03:01Z)

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.