Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

0.7%1.4%2.1%2.8% · Aug 200219922001200920172026
48 results for cellular automaton

CURIE uses cellular automata to detect concept drift in data streams.

problem Detecting changes in data distribution (concept drift) in data streams.
method CURIE represents data stream distribution in a cellular automata grid and uses its neighborhood rule to detect changes.
result CURIE, when hybridized with base learners, performs competitively in detection metrics and classification accuracy.

We discuss algorithms for estimating the Shannon entropy h of finite symbol sequences with long range correlations. In particular, we consider algorithms which estimate h from the code lengths produced by some compression algorithm. Our interest is in describing their convergence with sequence length, assuming no limit…

2002-03-21abs ↗pdf ↗

In this paper we study Thurston's automaton on the braid groups via binary operations. These binary operations are obtained from the construction of this automaton. We study these operations and find some connections between them in a "skew lattice" spirit.

2015-09-06abs ↗pdf ↗

A full Mealy automaton is associated with a graph and a square complex, which contains an anti-torus if and only if the automaton is bi-reversible and the graph is aperiodic.

problem Determining the existence of anti-tori in square complexes associated with Mealy automata
method Associating a graph and a square complex with a Mealy automaton and proving the equivalence between bi-reversibility and aperiodicity of the graph
result The square complex contains an anti-torus if and only if the automaton is bi-reversible and the graph is aperiodic

The language of maximal lexicographic representatives of elements in the positive braid monoid AnA_n with nn generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length kk whose maximal lexicographic repres…

2018-08-08abs ↗pdf ↗

In this paper we generalize cellular algebras by allowing different partial orderings relative to fixed idempotents. For these relative cellular algebras we classify and construct simple modules, and we obtain other characterizations in analogy to cellular algebras. We also give several examples of algebras that are re…

2017-10-08abs ↗pdf ↗

The paper distills a weighted automaton from RNNs for language modeling.

problem Tackles the gap between deep learning and grammatical inference.
method Uses a spectral approach to infer a weighted automaton from a trained RNN.
result Extracted weighted automata are good approximations of the RNNs, validating the approach.

DeepSynth synthesizes automata to guide deep RL agents through sparse, non-Markovian rewards.

problem Training deep RL agents with sparse, non-Markovian rewards and unknown high-level objectives.
method Employing a novel algorithm for synthesizing compact automata to uncover sequential structure from trace data.
result Reduces the number of iterations required for policy synthesis by two orders of magnitude and improves scalability.

This article introduces descriptive cellular homology on cell complexes, which is an extension of J.H.C. Whitehead's CW topology. A main result is that a descriptive cellular complex is a topology on fibres in a fibre bundle. An application of two forms of cellular homology is given in terms of the persistence of shape…

2018-01-05abs ↗pdf ↗

The paper studies Morse theory on manifolds with boundaries, constructing cellular structures and estimating critical points.

problem Understanding Morse functions on manifolds with boundaries.
method Constructing a cellular structure and analyzing its algebraic properties.
result Estimation of the number of critical points of a Morse function with boundary conditions.

We present a construction of cellular BF theory (in both abelian and non-abelian variants) on cobordisms equipped with cellular decompositions. Partition functions of this theory are invariant under subdivisions, satisfy a version of the quantum master equation, and satisfy Atiyah-Segal-type gluing formula with respect…

2017-01-20abs ↗pdf ↗

Optimizes natural frequencies of cellular composites with various microstructures.

problem Designing cellular composites with diverse microstructures for maximizing natural frequencies.
method Data-driven topology optimization with a latent-variable Gaussian process model.
result Cellular designs with multiclass microstructures achieve higher natural frequencies.

Convolutional networks struggle to learn Game of Life, even with lottery ticket weights.

problem Training convolutional networks to predict Conway's Game of Life is challenging.
method Examined small convolutional networks trained on Game of Life, focusing on weight initializations and network sizes.
result Minimal networks require significantly more parameters to converge, and their performance is sensitive to small changes in weights.

For leveled spatial graphs, we find a surface embedding that allows cellular embedding.

