On the Triangle Inequality for the Jaccard Distance in Arbitrary Lattices
Costin B\u{a}dic\u{a}Amelia B\u{a}dic\u{a}
Aug 2026
Artificial Intelligence
Abstract
This paper presents new theoretical results on generalizing the Jaccard distance for lattices and real valuations. We demonstrate that when the valuation is strictly positive, monotone, and modular, the Jaccard distance satisfies the triangle inequality on arbitrary lattices, effectively generalizing earlier results that depended heavily on distributivity. Moving to relatively complemented distributive lattices (which safely drop the requirement for the global bounds found in Boolean algebras), we prove the triangle inequality holds as long as the valuation is positive, monotone, supermodular, and $\log$-submodular. Additionally, we adapt the symmetric-difference Jaccard formulation for submodular valuations to sectionally complemented distributive lattices. Shifting to necessary conditions, we prove that supermodularity is a strict requirement for the standard generalized Jaccard distance to operate as a valid metric. Finally, we map the practical value of relaxing these structural constraints to computational fields like quantum information theory, formal concept analysis, and machine learning, closing with a brief look at open mathematical problems.
Investigating how experienced developers use agents in building software, including their motivations, strategies, task suitability, and sentiments finds that while experienced developers value agents as a productivity boost, they retain their agency in software design and implementation out of insistence on fundamental software quality attributes.
This systematic review evaluates 55 studies from 2017 to 2023 on the application of machine learning techniques to ASD, highlighting key challenges and opportunities, particularly the need for models that can integrate complex data to improve diagnostic accuracy and treatment outcomes.
Rafael Muñoz-Terol, Jesús Peral, Sandra Amador et al.· Heliyon· 4 citations· ⚡1
This paper identifies two different routes through which models can acquire geometrically separable features: they can learn them from complementary co-occurrence signals in general language data, including text-number co-occurrence and cross-number interaction, or from multi-token addition problems.
This work explores image generation using flow matching using flow matching and proposes an iterative process that can be integrated into virtually any generative modeling technique, thereby enhancing the performance and robustness of image synthesis systems.
Eldad Haber, Shadab Ahamed, Md Shahriar Rahim Siddiqui et al.· SIAM Journal on Scientific C...· 3 citations
This work presents AutoOR, a scalable synthetic data generation and reinforcement learning pipeline that trains LLMs to autoformulate optimization problems specified in natural language across linear, mixed-integer, and non-linear categories and introduces a curriculum RL strategy that bootstraps from limited initial training data to make this class tractable for post-training.
S. Motwani, Chuan Du, A. Petrov et al.· 2 citations
A benchmark built on the Speech Accessibility Project (SAP) dataset is introduced that tests whether diagnosis labels, clinician-derived speech ratings, and progressively richer clinical descriptions improve transcription accuracy for dysarthric speech, finding that current models do not meaningfully use this context.
P. Moure, Niclas Pokel, Bilal Bounajma et al.· arXiv.org· 2 citations
