§ 1   Research

Research at Ufinq

Ufinq is the research arm behind Diafunc — a focused effort to make Symbolic AI scale. Where deep learning compresses data into millions of opaque weights, Ufinq evolves code: small, readable programs that describe how data behaves, deployable on any machine and auditable line by line.

Our work is organized around seven research areas, each a thread of active investigation. The corresponding publications are listed under Papers; short-form notes on individual problems live under Notes.

Symbolic AI is not a smaller deep learning. It is a different category of model — and a different research program.
§ 2   Areas

Research areas

§ 2.1

Distributed orchestration

AHISTER, DEBOHAC, and the cluster lifecycle — distributing evolutionary search across heterogeneous compute under hierarchical capacity and budget.

Read more
§ 2.2

Symbolic refinement

Algebraic simplification, structural normalization, and the e-graph rewriter — reducing every candidate to its canonical form before it enters the gene pool.

Read more
§ 2.3

Constant optimization

CMA-ES, L-BFGS, Nelder-Mead, Coordinate Descent — numeric methods specialized for the constraints of symbolic regression candidates.

Read more
§ 2.4

Approximate evaluation

CRESCENT and successors — cheap-then-full evaluation gating that redirects compute toward the candidates that deserve a full-fidelity score.

Read more
§ 2.5

Genetic operators

How candidates are generated and recombined — the mutation chain, crossover families, and the structural invariants they must preserve.

Read more
§ 2.6

Search strategies

Navigating the universal function space — exploration vs exploitation, adaptive search spaces, and the dual diversity gates that hold populations open.

Read more
§ 2.7

Compositional search

Building large models by composing smaller ones — divide-and-conquer in symbolic regression, sub-model assembly, and the seams between them.

Read more
§ 3   Frontier

The Pareto frontier

Ufinq does not return one model. It returns a frontier — a set of candidate solutions that trade accuracy against complexity. A small, blunt model and a large, accurate model can both be on the frontier; nothing strictly dominated by another candidate gets to stay. The user picks the tradeoff that fits the problem.

The Pareto frontier Candidate models plotted on a complexity vs error chart. The Pareto frontier traces the lower bound — solutions that are not dominated by any other. Errorlower is betterComplexitysmall ←    → largesmall & decenta 3-line formulalarge & accuratea many-term expressionPareto frontier
Figure The Pareto frontier. Each green point is a non-dominated candidate; the user picks the tradeoff that fits the problem.
§ 4   Principles

Research principles

Ufinq research is closed-source by default, but open in its ideas. Algorithms, designs, and empirical results are described in papers and technical reports; the productized implementation is part of the Diafunc platform. The asymmetry between reading a paper and reproducing a full distributed system is deliberate — and the direction is reversible: closed today, with the option to open components later if and when it serves the research community.

Three commitments shape what gets prioritized:

Readable modelsEvery output is auditable code, not opaque weights — the result must remain readable as it scales.
Distributed by constructionAlgorithms are designed for cluster execution from day one — not single-machine prototypes retrofitted later.
Honest benchmarksEvery claim ships with reproducible SRBench-schema results — no cherry-picked workloads, no contaminated splits.
§ 5   Read

Where to read more

The full output of the research effort lives on the Papers page. Empirical evaluations are tracked under Benchmarks. For the short version of how the system works end-to-end, see Technology.

Read the papers