8 citations · 35 across the 21 of their papers we have counts for
5 papers · 1 filter
A note on the price of bandit feedback for mistake-bounded online learning
Jesse Geneson
The standard model and the bandit model are two generalizations of the mistake-bound model to online multiclass classification. In both models the learner guesses a classification…
An algorithm for bounding extremal functions of forbidden sequences
Jesse Geneson
Generalized Davenport-Schinzel sequences are sequences that avoid a forbidden subsequence and have a sparsity requirement on their letters. Upper bounds on the lengths of generaliz…
Expected capture time and throttling number for cop versus gambler
Jesse Geneson, Carl Joshua Quines, Espen Slettnes +1
We bound expected capture time and throttling number for the cop versus gambler game on a connected graph with vertices, a variant of the cop versus robber game that is played…
Variations of the cop and robber game on graphs
Espen Slettnes, Carl Joshua Quines, Shen-Fu Tsai +1
We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric ca…
Sequences of formation width and alternation length
Jesse Geneson, Peter Tian
Sequence pattern avoidance is a central topic in combinatorics. A sequence contains a sequence if some subsequence of can be changed into by a one-to-one renaming o…