Algorithm solves word problem for 3-manifold groups.
problem Word problem in 3-manifold groups.
method Algorithmic approach using finite state automata and group properties.
result Fundamental groups of 3-manifolds are autostackable.
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.
169,291 papers · 148 categories
Trend · papers per month
4 results for “autostackable”
Autostacker uses EA to evolve machine learning pipelines without domain knowledge.
problem Finding optimal machine learning models and hyperparameters without expert knowledge.
method Hierarchical stacking architecture + Evolutionary Algorithm (EA) for efficient parameter search.
result Autostacker achieves state-of-the-art performance on 15 datasets.
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical fini…
A graph-based evolutionary algorithm automates machine learning workflows.
problem Automated machine learning to reduce manual operations.
method Graph-based architecture for flexible model combinations, evolutionary algorithm with mutation and heredity operators, Bayesian hyper-parameter optimization.
result State-of-the-art performance compared to other AutoML systems.