Learning an unknown linear order with up to k false counterexamples per round
Read the original at arxiv.org→arXiv:2608.21579v1 Announce Type: new Abstract: Consider the following problem of learning an unknown linear order on $n$ items. In each round, the learner guesses a complete ordering of the items and receives...
Original headline: "Sorting from Counterexamples"
Coverage timeline
- Aug 25, 04:00 UTC arXiv cs.LG lead source Sorting from Counterexamples