Search arXivSearch

arXiv · 2607.16196

Design and Embedded Validation of Compact ML Models for Affective Touch Classification in a Soft Interactive Companion

Abstract

Soft plush companions provide a safe and intuitive platform for affective human-robot interaction, but their deformable structure and distributed tactile signals make reliable gesture recognition difficult. This study presents a complete workflow for developing and validating compact affective-touch classifiers for an interactive plush companion. A newly collected dataset comprised 1,326 labelled recordings before curation, including interactions from 25 children, teenagers, and adults. Each classifier received 2.5-s windows containing ten capacitive channels and one accelerometer-magnitude channel. MATLAB supported acquisition, quality control, window generation, and a 468-run exploratory study of dilated one-dimensional convolutional neural networks (1D CNNs). A closely matched Python workflow then preserved participant provenance, fitted preprocessing inside each fold, and evaluated shortlisted models by 25-fold leave-one-subject-out cross-validation (LOSO-CV). On the operational 10-class task, the compact dilated CNN achieved 81.96% mean macro-F1 and 85.42% mean accuracy. The depthwise-separable CNN achieved the strongest neural result (84.50% macro-F1), whereas a linear support-vector machine using 66 predefined time-domain features achieved the best overall result (87.98% macro-F1 and 91.05% mean accuracy). Paired fold analysis showed that the linear support-vector machine and constrained random forest outperformed the compact dilated CNN, whereas differences among the tested neural models were not statistically significant after correction. Direct measurements on a 240-MHz ESP32-S3 confirmed valid deployment of the dilated CNN, depthwise-separable CNN, temporal convolutional network, linear support-vector machine, and random forest; the linear model required a 3.2 kB serialized payload and 1.405 ms mean end-to-end classifier time.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aleksandrs Vališevskis, Aleksandrs Okss, Inese Tīģere, Aleksejs Kataševs, Dina Bethere, Anete Hofmane, Airisa Šteinberga, Undīne Gavriļenko, Santa Meļķe, Lucie Matouškova. 2026-09-12. Design and Embedded Validation of Compact ML Models for Affective Touch Classification in a Soft Interactive Companion. https://arxiv.org/abs/2607.16196

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

KEEP EXPLORING

Related papers

Small Language Models are the Future of Agentic AI

Large language models (LLMs) are often praised for exhibiting near-human performance on a wide range of tasks and valued for their ability to hold a general conversation. The rise of agentic AI systems is, however, ushering in a mass of applications in which language models perform a small number of specialized tasks repetitively and with little variation. Here we lay out the position that small language models (SLMs) are sufficiently powerful, inherently more suitable, and necessarily more economical for many invocations in agentic systems, and are therefore the future of agentic AI. Our argumentation is grounded in the current level of capabilities exhibited by SLMs, the common architectures of agentic systems, and the economy of LM deployment. We further argue that in situations where general-purpose conversational abilities are essential, heterogeneous agentic systems (i.e., agents invoking multiple different models) are the natural choice. We discuss the potential barriers for the adoption of SLMs in agentic systems and outline a general LLM-to-SLM agent conversion algorithm. Our position, formulated as a value statement, highlights the significance of the operational and economic impact even a partial shift from LLMs to SLMs is to have on the AI agent industry. We aim to stimulate the discussion on the effective use of AI resources and hope to advance the efforts to lower the costs of AI of the present day. Calling for both contributions to and critique of our position, we commit to publishing all such correspondence at https://research.nvidia.com/labs/lpr/slm-agents.

cs.AI

EndoCogniAgent: Closed-Loop Agentic Reasoning with Self-Consistency Validation for Endoscopic Diagnosis

Endoscopic diagnosis is an iterative process in which clinicians acquire, compare, and verify local visual evidence before reaching a conclusion. Current AI systems do not adequately support this process because fine-grained evidence acquisition and multi-step reasoning remain weakly coupled, complicating reconciliation of image-derived findings with their textual interpretations. This gives rise to two failure modes, hallucinated evidence and uncorrected error accumulation, that undermine diagnostic reliability. We propose EndoCogniAgent, a closed-loop agentic framework that formulates endoscopic diagnosis as a controlled state update process for integrating complementary visual and textual evidence. At each reasoning round, a central planner selects an evidence acquisition action, specialized expert tools extract spatial and semantic observations as structured textual evidence, and a self-consistency validation mechanism examines this evidence along two dimensions, knowledge consistency against the input image and temporal consistency with prior validated findings, before updating the diagnostic state. Validated observations are admitted into the evolving state to condition subsequent planning, while insufficiently supported or conflicting findings are retained with corrective feedback that redirects the planner toward additional verification. We further introduce EndoAgentBench, a workflow-oriented benchmark comprising 6,132 question-answer pairs from 11 endoscopic datasets, to evaluate diagnostic agents across a comprehensive diagnostic chain, from fine-grained visual perception to high-level diagnostic reasoning. EndoCogniAgent achieves 85.23% overall accuracy on perception tasks and 71.13% clinical acceptance rate on reasoning tasks. Blinded clinician evaluation further shows consistent improvements in diagnostic response quality over the evaluated baselines.

cs.AI

Navigating Taxonomic Expansions of Entity Sets Driven by Knowledge Bases

Recognizing similarities among entities is central to both human cognition and computational intelligence. Within this broader landscape, Entity Set Expansion is one prominent task aimed at taking an initial set of (tuples of) entities and identifying additional ones that share relevant semantic properties with the former, potentially repeating the process to form increasingly broader sets. However, this ``linear'' approach does not unveil the richer ``taxonomic'' structures present in knowledge resources. A recent logic-based framework introduces the notion of an expansion graph: a rooted directed acyclic graph where each node represents a semantic generalization labeled by a logical formula, and edges encode strict semantic inclusion. This structure supports taxonomic expansions of entity sets driven by knowledge bases. Yet, the potentially large size of such graphs may make full materialization impractical in real-world scenarios. To overcome this, we formalize reasoning tasks that check whether two tuples belong to comparable, incomparable, or the same nodes in the graph. Our results show that these tasks are intractable in general, that they remain intractable when the number of input tuples is bounded, and that they become solvable in polynomial time when the descriptions of the entities are small as well. The bounds we establish are tight. This enables local, incremental navigation of expansion graphs, supporting practical applications without requiring full graph construction.

cs.AI