English
Related papers

Related papers: Hypergraph Automata: A Theoretical Model for Patte…

200 papers

Tile assembly systems in the abstract Tile Assembly Model (aTAM) are computationally universal and capable of building complex shapes, but DNA-based implementations encounter formidable error rates that stifle this theoretical potential.…

Computational Geometry · Computer Science 2024-05-13 Phillip Drake , Daniel Hader , Matthew J. Patitz

In self-supervised learning, a model is trained to solve a pretext task, using a data set whose annotations are created by a machine. The objective is to transfer the trained weights to perform a downstream task in the target domain. We…

Machine Learning · Computer Science 2021-10-22 Prathamesh Sonawane , Sparsh Drolia , Saqib Shamsi , Bhargav Jain

Chinese characters carry a wealth of morphological and semantic information; therefore, the semantic enhancement of the morphology of Chinese characters has drawn significant attention. The previous methods were intended to directly extract…

Computer Vision and Pattern Recognition · Computer Science 2022-07-19 Zongze Chen , Wenxia Yang , Xin Li

Sparse autoencoders (SAEs) have lately been used to uncover interpretable latent features in large language models. By projecting dense embeddings into a much higher-dimensional and sparse space, learned features become disentangled and…

Machine Learning · Computer Science 2025-07-30 Viktoria Schuster

As a mathematical model of self-assembling systems, Winfree's abstract Tile Assembly Model (aTAM) is a remarkable platform for studying the behaviors and powers of self-assembling systems. Capable of Turing universal computation, the aTAM…

Computational Geometry · Computer Science 2016-08-11 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This…

Computational Complexity · Computer Science 2015-03-13 David Doty

We characterize the complexity of the PATS problem for patterns of fixed height and color count in variants of the model where seed glues are either chosen or fixed and identical (so-called non-uniform and uniform variants). We prove that…

Formal Languages and Automata Theory · Computer Science 2017-03-31 Shinnosuke Seki , Andrew Winslow

This work explores scene graphs as a distilled representation of high-level information for autonomous driving, applied to future driver-action prediction. Given the scarcity and strong imbalance of data samples, we propose a…

Computer Vision and Pattern Recognition · Computer Science 2023-02-08 Pawit Kochakarn , Daniele De Martini , Daniel Omeiza , Lars Kunze

Harnessing the intrinsic dynamics of physical systems for information processing opens new avenues for computation embodied in matter. Using simulations of a model system, we show that assemblies of DNA tiles capable of self-organizing into…

Soft Condensed Matter · Physics 2025-10-23 Tim E. Veenstra , René van Roij , Marjolein Dijkstra

A significant challenge facing current optical flow and stereo methods is the difficulty in generalizing them well to the real world. This is mainly due to the high costs required to produce datasets, and the limitations of existing…

Computer Vision and Pattern Recognition · Computer Science 2024-10-15 Han Ling , Yinghui Sun , Quansen Sun , Ivor Tsang , Yuhui Zheng

Algorithmic self-assembly, a generalization of crystal growth processes, has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanostructures. A `program' for growing a desired structure…

Materials Science · Physics 2010-01-08 Rebecca Schulman , Erik Winfree

In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While…

Emerging Technologies · Computer Science 2013-09-09 Jacob Hendricks , Matthew J. Patitz

Sparse autoencoders (SAEs) are used to analyze embeddings, but their role and practical value are debated. We propose a new perspective on SAEs by demonstrating that they can be naturally understood as topic models. We propose a continuous…

Computer Vision and Pattern Recognition · Computer Science 2026-05-19 Leander Girrbach , Zeynep Akata

Arbitrary style transfer is a significant topic with research value and application prospect. A desired style transfer, given a content image and referenced style painting, would render the content image with the color tone and vivid stroke…

Computer Vision and Pattern Recognition · Computer Science 2020-08-19 Yingying Deng , Fan Tang , Weiming Dong , Wen Sun , Feiyue Huang , Changsheng Xu

Recent generative adversarial networks (GANs) are able to generate impressive photo-realistic images. However, controllable generation with GANs remains a challenging research problem. Achieving controllable generation requires semantically…

Machine Learning · Computer Science 2021-05-04 Grigorios G Chrysos , Jean Kossaifi , Zhiding Yu , Anima Anandkumar

Sparse autoencoders (SAEs) are a mechanistic interpretability technique that have been used to provide insight into learned concepts within large protein language models. Here, we employ TopK and Ordered SAEs to investigate autoregressive…

Since its introduction by Erik Winfree in 1998, the abstract Tile Assembly Model (aTAM) has inspired a wealth of research. As an abstract model for tile based self-assembly, it has proven to be remarkably powerful and expressive in terms of…

Mathematical Software · Computer Science 2015-03-18 Matthew J. Patitz

Diffusion models have become the go-to method for text-to-image generation, producing high-quality images from pure noise. However, the inner workings of diffusion models is still largely a mystery due to their black-box nature and complex,…

Computer Vision and Pattern Recognition · Computer Science 2026-01-23 Berk Tinaz , Zalan Fabian , Mahdi Soltanolkotabi

While the activations of neurons in deep neural networks usually do not have a simple human-understandable interpretation, sparse autoencoders (SAEs) can be used to transform these activations into a higher-dimensional latent space which…

Machine Learning · Computer Science 2025-08-07 Gonçalo Paulo , Alex Mallen , Caden Juang , Nora Belrose

This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…

Computational Geometry · Computer Science 2013-09-06 Damien Woods