|
Models that prove their own correctness | title | Models that prove their own correctness |
|---|
| start_date | 2024/12/10 |
|---|
| schedule | 11h |
|---|
| online | no |
|---|
| location_info | salle 3052 |
|---|
| summary | This talk introduces Self-Proving models, a new class of models that formally prove the correctness of their outputs via an Interactive Proof system. After reviewing some related literature, I will formally define Self-Proving models and their per-input (worst-case) guarantees. I will then present algorithms for learning these models and explain how the complexity of the proof system affects the complexity of the learning algorithms. Finally, I will show experiments where Self-Proving models are trained to compute the Greatest Common Divisor of two integers, and to prove the correctness of their results to a simple verifier.
Joint work with Noga Amit, Shafi Goldwasser, and Guy N. Rothblum. |
|---|
| responsibles | Szabó |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2024/12/04 13:29 UTC |
| |
|