10 citations · 12 across the 6 of their papers we have counts for
6 papers
Packings of Smoothed Polygons
Thomas Hales, Koundinya Vajjha
This book uses optimal control theory to prove that the most unpackable centrally symmetric convex disk in the plane is a smoothed polygon. A smoothed polygon is a polygon whose co…
On the Reinhardt Conjecture and Formal Foundations of Optimal Control
Koundinya Vajjha
We describe a reformulation (following Hales (2017)) of a 1934 conjecture of Reinhardt on pessimal packings of convex domains in the plane as a problem in optimal control theory. S…
Formalization of a Stochastic Approximation Theorem
Koundinya Vajjha, Barry Trager, Avraham Shinnar +1
Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are…
CertRL: Formalizing Convergence Proofs for Value and Policy Iteration in Coq
Koundinya Vajjha, Avraham Shinnar, Vasily Pestun +2
Reinforcement learning algorithms solve sequential decision-making problems in probabilistic environments by optimizing for long-term reward. The desire to use reinforcement learni…
Verification of ML Systems via Reparameterization
Jean-Baptiste Tristan, Joseph Tassarotti, Koundinya Vajjha +2
As machine learning is increasingly used in essential systems, it is important to reduce or eliminate the incidence of serious bugs. A growing body of research has developed machin…
A Formal Proof of PAC Learnability for Decision Stumps
Joseph Tassarotti, Koundinya Vajjha, Anindya Banerjee +1
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory deriv…