SearcharxivSearch

arXiv subjects

Allyson Hahn

Publications and source records attributed to Allyson Hahn.

3 recordsLinked to original sources

The Effect of Architecture During Continual Learning

Continual learning is a challenge for models with static architecture, as they fail to adapt to when data distributions evolve across tasks. We introduce a mathematical framework that jointly models architecture and weights in a Sobolev space, enabling a rigorous investigation into the role of neural network architecture in continual learning and its effect on the forgetting loss. We derive necessary conditions for the continual learning solution and prove that learning only model weights is insufficient to mitigate catastrophic forgetting under distribution shifts. Consequently, we prove that by learning the architecture and weights simultaneously at each task, we can reduce catastrophic forgetting. To learn weights and architecture simultaneously, we formulate continual learning as a bilevel optimization problem: the upper level selects an optimal architecture for a given task, while the lower level computes optimal weights via dynamic programming over all tasks. To solve the upper level problem, we introduce a derivative-free direct search algorithm to determine the optimal architecture. Once found, we must transfer knowledge from the current architecture to the optimal one. However, the optimal architecture will result in a weights parameter space different from the current architecture (i.e., dimensions of weights matrices will not match). To bridge the dimensionality gap, we develop a low-rank transfer mechanism to map knowledge across architectures of mismatched dimensions. Empirical studies across regression and classification problems, including feedforward, convolutional, and graph neural networks, demonstrate that learning the optimal architecture and weights simultaneously yields substantially improved performance (up to two orders of magnitude), reduced forgetting, and enhanced robustness to noise compared with static architecture approaches.

cs.LG

Geometric Function Theory on Uniformly Quasiconformally Homogeneous Domains

Uniformly quasiconformally homogeneous domains in $\mathbb{R}^n$ carry a transitive collection of $K$-quasiconformal maps for a fixed $K\geq 1.$ In this paper, we study two questions in this setting. The first is to show that quasiconformality and quasisymmetry with respect to the quasihyperbolic metric are equivalent. The second is to study normal quasiregular maps from such a domain into $S^n$ or $\mathbb{R}^n$ and show they enjoy geometric properties such as a uniform H\"{o}lder condition.

math.CV

Cops and Robbers on Toroidal Chess Graphs

We investigate multiple variants of the game Cops and Robbers. Playing it on an $n \times n$ toroidal chess graph, the game is varied by defining moves for cops and robbers differently, always mimicking moves of certain chess pieces. In these cases, the cop number is completely determined.

math.CO