4 papers
Solvable Sokoban Without a Solver via Diffusion
Sina Baghal
Deciding whether a Sokoban puzzle is solvable is PSPACE-complete (Culberson, 1997): solutions can be exponentially long and there is no short certificate to check. Solvability is a…
Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization
Sina Baghal
Pasur is a fishing card game played over six rounds and is played similarly to games such as Cassino and Scopa, and Bastra. This paper introduces a CUDA-accelerated computational f…
A matrix concentration inequality for products
Sina Baghal
We present a non-asymptotic concentration inequality for the random matrix product \begin{equation}\label{eq:Zn} Z_n = \left(I_d-αX_n\right)\left(I_d-αX_{n-1}\right)\cdots \left(I_…
A termination criterion for stochastic gradient descent for binary classification
Sina Baghal, Courtney Paquette, Stephen A. Vavasis
We propose a new, simple, and computationally inexpensive termination test for constant step-size stochastic gradient descent (SGD) applied to binary classification on the logistic…