Tootfinder

BINGO! Simple Optimizers Win Big if Problems Collapse to a Few Buckets
Kishan Kumar Ganguly, Tim Menzies
https://arxiv.org/abs/2506.04509 https://

BINGO! Simple Optimizers Win Big if Problems Collapse to a Few Buckets
Traditional multi-objective optimization in software engineering (SE) can be slow and complex. This paper introduces the BINGO effect: a novel phenomenon where SE data surprisingly collapses into a tiny fraction of possible solution "buckets" (e.g., only 100 used from 4,096 expected). We show the BINGO effect's prevalence across 39 optimization in SE problems. Exploiting this, we optimize 10,000 times faster than state-of-the-art methods, with comparable effectiveness. Our new algorithms (LIT…

I finally got rid of the old bed I’d kept since moving in, so the room feels pretty empty right now.
I’m in the process of reorganizing everything and plan to turn this space into my own anarchist sanctuary.
Soon, I’ll add a bookshelf and more anarchist art to the wall, right next to the communist hammer and sickle symbol.
#Declutter

Übrigens, wer meine (soweit Neuerblühtes vorhanden täglichen) #blühklex Fotos ausm #klexenhaus mag: dieses Jahr versuche ich sie konsequent in einem eigenen nur dafür gedachten Instagram Account zu sammeln, wer mag, findet den unter https://www.instagram.com/bluehklex/profilecard/?igsh=MWg0d3QyNmFtbjBxdQ==.
(ja, Instagram böse, ich weiß, klei mi büdde anne fööt)

"The destruction of the climate by industrial processes is a real-world problem. If programming language selection has no impact on it, then maybe we’re all just wasting our time, creating shiny consumer distractions to make the last few years of humanity that little more palatable for the richest 1% of the world’s human population."

Choosing A Programming Language
Selecting the correct programming language for a particular task often feels like a bunfight. Suggestions are thrown around based on the individual's preferences and desires. The experience is very likely to leave one feeling that programming is an art, rather than a science.

Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives
Vu Thi Huong, Ida Litzel, Thorsten Koch
https://arxiv.org/abs/2506.04045

Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives
Fuzzy clustering, which allows an article to belong to multiple clusters with soft membership degrees, plays a vital role in analyzing publication data. This problem can be formulated as a constrained optimization model, where the goal is to minimize the discrepancy between the similarity observed from data and the similarity derived from a predicted distribution. While this approach benefits from leveraging state-of-the-art optimization algorithms, tailoring them to work with real, massive dat…

Literature Review Of Multi-Agent Debate For Problem-Solving
Arne Tillmann
https://arxiv.org/abs/2506.00066 https://arxiv.org/pdf/2506…

Literature Review Of Multi-Agent Debate For Problem-Solving
Multi-agent large language models (MA-LLMs) are a rapidly growing research area that leverages multiple interacting language agents to tackle complex tasks, outperforming single-agent large language models. This literature review synthesizes the latest research on agent profiles, communication structures, and decision-making processes, drawing insights from both traditional multi-agent systems and state-of-the-art MA-LLM studies. In doing so, it aims to address the lack of direct comparisons in…

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
Rajpreet Singh, Novak Bo\v{s}kov, Aditya Gudal, Manzoor A. Khan
https://arxiv.org/abs/2506.01571

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
Resource allocation and scheduling are a common problem in various distributed systems. Although widely studied, the state-of-the-art solutions either do not scale or lack the expressive power to capture the most complex instances of the problem. To that end, we present a mathematical framework for hypergraph ranking and analysis, unifying graph theory, lattice theory, and semantic analysis. In our fundamental theorem, we prove the existence of partial order on entities of hypergraphs, extendin…

This https://arxiv.org/abs/2503.07792 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

Efficient Neural Clause-Selection Reinforcement
Clause selection is arguably the most important choice point in saturation-based theorem proving. Framing it as a reinforcement learning (RL) task is a way to challenge the human-designed heuristics of state-of-the-art provers and to instead automatically evolve -- just from prover experiences -- their potentially optimal replacement. In this work, we present a neural network architecture for scoring clauses for clause selection that is powerful yet efficient to evaluate. Following RL principle…

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
Zhiwei Zhang, Samy Wu Fung, Anastasios Kyrillidis, Stanley Osher, Moshe Y. Vardi
https://arxiv.org/abs/2506.00674

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
The Boolean satisfiability (SAT) problem lies at the core of many applications in combinatorial optimization, software verification, cryptography, and machine learning. While state-of-the-art solvers have demonstrated high efficiency in handling conjunctive normal form (CNF) formulas, numerous applications require non-CNF (hybrid) constraints, such as XOR, cardinality, and Not-All-Equal constraints. Recent work leverages polynomial representations to represent such hybrid constraints, but it re…

Unlikely intersections in Shimura varieties and beyond: a survey
Christopher Daw
https://arxiv.org/abs/2506.02900 https://arxiv.org/p…

Unlikely intersections in Shimura varieties and beyond: a survey
The aim of this note is to provide a concise introduction to so-called problems of unlikely intersections for (pure) Shimura varieties and to review the current state-of-the-art. In the process, we will touch upon more general settings and some of the results in those contexts.