Source author record

Annan Yu

Annan Yu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

2works
3topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

2 published item(s)

preprint2026arXiv

Continuity Laws for Sequential Models

Inductive biases influence the behavior and performance of sequential models. In this work, we study an underexplored inductive bias in sequential modeling: continuity in time. We ask a simple question: do models motivated by continuous-time formulations, such as state-space models, actually behave continuously in time, and does this translate into better performance on tasks with continuous temporal structure? To answer this, we formalize model continuity as convergence under temporal refinement, where a model is continuous if its predictions approach an underlying continuous trajectory as the temporal discretization is refined. We show that S4 exhibits stable continuous behavior, whereas S6 (the core of Mamba) can be more sensitive to input amplitude and selective dynamics, despite being derived from a continuous dynamical system. To study whether this distinction matters for learning, we also need a corresponding notion of task continuity. We therefore introduce a metric to quantify the continuity of datasets directly from their temporal structure. Across benchmarks, we find a clear empirical alignment between task continuity, model continuity, and model performance. Beyond an inductive bias, continuity also has practical consequences: we show that it enables a simple temporal subsampling strategy that improves both efficiency and performance.

preprint2021arXiv

H-chromatic symmetric functions

We introduce $H$-chromatic symmetric functions, $X_{G}^{H}$, which use the $H$-coloring of a graph $G$ to define a generalization of Stanley's chromatic symmetric functions. We say two graphs $G_1$ and $G_2$ are $H$-chromatically equivalent if $X_{G_1}^{H} = X_{G_2}^{H}$, and use this idea to study uniqueness results for $H$-chromatic symmetric functions, with a particular emphasis on the case $H$ is a complete bipartite graph. We also show that several of the classical bases of the space of symmetric functions, i.e. the monomial symmetric functions, power sum symmetric functions, and elementary symmetric functions, can be realized as $H$-chromatic symmetric functions. We end with some conjectures and open problems.