problem Finding a surface embedding for general spatial graphs is not always possible.
method Define leveled property, decompose graph into subgraphs, and construct surface.
result For leveled spatial graphs with a small number of levels, a surface can always be found.

The notion of cellular stratified spaces was introduced in a joint work of the author with Basabe, González, and Rudyak [1009.1851] with the aim of constructing a cellular model of the configuration space of a sphere. In particular, it was shown that the classifying space (order complex) of the face poset of a totally …

2011-06-19abs ↗pdf ↗

A new layer learns abstract relations from graph structure using finite-state automata.

problem Learning abstract relations from graph structure for program analysis.
method Relaxing the problem into learning finite-state automata policies on a graph-based POMDP and training these policies using implicit differentiation.
result GFSA layer finds shortcuts in grid-world graphs and reproduces simple static analyses on Python programs.

ChemCPA predicts cellular responses to novel drugs using transfer learning.

problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.

Representative investors whose behaviour is modelled by a deterministic finite automaton generate complexity both in the time series of each asset and in the cross-sectional correlation when the rule governing their behaviour is schizophrenic, meaning the investor must hold multiple seemingly contradictory beliefs simu…

2010-04-26abs ↗pdf ↗

Machine learning predicts critical points for directed percolation models.

problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.

New findings on hyperbolicity of augmented links in thickened surfaces.

problem Proving hyperbolicity of links in thickened surfaces.
method Extending hyperbolicity results to generalized augmented cellular alternating links.
result Generalized augmented cellular alternating links in thickened surfaces are hyperbolic.

Solves challenges of drone communication in cellular networks.

problem Interference from drones to base stations in cellular networks.
method Derived analytical models, formulated optimization problem, transformed into machine learning problem, solved using deep reinforcement learning.
result Optimal handover and resource management policies for drones in cellular networks.

The paper optimizes UAV path and power for QoS in cellular networks.

problem Optimizing UAV path and power for QoS in cellular networks.
method Apprenticeship learning via deep inverse reinforcement learning (IRL) combined with Q-learning and DRL.
result The proposed method achieves expert-level performance and maintains performance in unseen situations.

Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in particular on the causality assumptions introduced by the choice of a specific tree visit direction. We w…

2018-05-31abs ↗pdf ↗

Motivation: Understanding functions of proteins in specific human tissues is essential for insights into disease diagnostics and therapeutics, yet prediction of tissue-specific cellular function remains a critical challenge for biomedicine. Results: Here we present OhmNet, a hierarchy-aware unsupervised node feature le…

2017-07-14abs ↗pdf ↗

We show that tree almost automorphism groups, including Neretin groups, satisfy the analogue of the FF_\infty-finiteness condition in the world of totally disconnected groups: They possess a cellular action on a contractible cellular complex such that the stabilizers are open and compact and the restriction of the act…

2015-10-19abs ↗pdf ↗

In this brief sequel to a previous article, we recall the notion of a cut cellular surface (CCS), being a surface with boundary, which is cut in a specified way to be represented in the plane, and is composed of 0-, 1- and 2-cells. We obtain invariants of CCS's under Pachner-like moves on the cellular structure, by cou…

2017-10-04abs ↗pdf ↗

Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from graphs to cell complexes. We show that evaluating this polynomial at the origin gives the number of cellular spanning trees in the sense of A. Duval, C. Klivans, and J. Martin. Moreover, after a slight modification, the Tutte-Krushkal-Renardy pol…

2012-04-16abs ↗pdf ↗

LUNAR uses cellular automata for real-time data classification in fast streams.

problem Real-time machine learning challenges with fast data streams and concept drift.
method Streamified cellular automata approach for incremental learning and adaptation.
result Competitive performance in classification compared to established online learning methods.

We introduce the notion of a cut cellular surface (CCS), being a surface with boundary, which is cut in a specified way to be represented in the plane, and is composed of 0-, 1- and 2-cells. We obtain invariants of CCS's under Pachner-like moves on the cellular structure, by counting colourings of the 1-cells with elem…

2015-12-22abs ↗pdf ↗