Search Results for author:
Found 4 papers, 1 papers with code
Solving Static Permutation Mastermind using $O(n \log n)$ Queries
Permutation Mastermind is a version of the classical mastermind game in which the number of positions $n$ is equal to the number of colors $k$, and repetition of colors is not allowed, neither in the codeword nor in the queries.
Combinatorics Probability
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning
In contrast, the online training algorithm Real Time Recurrent Learning (RTRL) provides untruncated gradients, with the disadvantage of impractically large computational costs.
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument
Hillclimbing is an essential part of any optimization algorithm.
The Lovász ϑ function, SVMs and finding large dense subgraphs
We show that the random graph with a planted clique is an example of $SVM-\theta$ graph, and as a consequence a SVM based approach easily identifies the clique in large graphs and is competitive with the state-of-the-art.
