activity
20242026
most citedTime complexity for deterministic string machines

1 citations · 1 across the 3 of their papers we have counts for

collaborators

6 papers

cs.FL2026

Stringological sequence prediction II: Right-to-left automaticity and related complexity measures

Vanessa Kosoy

In a previous paper, we began the study of sequence prediction algorithms adapted to stringological word complexity measures. One measure we considered was left-to-right (most-sign…

cs.FL20261 cited

Time complexity for deterministic string machines

Nur Cataltepe, Vanessa Kosoy

Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large eve…

cs.FL2026

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences

Vanessa Kosoy

We propose novel algorithms for sequence prediction based on ideas from stringology. These algorithms are time and space efficient and satisfy mistake bounds related to particular…

cs.LG2026

Ambiguous Online Learning

Vanessa Kosoy

We propose a new variant of online learning that we call "ambiguous online learning". In this setting, the learner is allowed to produce multiple predicted labels. Such an "ambiguo…

cs.LG2025

Regret Bounds for Robust Online Decision Making

Alexander Appel, Vanessa Kosoy

We propose a framework which generalizes "decision making with structured observations" by allowing robust (i.e. multivalued) models. In this framework, each model associates each…

cs.LG2024

Imprecise Multi-Armed Bandits

Vanessa Kosoy

We introduce a novel multi-armed bandit framework, where each arm is associated with a fixed unknown credal set over the space of outcomes (which can be richer than just the reward…