Jun 2, 2025

Approximating Human Preferences Using a Multi-Judge Learned System

Eitan Sprejer, Fernando Avalos, José Pedro Brito de Azevedo Faustino, Augusto Mariano Bernardi

🏆 2nd place by peer review

In this work, we introduced a learned approach to aggregating multi-judge scores: using a GAM and a simple MLP as an alternative to traditional, non-learned methods like averaging. Our models outperform the naive baseline in predicting simulated human preferences, demonstrating that learned aggregation can better capture complex evaluative signals.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow
Arrow
Arrow

Nice work! This is a really solid technical contribution demonstrating that learned aggregation of multi-judge scores significantly outperforms naive averaging. The mathematical formalization and very clear writeup make it a pleasure to read. The dataset is sufficiently large for the finding to be robust and the implementation details seem very solid.

To further strengthen this work consider these ideas:

* I liked the thoughts on bad judge contamination. Could you add a bad judge to demonstrate the effect?

* Generalization could be tested even more rigorously by holding out entire personas or domains

* Do some analysis on the resulting aggregation model. What is actually learned? How exactly does it achieve the performance gain on naive aggregation?

* I'd be curious about training personalized models per simulated user and comparing the resulting models

This is a great submission given the time allowed. Documentation is excellent.

Spell check the paper. There is a reference to Appendix A that should be to Appendix B. Explain all abbreviations at least once. All diagrams and tables should have a description that makes them ‘stand alone’ - assume some readers read just the tables and diagrams.

Clever approach and I like the idea of doing mechanistic interpretability analysis on the smaller learned model. Would be interested to see more development of that aspect too!

I love the exploration of using MLP and other architectures to aggregate multiple judges. I also liked the idea of using personas to simulate different judges.

One potential weakness is that your work seems to depend on having high quality labelled data. It would be interesting to see if you can define paradigms that scale well with having noisy “weak” probabilistic labels, e.g. by using some sort of discriminator like defined in this paper here from Snorkel (https://link.springer.com/article/10.1007/s00778-019-00552-1?utm_source=chat

Cite this work

@misc {

title={

(HckPrj) Approximating Human Preferences Using a Multi-Judge Learned System

},

author={

Eitan Sprejer, Fernando Avalos, José Pedro Brito de Azevedo Faustino, Augusto Mariano Bernardi

},

date={

6/2/25

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

View All

View All

Feb 2, 2026

Prototyping an Embedded Off-Switch for AI Compute

This project prototypes an embedded off-switch for AI accelerators. The security block requires periodic cryptographic authorization to operate: the chip generates a nonce, an external authority signs it, and the chip verifies the signature before granting time-limited permission. Without valid authorization, outputs are gated to zero. The design was implemented in HardCaml and validated in simulation.

Read More

Feb 2, 2026

Fingerprinting All AI Cluster I/O Without Mutually Trusted Processors

We design and simulate a "border patrol" device for generating cryptographic evidence of data traffic entering and leaving an AI cluster, while eliminating the specific analog and steganographic side-channels that post-hoc verification can not close. The device eliminates the need for any mutually trusted logic, while still meeting the security needs of the prover and verifier.

Read More

Feb 2, 2026

Modelling the impact of verification in cross-border AI training projects

This paper develops a stylized game-theoretic model of cross-border AI training projects in which multiple states jointly train frontier models while retaining national control over compute resources. We focus on decentralized coordination regimes, where actors publicly pledge compute contributions but privately choose actual delivery, creating incentives to free-ride on a shared public good. To address this, the model introduces explicit verification mechanisms, represented as a continuous monitoring intensity that improves the precision of noisy signals about each actor's true compute contribution. Our findings suggest that policymakers designing international AI governance institutions face a commitment problem: half-measures in verification are counterproductive, and effective regimes require either accepting some free-riding or investing substantially in monitoring infrastructure.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.