Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.05141

Generating behavioral acts of predetermined apparent complexity

Andrei Olifer
View original source ↗Read source document ↗Export metadata ↓

Abstract

Behavior of natural and artificial agents consists of behavioral episodes or acts. This study introduces a quantitative measure of behavioral acts -- their apparent complexity. The measure is based on the concept of the Kolmogorov complexity. It is an apparent measure because it is determined solely by the readings of the signals that directly encode percepts and actions during behavior. The article describes an algorithm of generating behavioral acts of predetermined apparent complexity. Such acts can be used to evaluate and develop learning abilities of artificial agents.

Explore related subjects

q-bio.QM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrei Olifer. 2017-11-14. Generating behavioral acts of predetermined apparent complexity. https://arxiv.org/abs/1711.05141

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

High Reconstruction Quality and Restart Repeatability Do Not Guarantee Recovery of Ground-Truth Muscle Synergies

High reconstruction quality and agreement across repeated fits do not necessarily establish recovery of muscle synergies. We tested whether a variance-accounted-for (VAF)/elbow rule recovers the generating synergy count and spatial vectors, whether high restart repeatability indicates recovery, and how five design factors affect recovery. Non-negative matrix factorisation was applied to 4,320 synthetic 16-muscle datasets varying generating rank, noise, trial count, spatial similarity and activation overlap. Combined recovery required the correct rank and cosine similarity of at least 0.80 for every matched spatial vector. Factor effects and two-factor interactions were assessed using exploratory heteroscedastic Wald tests with Benjamini-Hochberg adjustment. Rank selection was exact in 17.6% of datasets, too low in 54.9% and too high in 27.5%; combined recovery was 13.9%. Among fits with VAF at least 0.90, only 11.3% achieved combined recovery. Among 3,762 datasets with spatial repeatability at least 0.95, 19.6% had the correct rank and 15.7% achieved combined recovery. All five factors were associated with recovery (adjusted p < 0.001). Recovery declined from 26.2% to 1.7% with increasing spatial similarity and from 26.2% to 2.2% with increasing activation overlap. It was lower at ranks 7-9 than at 3-5, increased from 11.0% with 3 trials to 15.8% with 80 trials, and varied non-monotonically with noise. Five noiseless signals synthesised from measured-sEMG reference factors also showed under-selection despite VAF above 0.918. Under this selector, high reconstruction quality and restart agreement were insufficient indicators of correct rank and spatial recovery. Muscle-synergy interpretation should account for rank sensitivity and the separability of spatial and activation patterns.

q-bio.QM↗
arXiv2026

A hierarchical memory architecture overcomes context limits in long-horizon multi-agent computational modeling

Large language models (LLMs) demonstrate remarkable reasoning capabilities, yet their stateless architecture fundamentally limits deployment in long-horizon research workflows requiring multi-session continuity and quantitative rigor. Here we present Ensemble QSP, a multi-agent framework featuring a three-layer hierarchical memory architecture that bounds injected context (median 301 tokens, max 4,050) by capping state categories and evicting completed work. This enables continuous autonomous operation without context degradation. The system orchestrates five specialist worker agents under domain-expert principal investigators (PIs), enforcing physical constraints through physics-based checklists and structured domain knowledge. Comprehensive benchmarking demonstrates autonomous pharmacokinetic-pharmacodynamic (PKPD) model selection, improved parameter recovery relative to single-agent baselines, and robust interpretation of linguistically diverse prompts. Replication with open-weight models (DeepSeek-V4-Flash/Pro, Llama 3.1 70B) confirmed these architectural conclusions across PKPD modeling, literature synthesis, and PBPK model implementation, proving the framework is independent of proprietary LLMs. Feature-level ablations show that memory, retrieval, and PI oversight address distinct scientific failure modes, though underlying LLM capability remains consequential for stringent physical-consistency checks. The architecture is structurally agnostic to computational biology; adding a new scientific domain requires only a new PI-agent configuration.

q-bio.QM↗
arXiv2026

Hierarchical Maximum Likelihood Estimation for Time-Resolved NMR Data

Metabolic monitoring and reaction rate estimation using hyperpolarized NMR technology requires accurate quantitative analysis of multidimensional data scenarios. Currently, this analysis is often performed in a two-stage procedure, which is prone to errors in uncertainty propagation and estimation. We propose an approach derived from a Bayesian hierarchical model that intrinsically propagates uncertainties and operates on the full data to maximize the precision at minimal uncertainty. In an analytic treatment, we reduce the estimation procedure to a least-squares optimization problem which can be understood as an extension of the Variable Projection (VarPro) approach for data scenarios with two predictors. We investigate the method's efficacy in two experiments with hyperpolarized metabolites recorded with conventional high-field NMR devices and a micronscale NMR setup using Nitrogen-Vacancy centers in diamond for detection, respectively. In both examples, the new approach improves estimates compared to Fourier methods and proves operational advantages over a two-stage procedure employing VarPro. While the approach presented is motivated by NMR analysis, it is straightforwardly applicable to further estimation scenarios with similar data structure, such as time-resolved photospectroscopy.

q-bio.QM↗